Question: 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 _________
Options
A : Brute Force
B : Divide and Conquer
C : GreedyAlgorithm
D : None of the mentioned
Discrete Mathematics Types Algorithms more questions
In resistance commutation method we add resistance between __________________
How to avoid grooves in the commutation of DC machine....
What is the requirement of the good commutation?
The static excitations mainly comprises of _______
An algorithm which tries all the possibilities unless results are....
Which algorithmic technique does Fibonacci search use?
Which of the following strategies does the following diagram depict?
An algorithm which uses the past results and uses them....
Given a rod of length n and the selling prices....
Which approach is based on computing the distance between each....
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Discrete Mathematics Subgroups
Discrete Mathematics Terms Binomial Expansion
Discrete Mathematics Tree Traversal
Discrete Mathematics Types Relations
Discrete Mathematics Venn Diagram
Discrete Mathematics Written Test