30.10.2014 Views

BABSc, B.Com & BCA Questions _III - Nalanda Open University

BABSc, B.Com & BCA Questions _III - Nalanda Open University

BABSc, B.Com & BCA Questions _III - Nalanda Open University

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

<strong>Nalanda</strong> <strong>Open</strong> <strong>University</strong><br />

Annual Exam-2010,<br />

Bachelor in <strong>Com</strong>puter Application, Part-<strong>III</strong><br />

Paper-XX (CS-73)<br />

Time: 3Hrs Full Marks: 75<br />

Answer any five questions. All questions are of equal marks.<br />

1) Define Finite Automata. Explain DFA and NFA with suitable examples?<br />

2) Explain Mealy and Moore machine? Give suitable examples.<br />

3) Draw the Finite Automata for the following :<br />

a) (a+b)*<br />

b) 0(0+11)*1<br />

c) a*+b*+(ab)*<br />

d) (ab+ac+bc)+<br />

4) Explain pumping Lemma? Show that the following are not regular.<br />

a) L={a n b n | n>=0}<br />

b) L={a p | p is prime}<br />

5) Define Grammar? Explain Chomsky hierarchy of grammar?<br />

6) Define PDA? Draw a PDA for the following :<br />

a) An even palindrome in {a,b}.<br />

b) An odd palindrome in {a,b}.<br />

7) Define Turing Machine ?. Design a turing machine for F(m,n)={ m+n}<br />

Where (i) m=0 , n=0<br />

(ii) m >0, n=0<br />

(iii) m=0, n>0<br />

(iv) m>0, n>0<br />

8) Prove that Regular grammar is closed under :<br />

d) UNION<br />

e) CONCATENATION<br />

f) KLEENE STAR.<br />

9) Write the grammar for the following :<br />

a) L= {a m b n | m,n >=0}<br />

10) Write short notes on :<br />

(a) NP-hard problem<br />

(b) Types of <strong>Com</strong>plexity<br />

(c) Primitive Recursive

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!