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

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. A variable which is visible only in the function in which it is defined, is called

  • (A) static
  • (B) auto
  • (C) external
  • (D) local

A

Admin • 833.24K Points
Coach

Q. Unsigned integers occupies

  • (A) two bytes
  • (B) four bytes
  • (C) one bytes
  • (D) eight bytes

A

Admin • 833.24K Points
Coach

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

  • (A) strings
  • (B) lists
  • (C) queues
  • (D) all of the above

A

Admin • 833.24K Points
Coach

Q. In C, if you pass an array as an argument to a function, what actually gets passed?

  • (A) value of elements in array
  • (B) first element of the array
  • (C) base address of the array
  • (D) address of the last element of array

A

Admin • 833.24K Points
Coach

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

  • (A) stack
  • (B) queue
  • (C) dequeue
  • (D) binary search tree

A

Admin • 833.24K Points
Coach

Q. Queue is a -------------- List .

  • (A) fifo
  • (B) lifo
  • (C) lilo
  • (D) liso

A

Admin • 833.24K Points
Coach

Q. Stack is a -------------List.

  • (A) lifo
  • (B) fifo
  • (C) lilo
  • (D) lito

A

Admin • 833.24K Points
Coach

Q. A node in a linked list must contain at least

  • (A) three fields
  • (B) two fields
  • (C) four fields
  • (D) one field

A

Admin • 833.24K Points
Coach

Q. An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of

  • (A) f(n) x g(n)
  • (B) max ( f(n),g(n))
  • (C) min (f(n),g(n))
  • (D) f(n) + g(n)

A

Admin • 833.24K Points
Coach

Q. Big O notation is defined for

  • (A) time and space complexity
  • (B) optimality
  • (C) seaching
  • (D) none of the above

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.