Question # 1 of 10 ( Start time: 07:29:02 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 # 2 of 10 ( Start time: 07:30:11 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 # 3 of 10 ( Start time: 07:30:48 PM ) Total Marks: 1

If there are 100 elements in a heap, and 100 deleteMin operation are performed, will get ___________ list

Select correct option:

Sorted

Unsorted**Nonlinear**

None of given

Question # 4 of 10 ( Start time: 07:31:12 PM ) Total Marks: 1

If Ahmed is cousin of Ali and Ali is cousin of Asad then Ahmed is also cousin of Asad. This statement has the following property

Select correct option:

Reflexivity**Symmetry**

Transitivity

Question # 5 of 10 ( Start time: 07:31:42 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 # 6 of 10 ( Start time: 07:32:04 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 # 7 of 10 ( Start time: 07:32:25 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

Question # 8 of 10 ( Start time: 07:32:50 PM ) Total Marks: 1

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

Select correct option:

Reflexivity

Symmetry

Transitivity**All of the above**

Question # 9 of 10 ( Start time: 07:33:11 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 # 10 of 10 ( Start time: 07:33:28 PM ) Total Marks: 1

During union by size method, which data structure is used to improve the balancing of tree?

Select correct option:**Array**

Stack

Linked List

Tree

**improve performance**

code is readable

less code

heap can't be used in priority queues

Threaded Tree

AVL tree

*Complete binary tree*

Expression

**O(n2) time because sorting 1 element takes O(n) time - After 1 pass through the list,**

Select correct option:

5

**25**

50

**List Sh contains only the n special keys.**

**Remove a randomly chosen wall if the cells it separates are already in the same set.**

**Symmetry**

Transitivity

**Not a valid expression (not confirm)**

AVL tree

**Complete binary tree**

Expression

**Traversing a heap in order provides access to the data in numeric or alphabetical order.**

Removing the item at the top provides immediate access to the key value with highest (or lowest) priority.

Inserting an item is always done at the end of the array, but requires maintaining the heap property.

A heap may be stored in an array.

**Symmetry**

Transitvity

All of the given

Heap can be use to implement

Link list

Queue

**Priority Queue**

Which one of the following is not true regarding skip list.

**List Sh contain only the n special keys**

If Ahmad is cousin of Ali and Ali is cousin of Asad then Ahmad is also cousin of Asad

the statement has the following property.

Reflexivity

Symmetry

**Transitivity**

All of the above

Heap is full

Heap is not empty

**Heap is not full(not conferm)**

Associative

Stack

Link list

**Skip list**

Quadratic probing

**Cubic probing**

**Two entries with different keys have the exact has value**