CS301 Quiz No.3 Shared by Eman Rana

Question # 1 of 10 ( Start time: 08:41:42 PM ) Total Marks: 1
Which of the following is true regarding the maze generation?
Select correct option:
Randomly remove walls until the entrance and exit cells are in the same set
Removing a wall is the same as doing a union operation
Do not remove a randomly chosen wall if the cells it separates are already in the same set
All of the given


Question # 2 of 10 ( Start time: 08:42:13 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:42:32 PM ) Total Marks: 1
The preculateDown procedure will move the smaller value____ and bigger value______.
Select correct option:
left,right
right,left
up,down
down,up


Question # 4 of 10 ( Start time: 08:42:56 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 # 5 of 10 ( Start time: 08:43:12 PM ) Total Marks: 1
If we want to find 3rd minimum element from an array of elements, then after applying buildHeap method, how many times deleteMin method will be called ?
Select correct option:
1
2
3
4


Question # 6 of 10 ( Start time: 08:44:31 PM ) Total Marks: 1
Which one of the following is NOT true regarding the skip list?
Select correct option:
Each list Si contains the special keys + infinity and - infinity
List S0 contains the keys of S in non-decreasing order
List Sh contains only the n special keys
Each list is a subsequence of the previous one


Question # 7 of 10 ( Start time: 08:45:13 PM ) Total Marks: 1
Which of the following heap method increase 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)


Question # 8 of 10 ( Start time: 08:45:30 PM ) Total Marks: 1
The total number of nodes on 10th level of a perfect binary tree are :
Select correct option:
256
512
1024
Can't be determined


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


Question # 10 of 10 ( Start time: 08:46:05 PM ) Total Marks: 1
Which of the following method is helpful in creating the heap at once?
Select correct option:
insert
add
update
preculateDown