A. Ordered set B. Folding C. Insertion
D. Linked list E. n + 2 * e F. n + e
G. array H. 2 * n I. 10
J. BFS K. FIFO L. 12
M. 32 N. One-to-many O. Many-to-many
P. Doubly-linked list Q. 0 R. Abstract data type
4.1 A graph represents ________ relationship between nodes.
4.2 ________ data structure is used to implement dynamic storage management.
4.3 If x=2.5, y=0.1, m=1, n=-1. The value of the expression x > y && m < n is ________.
4.4 A B-tree of order 24 contains at least ________ keys in non-root node.
4.5 ________ can be used to find the shortest distance between given two nodes in a graph.
4.6 Given int r = 10;
Int *q = &r;
The value of *q is ________.
4.7 The ________ data structure uses direct access method for retrieval of the data.
4.8 Total number of nodes required to represent an undirected graph with “n” nodes and “e” edges using adjacency list representation is ________.
4.9 List is a(n) ________ of elements.
4.10 Linked list is preferred over an array for ________ operation.
