Data structures Mcqs-SET 01

1. The memory address of the first element of an array is called

a. floor address
b. foundation address
c. first address
d. base address

 Ans. base address

2. Which of the following data structures are indexed structures?

a. linear arrays
b. linked lists
c. both of above
d. none of above

 Ans:  linear arrays

3. Two dimensional arrays are also called

a. tables arrays
b. matrix arrays
c. both of above
d. none of above
Ans  c. both of above

4. Which of the following data structure can't store the non-homogeneous data elements?

a. Arrays
b. Records
c. Pointers
d. None
Ans a. Arrays

5. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called

a. elementary items
b. atoms
c. scalars
d. all of above
Ans  d. all of above

6. Binary search algorithm can not be applied to

a. sorted linked list
b. sorted binary trees
c. sorted linear array
d. pointer array
Ans  a. sorted linked list

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

a. underflow
b. overflow
c. housefull
d. saturated
Ans  overflow

---

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

a. underflow
b. overflow
c. housefull
d. saturated
Ans  a. underflow

9. Which of the following is two way list?

a. grounded header list
b. circular header list
c. linked list with header and trailer nodes
d. none of above

 Ans d. none of above

---

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

a. FIFO lists
b. LIFO list
c. Piles
d. Push-down lists

Ans a. FIFO lists

---

11. The term "push" and "pop" is related to the

a. array
b. lists
c. stacks
d. all of above
Ans  c. stacks

---

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

a. Linked lists
b. Stacks
c. Queues
d. Deque

Ans  d. Deque

---

13. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

a. FAEKCDBHG
b. FAEKCDHGB
c. EAFKHDCBG
d. FEAKDCHBG

Ans  b. FAEKCDHGB

14.    Which data structure allows deleting data elements from front and inserting at rear?

a. Stacks
b. Queues
c.   Deques
d. Binary search tree

Ans b. Queues

---

15.    Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

a. Input-restricted deque

b. Output-restricted deque

c.   Priority queues

d. None of above

Ans a. Input-restricted deque

Please Share it! :)