This document contains 90 multiple choice questions and answers about various data structures like arrays, stacks, queues, linked lists, trees, and graphs. It provides definitions and examples of different linear and non-linear data structures, describing their properties and common applications. Key points covered include the definition of a data structure, linear vs non-linear structures, common operations on stacks and queues, and ways to traverse tree and graph data structures.

1. DATA STRUCTURES
MCQ’S & ANSWERS
PART – 3
Follow Us On Instagram:-
https://www.instagram.com/knowledge_center_computer/?hl=en
KCC

2. KCC

3. 61. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree Answer: - D
62. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
Answer: - A
Answer: - A
63. The logical or mathematical model of a particular organization of
data is called ………
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
KCC

4. 64. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array Answer: - B
65. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
Answer: - B
Answer: - A
66. Arrays are best data structures …………
A) For relatively permanent collections of data.
B) For the size of the structure and the data in the structure are
constantly changing
C) For both of above situation
D) For none of the above
KCC

5. 67. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees Answer: - A
68. Each node in a linked list has two pairs of ………….. and
……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field Answer: - A
Answer: - C
69. A …………………… does not keep track of address of every
element in the list.
A) Stack
B) String
C) Linear array
D) Queue
KCC

6. 70. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion Answer: - D
71. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree
Answer: - D
Answer: - A
72. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
KCC

7. 73. The logical or mathematical model of a particular organization of
data is called a ………
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
Answer: - A
74. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array
Answer: - B
Answer: - B
75. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
KCC

8. 76. Arrays are best data structures …………
A) For relatively permanent collections of data.
B) For the size of the structure and the data in the structure are
constantly changing
C) For both of above situation
D) For none of the above
Answer: - A
77. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
Answer: - A
Answer: - A
78. Each node in a linked list has two pairs of ………….. and
……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
KCC

9. 79. A …………………… does not keep track of address of every
element in the list.
A) Stack
B) String
C) Linear array
D) Queue
Answer: - C
80. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
Answer: - D
Answer: - D
81. Stack is also called as
a. First in first out
b. First in last out
c. Last in last out
d. Last in first out
KCC

10. 82. Any node is the path from the root to the node is called
a. Ancestor node
b. Successor node
c. Internal node
d. None of the above Answer: - A
83. Which of the following is not the type of queue?
a. Priority queue
b. Circular queue
c. Single ended queue
d. Ordinary queue
Answer: - C
Answer: B
84. A graph is a collection of nodes, called...... And line segments
called arcs or ...... that connect pair of nodes.
a. vertices, paths
b. vertices, edges
c. graph node, edges
d. edges, vertices
KCC

11. 85. In ........, search start at the beginning of the list and check every
element in the list.
a. Binary search
b. Hash Search
c. Linear search
d. Binary Tree search
Answer: - C
86. In the ....... traversal we process all of a vertex’s descendants before
we move to an adjacent vertex.
a. Depth Limited
b. With First
c. Breadth First
d. Depth First Answer: - D
Answer: - B
87. To represent hierarchical relationship between elements, which
data structure is suitable?
a. Graph
b. Tree
c. Dequeue
d. Priority
KCC

12. 88. Which of the following data structure is linear type?
a. Stack
b. Graph
c. Trees
d. Binary tree Answer: - A
89. Herder node is used as sentinel in........
a. Queues
b. Stacks
c. Graphs
d. Binary tree
Answer: - D
Answer: - A
90. Which of the following data structure can’t store the
nonhomogeneous data elements?
a. Arrays
b. Stacks
c. Records
d. None of the above
KCC