CS301 Quiz 2

Cs 301 Quiz no 2

All of the given options

If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is . log2N

Use of binary tree in compression of data is known as . Huffman encoding

While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency. Equal to the sum of the two frequencies

Which of the following statement is correct?

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 successor. Inorder

Which of the following statement is true about dummy node of threaded binary tree?

This dummy node has either no value or some dummy value.

A complete binary tree is a tree that is filled, with the possible exception of the bottom level. completely A complete binary tree of height 3 has between _ nodes. 8 to 15 We can build a heap in _ time. Linear Suppose that a selection sort of 100 items has completed 42 iterations of the main loop. How many items are now guaranteed to be in their final spot (never to be moved again)?

Which of the following statement is NOT correct about find operation: One idea might be to use a tree to represent each set, since each element in a tree has the same root, thus the root can be used to name the set. (Consider the following infix )expression: x – y a + b / c Which of the following is a correct equivalent expression(s) for the above? x y a * - b c / + A complete binary tree of height has nodes between 16 to 31 .

What requirement is placed on an array, so that binary search may be used to locate an entry?

The array must have at least 2 entries