logo
  • Home
  • Test & Rank
  • About
  • Training
  • Programming
  • CS
  • IT
  • IS
  • ECE
  • EEE
  • EE
  • Civil
  • Mechanical
  • Chemical
  • Metallurgy
  • Instrumentation
  • Aeronautical
  • Aerospace
  • Biotechnology
  • Mining
  • Marine
  • Agriculture
  • MCA
  • BCA
  • Internship
  • Jobs
  • Contact

Discrete Mathematics Multiple Choice Questions | MCQs | Quiz

Discrete Mathematics Interview Questions and Answers
Practice Discrete Mathematics questions and answers for interviews, campus placements, online tests, aptitude tests, quizzes and competitive exams.

Get Started

•   Propositions
•   Logic & Bit Operations
•   Implications
•   Logic Circuits
•   De-Morgan's Laws
•   Tautologie & Contradictions
•   Statements Types
•   Logical Equivalences
•   Predicate Logic Quantifiers
•   Nested Quantifiers
•   Inference
•   Proofs Types
•   Set Types
•   Sets
•   Set Operations - 1
•   Set Operations - 2
•   Venn Diagram
•   Algebraic Laws on Sets
•   Cartesian Product of Sets
•   Subsets
•   Functions
•   Functions Growth
•   Functions Range
•   Number of Functions
•   Floor & Ceiling Function
•   Inverse of a Function
•   Arithmetic Sequences
•   Geometric Sequences
•   Arithmetic Mean
•   Special Sequences
•   Harmonic Sequences
•   Cardinality of Sets
•   Matrices Types
•   Matrices Operations
•   Matrices Properties
•   Transpose of Matrices
•   Inverse of Matrices
•   Sequences & Summations
•   Algorithms
•   Algorithms Types
•   Algorithms Complexity - 1
•   Algorithms Complexity - 2
•   Integers & Algorithms
•   Integers & Division
•   Prime Numbers
•   Quadratic Residue
•   Least Common Multiples
•   Highest Common Factors
•   Base Conversion
•   Complement of a Number
•   Exponents Rules
•   Number Theory Applications
•   Greatest Common Divisors
•   Modular Exponentiation
•   Cryptography Encryption
•   Cryptography Decryption
•   Ciphers
•   Mathematical Induction
•   Strong Induction
•   Recursion
•   Counting Principle
•   Pigeonhole Principle
•   Linear Permutation
•   Circular Permutations
•   Combinations
•   Divisors - Number & Sum
•   Objects Division
•   Equations Solution
•   Derangements
•   Binomial Expansion Terms
•   Binomial Coefficient
•   Recurrence Relation
•   ↓ Probability ↓
•   Addition Theorem
•   Multiplication Theorem
•   Geometric Probability
•   Probability Distribution
•   Random Variables
•   Bayes Theorem
•   Generating Functions
•   Exclusion Principle
•   Logarithmic Series
•   Power Series
•   Number of Relations
•   Relations Closure
•   Relations Types
•   Partial Orderings
•   Equivalence Classes
•   Diagraph
•   Hasse Diagrams
•   Lattices
•   Bipartite Graphs
•   Graphs Properties
•   Connected Graphs
•   Graphs Isomorphism
•   Graph - Different Path
•   Degree & Graph Coloring
•   Graph's Matrices
•   Tree Properties
•   Cycles
•   Tree Traversal
•   Notations Interconversion
•   Spanning Trees
•   Boolean Algebra
•   Boolean Functions
•   Functions Minimization
•   Karnaugh Maps
•   Gates Interconversion
•   Prime Implicants
•   Finite State Automation
•   Group Theory
•   Group Axioms
•   Closure & Associativity
•   Identity & Inverse Existence
•   Subgroups
•   Cosets
•   Cyclic Groups
•   Permutation Groups
•   Burnside Theorem

Best Reference Books

Discrete Mathematics Books

« Prev Page
Next Page »

Discrete Mathematics Questions and Answers – Types of Algorithms

Posted on August 17, 2017 by Manish

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Types of Algorithms”.

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 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 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
View Answer

Answer: c
Explanation: In Dynamic programming algorithms we utilizes previous results for new ones.

4. A Complexity of algorithm depends upon:
a) Time only
b) Space only
c) Both Time and Space
4) 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 genrally 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 possibilties are tried.
advertisement

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 finite recurssion.

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 most important charecterstic 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) flow 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 flow charts.

10. There are two algorithms suppose A takes 1.41 milli seconds while B take 0.9 milliseconds,Which one of them is better considering all other things 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.
advertisement

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.

« Prev Page - Discrete Mathematics Questions and Answers – Algorithms
» Next Page - Discrete Mathematics Questions and Answers – Complexity of Algorithms

« Discrete Mathematics Questions and Answers – Algorithms
Discrete Mathematics Questions and Answers – Complexity of Algorithms »
advertisement

Deep Dive @ Sanfoundry:

  1. C++ Programming Examples on Numerical Problems & Algorithms
  2. Discrete Mathematics Questions and Answers
  3. C++ Programming Examples on Combinatorial Problems & Algorithms
  4. Java Programming Examples on Combinatorial Problems & Algorithms
  5. C++ Programming Examples on Set & String Problems & Algorithms
  6. C Programming Examples on Combinatorial Problems & Algorithms
  7. C Programming Examples on Set & String Problems & Algorithms
  8. Discrete Mathematics Questions and Answers – Types of Statements
  9. Discrete Mathematics Questions and Answers – Types of Proofs
  10. Discrete Mathematics Questions and Answers – Types of Matrices
Manish Bhojasia
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 | Facebook | Twitter

Best Careers

Developer Tracks
SAN Developer
Linux Kernel Developer
Linux Driver Developer
Linux Network Developer

Live Training Photos
Mentoring
Software Productivity
GDB Assignment
Sanfoundry is No. 1 choice for Deep Hands-ON Trainings in SAN, Linux & C, Kernel Programming. Our Founder has trained employees of almost all Top Companies in India such as VMware, Citrix, Oracle, Motorola, Ericsson, Aricent, HP, Intuit, Microsoft, Cisco, SAP Labs, Siemens, Symantec, Redhat, Chelsio, Cavium, ST-Micro, Samsung, LG-Soft, Wipro, TCS, HCL, IBM, Accenture, HSBC, Mphasis, Tata-Elxsi, Tata VSNL, Mindtree, Cognizant and Startups.

Best Trainings

SAN I - Technology
SAN II - Admin
Linux Fundamentals
Advanced C Training
Linux-C Debugging
System Programming
Network Programming
Linux Threads
Kernel Programming
Kernel Debugging
Linux Device Drivers

Best Reference Books

Computer Science Books
Algorithm & Programming Books
Electronics Engineering Books
Electrical Engineering Books
Chemical Engineering Books
Civil Engineering Books
Mechanical Engineering Books
Industrial Engineering Books
Instrumentation Engg Books
Metallurgical Engineering Books
All Stream Best Books

Questions and Answers

1000 C Questions & Answers
1000 C++ Questions & Answers
1000 C# Questions & Answers
1000 Java Questions & Answers
1000 Linux Questions & Answers
1000 Python Questions
1000 PHP Questions & Answers
1000 Hadoop Questions
Cloud Computing Questions
Computer Science Questions
All Stream Questions & Answers

India Internships

Computer Science Internships
Instrumentation Internships
Electronics Internships
Electrical Internships
Mechanical Internships
Industrial Internships
Systems Internships
Chemical Internships
Civil Internships
IT Internships
All Stream Internships

About Sanfoundry

About Us
Copyright
Terms
Privacy Policy
Jobs
Bangalore Training
Online Training
Developers Track
Mentoring Sessions
Contact Us
Sitemap
© 2011 Sanfoundry. All Rights Reserved.