Bihar STET Computer Science – Data Structures & Algorithms SET-1

Questions 56-60 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 56

MCQ · Single Correct 1 mark

In a zero-indexed binary heap array, the left child of index i is located at:

Answers for question 56

Question 57

MCQ · Single Correct 1 mark

What is the time complexity of extracting the minimum element from a binary min-heap of n elements?

Answers for question 57

Question 58

MCQ · Single Correct 1 mark

Which sorting algorithm is stable in its standard implementation and has O(n log n) worst-case time?

Answers for question 58

Question 59

MCQ · Single Correct 1 mark

What is the best-case time complexity of bubble sort when an early-exit swap flag is used?

Answers for question 59

Question 60

MCQ · Single Correct 1 mark

Which sorting algorithm repeatedly selects the smallest remaining element and places it at the next position?

Answers for question 60
Scroll to Top