Registration No.
:__________________
PNR No:: DEM507462
COURSE CODE : DEMTH403
COURSE NAME : MATHEMATICAL FOUNDATION FOR COMPUTER
SCIENCE
Time Allowed: 03:00 hrs Max.Marks: 80
1. This question paper is divided into two parts A and B.
2. Answer all the questions in serial order.
3. Part A contains 10 questions of 2 marks each. All questions are compulsory.
4. Part B contains 10 questions (Questions 2 to 11) of 10 marks each, attempt any 06 questions out of
10. Attempt all parts of the selected question. Only first 06 attempted questions would be evaluated.
5. The student is required to attempt the question paper in English medium only.
6. Simple non programmable calculator is allowed.
PART A
Q1(a) Let Q(x, y, z) denote the statement "x - z = y - 3". What are the truth values of the
propositions Q(1, 4, 0) and Q(0, 3, 0)?
(b) Let Q(x) be the statement 𝑥 > 4.• What is the truth value of the quantification ∀(𝑥𝑄(𝑥)),
where the domain consists of all real numbers greater than 4.
(c) Consider the following relations on {1, 2, 3, 4}:
R1 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 4), (4, 1), (4, 4)}.
R2 = {(1, 1), (1, 2), (2, 1)}.
Classify the given relations as Reflexive and Transitive.
(d) Show that (1.1) + (0.1 ̅̅̅̅ + 0) = 1.
(e) How many bit strings of length 10 contain
(a) exactly four 1s? (b) at least four 1s?
(f) Define Pigeonhole Principle by giving an example.
(g) How many edges are there in 𝐾10 and 𝐶17 ?
(h) What is the minimum cycle length in complete bipartite graph K_(3,3)?
(i) Define "Euler Circuit" and "Hamilton Circuit" by giving an example.
(j) What is the chromatic number of wheel graph W_n and n-dimensional hypercube graph
Q_n?
PART B
Q2 Show that (p → q) ∧ (q → r) → (p → r) is a tautology.
Q3 How many permutations of the letters ABCDEFG contain
a) the string BCD?
b) the string CFGA?
c) the strings BA and GF?
Q4 Find the duals of the Boolean expressions: (𝑖) 𝑥𝑦𝑧 + 𝑥̅ 𝑦̅ 𝑧̅ (𝑖𝑖) 𝑥̅ 𝑦̅
Q5 Define Vacuous Proof, Trivial Proof and Proof by contradiction by giving example for
each.
Q6 Determine whether the graphs displayed in Figure are isomorphic are not.
Page 1 of 2
Q7 Find the least distance from vertex ‘a’ to vertex ‘z’ using Dijkstra’s algorithm.
Q8 Write the cut vertices and cut edges (if any) for 𝐾𝑛 , 𝐶𝑛 , 𝑊𝑛 , 𝑄𝑛 .
Write at least three cut set having three edges only for the given graph.
Q9 Define POSET. Give three different examples of POSET.
Q10 Find the value of the prefix expression 3 2 2 3 / 6 4 2 and postfix
expression 3 2 * 2 5 3 8 4 / * . (Every integer is positive and single digit).
Q11 Seven women and nine men are on the faculty in the mathematics department at a
school.
a) How many ways are there to select a committee of five members of the department if at least
one woman must be on the committee?
b) How many ways are there to select a committee of five members of the department if at least
one woman and at least one man must be on the committee?
-- End of Question Paper --
Page 2 of 2
