CS-301 Final Term Exams Preparation Virtual University With Answers

CS-301 Final Term Exams Preparation Virtual University

Sr. # Questions Answers Choice
1 What requirement is placed on an array, so that binary search may be used to locate an entry? The array elements must form a heap. The array must have at least 2 entries The array must be sorted. The array‟s size must be a power of two.
2 A complete binary tree of height ___ has node between 16 to 31. 2 3 4 5
3 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 / x *y a - b c / + x y a * - b c / + x y a * - b/ + c
4 A complete binary tree of height 3 has between ________ nodes. 8 to 14 8 to 15 8 to 16 8 to 17
5 A complete binary tree us a tree that is ___ filled with the possible exception of the bottom level. partially completely incompletely partly
6 Which of the following statement statement is true about dummy node of threaded binary type? This dummy node never has a value This dummy node has always some dummy values This dummy node has either no value or some dummy value This dummy node has always some integer value
7 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 levelorder Preorder Inorder Postorder
8 Which of the following statement is correct property of binary trees? A binary tree with 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 node. None of above statement is a property of the binary tree.
9 While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency. Equal to the small frequency Equal to the greater Equal to the sum of the two frequencies Equal to the difference of the two frequencies
10 Use of binary tree in compression of data is known as _______ Traversal Heap Union Huffman encoding
Download This Set

Is this page helpful?