Scribd
Upload
14 views5 pages

ACE Discrete Mathematics Chapterwise Questions

The document outlines various topics in mathematical logic, set theory, algebraic structures, combinatorics, and graph theory, with specific tasks such as constructing truth tables, proving mathematical statements, and defining key concepts. It includes exercises on truth tables, induction, group theory, permutations, and graph properties. Each unit contains definitions, proofs, and applications relevant to the respective mathematical field.

Uploaded by

swathidornala5
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
14 views5 pages

ACE Discrete Mathematics Chapterwise Questions

The document outlines various topics in mathematical logic, set theory, algebraic structures, combinatorics, and graph theory, with specific tasks such as constructing truth tables, proving mathematical statements, and defining key concepts. It includes exercises on truth tables, induction, group theory, permutations, and graph properties. Each unit contains definitions, proofs, and applications relevant to the respective mathematical field.

Uploaded by

swathidornala5
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/ 5

Unit I: Mathematical Logic

1. Construct a truth table for the proposition: (P → Q) ∧ (¬Q → ¬P)

2. Determine the validity of the argument using truth tables.

3. Translate the statement 'If it rains, then the ground gets wet' into
predicate logic.

4. Use rules of inference to prove: P → Q, Q → R ⊢ P → R

5. Prove by contradiction: If n^2 is even, then n is even.

6. What is the contrapositive of the statement: 'If it is raining, then the


ground is wet'?

7. Apply mathematical induction to prove: 1 + 2 + 3 + ... + n = n(n + 1)/2

8. Apply strong induction to prove: Every amount ≥ 8 cents can be


formed using 3 and 5 cent coins.

9. What is the difference between a tautology and a contradiction? Give


examples.

10. State and prove the law of excluded middle.

11. Construct truth tables for compound statements and determine


equivalency.

12. Use rules of inference to derive conclusion from a set of premises.

13. Use resolution method to prove unsatisfiability.

14. Define logical equivalence. Show (P → Q) ≡ (¬P ∨ Q)

15. Give the normal form of the formula: ¬(P ∧ Q) ∨ (¬R ∧ S)


Unit II: Set Theory
1. Define power set and give an example.

2. If A = {1,2,3} and B = {2,3,4}, find A ∪ B, A ∩ B, A - B.

3. Show that (A ∪ B) ∩ C = (A ∩ C) ∪ (B ∩ C).

4. Use Venn diagrams to illustrate De Morgan’s laws.

5. What is the Cartesian product of A = {1,2} and B = {x,y}?

6. Prove: A ⊆ B ⇔ A ∪ B = B and A ∩ B = A

7. Find the number of elements in A ∪ B if n(A) = 10, n(B) = 15, and n(A
∩ B) = 5.

8. How many elements are in the power set of a set with 4 elements?

9. Prove that if A ⊆ B and B ⊆ C, then A ⊆ C.

10. Write the set builder form of the set {2, 4, 6, 8}.

11. Prove or disprove: (A - B) ∪ (B - A) = (A ∪ B) - (A ∩ B)

12. Show that A × (B ∩ C) = (A × B) ∩ (A × C)

13. Use inclusion-exclusion principle to find |A ∪ B ∪ C|

14. Explain symmetric difference with an example.

15. Find the cardinality of a set A if |A × A| = 36


Unit III: Algebraic Structures
1. Define a group and give one example.

2. Prove that the set of integers under addition forms a group.

3. Show that the set of even integers under addition is a subgroup of


integers.

4. Define a monoid and give an example.

5. What is the identity element in the set of real numbers under


multiplication?

6. Prove or disprove: (Z, ×) is a group.

7. Define cyclic group and give an example.

8. Prove that every cyclic group is abelian.

9. Define ring and give an example of a commutative ring.

10. Is (Z, +, ×) a field? Justify your answer.

11. Prove that the set of all 2x2 matrices under addition is a group.

12. Find the inverse of 2 in Z_7 under multiplication.

13. Define the order of an element in a group.

14. Prove that in a group G, (ab)^-1 = b^-1 a^-1

15. Give examples of non-abelian groups.


Unit IV: Combinatorics
1. How many 4-digit numbers can be formed using digits 1 to 9 with
repetition allowed?

2. Find the number of permutations of the letters in the word


'DISCRETE'.

3. How many ways can you choose 3 students from a group of 10?

4. In how many ways can 5 people sit around a circular table?

5. What is the number of binary strings of length 6 with exactly 2 ones?

6. Apply the pigeonhole principle to prove: Among 13 people, at least


two have birthdays in the same month.

7. Find the number of 3-letter words (meaningful or not) that can be


formed using the English alphabet.

8. Using inclusion-exclusion, how many numbers between 1 and 100 are


divisible by 2, 3, or 5?

9. How many ways can 3 boys and 2 girls be arranged in a row such that
girls are together?

10. How many subsets of size 3 can be chosen from a set with 8
elements?

11. State and prove Pascal’s identity.

12. How many ways can you select a president and vice president from a
group of 6 people?

13. What is the coefficient of x^4 in (1 + x)^8?

14. How many solutions does x1 + x2 + x3 = 7 have in non-negative


integers?

15. Using combinatorics, prove the binomial theorem.


Unit V: Graph Theory
1. Define graph, simple graph, multigraph and pseudograph.

2. Draw a graph with 5 vertices and 6 edges.

3. Define degree of a vertex. State Handshaking Lemma.

4. Prove that the sum of degrees of all vertices is twice the number of
edges.

5. Define Eulerian graph and give a necessary and sufficient condition.

6. What is a Hamiltonian circuit? Give an example.

7. Draw the complete graph K5 and state its number of edges.

8. What is a bipartite graph? Give one example.

9. Find the chromatic number of a cycle of even length.

10. Prove that a tree with n vertices has exactly n - 1 edges.

11. Define spanning tree and minimum spanning tree.

12. State and explain Kruskal’s algorithm.

13. What is the adjacency matrix of a graph? Give an example.

14. Find the number of edges in a complete graph with 10 vertices.

15. Explain the difference between DFS and BFS.

You might also like