Data Structure and Algorithms (DSA) MCQs with answers Page - 84

Here, you will find a collection of MCQ questions on Data Structure and Algorithms (DSA). Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 833.24K Points
Coach

Q. Which of the following is an infix expression?

  • (A) (a+b)*(c+d)
  • (B) ab+c*
  • (C) +ab
  • (D) abc+*

A

Admin • 833.24K Points
Coach

Q. What is the time complexity of an infix to postfix conversion algorithm?

  • (A) O(N log N)
  • (B) O(N)
  • (C) O(N2)
  • (D) O(M log N)

A

Admin • 833.24K Points
Coach

Q. Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?

  • (A) operand is always placed in the output
  • (B) operator is placed in the stack when the stack operator has lower precedence
  • (C) parenthesis are included in the output
  • (D) higher and equal priority operators follow the same condition

A

Admin • 833.24K Points
Coach

Q. In infix to postfix conversion algorithm, the operators are associated from?

  • (A) right to left
  • (B) left to right
  • (C) centre to left
  • (D) centre to right

A

Admin • 833.24K Points
Coach

Q. A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?

  • (A) Queue
  • (B) Stack
  • (C) Tree
  • (D) Linked list

A

Admin • 833.24K Points
Coach

Q. The data structure required for Breadth First Traversal on a graph is?

  • (A) Stack
  • (B) Array
  • (C) Queue
  • (D) Tree

A

Admin • 833.24K Points
Coach

Q. A queue follows

  • (A) FIFO (First In First Out) principle
  • (B) LIFO (Last In First Out) principle
  • (C) Ordered array
  • (D) Linear tree

A

Admin • 833.24K Points
Coach

Q. Circular Queue is also known as

  • (A) Ring Buffer
  • (B) Square Buffer
  • (C) Rectangle Buffer
  • (D) Curve Buffer

A

Admin • 833.24K Points
Coach

Q. If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

  • (A) ABCD
  • (B) DCBA
  • (C) DCAB
  • (D) ABDC

A

Admin • 833.24K Points
Coach

Q. A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

  • (A) Queue
  • (B) Circular queue
  • (C) Dequeue
  • (D) Priority queue

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.