Question
a.
Brute Force
b.
Divide and Conquer
c.
Dynamic programming algorithms
d.
None of the mentioned
Posted under Algorithms Discrete Mathematics
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. An algorithm which tries all the possibilities unless results are satisfactory is and generally is time-consuming is _________
Similar Questions
Discover Related MCQs
Q. For a recursive algorithm _________
View solution
Q. Optimization of algorithm means _________
View solution
Q. For an algorithm which is the most important characteristic that makes it acceptable _________
View solution
Q. An algorithm can be represented through _________
View solution
Q. There are two algorithms suppose A takes 1.41 milli seconds while B takes 0.9 milliseconds, which one of them is better considering all other things the same?
View solution
Q. Which of the following case does not exist in complexity theory?
View solution
Q. The complexity of linear search algorithm is _________
View solution
Q. The complexity of Binary search algorithm is _________
View solution
Q. The complexity of merge sort algorithm is _________
View solution
Q. The Worst case occur in linear search algorithm when _________
View solution
Q. The worst case complexity for insertion sort is _________
View solution
Q. The complexity of Fibonacci series is _________
View solution
Q. The worst case occurs in quick sort when _________
View solution
Q. The worst case complexity of quick sort is _________
View solution
Q. Which is used to measure the Time complexity of an algorithm Big O notation?
View solution
Q. If for an algorithm time complexity is given by O(1) then the complexity of it is ____________
View solution
Q. If for an algorithm time complexity is given by O(log₂n) then complexity will be ___________
View solution
Q. If for an algorithm time complexity is given by O(n) then the complexity of it is ___________
View solution
Q. If for an algorithm time complexity is given by O(n²) then complexity will ___________
View solution
Q. If for an algorithm time complexity is given by O((3⁄2)ⁿ) then complexity will be ___________
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Discrete Mathematics? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
