• Attempt any five questions.
• All questions carry equal marks.
Define countable and uncountable sets. Prove that the set of rational numbers is countable.
Using Venn diagram, prove: A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
Define relation. Explain equivalence relation and partial ordering relation with suitable examples.
Let A = {1, 2, 3} R = {(1,1), (2,2), (3,3), (1,2), (2,1)}. Check whether R is an equivalence relation and find equivalence classes.
Define one-one, onto and bijective functions. Prove that inverse of a function exists if and only if the function is bijective.
State and prove Pigeonhole Principle.
Construct truth table for the proposition. (p → q) ↔ (¬p ∨ q) and show that it is a tautology.
Convert the following statement into predicate logic and write its negation: "Every student studies Discrete Mathematics."
Prove by mathematical induction that: 1 + 2 + 3 + ... + n = n(n+1)/2
Prove by contradiction that √2 is irrational.
Define group and Abelian group. Prove that identity element of a group is unique.
Find all subgroups of the group Z₈.
Define Finite State Machine. Explain FSM as a language recognizer.
Design a finite state machine that accepts all binary strings ending with 01.
Define Euler path and Euler circuit. State necessary and sufficient conditions for their existence.
Explain Dijkstra's Algorithm and find the shortest path from a given source vertex 0 to all other vertices in a weighted graph.
