Data Structures

71. Process of inserting an element in stack is called _________.

1. Create
2. Push
3. Evaluation
4. Pop

View answer

72. Program module contains its own list of variables called _________.

1. global.
2. scope.
3. local.
4. external.

View answer

73. Quick sort uses _________ for implementation.

1. recursion.
2. traversal.
3. heaps.
4. queues.

View answer

74. Quotation marks are also called as _________.

1. string delimiters.
2. period.
3. stopper.
4. string.

View answer

75. Selection sort and quick sort both fall into the same category of sorting algorithms. _________ is that category.

1. O(n log n) sorts.
2. Divide-and-conquer sorts.
3. Interchange sorts.
4. Average time is quadratic.

View answer

76. Stack can be represented by means of _________.

1. Tree.
2. Graph.
3. One-way List.
4. None.

View answer

77. STACK is also called as _________.

1. FIFO
2. LIFO
3. FOLI
4. FOFI

View answer

78. Sub algorithms fall into two basic categories: function sub algorithms and _________ _ sub algorithms.

1. procedure.
2. argument.
3. processor.
4. methods.

View answer

79. The _________ denotes the greatest integer.

1. ceiling.
2. time.
3. space.
4. floor.

View answer

80. The _________ for a linked list is a pointer variable that locates the beginning of the list.

1. anchor.
2. base.
3. footer.
4. header.

View answer