Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

No Downloads

Total views

1,284

On SlideShare

0

From Embeds

0

Number of Embeds

11

Shares

0

Downloads

5

Comments

0

Likes

1

No embeds

No notes for slide

- 1. No. of Printed Pages : 3 CS-73 BACHELOR IN COMPUTER(NI APPLICATIONS Term-End ExaminationO June, 2011 CS-73 : THEORY OF COMPUTER SCIENCE Time : 3 hours Maximum Marks : 75 Note : Question no. 1 is compulsory. Attempt any three from the rest. 1. (a) What do you understand by the following ? Explain each with an appropriate example : 2+2+2+2=8 (i) Regular expression (ii) Context Free Grammar NFA (iv) Pumping Lemma (b) Build a Finite Automata that accepts only 4 those words that have an even no of sub strings ab. (I = fa, b}) (c) For / = fa, bl 2 Give a regular expression that has all strings that end in a double letter (d) Find a grammar for the language of odd 2 palindromes over (a, b}. CS-73 1 P.T.O.
- 2. (e) Design a TM that recognises the strings of 2 even length over {a, b}. (f) Explain the practical and geometrical 4 interpretation of the following growth rate notations : 0 (big oh) ; 0 (theta) : o (little oh or small oh) (g) Show that 3 n2 + 31og n = 0(n2) (h) State any three decision problem which are 5 unsolvable.2. (a) Tabulate chomsky hierarchy of grammar with examples. (b) Convert the following regular expression 5 into a finite Automata. (a + b)* (aa + bb) (a + b)* (c) Derive a finite Automata from the following 5 NFACS-73 2
- 3. 3. (a) Show that L described as follows is not 6 regular L= {ww : w I {a, b}*} (b) Describe the operation of Turing machine 5 which uses a two way infinite tape. (c) What are the applications of finite 4 Automata ? Explain with an appropriate examples.4. (a) Build a PDA for the language described as 5 {wwR : w {a, b}*) (b) Show that the language 5 an 2 In? is not context free. 1) (c) Show that the function is primitive recursive 5 n —m if n?m f (n, m) = 0 otherwise5. (a) Show that the state entry problem is 4 undecidable (b) If f (n)= 2n2 + 3n2 + 1 then show that f (n) = w (n) and also f (n) = w (n2) (c) Show that K-colorability problem is NP. 5CS-73 3

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment