UNIT-1
Text Book Exercise Problems
Construct a truth table for each of these compound propositions.
a) p ∧￢p b) p ∨￢p
c) (p ∨￢q) → q d) (p ∨ q) → (p ∧ q)
e) (p → q) ↔ (￢q →￢p)
f ) (p → q) → (q → p)
Construct a truth table for each of these compound propositions.
a) p → (￢q ∨ r)
b) ￢p → (q → r)
c) (p → q) ∨ (￢p → r)
d) (p → q) ∧ (￢p → r)
e) (p ↔ q) ∨ (￢q ↔ r) f ) (￢p ↔￢q) ↔ (q ↔ r)
3. Construct a combinatorial circuit using inverters, OR gates, and AND gates that produces
the output (p ∧￢r) ∨ (￢q ∧ r) from input bits p, q, and r.
4. Construct a combinatorial circuit using inverters, OR gates, and AND gates that produces
the output ((￢p ∨￢r)∧￢q) ∨ (￢p ∧ (q ∨ r)) from input bits p, q, and r.
5. Show that (p → q) ∧ (p → r) and p → (q ∧ r) are logically equivalent.
6. Show that (p → r) ∧ (q → r) and (p ∨ q) → r are logically equivalent.
7. Show that (p → q) ∨ (p → r) and p → (q ∨ r) are logically equivalent.
Example:6 page No: 73 from Text Book
Show that the premises “It is not sunny this afternoon and it is colder than yesterday,” “We will
go swimming only if it is sunny,” “If we do not go swimming, then we will take a canoe trip,”
and “If we take a canoe trip, then we will be home by sunset” lead to the conclusion “We will
be home by sunset.”
Example 7: Page No 74 from Text Book
Show that the premises “If you send me an e-mail message, then I will finish writing the
program,” “If you do not send me an e-mail message, then I will go to sleep early,” and “If I go
to sleep early, then I will wake up feeling refreshed” lead to the conclusion “If I do not finish
writing the program, then I will wake up feeling refreshed.”
Example:13 Page No :77 from Text Book
Show that the premises “A student in this class has not read the book,” and “Everyone in this
class passed the first exam” imply the conclusion “Someone who passed the first exam has not
read the book.”
UNIT-2
Important topics and Examples & Problems
The following topics are problematic topics
Properties of Relations
Closures of Relations,
Equivalence Relations,
Partial Orderings.
Exercise Problem 25 : from Text book
Use Algorithm 1 to find the transitive closures of these
relations on {1, 2, 3, 4}.
c) {(1, 2), (1,3), (1,4), (2,3), (2,4), (3, 4)}
d) {(1, 1), (1,4), (2,1), (2,3), (3,1), (3, 2), (3,4), (4, 2)}
Exercise Problem 26. From Text Book
Use Algorithm 1 to find the transitive closures of these
relations on {a, b, c, d, e}.
c) {(a, b), (a, c), (a, e), (b, a), (b, c), (c,a), (c,b), (d,a),(e, d)}
d) {(a, e), (b, a), (b, d), (c,d), (d,a), (d, c), (e,a), (e,b),(e, c), (e, e)}
UNIT-III
Important Topics
Mathematical Induction-Problems
Structural Induction-Problems
Strong Induction and Its Problems
Examples: from Text Book
Example-1 : from Text Book Page 316
Show that if n is a positive integer, then
1 + 2+· · ·+n = n(n + 1)/2
Example: 2 from text book page 316
Conjecture a formula for the sum of the first n positive odd integers. Then prove your conjecture
using mathematical induction.
Example 3: from text book page 318
Use mathematical induction to show that
1 + 2 + 22 +· · ·+2n = 2n+1 − 1
Example 9: page no 322 from Text book
Use mathematical induction to prove that 7n+2 + 82n+1 is divisible by 57 for every nonnegative
integer n.
Exercise problems: Page no 330 from text book.
15. Prove that for every positive integer n,
1 · 2 + 2 · 3+· · ·+n(n + 1) = n(n + 1)(n + 2)/3.
16. Prove that for every positive integer n,
1 · 2 · 3 + 2 · 3 · 4+· · ·+n(n + 1)(n + 2)
= n(n + 1)(n + 2)(n + 3)/4.
Unit-IV
Important Topics:
Expected Value and Variance Advanced Counting Techniques Problems
Recurrence Relations, Solving Linear Recurrence Relations and Problems from Text book
EXAMPLE 3 What is the solution of the recurrence relation
an = an−1 + 2an−2
with a0 = 2 and a1 = 7?
Find an explicit formula for the Fibonacci numbers.
What is the solution of the recurrence relation
an = 6an−1 − 9an−2
with initial conditions a0 = 1 and a1 = 6?
Find the solution to the recurrence relation
an = 6an−1 − 11an−2 + 6an−3
with the initial conditions a0 = 2, a1 = 5, and a2 = 15.
EXAMPLE 8 Find the solution to the recurrence relation
an = −3an−1 − 3an−2 − an−3
with initial conditions a0 = 1, a1 = −2, and a2 = −1.
From Text book
EXAMPLE 11 Find all solutions of the recurrence relation
an = 5an−1 − 6an−2 + 7n.
UNIT-V
Important Topics
Euler and Hamilton Paths, Shortest-Path Problems
Graph Isomorphism and Problems
Tree Traversal, Spanning Trees, Minimum Spanning Trees
