Time Left - 15:00 mins

GATE 2022 : Algorithm Quiz -3

Attempt now to get your rank among 321 students!

Question 1

……… is rearranging pairs of elements which are out of order, until no such pairs remain.

Question 2

The average successful search time for sequential search ‘n’ items is

Question 3

______ sorting algorithms has the lowest worst-case time complexity.

Question 4

The sorting algorithm which requires least number of swaps in the worst case is

Question 5

Consider the following scenario during insertion sort when the array looks like the following:
{25, 75, 95, 125, 80, 5, 10}

The number of comparisons that it will further take for the array to be completely sorted are ________.

Question 6

Conisder a sorted array with 100 elements. To find a specific element in array , the worst case number of probes required _______.
  • 321 attempts
  • 0 upvotes
  • 2 comments
Aug 7GATE & PSU CS

Posted by:

Harshita AgarwalHarshita AgarwalMember since Jul 2020
Share this quiz   |