CS301 Data Structure Quizzes File No 1

Question # 1 of 10 ( Start time: 08:48:28 PM ) Total Marks: 1
The total number of nodes on 5th level of a perfect binary tree are :
Select correct option:
16
15
31
32 


Question # 2 of 10 ( Start time: 08:49:09 PM ) Total Marks: 1
given the values are the array representation of heap; 12 23 26 31 34 44 56 64 78 100 If we perform 4 deleteMin operations, the last element deleted is__________.
Select correct option:
31 
34
44
56


Question # 3 of 10 ( Start time: 08:50:20 PM ) Total Marks: 1
The worst case of building a heap of N keys is _______ .
Select correct option:
N
N^2
NlogN 
2^N

 Vukwl- Virtual Education Solution

Question # 4 of 10 ( Start time: 08:51:10 PM ) Total Marks: 1
If we want to find median of 50 elements, then after applying buildHeap method, how many times deleteMin method will be called ?
Select correct option:
5
25 
35
50


Question # 5 of 10 ( Start time: 08:52:11 PM ) Total Marks: 1
For a perfect binary tree of height 4. What will be the sum of heights of nodes?
Select correct option:
31
30
27
26


Question # 6 of 10 ( Start time: 08:53:02 PM ) Total Marks: 1
Heap can be used to implement
Select correct option:
Stack
Linked list
Queue
Priority Queue 

 Vukwl- Virtual Education Solution

Question # 7 of 10 ( Start time: 08:53:49 PM ) Total Marks: 1
Suppose there are 100 elements in an equivalence class, so initially there will be 100 trees. The collection of these trees is called ________________.
Select correct option:
Cluster
Class
Forest 
Bunch


Question # 8 of 10 ( Start time: 08:54:10 PM ) Total Marks: 1
Consider a min heap, represented by the following array: 3,4,6,7,5,10 After inserting a node with value 1. Which of the following is the updated min heap?
Select correct option:
3,4,6,7,5,10,1
3,4,6,7,5,1,10
1,4,6,7,5,10,3
1,4,3,7,5,10,6


Question # 9 of 10 ( Start time: 08:55:21 PM ) Total Marks: 1
Finding the minimum is easy; it is _____ of the min heap.
Select correct option:
Top 
Left most child
Right most child
None of the given options.

 Vukwl- Virtual Education Solution

Question # 10 of 10 ( Start time: 08:55:55 PM ) Total Marks: 1
Suppose there are a set of fruits and a set of vegetables. Both sets are ______________ sets.
Select correct option:
Disjoint 
Subsets
Whole
Equal

For a perfect binary tree of height 4. What will be the sum of heights of nodes?31
302726

For a perfect binary tree of height h, having N nodes, the sum of heights of nodes is _____________.

N – (h – 1)
N – (h + 1) 
N – 1
N – 1 + h

If we want to find median of 50 elements, then after applying buildHeap method, how many times deleteMin method will be called ?
5
25
35
50

 Vukwl- Virtual Education Solution

Which of the following heap method increase the value of key at position ‘p’ by the amount ‘delta’?

increaseKey(p,delta) 
decreaseKey(p,delta)
preculateDown(p,delta)
remove(p,delta)

www.vuzs.info
The main reason of using heap in priority queue is
improve performance 
code is readable
less code
heap can't be used in priority queues

 Vukwl- Virtual Education Solution

The total number of nodes on 10th level of a perfect binary tree are :

256
512
1024
Can't be determined
Which property of equivalence relation is satisfied if we say: Ahmad R(is related to) Ahmad

Reflexivity
Symmetry 
Transitivity
All of the above

Which of the following heap method lowers the value of key at position ‘p’ by the amount ‘delta’?

increaseKey(p,delta) 
decreaseKey(p,delta)
preculateDown(p,delta)
remove(p,delta)

We can build a heap in _____ time.

Linear 
Exponential
Polynomial
None of the given options

 Vukwl- Virtual Education Solution

If a tree has 50 nodes, then the total edges/links in the tree will be :

55
51
50
49 N-1= 49