DR.

BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

RegularExam_Summer_2023
]Course: B. Tech. Branch : Information Technology Semester :IV
Subject Code & Name: BTITC403 Discrete Mathematics
Max Marks: 60 Date:18/07/2023 Duration: 3 Hr.
Instructions to the Students:
1. All the questions are compulsory.
2. The level of question/expected answer as per OBE or the Course Outcome (CO) on
which the question is based is mentioned in ( ) in front of the question.
3. Use of non-programmable scientific calculators is allowed.
4. Assume suitable data wherever necessary and mention it clearly.
(Level/Co) Marks
Q. 1 Solve Any Two of the following. 12
A) State and Prove De Morgans Law (A∩B)’= A’ U B’ Level 02 6
B) If A={4,5,7,8,10},B={4,5,9} and C={1,4,6,9} then verify that Level 03 6
A∩ (B U C)=(A∩B) U (A∩C)
C) Among 50 students in a class ,26 got an A in the first examination and 21 Level 02 6
got an A in the second examination. If 17 students did not get an A in either
examination , how many students got A in both the examination

Q.2 Solve Any Two of the following. 12

A) Prove that 1+2+3+………….+n= n(n+1)/2 by mathematical induction Level 01 6
B) Give the recursive definition of an where a is non zero real number and n is Level 03 6
non-negative integer
C) Find the maximum profit for the following by using Job Scheduling Level 02 6
Problem
Job J1 J2 J3 J4 J5
Deadline 2 1 3 2 1
Profit 60 100 20 40 20

Q. 3 Solve Any Two of the following. 12

A) Find the number of combinations of the four objects a,b,c,d taken three at a Level 02 6
time. Show pictorially Each combination consisting of three objects
determine 3!=6 permutations of the combination.
B) Simplify n!/(n-1)! Level 01 6
C) Show that if any 20 people are selected ,then we may choose a subset of Level 03 6
3 so that all 3 were born on the same day of the week.

Q.4 Solve Any Two of the following. 12

A) Verify relation if A={1,2,3} R=(1,3),(1,1),(2,2),(3,3)} Level 03 6

B) Draw Hasse diagram for partial ordering{(A,B)|A⊆} on powerset p(s)where Level 02 6

s={a,b,c}
 C) prove that the fourth root of unity 1,-1,i,-i form an abelian multiplicative Level 02 6
group

Q. 5 Solve Any Two of the following. 12

A) Define Graph,kurtowaski graph,Hamiltonian graph Level 01 6
B) State and prove Handshaking theorem Level 02 6
C) Find the cut edges of following graph Level 02 6

*** End ***

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
Winter Supplementary End Semester Examination – 2023
Course: B. Tech. Branch : Information Technology Semester : IV
Subject Code & Name: BTITC403 Discrete Mathematics
Max Marks: 60 Date:20/01/2024 Duration: 3 Hrs.
Instructions to the Students:
1. All the questions are compulsory.
2. The level of question/expected answer as per OBE or the Course Outcome (CO) on
which the question is based is mentioned in ( ) in front of the question.
3. Use of non-programmable scientific calculators is allowed.
4. Assume suitable data wherever necessary and mention it clearly.
(Level/CO) Marks
Q. 1 Solve Any Two of the following. 12
A) Let U = {1, 2, 3, ........., 10}, A = {2, 4, 6, 8, 10}, B = {1, 3, 5, 7, 9, 10} CO1 6
Find:
i) (A U B)' ii) (A ∩ B)' iii) (B)' iv) (B–A)
B) A college records gives following information : 119 students enrolled in CO1 6
Introductory computer science, 96 of them took data structures, 53 took
foundations, 39 took assembly language, 31 took both foundation and
Assembly language, 32 took both data structures and Assembly language, 38
took data structures and foundations and 22 took all of three courses is this
information correct? Why?
C) Explain following terms with example. CO1 6
i) Symmetric difference between set
ii) Union of set
iii) Intersection of Set
iv) Subset of a set

Q.2 Solve Any Two of the following. 12

A) Let f(x)=2x+3, g(x)=3x+4, h(x)=4x find gof, fog, foh, goh CO1 6
B) Let A={1,2,3,4} and R={(1, 2), (2, 4), (1, 3), (3, 2)}, Find transitive closure CO1 6
of relation R.
C) A = {1, 2, 3, 4, 5, 6} = B R = {(i, j) ||i – j| = 2}. CO1 6
Find whether R is equivalence relation or not.

Q. 3 Solve Any Two of the following. 12

A) Use Mathematical induction to prove that CO1 6
13+23+33+⋯+n3 = ( [n(n+1)]/2)2
B) Construct truth table of the compound proposition (p v ‫ﬧ‬q) → (p ˄ q) CO1 6
 C) Define with example. CO3 6
i) Level and height of a tree.
ii) Binary search tree.
iii) Spanning tree

Q.4 Solve Any Two of the following. 12

A) A box contains 6 white and 5 black balls. Find number of ways 4 balls can CO2 6
be drawn from the box if
i) Two must be white
ii) All of them must have same color
B) In how many ways can one distribute 10 apples among 4 children? CO2 6
C) A connected planar graph has nine vertices with degree 2,2,2,3,3,3,4,4,5 CO3 6
Find
i) number of edges
ii) number of faces
iii) construct two such graphs

Q. 5 Solve Any Two of the following. 12

A) Define following terms with example. CO3 6
i. Complete graph
ii. Regular graph
iii. Bipartite graph
iv. Complete bipartite graph
v. Paths and circuits
B) Determine which if the graph below represents Eulerian circuit, Eulerian CO3 6
path, Hamiltonian circuit and Hamiltonian Path. Justify your answer.

C) Explain the following terms with examples CO4 6

i) Ring with unity
ii) Integral domain
iii) Field
*** End of Question Paper ***
 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
Regular & Supplementary Summer 2024
Course: B. Tech. Branch : Information Technology Semester : IV
Subject Code & Name: BTITC403 Discrete Mathematics
Max Marks: 60 Date: 18/06/2024 Duration: 3 Hr.
Instructions to the Students:
1. All the questions are compulsory.
2. The level of question/expected answer as per OBE or the Course Outcome (CO) on
which the question is based is mentioned in ( ) in front of the question.
3. Use of non-programmable scientific calculators is allowed.
4. Assume suitable data wherever necessary and mention it clearly.
(CO) Marks
Q. 1 Solve Any Two of the following. 12
A) State Principal of Inclusion-exclusion and solve the following CO1 6

Let A, B, and C be three sets. Given the following cardinalities:

• ∣A∣=20
• ∣B∣=30
• ∣C∣=25
• ∣A∩B∣=10
• ∣A∩C∣=5
• ∣B∩C∣=8
• ∣A∩B∩C∣=3

Find the cardinality of A∪B∪C.

B) Use De Morgan's laws to simplify the expression ¬(p∧¬q) CO1 6
C) Show that the propositions p→q and ¬p∨q are logically equivalent. CO1 6

Q.2 Solve Any Two of the following. 12

A) Prove that 1+2+3+…+n=n(n+1)/2 for all positive integers n by using CO1 6
Mathematical Induction.
B) Solve the job scheduling problem for the following jobs with start time si, end time ei CO2 6
, and profit pi :

Job Start Time End Time Profit

1 1 3 5
2 2 5 6
3 4 6 5
4 6 7 4
5 5 8 11
6 7 9 2
C) i. Prove that the function f: R→R defined by f(x)=3x+2 is injective. CO1 6
ii. Prove that the function g: R→R defined by g(x) = x3 is surjective.
Page1/2
Q. 3 Solve Any Two of the following. 12
A) Prove that in any group of 13 people, at least two people will have the same birth CO2 6
month.
B) Solve the recurrence relation an=5an−1−6an−2 with initial conditions a0=1 and a1=4. CO2 6
C) How many ways can you arrange 5 books on a shelf if 3 specific books must be CO2 6
together?

Q.4 Solve Any Two of the following. 12

A) Explain how ring theory is applied in error-detecting and error-correcting codes, such CO4 6
as in the context of cyclic redundancy checks (CRC). Include an example of how
CRC is used to detect errors in data transmission.
B) Consider a set A={1,2,3}. Define a binary relation R on A by CO1 6
R={(1,1),(1,2),(2,3),(3,1)}. Determine if R is reflexive, symmetric, transitive, and
compute the transitive closure of R using Warshall's algorithm. Additionally, explain
what it means for a relation to be an equivalence relation and whether R qualifies as
one.
C) Define a group and provide an example. Explain the concept of a subgroup and verify CO4 6
if H= {0,4,8}is a subgroup of (Z12,+12).

Q. 5 Solve Any Two of the following. 12

A) Find the shortest path from vertex A to vertex D in the following weighted graph us- CO3 6
ing Dijkstra's algorithm:

A B C D
A 0 1 4 ∞
B 1 0 2 6
C 4 2 0 3
D ∞ 6 3 0
B) Using Kruskal's algorithm, find the minimal spanning tree of the following graph: CO3 6

A B C D E
A 0 1 3 ∞ ∞
B 1 0 3 6 ∞
C 3 3 0 4 2
D ∞ 6 4 0 5
E ∞ ∞ 2 5 0

C) Determine if the following graph has an Eulerian path, Eulerian circuit, Hamiltonian CO3 6
path, or Hamiltonian circuit. Provide a brief explanation for each.

Graph G:

• Vertices: V={A,B,C,D,E}
• Edges: E={(A,B),(A,C),(B,C),(B,D),(C,D),(C,E),(D,E)}
Page2/2
*** End ***
 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
Supplementary Winter Examination – 2024
Course: B. Tech. Branch : Information Technology Semester : IV
Subject Code & Name: BTITC403* & Discrete Mathematics
Max Marks: 60 Date: 24/12/2024 Duration: 3 Hr.
Instructions to the Students:
1. Each question carries 12 marks.
21293673

21293673

21293673
2. Question No. 1 will be compulsory and include objective-type questions.
3. Candidates are required to attempt any four questions from Question No. 2 to Question No. 6.
4. The level of question/expected answer as per OBE or the Course Outcome (CO) on which the
question is based is mentioned in ( ) in front of the question.
5. Use of non-programmable scientific calculators is allowed.
6. Assume suitable data wherever necessary and mention it clearly.
(CO) Marks
Q. 1 Objective type questions. (Compulsory Question) 12
1 Which of the following is a tautology? CO1 1
a. P∨Q b. P∨¬P c. P∧Q d. P∧¬P
2 Let A = {1,2,3} and B= {4,5}. How many relations can be defined from A to B? CO1 1
a. 6 b. 8 c. 32 d. 64
3 A simple undirected graph has 7 vertices and 10 edges. The sum of the degrees CO3 1
21293673

21293673

21293673
of all vertices is:
a.7 b. 10 c. 14 d. 20
4 If f: A→B is one-to-one, then which of the following is true? CO1 1
a. ∣A∣≤∣B∣ b. ∣A∣>∣B∣ c. ∣A∣=∣B∣ d. ∣A∣≥∣B∣
5 A die is rolled. What is the probability of getting a number greater than 4? CO2 1
a. 1/2 b. 1/3 c. 2/3 d. 1/6
6 How many 3-digit numbers can be formed using the digits 1,2,3,4 if repetition is CO2 1
not allowed?
a. 24 b. 64 c. 120 d. 720
7 The recurrence relation T(n)=2T(n/2)+n has a solution of: CO2 1
21293673

21293673

21293673

a. O(log n) b. O(n) c. O(n log n) d. O(n2)

8 The dual of the Boolean expression A+0=A is: CO2 1
a. A⋅1=A b. A⋅0=0 c. A+1=1 d. A+A=A
9 Which of the following is a group under addition? CO4 1
a. Natural b. Integers c. Positive d. Non-zero Real Numbers
Numbers Rational
Numbers
10 The minimum number of colours required to colour a complete graph K4 is: CO3 1
a. 2 b. 3 c. 4 d. 5

Page 1
 11 How many ways are there to distribute 5 indistinguishable balls into 3 CO2 1
distinguishable boxes, such that no box is empty?
a. 5 b. 6 c. 7 d. 10
12 Which of the following pairs of graphs are isomorphic? 1
a. Two cycles b. A cycle with c. Two d. A cycle with 5 vertices
with 4 vertices 4 vertices and complete and a complete graph K5
each a complete graphs K3
21293673

21293673

21293673
graph K4

Q. 2 Solve the following. 12

A) Let A, B and C be sets such that: CO1 6
• ∣A∣=50, ∣B∣=30, ∣C∣=20
• ∣A∩B∣=10, ∣A∩C∣=5, ∣B∩C∣=8
• ∣A∩B∩C∣=3
Using the Principle of Inclusion-Exclusion, calculate:
1. ∣A∪B∪C∣
2. The number of elements belonging only to set A.
B) Translate the following English statement into a propositional logic expression. CO1 6
21293673

21293673

21293673
Then, prove its validity using a truth table or rules of inference.
Statement:
"If a student studies hard, then they pass the exam. If they pass the exam, then
they get a certificate. Therefore, if a student studies hard, they get a certificate."

Q.3 Solve the following. 12

A) Prove by mathematical induction that for all n≥1: CO2 6
13+23+33+⋯+n3=[n(n+1)/2]2
B) A recursive function f(n) is defined as follows: CO2 6
f(n) = {1 if n=0,
21293673

21293673

21293673

2⋅f(n−1) + 1 if n>0.
1. Write the first four values of f(n) (for n=0,1,2,).
2. Derive a closed-form expression for f(n) and verify using induction.

Q. 4 Solve Any Two of the following. 12

A) Prove that in any group of 13 people, at least 2 of them were born in the same CO3 6
month.
B) Solve the recurrence relation an=3an−1−2an−2 with initial conditions a0=2, a1=5. CO3 6

Page 2
 C) How many distinct 6-letter words can be formed using the letters of the word CO3 6
BANANA?

Q.5 Solve Any Two of the following. 12

A) Consider the directed graph represented by the adjacency matrix below: CO1 6
0 1 0
A = 0 0 1
21293673

21293673

21293673
1 0 0
1. Find the transitive closure of the relation using Warshall’s Algorithm.
2. Write the final adjacency matrix representing the transitive closure.
B) Prove that the set of integers Z under addition forms a group, but the set of CO4 6
positive integers Z+ under addition does not.
C) Using Fermat’s Little Theorem, compute 7100mod 13. CO4 6

Q. 6 Solve Any Two of the following. 12

A) Consider the weighted graph below: CO3 6
Vertices: A, B, C, D
Edges: (A, B, 4), (A, C, 2), (B, C, 1), (B, D, 5), (C, D, 8)
21293673

21293673

21293673
1. Find the shortest path from vertex A to vertex D using Dijkstra’s Algorithm.
2.Write the sequence of vertices in the shortest path and its total weight.
B) Prove whether the following graph is planar or not: CO3 6
K5, the complete graph on 5 vertices.
C) Find the Minimal Spanning Tree (MST) for the following graph using Prim’s CO3 6
Algorithm:
Vertices: A, B, C, D, E
Edges with weights: (A, B, 1), (A, C, 5), (B, C, 2), (B, D, 4), (C, D, 6), (D, E, 3)
*** End ***
21293673

21293673

21293673

Page 3