Electron: Solved MCQ of Data Structure and Algorithm set-4

Tree-data-structure (Photo credit: Wikipedia)

1. Which of the following data structure is non-linear type?

A) Strings

B) Lists

C) Stacks

D) Tree

2. Which of the following data structure is linear type?

A) Array

B) Tree

C) Graphs

D) Hierarchy

3. 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

4. The simplest type of data structure is ..................

A) Multidimensional array

B) Linear array

C) Two dimensional array

D) Three dimensional array

5. Linear arrays are also called ...................

A) Straight line array

B) One-dimensional array

C) Vertical array

D) Horizontal array

6. 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

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

A) Linear arrays

B) Linked lists

C) Graphs

D) Trees

8. 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

9. A ........................ does not keep track of address of every element in the list.

A) Stack

B) String

C) Linear array

D) Queue

10. When does top value of the stack changes?

A) Before deletion

B) While checking underflow

C) At the time of deletion

D) After deletion

Answers: