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

# Vukwl- Virtual Education Solution

Question # 2 of 10 ( Start time: 08:42:13 PM ) Total Marks: 1If 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

# Vukwl- Virtual Education Solution

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

# Vukwl- Virtual Education Solution

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

Select correct option:

insert

add

update

preculateDown

**Consider a max heap, represented by the following array; 40,30,20,10,15,16,17,18,4 After inserting a nodes with value 35.Which of following is the updated**

**max heap?**

**40,30,20,10,15,16,17,8,4,35**40,30,20,10,35,16,17,8,4,1540,35,20,10,30,16,17,8,4,1540,35,20,10,15,16,17,18,4,30

**A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a Link) ___________Successor.**

Preorder

**Inorder**PostorderLeveloder**Which of the following is a property of binary tree?**A Binary tree with N internal nodes has 2+N links, N-1 links to internal nodes and N+1 links to external nodesA Binary tree with N internal nodes has 2*N links, N-1 links to internal nodes and N+1 links to external nodes.A Binary tree with N internal nodes has 2-N links, N-1 links to internal nodes and N+1 links to external nodes.

**A Binary tree with N internal nodes has 2N links, N+1 links to internal nodes and N-1 links to external nodes.**

**A Threaded Binary tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link)_____________ successor.**Preoder

**Inorder**PostorderLevelorder

**If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?**

545556

**57****Which of the following statement is correct?**

A threaded Binary tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor.

**A threaded Binary tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREORDER successor.**A threaded Binary tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor.A threaded Binary tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER predecessor.**It is necessary fro Huffman encoding tree to be,**

AVL tree

**Binary tree**Complete binary TreeNone of these**A binary tree with 45 internal nodes has _________ links to external nodes.**

4445

**46**90**In which of the following tree, parent nodes has key greater than or equal to its both children?**

Max heapBinary search treeThreaded Binary tree

**Complete Binary tree****If one pointer of the nodes in a binary tree is NULL then it will be a/an**

Inner nodeLeaf nodeExternal nodeRoot node

**If there are N external nodes is a binary tree then what will be the no. of the internal nodes in this binary tree?**N-1N

**N+1**N+2

**See the below code and fill the appropriate answer for? Void fastlnorder(TreeNod+p) {while((p+nextInorder(p)) !+ ? ) cout << p->getInfo();}**

**Dummy**rootNodeLTHRTH

**In threaded binary tree, the NULL pointer are replaced by the.**Preorder successor or Predecessor

**Inorder successor or predecessor**Postorder successor or predecessorNULL pointer are not replaced

**In which of the following tree, parent nodes has a key greater than or equal to its both children?**

Max heapBinary search treeThreaded Binary threeComplete Binary tree

**In Complete binary tree the bottom level is filled from _______.**

**Left to right**Right to leftNot filled at allNone of the given options

**If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a ________**

**Complete Binary tree**Threaded Binary TreeExpression treePerfectly compete Binary tree

**If an expression tree is correct then its root should have,**

**An operator**()an operand

**In threaded binary tree, the NULL pointers are replaced by the.**

Preorder successor or predecessorInorder successor or predecessorPostorder successor or predecessorNULL pointer are not replaced

**A complete binary tree is a tree that is ________ filled, with the possible exception of the bottom level.**

Partially

**Completely**IncompletelyPartly**If the bottom level of a binary tree is not completely filled, depicts that the tree is not a _________.**

Expression treeThreaded binary tree

**Complete binary tree**Perfectly complete binary tree**An expression tree will always be a,**Complete binary tree

**Binary search tree**Heap AVL tree

**Which of the following is a property of binary tree?**A binary tree of N external nodes has N internal node

**A Binary tree of N internal nodes has N+1 external node**A Binary tree of N external nodes has N+1 internal nodeA Binary tree of N internal has N-1 external node

**In a threaded binary tree which nodes have NULL child pointers,**

**All leaf nodes**

Nodes other then leaf nodes

Root Node

None of the nodes

**In threaded binary tree, the NULL pointers are replaced by the**

preorder successor or predecessor

**inorder successor or predecessor**

postorder successor or predecessor

NULL pointers are not replaced

**A complete binary tree is a tree that is**

*_______*filled, with the possible exception of the bottom level.partially

**completely**

incompletely

partly

**Which one of the following is TRUE about iteration?**

Iterative function calls consumes a lot of memory

Threaded Binary Trees use the concept of iteration

**Iteration extensively uses stack memory**

Recursion is more efficient than iteration

**Which of the following statement concerning heaps is NOT true?**

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

**Which of the following statement concerning heaps is NOT true?**

A heap can be stored in a binary search tree.

A heap can be stored in an array.

A heap can be used to implement a priority queue.

A heap can be used to sort data.

**A complete binary tree is a tree that is _________ filled, with the possible exception of the bottom level.**partially

**completely**incompletelypartly

**By using __________we avoid the recursive method of traversing a Tree, which makes use of stacks and consumes a lot of memory and time.**Binary tree onlyHeap data structureHuffman encoding

**Which of the following statement is true about dummy node of threaded binary tree?**The left pointer of dummy node points to the itself while the right pointer points to the root of tree.The left pointer of dummy node points to the root node of the tree while the right pointer points itself i.e. to dummy node.The left pointer of dummy node points to the root node of the tree while the right pointer is always NULL.The right pointer of dummy node points to the itself while the left pointer is always NULL.

**Threaded binary tree**

**When a complete binary tree, represented by an array then for any array element at position i, the parent is at position ______ .**2i-12i2i+1

**floor(i/2)**

**When a complete binary tree represented by an array then if right child is at position 5 then left child will be at position _____**23

**4**6

**A binary tree with N internal nodes has _____ links, _______ links to internal nodes and ________ links to external nodes.**

**2N, N-1, N+1**N-1, 2N, N+1N+1, 2N, N-1N+1, N-1, 2N

**If a binary tree has N + 1 external nodes then,**

**It has N internal nodes**.It has N-1 internal nodes.It has N/2 internal nodes.It has N+2 internal nodes.

**A binary tree with 45 internal nodes has _______links to external nodes.**44454690

**Consider a binary tree, represented by the following array: 10,7,9,5,2,1,6,3,4 This is a ________.**Min heapMax heap (Not Sure)Threaded binary treeBinary Search tree

**Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,I Is it a strictly binary tree ?**Yes

**No**

**In threaded binary tree the NULL pointers are replaced by the**preorder successor or predecessor

**inorder successor or predecessor**inorder successor or predecessorNULL pointers are not replaced

**Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,H,I,J,K,L Is it a strictly binary tree?**Yes

**No**

**We implement the heap by ______________ .**Threaded TreeAVL tree

**Complete binary tree**Expression

**If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?**

► 54 ► 55 ► 56

**►**

**57**

**Which of the following statements is correct property of binary trees?**

► A binary tree with N internal nodes has N+1 internal links. ► A binary tree with N external nodes has 2N internal nodes.

**►**

**A binary tree with N internal nodes has N+1 external nodes.**► None of above statement is a property of the binary tree.

**Which of the following is a property of binary tree?**► A binary tree of N external nodes has N internal node.

**►**

**A binary tree of N internal nodes has N+ 1 external node.**► A binary tree of N external nodes has N+ 1 internal node. ► A binary tree of N internal nodes has N- 1 external node.

**Which of the following statement is true about dummy node of threaded binary tree?**► The left pointer of dummy node points to the itself while the right pointer points to the root of tree.

**►**

**The left pointer of dummy node points to the root node of the tree while the right pointer points itself i.e. to**► The left pointer of dummy node points to the root node of the tree while the right pointer is always NULL. ► The right pointer of dummy node points to the itself while the left pointer is always NULL.

*dummy*node**If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a**

► Expression tree ► Threaded binary tree ►

**complete Binary tree**► Perfectly complete Binary tree

**Which of the following statement is correct about find(x) operation:**

**►**

**A find(x) on element x is performed by returning exactly the same node that is found.**► A find(x) on element x is performed by returning the root of the tree containing x. ► A find(x) on element x is performed by returning the whole tree itself containing x. ► A find(x) on element x is performed by returning TRUE.

**If there are 23 external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?**

**►**

**23**

**►**

**2**

**►**

**21**

**►**

**22**

f there are N external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

**►**

**N -1**

**►**

**N+1**

**►**

**N+2**

**►**

**N**

**Which of the following statement is correct?**

**►**

**A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER**

successor.

**►**

**A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREOREDR successor.**

**►**

**A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its INORDER successor.**

**►**

**A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER successor.**

**By using __________we avoid the recursive method of traversing a Tree, which makes use of stacks and consumes a lot of memory and time.**

**►**

**Binary tree only**

**►**

**Threaded binary tree**

**►**

**Heap data structure**

**►**

**Huffman encoding**

**Consider a min heap, represented by the following array:**

**10,30,20,70,40,50,80,60**

**After inserting a node with value 31.Which of the following is the updated min heap?**

**►**

**10,30,20,31,40,50,80,60,70**

**►**

**10,30,20,70,40,50,80,60,31**

**►**

**10,31,20,30,40,50,80,60,31**

**►**

**31,10,30,20,70,40,50,80,60**

**In complete binary tree the bottom level is filled from ________.**

**►**

**Left to right**

**►**

**Right to left**

**►**

**Not filled at all**

**►**

**None of the given options**

**In case of deleting a node from AVL tree, rotation could be prolong to the**

*root*node.

**►**

**Yes**

**►**

**No**

**When an array of object is created dynamically then there is no way to provide parameterized constructors for array of objects.**

**True**Flase

**Which of the following method is helpful in creating the heap at once?**

insertaddupdate

**preculateDown**