CS301 Quiz No.3 Shared by Sidra Fatima

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


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


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


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