Data Structure (DS) MCQs | Page - 8

Dear candidates you will find MCQ questions of Data Structure (DS) here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 97.30K Points
Coach

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

  • (A) fifo lists
  • (B) lifo list
  • (C) piles
  • (D) push-down lists
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

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

  • (A) stacks
  • (B) queue
  • (C) dequeue
  • (D) binary search tree
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

Q. node.next -> node.next.next; will make

  • (A) node.next inaccessible
  • (B) node.next.next inaccessible
  • (C) this node inaccessible
  • (D) none of the above
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

Q. A circular linked list can be used for

  • (A) stack
  • (B) queue
  • (C) both stack & queue
  • (D) neither stack or queue
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

Q. In doubly linked lists

  • (A) a pointer is maintained to store both next and previous nodes.
  • (B) two pointers are maintained to store next and previous nodes.
  • (C) a pointer to self is maintained for each node.
  • (D) none of the above
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

Q. The disadvantage in using a circular linked list is …………………….

  • (A) it is possible to get into infinite loop
  • (B) last node points to first node.
  • (C) time consuming
  • (D) requires more memory space
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

Q. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as

  • (A) singly linked list
  • (B) circular linked list
  • (C) doubly linked list
  • (D) linear linked list
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

Q. In doubly linked lists, traversal can be performed?

  • (A) only in forward direction
  • (B) only in reverse direction
  • (C) in both directions
  • (D) none of the above
Show Answer Discuss Share

M

Mr. Dubey • 97.30K Points
Coach

Q. What differentiates a circular linked list from a normal linked list?

  • (A) you cannot have the ‘next’ pointer point to null in a circular linked list
  • (B) it is faster to traverse the circular linked list
  • (C) you may or may not have the ‘next’ pointer point to null in a circular linked list
  • (D) head node is known in circular linked list
Show Answer Discuss Share

Jump to

Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.

Image