B V Raju Institute of Technology w.e.f.

2022-2023

DISCRETE MATHEMATICS L T P C
I YEAR I SEM
3 0 0 3
CODE: A61N1
Course Pre-Requisites: Set, Relation, Mapping, Permutations and Combinations

Course Objectives: To learn

1. Concepts of sets and relation to understand Group’s and Ring structure
2. The concept of tautology, contradiction, quantifiers and contingency.
3. Combinatorics techniques in solving the system by various methodologies
4. Boolean expressions, operations and truth tables
5. Graphs serve as models for many standard problems

Unit-I: Abstract Algebra (10 Periods)

Sets, Finite sets, Power sets, Set Operations, Algebra of sets and duality, Partitions, Relations, Types of
relations, Closure properties, Equivalence relations, Partial Ordering, Groups, subgroups, Lagrange's
theorem on finite groups, introduction to Ring, Integral domain and Field.

Unit-II: Logic (10 Periods)

Propositional calculus - propositions and connectives, truth assignments and truth tables, validity and
satisfiability, tautology; Logical Equivalence and normal forms; Algebra of propositions, Conditional and Bi-
conditional statements, Logical implication, Quantifiers, Negation of quantified statements.

Unit-III: Combinatorics (9 Periods)

Introduction, basic counting, Factorial notation, Binomial coefficients, generating functions, recurrence
relations, pigeonhole principle, principle of mathematical induction.

Unit-IV: Boolean algebra (9 Periods)

Introduction of Boolean algebra, principle of duality, Basic logic gates, truth table, Boolean expressions,
canonical form, Karnaugh’s map.

Unit-V: Graph Theory (10 Periods)

Graphs, Types of Graphs, digraphs, adjacency matrix, isomorphism, Trees, Properties of trees, spanning
trees, Minimal Spanning trees using Kruskal’s and Prims Algorithms.Graph Theory Applications: Eulerian
paths and circuits in graphs and digraphs, Hamiltonian paths and circuits in graphs, Planar graphs, dual of
a planer graph, Euler’s formula, chromatic number, statement of Four-color theorem.

Course Outcomes:
After completing the course, the students will be able to:
1. Represent characteristics of Sets, Groups, Rings and Fields
2. Explain and exemplify tautology, contradiction and contingency
3. Identify underlying combinatorial structures
4. Analyse the design of various combinational & sequential logic circuits using the concepts of Boolean
Algebra
5. Apply graph theory based tools in solving practical problems

Text Books:
1. Topics in Algebra, I. N. Herstein, John Wiley and Sons.
2. Digital Logic & Computer Design, M. Morris Mano, Pearson.
3. Elements of Discrete Mathematics, (Second Edition) C. L. LiuMcGraw Hill, New Delhi.

Reference Books:
1. Graph Theory with Applications, J. A. Bondy and U. S. R. Murty, Macmillan Press, London.
2. Mathematical Logic for Computer Science, L. Zhongwan, World Scientific, Singapore.
3. Introduction to linear algebra. Gilbert Strang.
4. Introductory Combinatorics, R. A. Brualdi, North-Holland, New York.
5. Graph Theory with Applications to Engineering and Computer Science, N. Deo, Prentice Hall,
Englewood Cliffs.
6. Introduction to Mathematical Logic, (Second Edition), E. Mendelsohn, Van-Nostrand, London.
Code No: A61N1 R 22
BVRAJU INSTITUTE OF TECHNOLOGY, NARSAPUR
(UGC - AUTONOMOUS)
I B.Tech I Semester Regular/Supplementary Examinations, Jan 2024
DISCRETE MATHEMATICS
(COMPUTER SCIENCE AND BUSINESS SYSTEMS)
Time: 3 Hours Max Marks: 60
Note: This Question Paper contains two Parts A and B
 Part A is compulsory which carries 10 marks. Ten questions from five units. Answer all questions in
Part A at one place only.
 Part-B consists of 5 Questions (numbered from 2 to 6) carrying 10 marks each. Each of these
questions is from one unit and may contain a, b, c as sub-questions. For each question there will be an
either/or choice (that means there will be two questions from each unit and the student should answer
only one question).
PART – A (10x1 = 10 Marks)
1. Marks Bloom Level CO
a Give a relation which is both symmetric and transitive on a set. 1 1 1
b Give an example of a ring. 1 1 1
c Draw truth table for 𝑝 ↔ 𝑞 1 4 2
d Write the negation of quantified statement ∀𝑥 ∈ 𝐴, 𝑃(𝑥) 1 1 2
e What is the coefficient of 𝑥12 𝑦 13 in the expansion of (𝑥 + 𝑦)25 . 1 4 3
f State the Pigeonhole principle. 1 3 3
g State the principle of duality 1 3 4
h Prove the Boolean identity 𝑎.𝑏+𝑎.𝑏′=𝑎. 1 4 4
i Define isomorphism of graphs. 1 4 5
j State Four-color theorem 1 3 5

PART – B (5x10 = 50 Marks)

Marks Bloom Level CO
2 .a Let 𝑅 be a binary relation on the set of all positive integers such 10 2 1
that 𝑅 = {(𝑎, 𝑏) | 𝑎 − 𝑏 𝑖𝑠 𝑎𝑛 𝑜𝑑𝑑 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟 }. Is 𝑅
reflexive? Symmetric? Antisymmetric? Transitive? An
equivalence relation? A partial ordering relation?
OR
2.b Prove that the set 𝑍 of all integers with the binary operation 𝑎 ∗ 10 2 1
𝑏 = 𝑎 + 𝑏 + 1 for all 𝑎, 𝑏 ∈ 𝑍 is an abelian group.
***
3.a Find the principal conjunctive normal form and principal 10 1 2
disjunctive normal form of the propositional formula (~𝑝 →
𝑟) ∧ (𝑝 ↔ 𝑞)
OR
3.b For the universe of all integers, let 𝑝(𝑥): 𝑥 > 0, 𝑞(𝑥): 𝑥 is even 10 3 2
and 𝑟(𝑥): 𝑥 is divisible by 3 .
Then write down the following statements in symbolic form
(i) At least one integer is even
(ii) There exists a positive integer that is even
(iii) Some even integers are divisible by 3.
***
4.a (i) Solve the recurrence relation 5 4 3
𝑎𝑛+2 − 4𝑎𝑛+1 + 3𝑎𝑛 = 0, 𝑎0 = 2, 𝑎1 = 4 using the generating
function.
(ii) Prove that 1 + 2 + 3 + ⋯ + 𝑛 = 𝑛(𝑛 + 1)/2 by using 5 4 3
principle of mathematical induction.
OR
4.b Solve the Fibonacci recurrence relation 𝑎𝑛 = 𝑎𝑛−1 + 𝑎𝑛−2 with 10 4 3
the initial conditions 𝑎0 = 0, 𝑎1 = 1.
***
5.a Find the conjunctive normal form of the Boolean expression 10 4 4
(𝑥 ∧ (𝑦 ′ ∨ 𝑧)) ∨ 𝑧 ′ and then find its Disjunctive normal form
from it.
OR
5.b Use Karnaugh maps to find the minimal form for 10 4 4
𝑥𝑦𝑧 + 𝑥𝑦𝑧 ′ + 𝑥 ′ 𝑦𝑧 ′ + 𝑥 ′ 𝑦 ′ 𝑧.
***
6.a Find the minimum spanning tree of the following graph using 10 4 5
Kruskal’s algorithm (or) Prim’s algorithm

OR
6.b Find an Euler path or an Euler Circuit if it exists, in each of the
three graphs given below.
(i) (ii) (iii) 10 4 5

***
Code No: A61N1 R 22
BVRAJU INSTITUTE OF TECHNOLOGY, NARSAPUR
(UGC - AUTONOMOUS)
I B. Tech I Semester Supplementary Examinations, June- 2024
DISCRETE MATHEMATICS
(COMPUTER SCIENCE AND BUSINESS SYSTEMS)
Time: 3 Hours Max Marks: 60
Note: This Question Paper contains two Parts A and B
 Part A is compulsory which carries 10 marks. Ten questions from five units. Answer all questions in
Part A at one place only.
 Part-B consists of 5 Questions (numbered from 2 to 6) carrying 10 marks each. Each of these
questions is from one unit and may contain a, b, c as sub-questions. For each question there will be an
either/or choice (that means there will be two questions from each unit and the student should answer
only one question).
PART – A (10x1 = 10 Marks)
1. Marks Bloom Level CO
a Give a relation which is both a partial ordering relation and an 1 1 1
equivalence relation on a set.
b Give an example of an integral domain which not a field 1 1 1
c Draw truth table for 𝑝 ∨ 𝑞. 1 6 2
d Write the negation of quantified statement ∃𝑥 ∈ 𝐴, 𝑃(𝑥) 1 2 2

e What is the coefficient of 𝑥12 𝑦 13 in the expansion of (2𝑥 − 1 4 3

3𝑦)25 .
f Prove that if 𝑘𝑛 + 1 pigeons are placed into 𝑛 pigeon-holes, then 1 3 3
some pigeon-hole must contain at least 𝑘 + 1
pigeons
g Define Boolean algebra. 1 3 4
h ProvetheBooleanidentity𝑎.𝑏+𝑎.𝑏′=𝑎. 1 5 4
i Write any two properties of a tree 1 5 5
j State Euler’s formula 1 3 5

PART – B (5x10 = 50 Marks)

Marks Bloom Level CO
2 .a Let A={1,2,3,4,5} and 𝑅 a relation on 𝐴 × 𝐴 such that 10 2 1
(𝑥, 𝑦)𝑅(𝑥 ′ , 𝑦 ′ ) ⇔ 𝑥𝑦 ′ = 𝑥 ′ 𝑦. Then show that 𝑅 is an
equivalence relation on 𝐴 × 𝐴.
OR
2.b State and prove Lagrange’s theorem on finite groups. 10 2 1
***
3.a Find the principal conjunctive normal form and principal 10 1 2
disjunctive normal form of the propositional formula (~𝑝 → 𝑟) ∧
(𝑝 ↔ 𝑞)
OR
3.b Write the quantifiers of the following statements where predicate 10 3 2
symbols denotes, 𝐹(𝑥): 𝑥 is fruit,
𝑉(𝑥): 𝑥 is vegetable and 𝑆(𝑥, 𝑦): 𝑥 is sweeter than 𝑦.
(a) Some vegetables are sweeter than all fruits
(b) Every fruit is sweeter than all vegetables
(c) Every fruit is sweeter than some vegetables
(d) Only fruits are sweeter than vegetables
***
4.a (i) Solve the recurrence relation 5 4 3
𝑎𝑛 = 8𝑎𝑛−1 − 16𝑎𝑛−2 , for 𝑛 ≥ 2, 𝑎0 = 16, 𝑎1 = 18.
(ii) Use mathematical induction to prove that,
 (𝑛 + 1)(2𝑛 + 1)(2𝑛 + 3) 5 4 3
12 + 32 + 52 + ⋯ . (2𝑛 + 1)2 = ,
3
Whenever 𝑛 is positive integer.

OR
4.b (i) Use generating functions to solve the recurrence relation 5 3 3
𝑎𝑛 = 2𝑎𝑛−1 − 3𝑎𝑛−2 = 0, 𝑛 ≥ 2 with 𝑎0 = 3, 𝑎1 = 1.
(ii) Solve:
T(k) − 7T(k − 1) + 10T(k − 2) = 6 + 8k, T(0) = 1, T(1) = 2. 5 3 3

***
5.a Find the disjunctive normal form of the Boolean expression 10 5 4
(𝑥 ∨ (𝑦 ′ ∧ 𝑧)) ∧ 𝑧 ′ and then find its conjunctive normal form
from it.

OR
5.b Use Karnaugh maps to find the minimal form for 10 5 4
𝑥𝑦𝑧 + 𝑥𝑦𝑧 ′ + 𝑥𝑦 ′ 𝑧 + 𝑥 ′ 𝑦𝑧 + 𝑥 ′ 𝑦 ′ 𝑧.
***
6.a Use Kruskal’s algorithm to find the minimum spanning tree of the 10 6 5
following graph

OR
6.b Which of the following graphs are both Eulerian and Hamiltonian. 10 6 5
If any meet both criteria, explain the reasons.

***
Code No: A51N1 R 20A
BVRAJU INSTITUTE OF TECHNOLOGY, NARSAPUR
(UGC - AUTONOMOUS)
I B.Tech I Semester Supplementary Examinations, Jan 2024
DISCRETE MATHEMATICS
(Computer Science and Business Systems)
Time: 3 Hours Max Marks: 70
Note: This Question Paper contains two Parts A and B
 Part A is compulsory which carries 10 marks. Five questions from six units. Answer all questions
in Part A at one place only.
 Part-B consists of 5 Questions (numbered from 2 to 11) carrying 12 marks each. Each of these
questions is from one unit and may contain a, b, c as sub-questions. For each question there will
be an either/or choice (that means there will be two questions from each unit and the student
should answer only one question).
PART – A (5x2 = 10 Marks)
1. Marks Bloom Level CO
a Define Equivalence relation. 2 1 1
b Explain about conditional and Bi-conditional statements include truth 2 2 2
tables.
c What is the coefficient of in the expansion of . 2 1 3
d Translate the propositional logic into Boolean algebra 2 2 4
and convert the Boolean algebra into propositional
logic.
e Define the Chromatic number and state the Four color Theorem. 2 1 5
PART – B (5x12 = 60 Marks)
Marks Bloom Level CO
2 Explain about sets, finite sets, power sets and set operations with 12 2 1
examples. What is the power set of the set ?
OR
3 (a) Show that G = {1,-1} is a group under Multiplication. 6 2 1
(b) Show that is a ring, where is a set of integers. 6 2
***
4 (a) Which of these sentences are propositions? What are the truth 6 1 2
values of those that are propositions?
(i) Boston is the capital of Massachusetts
(ii) Miami is the capital of Florida
(iii) What time is it?
(iv) 5+7=10 (v) The moon is made of green cheese 6 4 2
(b) Determine whether is a Tautology.
OR
5 (a) Show that are Logically equivalent 6 2 2
(b) Let be the statement “ has visited North Dakota”, where the 6 2 2
domain consists of the students in your college. Translate each of these
quantifications in English:

***
6 (a) What are the basic counting principles, Explain with examples? 6 1 3
(b)What is the solution of the given recurrence relation 6 1 3
with initial conditions .
OR
7 (a) During a month with 30 days, a baseball team plays at least one game a 6 2 3
day, but no more than 45 games. Show that these must be a period of some
numbers of consecutive days during which the team must play exactly
14games. (Apply pigeonhole principle)
(b) Utilize Mathematical Induction to prove the inequality for all 6 3 3
positive integers .
***
8 Utilize the table to find the values of Boolean functions represented by 3 4
are (a) 4
(b) 4
(c) . 4
OR
9 Construct the Karnaugh’s map (k-maps) of these sum of products 3 4
expansions in three variables
6
6
***
10 (a) Verify the graphs are isomorphic or not? 6 2 5

6 2 5

(b) Explain about trees and spanning trees with examples.

OR
11 (a) Identify which of the graphs have Hamilton circuit 6 3 5

6 2
5

(b) Explain about a planar graphs with examples.

***