Algorithms-Sorting [GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS)]: Questions 1 - 6 of 32

Choose Programs:

🎓 Study Material (1190 Notes): 2024-2025 Syllabus

Rs. 1000.00 -OR-

3 Year Validity (Multiple Devices)

Topic-wise Notes & SampleDetails

🎯 302 Numeric, 2894 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)

Rs. 650.00 -OR-

3 Year Validity (Multiple Devices)

CoverageDetailsSample Explanation

Help me Choose & Register (Watch Video) Already Subscribed?

Question 1

Question MCQ▾

Quick sort algorithm requires a maximum of ________ stack space in the worst case.

Choices

Choice (4)Response

a.

O (n)

b.

O (n2)

c.

O (logn)

d.

None of the above

Edit

Question 2

Appeared in Year: 2011

Question MCQ▾

The total number of comparisons in a bubble sort is (December Paper II)

Choices

Choice (4)Response

a.

b.

c.

d.

None of the above

Edit

Question 3

Appeared in Year: 2013

Question MCQ▾

Suppose that the splits at every level of Quicksort are in proportion where is a constant. The number of elements in an array is n. The maximum depth is approximately (September Paper II)

Choices

Choice (4)Response

a.

b.

c.

d.

Edit

Question 4

Appeared in Year: 2018

Question MCQ▾

The elements are inserted one by one in the given order into a max-heap. The resultant max-heap is stored in an array implementation as (December)

Choices

Choice (4)Response

a.

b.

c.

d.

Edit

Question 5

Appeared in Year: 2019

Question MCQ▾

Which of the following is best running time to sort n integers in the range 0 to ? (June)

Choices

Choice (4)Response

a.

b.

c.

d.

Edit

Question 6

Appeared in Year: 2019

Question MCQ▾

There are many sorting algorithms based on comparison. The running time of heap sort algorithm is O (n log n) . Like P, but unlike Q, heap sort sorts in place where (P, Q) is equal to (June)

Choices

Choice (4)Response

a.

Insertion Sort, Merge sort

b.

Insertion Sort, Quick sort

c.

Quick Sort, Insertion sort

d.

Quick Sort, Merge sort

Edit