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
131

Data structures and Algorithms MCQ with Answers

131) The average search time of hashing, with linear probing will be less if the load factor

is far greater than one

equals one

Is far less than one

none of these

Answer is:

Is far less than one

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

132) Suppose DATA array contains 1000000 elements. Using the binary search algorithm, one requiresonly about n comparisons to find the location of an item in the DATA array, then n is

60

45

20

None of these

Answer is:

20

133) Which of the following sorting procedure is the slowest

Quick sort

Heap sort

Shell sort

Bubble sort

Answer is:

Bubble sort

134) Which of the following sorting method is stable

Straight insertion sort

Binary insertion sort

Shell sort

Heap sort

Answer is:

Straight insertion sort

135) Which of the following best describes sorting ?

Accessing and processing each record exactly once

Finding the location of the record with a given key

Arranging the data (record) in some given order

Adding a new record to the data structure

Answer is:

Arranging the data (record) in some given order

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here