IET, DAVV, Indore

B.E. II (IT-A & B)

Class Test I (Sep-2021)
AIR3C1: Discrete Mathematics

Time: 70 min Max Marks: 20

Note: Attempt any FOUR questions. All questions carry equal marks.

Q.1. (i) Show that (p ∨ q) ∧ (~ p ∨ r) → (q ∨ r) is a tautology. (03)

(ii) Let M(x, y) be “x has sent y an e-mail message” and T (x, y) be “x has telephoned y,”
(02)
where the domain consists of all students in your class. Use quantifiers to express each of
these statements:
1) Chou has never sent an e-mail message to Koko.
2) No one in your class has telephoned Nina.
3) There is someone in your class who has either sent an e-mail message or telephoned
everyone else in your class.
4) Every student in the class has either received an email message or received a
telephone call from another student in the class.
Q.2. (i) State the converse, contrapositive and inverse of the following implication: (03)
“That you get the job implies that you had the best credentials”.
(ii) Express the negation of these propositions using quantifiers, and then express the (02)
negation in English:
“There is someone in this class who does not have a good attitude”
Q.3. Determine the number of integers between 1 and 451 that are divisible by any of the integers (05)
5, 9, 21 and 36.
Q.4. For the following hashing function, show how the following data would be inserted in the (05)
order given in initially empty cells. Use the usual collision resolution policy to resolve
collision, if occurs: h(x) = (x3 + x2 – x) (mod 15), cells indexed from 0 to 10; the data is:
04, 29, 18, 48, 10, 15, 32, 03, 22, 08.
Q.5. (n + 1)(2n + 1)(2n + 3) (05)
Prove that 12 + 32 + 52 + ··· + (2n + 1)2 = whenever n is a nonnegative
3
integer.
*****
 IET, DAVV, Indore
B.E. II (IT-A & B)
Class Test II (Oct.-2021)
AIR3C1: Discrete Mathematics

Time: 70 min Max Marks: 20

Note: Attempt any FOUR questions. All questions carry equal marks.

Q.1. Solve the recurrence relation an – 6an-1 + 8an-2 = n.4n. (05)

Q.2. Use generating functions to solve the recurrence relation an – 4an-1 + 4an-2 = 1, where a0 = 1, (05)
a1 = 1, for n ≥ 2.

Q.3. Use Prim’s algorithm to find a minimum spanning tree for the given weighted graph: (05)

Q.4. Use Huffman coding algorithm to encode these symbols with given frequencies: (05)
A: 0.15, B: 0.20, C: 0.05, D: 0.10, E: 0.25, F: 0.08, G: 0.07, H: 0.04, I: 0.06
What is the average number of bits required to encode a symbol?

Q.5. Find a least expensive route in terms of total tolls using the roads in the graph between the (05)
pair of the cities Newark (a) and CapeMay (z) using Dijkstra’s algorithm:

*****
 IET, DAVV, Indore
B.E. II (IT-A & B)
Class Test III (Nov.-2021)
AIR3C1: Discrete Mathematics

Time: 70 min Max Marks: 20

Note: Attempt ALL questions. All questions carry equal marks.

Q.1. Draw the Hasse diagram for the “divisibility” relation on the set {1, 2, 3, 4, 8, 9, 16, 32, 64}. (05)

Q.2. Use Warshall’s Algorithm to find the Transitive Closure of the relation R = {(1, 2), (1, 3), (05)
(1, 4), (2, 3), (2, 4), (3, 4)} on the set A = {1, 2, 3, 4}.
Q.3. Check whether the set of numbers I( 2 ) = {a + b 2 : a and b are integers} is a field or not? (05)
Q.4. Express the following function in Disjunctive and Conjunctive normal forms and also find (05)
their respective complement functions.

f (x, y, z) = ( yz + xz' ) ( xy' + z)'

*****
 2021009
B.E. II EXAMINATION NOV-DEC’ 2021
Information Technology
AIR3C1: Discrete Mathematics

Duration: 3 Hrs] [Max. Marks: 60

Note: Attempt any TWO parts from each question. Each carries equal marks.

Q1. (a) Among 100 students, 32 study Mathematics, 20 study Physics, 45 study Biology, 15 (06)
study Mathematics and Biology, 7 study Mathematics and Physics, 10 study Physics
and Biology and 30 do not study any of the three subjects. Then
(i) Find the number of students studying all the three subjects.
(ii) Find the number of students studying exactly one of the three subjects.

(b) Using the hashing function h, which takes the first three digits of a seven digit number (06)
as one number and the last four digits as another number, adds them and then apply
mod 57 function, determine the hash addresses of the following numbers:
2159213, 1903021, 7249201, 6138425, 3268954, 4005289

(c) Use Warshall’s algorithm to find the transitive closure of the relation R = {(1, 1), (06)
(1, 3), (2, 1), (2, 3), (2, 4), (3, 2), (3, 4), (4, 1)} on the set A = {1, 2, 3, 4}.

Q2. (a) Check whether the compound propositions is a tautology or not: (06)
[(p  q)  (q  r)]  (p  r)

(b) (i) State the converse, inverse and contrapositive of the following implication: (04)
“Getting elected follows from knowing the right people.”
(ii) Prove that Disjunctive syllogism is a valid argument. (02)

(c) (i) Let P(x), Q(x), R(x), and S(x) be the statements “x is a baby,” “x is logical,” “x is (04)
able to manage a crocodile,” and “x is despised,” respectively. Express each of these
statements using quantifiers, logical connectives and P(x), Q(x), R(x), and S(x), when
the domain is all people:
(1) Babies are illogical. (2) Nobody is despised who can manage a crocodile.
(3) Illogical persons are despised. (4) Babies cannot manage crocodiles.

(ii) Determine the truth value of each of these statements if the domain for the variables (02)
consists of all integers:
(1)  n  m(n 2  m) , (2)  n  m(nm  m) ,
(3)  n  m(n  m  5) , (4)  n  m(n  m  4  n  m  2) .
2 2

Q3. (a) Use mathematical induction to prove that np – n is divisible by p, whenever p is a (06)
positive integer.
(b) Use generating function to solve the recurrence relation an – 6an-1 + 5an-2 = 0, n ≥ 2, (06)
with a0 = 1, a1 = 2.
(c) Find the solution to the recurrence relation an = 2an-1 + an-2 – 2an-3, for n ≥ 3, with the (06)
initial conditions a0 = 3, a1 = 6 and a2 = 0.

PTO
Q4. (a) Find the length of the shortest path between p and u in the given weighted graph using (06)
Dijkstra’s algorithm:

(b) Use Prim’s algorithm to find a minimum spanning tree in the following weighted (06)
graph:

(c) (i) Use Huffman coding algorithm to find an optimal code for these symbols and (03)
frequencies: A: 0.3, B: 0.2, C: 0.4, D: 0.1. What is the average number of bits required
to encode a character?
(ii) Evaluate the following postfix expression:
(03)
x y * y ↑ (x + y) x – y3 y2 / * –
where x = 3 and y = 2.

Q5. (a) Show that the set of six matrices: (06)

 1 0  0  2 0  0 1   0 2   0  
 
M =   , 2 
, ,  , , 2   , where  is a
 0 1   0    0  1 0  0   0  
 
complex cube root of unity, forms a group with respect to the multiplication of
matrices.
(b) Determine whether the set S = {0, 2, 4, 6, 8} is a Field under the operation addition (06)
and multiplication modulo 10?

(c) (i) Reduce the following into conjunctive normal form and find its complement: (03)
f(x, y, z) = [ x  (x  y ) ].[x  ( y . z) ].
(ii) Simplify and then draw a logic circuit and switching circuit of the Boolean (03)
function:
f (p, q, r)  p . r  q . (q  r) . (p  q . r)

*****