Data Structures

51. How do the nested calls of the function get managed?

1. Through Queues.
2. Through Stacks.
3. Through Trees.
4. Through Graphs.

View answer

52. How many pointers are necessarily changed for the insertion in a Linked List?

1. 1
2. 2
3. 3
4. 5

View answer

53. Identify the data structure which allows deletions at both ends of the list but insertion at only one end_________.

1. Input-restricted dequeue.
2. Output-restricted dequeue.
3. Priority queues.
4. Data structure.

View answer

54. If every node u in G is adjacent to every other node v in G, A graph is said to be _________.

1. isolate.
2. complete.
3. finite.
4. Strongly connected.

View answer

55. If FRONT = NULL then _________.

1. queue full
2. queue empty
3. dequeue
4. priority queue

View answer

56. If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?

1. ABCD
2. DCBA
3. DCAB
4. ABDC

View answer

57. Important part of any compiler is the construction and maintenances of a dictionary, this types of dictionary are called _________.

1. symbol table.
2. index table.
3. grammar table.
4. pointer table.

View answer

58. In _________ all the records contain the same data items with the same amount of space.

1. variable-length records.
2. fixed-length records.
3. subscripted variable.
4. superscripted variable.

View answer

59. In a directed tree any node which has out degree 0 is called a terminal node or__________.

1. a tree.
2. a list.
3. a node.
4. a leaf.

View answer

60. In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called _________ tree.

1. directed.
2. structure.
3. ordered.
4. degree of.

View answer