CS-301 Final Term Exams Preparation Virtual University
00:00
Question # 1
Binary Search is an algorithm of searching, used with the ______ data
Question # 2
We can build a heap in ________ time.
Question # 3
If there are N elements in an array then the number of maximum steps needed to find an elements using Binary Search is __________
Question # 4
Suppose A is an array containing numbers in increasing order, but some numbers occur more than once when
using a binary search for a value, the binary search always finds ____________
Question # 5
We are given N items to build a heap ,this can be done with ______ successive inserts.
Question # 6
Let heap stored in an array as H = [50, 40, 37, 32, 28, 22, 36, 13]. In other words, the root of the heap contains
the maximum element. What is the result of deleting 40 from this heap
Question # 7
A binary relation R over S is called an equivalence relation if it has following property(s)
Question # 8
A complete binary tree of height 3 has between ________ nodes.
Question # 9
I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of
these pointers will change during an insertion into an EMPTY queue?
.gif)
Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
.png)
