Scribd
Upload
35 views1 page

Discrete Math Sample Questions

The document contains a series of sample math questions based on a syllabus, covering topics such as binary relations, power sets, the Schroeder-Bernstein theorem, mathematical induction, the Euclidean algorithm, combinatorics, logical equivalences, group theory, Boolean algebra, graph theory, and Dijkstra's algorithm. Each question requires definitions, proofs, examples, or explanations related to these mathematical concepts. The questions are designed to test understanding and application of fundamental principles in mathematics.

Uploaded by

Vivek Chaurasia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views1 page

Discrete Math Sample Questions

The document contains a series of sample math questions based on a syllabus, covering topics such as binary relations, power sets, the Schroeder-Bernstein theorem, mathematical induction, the Euclidean algorithm, combinatorics, logical equivalences, group theory, Boolean algebra, graph theory, and Dijkstra's algorithm. Each question requires definitions, proofs, examples, or explanations related to these mathematical concepts. The questions are designed to test understanding and application of fundamental principles in mathematics.

Uploaded by

Vivek Chaurasia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Sample Math Questions Based on Syllabus

1. Define and provide an example of a Binary Relation. How is it different from an Equivalence

Relation?

2. Prove that the set of all subsets of a set with 'n' elements has 2^n elements using the Power Set

theorem.

3. State and prove the Schroeder-Bernstein theorem with an example.

4. Use Mathematical Induction to prove that 1 + 2 + 3 + ... + n = n(n + 1)/2 for all positive integers n.

5. Explain the Euclidean Algorithm to find the Greatest Common Divisor (GCD) of two numbers.

Provide a worked example.

6. A group of 5 men and 4 women is to form a committee of 4 members. In how many ways can the

committee be formed such that at least one woman is included?

7. Construct a truth table for the compound statement: (P -> Q) and (not Q -> not P).

8. Prove that (P or Q) and (not P or R) implies (Q or R) using logical equivalences.

9. Prove that every subgroup of a cyclic group is cyclic.

10. Define Boolean Algebra. Verify the identity A + AB = A using truth tables.

11. Draw a graph with 6 vertices and show that it contains at least one cycle if it has more than 5

edges.

12. Explain Dijkstra's algorithm for finding the shortest path in a weighted graph with an example.

You might also like