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
95

Data structures and Algorithms MCQ with Answers

95) The complexity of the average case of an algorithm is

Much more complicated to analyze than that of worst case

Much more simpler to analyze than that of worst case

Sometimes more complicated and some other times simpler than that of worst case

None or above

Answer is:

Much more complicated to analyze than that of worst case

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

96) The complexity of linear search algorithm is

O(n)

O(log n)

O(n²)

O(n log n)

Answer is:

O(n)

97) The complexity of Binary search algorithm is

O(n)

O(log )

O(n²)

O(n log n)

Answer is:

O(log )

98) The complexity of Bubble sort algorithm is

O(n)

O(log n)

O(n²)

O(n log n)

Answer is:

O(n²)

99) The indirect change of the values of a variable in one module by another module is called

internal change

inter-module change

side effect

side-module update

Answer is:

side effect

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here