CS301 Data Structure Quizzes File No 4

Question # 1 of 10 ( Start time: 08:21:12 PM ) Total Marks: 1
For a perfect binary tree of height h, having N nodes, the sum of heights of nodes is _____________.
Select correct option:
N – (h – 1)
N – (h + 1) 
N – 1
N – 1 + h


Question # 2 of 10 ( Start time: 08:22:46 PM ) Total Marks: 1
If a tree has 50 nodes, then the total edges/links in the tree will be :
Select correct option:
55
51
50
49 

 Vukwl- Virtual Education Solution

Question # 3 of 10 ( Start time: 08:23:44 PM ) Total Marks: 1
given the values are the array representation of heap; 12 23 26 31 34 44 56 64 78 100 What is the 5th smallest element in the given heap?
Select correct option:
31
34 
44
56


Question # 4 of 10 ( Start time: 08:24:12 PM ) Total Marks: 1
We can build a heap in _____ time.
Select correct option:
Linear 
Exponential
Polynomial
None of the given options


Question # 5 of 10 ( Start time: 08:24:35 PM ) Total Marks: 1
If there are 100 elements in an equivalence class then we will have _________ sets initially.
Select correct option:
50
100 
1000
80


Question # 6 of 10 ( Start time: 08:25:10 PM ) Total Marks: 1
If the height of a perfect binary tree is 4. What will be the total number of nodes in it?
Select correct option:
15
16 
31
32

 Vukwl- Virtual Education Solution

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


Question # 8 of 10 ( Start time: 08:26:05 PM ) Total Marks: 1
Which one of the following is NOT the property of equivalence relation?
Select correct option:
Reflexive
Symmetric
Transitive
Associative 


Question # 9 of 10 ( Start time: 08:26:30 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

 Vukwl- Virtual Education Solution

Question # 10 of 10 ( Start time: 08:27:10 PM ) Total Marks: 1
Which property of equivalence relation is satisfied if we say: Ahmad R(is related to) Ahmad
Select correct option:
Reflexivity 
Symmetry
Transitivity
All of the above

The preculateDown procedure will move the smallervalue____ and bigger value______.

Select correct option:

	left,right
	right,left
	up,down
	down,up

There are _________cases of Rotation in AVLtree.

Select correct option:

	2
	3
	4
	5

	Vukwl- Virtual Education Solution .

A complete binary tree of height 3 has between ________nodes.

Select correct option:

	8 to 14
	8 to 15
	8 to 16
	8 to 17

In case of insertion of right inner node in BST,

Select correct option:

	we need to apply single left rotation to make it AVL tree.
	we need to apply single right rotationto make it AVL tree.
	single left rotation first and then single right rotation tomake it AVL tree.
	single right rotation first and then single left

Binary Search Tree voilates the condition of AVL tree when anynode has balance equal to

Select correct option:

	2 or -2
	1 or -1
	0
	None of the options.

Suppose we have the following values to be inserted inconstructing AVL tree, 20,23,25,10,12,13 Tell when first rotationwill take place,

Select correct option:

	after inserting node 25
	after inserting node 23
	after inserting node 10
	after inserting node 12

A binary relation R over S is called an equivalence relation if it has following property(s)

Reflexivity
Symmetry 
Transitivity 
All of the given options
The preculateDown procedure will move the smaller value____ and bigger value______.
left,right
right,left
up,down
down,up
If the height of a perfect binary tree is 4. What will be the total number of nodes in it?


15 
16 
31
32 
Which one of the following is NOT the property of equivalence relation?
Reflexive
Symmetric 
Transitive 
Associative 

Which of the following heap method lowers the value of key at position ‘p’ by the amount ‘delta’?
Select correct option: 
increaseKey(p,delta) 
decreaseKey(p,delta) 
preculateDown(p,delta) 
remove(p,delta) 

 Vukwl- Virtual Education Solution

heap can be used to implement 
stack 
linked list 
queue
priorty queue
which of following method is helpful in creating heap at once
insert 
add 
pecular down 
update