NR

Code No: A0505

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
M.Tech. I Semester Regular Examinations March, 2009
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
(Computer Science)
Time: 3hours. Max. Marks: 60
Answer any FIVE questions
All questions carry equal marks
---
1.a) Construct DFA for accepting the language (a b) * abb.
b) Write short notes on Moore and melay machines.

2.a) Write Regular expressions for the following patterns. Use auxiliary
definitions where convenient.
The set of chess moves, such as P-K4 or kbp × qn.
b) Construct MDFA and MFA for the above one.

3.a) In how many ways can 6 men and 6 women be seated in a row
i) If any person may sit next to any other?
ii) If men and women must occupy alternate heats?
b) Find the coefficient of X9 Y3 in the expansion of (2x-3y)12 .

4.a) Show that f(x)=(1-x)-1 − x 2 generates the sequence 1,1,0,1,1,1……..

b) How many integers between 1 and 300 (inclusive) are divisible by
none of 5,6,8,9.

5. If a0 = 0, a1 = 1, a2 = 4 and a3 = 37 . Satisfy the recurrence relation.

determine the constants b and c and then solve the relation for an .

6.a) Prove that, in a graph, there is u-v trail if and only if there is a u-v
path.
b) Explain DFS algorithm with an example.

7.a) Prove that two graphs show below are Isomorphic.

b) Prove that complete bi partite graph K2,3 contains an Euler trail.

8. Write short notes on:

a) Church’s by notes his b) Tuning reducibility
c) HP hard problems.
****