# Discrete Mathematics Questions and Answers

Our 1000+ Discrete Mathematics questions and answers focuses on all areas of Discrete Mathematics subject covering 100+ topics in Discrete Mathematics. These topics are chosen from a collection of most authoritative and best reference books on Discrete Mathematics. One should spend 1 hour daily for 2-3 months to learn and assimilate Discrete Mathematics comprehensively. This way of systematic learning will prepare anyone easily towards Discrete Mathematics interviews, online tests, examinations and certifications.

**Highlights**

– 1000+ Multiple Choice Questions & Answers in Discrete Mathematics with explanations.

– Every MCQ set focuses on a specific topic in Discrete Mathematics Subject.

**Who should Practice these Discrete Mathematics Questions?**

– Anyone wishing to sharpen their knowledge of Discrete Mathematics Subject.

– Anyone preparing for aptitude test in Discrete Mathematics.

– Anyone preparing for interviews (campus/off-campus interviews, walk-in interview and company interviews).

– Anyone preparing for entrance examinations and other competitive examinations.

– All – Experienced, Freshers and Students.

**Here’s list of Questions & Answers on Discrete Mathematics Subject covering 100+ topics:**

#### 1. The Foundation: Logics and Proofs

The section contains questions and answers on propositions, logic operations and circuits, implications, de morgans law, statements types, tautologies, logical equivalences, quantifiers, inference and proofs types.

#### 2. Mapreduce

The section contains questions on sets and its operations and types, venn diagram, subsets, functions and its growth, algebraic laws, range and domain of functions, arithmetic and geometric sequences, special and harmonic sequences, matrices types, properties and operations, transpose and inverse of matrices, weighed mean, sequences and summations.

#### 3. Algorithms

The section contains questions and answers on algorithms and its types, algorithms complexity, integers and division.

Algorithms Types of Algorithms Complexity of Algorithms – 1 |
Complexity of Algorithms – 2 Integers and Algorithms The Integers and Division |

#### 4. Number Theory and Cryptography

The section contains questions on prime numbers, quadratic residue, lcm, hcf, base conversion, exponent rules, number complement, number theory applications, modular exponentiation, ciphers, cryptography encryption and decryption.

Prime Numbers Quadratic Residue and Pseudo Prime Least Common Multiples Highest Common Factors Base Conversion Complement of a Number Rules of Exponents |
Applications of Number Theory Primes and Greatest Common Divisors Modular Exponentiation Cryptography-Encryption Cryptography-Decryption Ciphers |

#### 5. Induction and Recursion

The section contains questions on strong induction and ordering, mathematical induction principles and recursion.

Strong Induction and Well Ordering Principle of Mathematical Induction |
Recursion |

#### 6. Counting

The section contains questions on counting and pigeonhole principle, linear and circular permutations, combinations, divisors, derangement, recurrence relation, binomial expansion terms and coefficient.

Fundamental Principle of Counting Pigeonhole Principle Linear Permutation Circular Permutations Combinations Number and Sum of Divisors |
Division of Objects Number of Solution of Equations Derangement Terms in Binomial Expansion Binomial Coefficient Recurrence Relation |

#### 7. Discrete Probability

The section contains questions and answers on addition and multiplication theorem on probability, probability distribution, bayes theorem, generating functions, inclusion and exclusion principles, logarithmic and power series.

Addition Theorem on Probability Multiplication Theorem on Probability Geometric Probability Probability Distribution Mean and Variance of Random Variables |
Bayes Theorem Generating Functions Principle of Inclusion Exclusion Logarithmic Series Power Series |

#### 8. Relations

The section contains questions and answers on relations types and closure, partial orderings and equivalence classes.

Number of Relations Closure on Relations Types of Relations |
Partial Orderings Equivalence Classes and Partitions |

#### 9. Graphs

The section contains questions on diagraph, hasse diagrams, lattices, bipartite graphs, graph properties, connected graphs, planarity, graph coloring, different path in graph and graph matrices.

Diagraph Hasse Diagrams Lattices Bipartite Graphs Graphs Properties |
Complete and Connected Graphs Isomorphism in Graphs Different Path in a Graph Planarity, Degree and Coloring of Graph Graph’s Matrices |

#### 10. Trees

The section contains questions and answers on tree properties, cycles, tree traversal, spanning trees, prefix, postfix and infix notations.

Properties of Tree Cycles Tree Traversal |
Interconversion for Prefix Postfix Infix Notations Spanning Trees |

#### 11. Boolean Algebra and Modeling Computations

The section contains questions on boolean algebra and functions, karnaugh maps, gates interconversion, prime implicants and essentials, minimization of boolean functions and finite state automation.

Boolean Algebra Boolean Functions Minimization of Boolean Functions Karnaugh Maps |
Interconversion of Gates Prime Implicants and Essentials Finite-State Automation |

#### 12. Groups

The section contains questions on group theory and axioms, closure and associativity, subgroups, identity and inverse existence, burnside theorem, cyclic and permutation groups.

Group Theory Group Axioms Closure and Associativity Existence of Identity & Inverse Subgroups |
Cosets Cyclic Groups Permutation Groups Burnside Theorem |

Here’s the list of Best Reference Books in Discrete Mathematics.

**Wish you the best in your endeavor to learn and master Discrete Mathematics!**