MCQ | Data Structure Part 2

Data Structure - PART 2

« Previous Next »

1. Each data in a linked list is called

A. Element
B. Data
C. Information
D. Node

  [NET]

Answer: D - Node

---

2. The List with no node is called

A. Null list
B. Empty list
C. Zero list
D. Both (A) and (B)

  [NET]

Answer: D - Both (A) and (B)

---

3. Linked list application are

A. Stack
B. Queue
C. Graph
D. All of these

  [NET]

Answer: D - All of these

---

4. A valid linked list are

A. Single
B. Double
C. Circular
D. All of these

  [NET]

Answer: D - All of these

---

5. Which statement is not true regarding tree

A. Tree have cycles
B. Tree is a data structure
C. Tree has parent node called root node
D. Tree has single path from a node to another

  [NET]

Answer: A - Tree have cycles

---

6. Select which of the following is type of tree

A. NVL
B. AVL
C. Preorder
D. postorder

  [NET]

Answer: B - AVL

---

7. Graph traversal methods are

A. Depth first search
B. Breadth first search
C. Both (A) and (B)
D. None of these

  [NET]

Answer: C - Both (A) and (B)

---

8. At least ____ fields must contain a linked list

A. Two
B. Three
C. Four
D. One

  [NET]

Answer: A - Two

---

9. The most common hash functions use to complete the hash address

A. Division method
B. Union method
C. Substraction method
D. None of these

  [NET]

Answer: A - Division

---

10. PUSH and POP operation that perform in

A. Queue
B. Stack
C. List
D. Array

  [NET]

Answer: B - Stack

---

« Previous Next »