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.
– 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.
Logic and Bit Operations
Implication and Double Implications
Tautologies and Contradictions
Types of Statements
Predicate Logic Quantifiers
Types of Proofs
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.
The section contains questions and answers on algorithms and its types, algorithms complexity, integers and division.
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.
Quadratic Residue and Pseudo Prime
Least Common Multiples
Highest Common Factors
Complement of a Number
Rules of Exponents
Applications of Number Theory
Primes and Greatest Common Divisors
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
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
Number and Sum of Divisors
Division of Objects
Number of Solution of Equations
Terms in Binomial Expansion
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
Mean and Variance of Random Variables
Principle of Inclusion Exclusion
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
Equivalence Classes and Partitions
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.
Complete and Connected Graphs
Isomorphism in Graphs
Different Path in a Graph
Planarity, Degree and Coloring of Graph
The section contains questions and answers on tree properties, cycles, tree traversal, spanning trees, prefix, postfix and infix notations.
Properties of Tree
Interconversion for Prefix Postfix Infix Notations
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.
Minimization of Boolean Functions
Interconversion of Gates
Prime Implicants and Essentials
The section contains questions on group theory and axioms, closure and associativity, subgroups, identity and inverse existence, burnside theorem, cyclic and permutation groups.
Closure and Associativity
Existence of Identity & Inverse
Wish you the best in your endeavor to learn and master Discrete Mathematics!