Discrete Mathematics Multiple Choice Questions on “Algorithms – Types”.
1. An Algorithm is ___________
a) A procedure for solving a problem
b) A problem
c) A real life mathematical problem
d) None of the mentioned
Answer: a
Clarification: An algorithm is a stepwise solution to the problem.
2. 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 _________
a) Brute Force
b) Divide and Conquer
c) GreedyAlgorithm
d) None of the mentioned
Answer: b
Clarification: In Divide and Conquer we divide the problem and then recombine the solution.
3. An algorithm which uses the past results and uses them to find the new results is _________
a) Brute Force
b) Divide and Conquer
c) Dynamic programming algorithms
d) None of the mentioned
Answer: c
Clarification: In Dynamic programming algorithms we utilize previous results for new ones.
4. A Complexity of algorithm depends upon _________
a) Time only
b) Space only
c) Both Time and Space
d) None of the mentioned
Answer: c
Clarification: For Complexity, we calculate both time and space consumed.
5. 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: a
Clarification: In Brute force, all the possibilities are tried.
6. For a recursive algorithm _________
a) a base case is necessary and is solved without recursion.
b) a base case is not necessary
c) doesnot solve a base case directly
d) none of the mentioned
Answer: b
Clarification: Base case ends recursion and therefore it is necessary for finite recursion.
7. Optimization of algorithm means _________
a) making that algorithm fast by time and compact by space
b) making that algorithm slow by time and large by space
c) making that algorithm fast by time and large by space
d) making that algorithm slow by time and compact by space
Answer: a
Clarification: An Algorithm should be fast and compact.
8. For an algorithm which is the most important characteristic that makes it acceptable _________
a) Fast
b) Compact
c) Correctness and Precision
d) None of the mentioned
Answer: c
Clarification: An algorithm should be correct otherwise it’s of no use even if it is fast and compact.
9. An algorithm: can be represented through _________
a) flow charts
b) pseudo codes
c) instructions in common language
d) all of the mentioned
Answer: d
Clarification: Algorithm is represented through pseudo codes, normal language sentences or flow charts.
10. 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?
a) A is better than B
b) B is better than A
c) Both are equally good
d) None of the mentioned
Answer: b
Clarification: B takes less time than A for the same task.