(A) 2^H
(B) 2^H +1
(C) 2^H -1
(D) 2^H +2
Tag: Data Structures and Algorithms Mcq
__ is a data structure that can grow easily dynamically at run time without having to copy existing elements.
(A) List
(B) Array()
(C) Both of the above
(D) None of the above
Consider a min heap, represented by the following array: 11,22,33,44,55 After inserting a node with value 66.Which of the following is the updated min heap?
(A) 11,22,33,44,55,66
(B) 11,22,33,44,66,55
(C) 11,22,33,66,44,55
(D) 11,22,66,33,44,55
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?
(A) 10,30,20,31,40,50,80,60,70
(B) 10,30,20,70,40,50,80,60,31
(C) 10,31,20,30,40,50,80,60,31
(D) 31,10,30,20,70,40,50,80,60
Huffman encoding uses __ tree to develop codes of varying lengths for the letters used in the original message.
(A) Stack
(B) Linked list
(C) Binary tree
(D) Queue
Union is a __ time operation.
(A) Constant
(B) Polynomial
(C) Exponential
(D) None of the above
The definition of Transitivity property is?
(A) For all element x member of S, x R x
(B) For all elements x and y, x R y if and only if y R x
(C) For all elements x, y and z, if x R y and y R z then x R z
(D) For all elements w, x, y and z, if x R y and w R z then x R z
A binary tree with N internal nodes has __ links, __ links to internal nodes and __ links to external nodes.
(A) N+1, 2N, N-1
(B) N+1, N-1, 2N
(C) 2N, N-1, N+1
(D) N-1, 2N, N+1