Top 150+ Solved Data Structure (DS) MCQ Questions Answer

a. link field and information field

b. link field and avail field

c. avail field and information field

d. address field and link field

a. stack

b. string

c. linear array

d. queue

a. before deletion

b. while checking underflow

c. at the time of deletion

d. after deletion

a. for relatively permanent collections of dat

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

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 above situation

a. it is possible to get into infinite loop.

b. last node points to first node.

c. time consuming

d. requires more memory space

a. singly linked list

b. circular linked list

c. doubly linked list

d. linear linked list

a. circular queue

b. random of queue

c. priority

d. dequeue

a. front, rear end

b. only at rear end

c. only at front end

d. any position

a. o(n)

b. o(n2)

c. o(n log n)

d. o(log n)

a. finding factorial

b. tower of hanoi

c. infix to postfix conversion

d. all of the above

a. queue

b. stack

c. tree

d. graph

a. linear

b. non linear

c. linked list

d. trees

a. abstract level

b. application level

c. implementation level

d. all of the above

a. arrays

b. linked lists

c. both of the above

d. none of the above