Discrete Mathematics Questions and Answers –

Algorithms – Types
« Prev Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses 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

View Answer

Answer: a
Explanation: An algorithm is a stepwise solution to the problem.

advertisement 

 
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

View Answer

Answer: b
Explanation: 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 nd the new results is _________
a) Brute Force
b) Divide and Conquer
c) Dynamic programming algorithms
d) None of the mentioned

View Answer

Answer: c
Explanation: 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

View Answer

Answer: c
Explanation: 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

View Answer

Answer: a
Explanation: In Brute force, all the possibilities are tried.

advertisement
Google 'must decide its own futu…

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

View Answer

Answer: b
Explanation: Base case ends recursion and therefore it is necessary for nite 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

View Answer 

Answer: a
Explanation: 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

View Answer

Answer: c
Explanation: 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) ow charts
b) pseudo codes
c) instructions in common language
d) all of the mentioned

View Answer

Answer: d
Explanation: Algorithm is represented through pseudo codes, normal language sentences or ow
charts.

advertisement


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

View Answer

Answer: b
Explanation: B takes less time than A for the same task.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certi cation contest to get free Certi cate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

« Prev - Discrete Mathematics Questions and Answers – Algorithms

» Next - Discrete Mathematics Questions and Answers – Algorithms – Complexity-1

advertisement

Recommended Posts:
1. C++ Programming Examples on Hard Graph Problems & Algorithms 
2. C Programming Examples on Hard Graph Problems & Algorithms
3. Java Programming Examples on Graph Problems & Algorithms
4. C Algorithms, Problems & Programming Examples
5. C Programming Examples on Graph Problems & Algorithms  
 6. C++ Programming Examples on Numerical Problems & Algorithms
7. C Programming Examples on Numerical Problems & Algorithms
8. Java Programming Examples on Numerical Problems & Algorithms
9. C++ Programming Examples on Combinatorial Problems & Algorithms
10. Java Algorithms, Problems & Programming Examples
11. C Programming Examples on Combinatorial Problems & Algorithms
12. Java Programming Examples on Set & String Problems & Algorithms
13. C++ Programming Examples on Set & String Problems & Algorithms
14. Java Programming Examples on Combinatorial Problems & Algorithms
15. Discrete Mathematics Questions and Answers
16. C Programming Examples on Set & String Problems & Algorithms
17. C++ Algorithms, Problems & Programming Examples
18. Discrete Mathematics Questions and Answers – Logics – Types of Statements
19. Discrete Mathematics Questions and Answers – Number Theory – Highest Common Factors
20. Discrete Mathematics Questions and Answers – Number Theory – Least Common Multiples

advertisement

Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is
Founder and CTO at Sanfoundry. He is Linux Kernel Developer & SAN Architect
and is passionate about competency developments in these areas. He lives in
Bangalore and delivers focused training sessions to IT professionals in Linux
Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage,
Advanced C Programming, SAN Storage Technologies, SCSI Internals & Storage 
Protocols such as iSCSI & Fiber Channel. Stay connected with him @ LinkedIn

 
 Subscribe Sanfoundry Newsletter and Posts

Name*

Email*

Subscribe

About | Certi cations | Internships | Jobs | Privacy Policy | Terms | Copyright | Contact

     

© 2011-2021 Sanfoundry. All Rights Reserved.