This section contains more frequently asked Data Structure and Algorithms Fundamentals MCQs in the various University level and competitive examinations.
PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE
1. Data by itself is not useful unless
- It is massive
- It is processed to obtain information
- It is collected from diverse sources
- It is properly stated
B. It is processed to obtain information
2. Which of the following data structure is not linear data structure?
- Arrays
- Linked lists
- Both of the above
- None of the above
D. None of the above
3. The disadvantage in using a circular linked list is …………………….
- It is possible to get into infinite loop.
- Last node points to first node.
- Time consuming
- Requires more memory space
A. It is possible to get into infinite loop.
4. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
- Singly Linked List
- Circular Linked List
- Doubly Linked List
- Linear Linked List
C. Doubly Linked List
5. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
- circular queue
- random of queue
- priority
- dequeue
D. dequeue
6. In a priority queue, insertion and deletion takes place at ………………
- front, rear end
- only at rear end
- only at front end
- any position
D. any position
7. Which of the following is an application of stack?
- finding factorial
- tower of Hanoi
- infix to postfix conversion
- all of the above
B. tower of Hanoi
8. The data structure which is one ended is ………………
- queue
- stack
- tree
- graph
B. stack
9. A list which displays the relationship of adjacency between elements is said to be
- linear
- non linear
- linked list
- trees
A. linear
