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

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 conditions checks available free space in avail list?

  • (A) Avail=Top
  • (B) Null=Avail
  • (C) Avail=Null
  • (D) Avail=Max stack

A

Admin • 833.24K Points
Coach

Q. Which of the following sorting algorithm is of divide-and-conquer type?

  • (A) Bubble sort.
  • (B) Insertion sort.
  • (C) Quick sort.
  • (D) Algorithm.

A

Admin • 833.24K Points
Coach

Q. STACK is also called as ______________.

  • (A) FIFO
  • (B) LIFO
  • (C) FOLI
  • (D) FOFI

A

Admin • 833.24K Points
Coach

Q. Collection of related data items is called _______.

  • (A) files
  • (B) fields
  • (C) attributes.
  • (D) records.

A

Admin • 833.24K Points
Coach

Q. Breadth First search is used in____________.

  • (A) binary tree.
  • (B) stacks.
  • (C) graphs.
  • (D) both a and c.

A

Admin • 833.24K Points
Coach

Q. A variable whose size is determined at compile time and cannot be changed at run time is_________.

  • (A) static variable.
  • (B) dynamic variable.
  • (C) not a variable.
  • (D) data variable.

A

Admin • 833.24K Points
Coach

Q. Process of inserting an element in stack is called ____________.

  • (A) Create
  • (B) Push
  • (C) Evaluation
  • (D) Pop

A

Admin • 833.24K Points
Coach

Q. Length of linear array can be found by using the formula_________

  • (A) UB-LB+1
  • (B) LB+UB
  • (C) LB-UB
  • (D) LB-UB+1

A

Admin • 833.24K Points
Coach

Q. The average number of key comparisons done in a successful sequential search in a list of length n is___________.

  • (A) log n
  • (B) n-1/2.
  • (C) n/2.
  • (D) n+1/2.

A

Admin • 833.24K Points
Coach

Q. A technique for direct search is _______________.

  • (A) Binary Search
  • (B) Linear Search
  • (C) Tree Search
  • (D) Hashing