Scribd
Upload
7 views

Elective Discrete mathematics

This document outlines a model examination for an elective course in Discrete Mathematics at Government Arts and Science College, Pappireddipatti. It includes multiple-choice questions, short answer questions, and longer problem-solving questions, covering topics such as logical equivalence, big-O notation, Boolean algebra, and Turing machines. The exam is structured into three parts with a total of 75 marks over a duration of three hours.

Uploaded by

GOVINDHARAJ S
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views

Elective Discrete mathematics

This document outlines a model examination for an elective course in Discrete Mathematics at Government Arts and Science College, Pappireddipatti. It includes multiple-choice questions, short answer questions, and longer problem-solving questions, covering topics such as logical equivalence, big-O notation, Boolean algebra, and Turing machines. The exam is structured into three parts with a total of 75 marks over a duration of three hours.

Uploaded by

GOVINDHARAJ S
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

GOVERNMENT ARTS AND SCIENCE COLLEGE – PAPPIREDDIPATTI

DEPARTMENT OF MATHEMATICS
MODEL EXAMINATION
ELECTIVE – DISCRETE MATHEMACTICS [21PMAE01]

Time: Three hours Maximum: 75 marks


I– M.Sc., MATHEMATICS

PART A – (15 X 1 = 15 Marks)


Answer the all questions:
1. The compound propositions p and q are called logically equivalent if p↔q is
a___________.
(a)conjunction (b)contrapositiv (c)tautology (d)inverse
e
2. The person who introduced big – O notation is ______________.
(a)Paul Gustav (b)John Wilder Tokey
(c)Augustus Demorgan (d)Karnaugh
3. The big – O symbol is sometimes called as a ____________symbol.
(a)Latin (b)Liouvilli (c) Leibritz (d) Landau
4. There are _________ different bit strings of length seven
(a)29 (b) 25 (c) 27 (d) 28
5. If n and r are integers such that 0 ≤ r ≤n then p (n, r) =________________.

(a) (b) (c) (d)


(n−1)! n! n! n!

6. The number of r-permutations of a set of n objects with repetition allowed is


(n−r +1)! (n−r )! (n−r−2)! r!

____________.
(a)nr-1 (b) nr+1 (c) nr (d) rn
7. The generation function for the sequence a0, a1, a2, ……ak … of real number is
the infinite G(x)=

(a) ∑ ak x (b)∑ ak−1 x


∞ ∞
k k

k =1

(c) ∑ ak−1 x (d)∑ ak+ 1 x


k=0
∞ ∞
k−1 k

8. Let x be a real number with |x|<1 and let u be a real number. Then (1+x)u =
k =1 k =1

∑ (uk )xk is called


∞

k=0

(a) Binomial theorem (b) Poisson theorem


(c) Principle of Inclusion-Exclusion (d) the extended Binomial
theorem
9. The value of ak in the series =∑ x k is
∞
1
1−x k=0

(a) 0 (b) ∞ (c) 1 (d) −∞


10. The graph used to reduce the number of terms in a Boolean expression
representing a circuit is called
(a)Karnaugh (b)directed graph
(c) tree (d) undirected graph
11. _____________method is used for minimizing Boolean expressions
(a) Quine-Mccluskey (b) Eugene charbes
(c) Hell man method (d) Quine method
12. The value of the function for the combinations that never occur can be
arbitrarily assigned are called____________
(a) Richard conditions (b) Hellmen conditions
(c)Don’t care conditions (d) Particular conditions
13. In M=(S, I, o, f, g, So), f is called
(a) on to function (b) one to one function
(c)recurrence function (d) transition function

14. Machines of the type in which outputs corresponds to transitions


between states are called__________.
(a) Moore machine (b) Deterministic machine
(c) Modelling machine (d) Finite-state machine
15. Two finite-state automata are called _____________ if they recognize the
same language.
(a) Equal (b) Equivalent (c)Different (d)Identical

PART B – (2 X 5 = 10 MARKS)
Answer any Two questions:
16. Show that and p ⋀ ¬ q are logically equivalent.
17. How many cards must be selected from a standard deck of 52 cards to
¬( p →q )

guarantee that at least three cards of the same suit are chosen?
18. Find the solution to the recurrence relation an = -3an-1 -3an-2 -an-3 with
initial conditions a0 = 1, a1 = -2 and a2 = -1.
19. Prove that absorption law x (x + y) = x using the identities of Boolean
Algebra.
20. Construct a Turing machine for adding two non-negative integers.
PART C – (5 x 10 = 50 marks)
Answer All the questions:
21. (a) Let p be the statement “Maria learns discrete mathematics” and q be
the statement “Maria will find a good job” Express the statement p → q as a
statement in English.
OR
(b) Give big-O estimates for the factorial function and the logarithm of the
factorial function where factorial function f(n)=n! is defined by n! = 1.2.3…..n
whenever n is a positive integer and 0!=1. Note that the function n! grows
rapidly.

22. (a) How many different IPV4 addresses are available for computer on
the Internet?
OR
(b) How many bit strings of length eight either start with a 1 bit or end with
the two bits 00?
23. (a) Find an explicit formula for Fibonacci numbers.
OR
(b) (i) Find all solution of the recurrence relation an = 3an-1 + 2n.
(ii) What is the solution with a1 = 3

24. (a) Use the Quine-Mccluskey method to solve the sum-of-products

OR
ωxy z +ω x yz +ω x y z +ω xyz +ω x y z +ωx yz + ωxy z .

(b) Translate the distributive law x+yz=(x+y) (x+z) in to a logical equivalence.

25. (a) An important element in many electronic devices is a unit-delay


machine, which produces as output the input string delayed by a specified
amount of time. How can a finite state machine be constructed that delays an
input string by one unit of time, that is produces as output the bit string 0x1 x2
x3……xk-1 given the input string x1 x2 x3…..xk?
OR
(b) Find a Turing machine that recognizes the set {0n 1n | n ≥ 1}

You might also like