An algorithm which tries all the possibilities unless results are sat – McqOptions

MCQOPTIONS

1.	An algorithm which tries all the possibilities unless results are satisfactory is and generally is time-consuming is _________
A.	Brute Force
B.	Divide and Conquer
C.	Dynamic programming algorithms
D.	None of the mentioned
Answer» B. Divide and Conquer

Discussion

No Comment Found

Related MCQs

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?
An algorithm: can be represented through _________
For an algorithm which is the most important characteristic that makes it acceptable _________
Optimization of algorithm means _________
For a recursive algorithm _________
An algorithm which tries all the possibilities unless results are satisfactory is and generally is time-consuming is _________
A Complexity of algorithm depends upon _________
An algorithm which uses the past results and uses them to find the new results is _________
An algorithm in which we divide the problem into subproblem and then we combine the subsolutions to form solution to the original problem is known as _________
An Algorithm is ___________