Data Structures and Algorithms MCQs Test 6 Online For Preparation

1. The situation when in a linked list START=NULL is ?

A. House full

B. Saturated

C. Overflow

D. Underflow

2. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called ?

A. Overflow

B. Saturated

C. Underflow

D. House full

3. When in order traversing a tree resulted E A C K F H D B G; the pre order traversal would return ?

A. FAEKCDHGB

B. FEAKDCHBG

C. FAEKCDBHG

D. EAFKHDCBG

4. Which of the following is two way list ?

A. None of above

B. Linked list with header and trailer nodes

C. Grounded header list

D. Circular header list

5. Binary search algorithm can not be applied to ?

A. Sorted linear array

B. Pointer array

C. Sorted linked list

D. Sorted binary trees

6. The difference between linear array and a record is ?

A. All of above

B. An array is suitable for homogeneous data but the data items in a record may have different data type

C. In a record, there may not be a natural ordering in opposed to linear array.

D. A record form a hierarchical structure but a linear array does not

7. A data structure where elements can be added or removed at either end but not in the middle ?

A. Queues

B. Linked lists

C. Stacks

D. Deque

8. Which of the following statement is false ?

A. pointers store the next data element of a list

B. Arrays are dense lists and static data structure

C. data elements in linked list need not be stored in adjacent space in memory

D. linked lists are collection of the nodes that contain information part and next pointer

9. The term "push" and "pop" is related to the ?

A. All of above

B. Lists

C. Stacks

D. Array

10. Which of the following name does not relate to stacks ?

A. Push-down lists

B. Piles

C. FIFO lists

D. LIFO list

Data Structures and Algorithms MCQs Test 6 Online For Preparation

Leave a Reply Cancel reply