# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## Jump Search Multiple choice Questions and Answers (MCQs)

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Jump search algorithm requires which of the following condition to be true?

array should be sorted | |

array should have not be sorted | |

array should have a less than 64 elements | |

array should be partially sorted |

Question 1 Explanation:

Jump sort requires the input array to be sorted. The algorithm would fail to give the correct result if array is not sorted.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Jumps are made in the jump search algorithm until .....

element having value less than that of the required element is found | |

element having value equal to the median of values of the array is found | |

element having value greater than that of the required element is found | |

middle element is found equal to the element being searched |

Question 2 Explanation:

In jump search algorithm jumps are made until element having value greater than the value of element being searched is found. After this linear search is performed in backwards direction.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which of the following step is taken after finding an element having value greater than the element being searched?

linear search takes place in the forward direction | |

linear search takes place in the backward direction | |

binary search takes place in the forward direction | |

binary search takes place in a backward direction |

Question 3 Explanation:

First an element having value greater than the element being searched is found. After this linear search is performed in a backward direction.

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

How many jumps will be made in the worst case of jump search(let block jumped =k)?

n*k | |

n/k | |

k/n | |

n+k |

Question 4 Explanation:

Worst case occurs when the value to be searched is in the last section of the array. So, in this case the number of jumps will be n/k.

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What will be the maximum number of comparisons that can be made in jump search algorithm (assuming k to be blocks jumped)?

k | |

n/k | |

k-1 | |

k-1 |

Question 5 Explanation:

Worst case occurs when the element being searched is present just after the element that has been compared while making the last jump. So, in this case k-1 comparisons will have to be made.

There are 5 questions to complete.