Question # 1 of 10 ( Start time: 07:20:04 PM ) Total Marks: 1

Which of the following is NOT an implementation of Table ADT?

Select correct option:

Sorted Sequential Array

Stack

Linked List**Skip List**

Question # 2 of 10 ( Start time: 07:20:32 PM ) Total Marks: 1

Which of the following is NOT 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**

None of the given

Question # 3 of 10 ( Start time: 07:21:22 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 # 4 of 10 ( Start time: 07:21:57 PM ) Total Marks: 1

The worst case of building a heap of N keys is _______ .

Select correct option:

N

N^2**NlogN**

2^N

Question # 5 of 10 ( Start time: 07:22:32 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 # 6 of 10 ( Start time: 07:23:01 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 given options**

Question # 7 of 10 ( Start time: 07:23:44 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.

Question # 8 of 10 ( Start time: 07:24:18 PM ) Total Marks: 1

We can build a heap in _____ time.

Select correct option:**Linear**

Exponential

Polynomial

None of the given options

Question # 9 of 10 ( Start time: 07:24:52 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) (not confirm)

N – (h + 1)

N – 1

N – 1 + h

Question # 10 of 10 ( Start time: 07:25:37 PM ) Total Marks: 1

Suppose there is an image of 7 * 7. now we will have matrix of _____ rows and _______ columns.

Select correct option:

7, 7 (Not Confirm)

49, 49

100, 100

8, 8**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) **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

**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 |

. | |

8 to 14 | |

8 to 15 | |

8 to 16 | |

8 to 17 |

**In case of insertion of right inner node in BST,**

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**

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,**

after inserting node 25 | |

after inserting node 23 | |

after inserting node 10 | |

after inserting node 12 |