Top 350+ Solved Data Structure and Algorithms (DSA) MCQ Questions Answer

From 286 to 300 of 305

Q. In linked list,a node contain

a. node,adrees field and data field

b. node number and data field

c. next adress field and information field

d. none of the above

  • c. next adress field and information field

Q. In linked list,the logical order of elements

a. is same as their physical arrangement

b. is not necessarily equivalent to their physical arrangement

c. is determined by their physical arrangement

d. none of the above

  • b. is not necessarily equivalent to their physical arrangement

Q. Null pointer is used to tell

a. end of linked list

b. empty pointer field of a structure

c. the linked list is empty

d. all of the above

  • d. all of the above

Q. List pointer variable in linked list contains address of the

a. following node in the first

b. current node in the first

c. first node in the first

d. none of the above

  • c. first node in the first

Q. Because of linear structure of linked list having linear ordering,there is similarity between linked list and array in

a. insertion of a node

b. deletion of a node

c. traversal of elements of list

d. none of the above

  • c. traversal of elements of list

Q. Searching of linked list requires linked list to be created

a. in stored order only

b. in any order

c. without underflow condition

d. none of the above

  • b. in any order

Q. A circular list can be used to represent

a. a stack

b. a queue

c. a tree

d. both a and b

  • d. both a and b

Q. To insert a node in a circular list at rear end it should be inserted at …...of the queue

a. front position

b. front-1position

c. rear position

d. rear-1 position

  • c. rear position

Q. In a circularly linked list organisation ,insertion of a record involves the modifications of

a. no pointer

b. 1 pointer

c. 2 pointer

d. 3 pointer

  • b. 1 pointer

Q. What is true about linked kist?

a. it is a linked structure,where each data gives the address of the next data

b. it is a dynamic data structure

c. it is a static data structure

d. both (a) and (b)

  • a. it is a linked structure,where each data gives the address of the next data

Q. A node of linked list contains_______

a. data field

b. a self referential pointer

c. both (a)and(b)

d. only b

  • c. both (a)and(b)

Q. Which nodes contains a null pointer in a linked list?

a. first node

b. middle node

c. last node

d. both (a) and (b)

  • c. last node

Q. Deletion of a node from an empty linked list will cause________

a. underflow

b. overflow

c. run time error

d. all of the above

  • a. underflow
Subscribe Now

Get All Updates & News