www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Data structures and Algorithms
136

Data structures and Algorithms MCQ with Answers

136) A sort which compares adjacent elements in a list and switches where necessary is

insertion sort

heap sort

quick sort

bubble sort

Answer is:

bubble sort

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

137) A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called

insertion sort

selection sort

heap sort

quick sort

Answer is:

selection sort

138) Which of the following statements is used in the binary search algorithm to halve the array ?

middle Sub = (start Sub + stop Sub)/2;

middle Sub = start Sub + stop Sub/2;

middle Sub = middle Sub/2;

middle Sub = (stop Sub - start Sub)/2;

Answer is:

middle Sub = (start Sub + stop Sub)/2;

139) The data for which you are searching is called

search argument

sorting argument

detection argument

binary argument

Answer is:

search argument

140) If the binary search algorithm determines that the search argument is in the lower half of the array, which of the following statements will, set the appropriate variable to the appropriate value

start Sub = middle Sub - 1;

start Sub = middle Sub + 1;

stop Sub = middle Sub - 1;

stop Sub = middle Sub + 1.

Answer is:

start Sub = middle Sub + 1;

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here