A. Floor of log n! B. Ceiling of log n! C. m+n-1
D. m+n E. 2^n F. 2^n-1
G. 2000 H. 1000/2 I. Static
J. Dynamic K. p+q L. p+q-2
M. Logical properties N. Physical properties O. Segment violation
P. Block overflow Q. AB/CDE+AC R. AB/CDEAC*+
S. Strings T. Pointers U. inorder
4.1 A sorting algorithm on n elements based on binary comparisons requires at least _______ comparisons. 4.2 Two sorted lists with m elements and n elements can be merged into a sorted list using no more than _________ comparisons. 4.3 argv an array of pointers to _________. 4.4 The minimum size of an array to store a binary tree of n levels is ________. 4.5 The number of edges in a full binary tree with 1,000 internal vertices is ____________. 4.6 An error caused by a program trying to access memory outside its address space is known as ________. 4.7 The storage class of a variable declared inside a function which allows retention of its previous value is termed as _________. 4.8 An abstract data type is a(n) __________. 4.9 Number of nodes required to store the adjacency list of a directed graph that has “p” vertices and ‘q’ edges is __________. 4.10 The postfix form of the expression A/B ** C + D*E- A*C is _____________.