M.O.P. VAISHNAV COLLEGE FOR WOMEN (Autonomous) Chennai 34.

Department of Computer Science

Question Bank Course Batch Subject Allied : B.Sc., Computer Science : 2010 2013 : Discrete Mathematics : III

Semester : III

MOP VAISHNAV COLLEGE FOR WOMEN (AUTONOMOUS) CHENNAI 34. DISCRETE MATHEMATICS Max Marks : 100 UNIT IV Section A 1. The term Regular expression is --------------------2. A grammer is a -------------------- tuple 3. Expansion of NDFA is --------------4. Expansion of DFA is --------------5. The term Concatenation is --------------------6. G in (G,N,T,P) stands for -------------------7. N in (G,N,T,P) stands for -------------------8. T in (G,N,T,P) stands for -------------------9. P in (G,N,T,P) stands for -------------------10. 11.If L is a regular language and F is a finite language, then, L F is --------------12.If L is a regular language and F is a finite language, then, L F is ---------------13.If L is a regular language and F is a finite language, then, L F is ----------------Section B 1. Determine the type of grammar having the following productions: (i) (ii) SaA, Aa, AaB, Bb SaAB, ABbB, Bb, AaB

2. Determine the type of grammar having the following productions: (i) (ii) (iii) SaA, AaAB, Aa, Bb SaB, Ba, Bb, BbA, Aa, AaB SaSBC, Sabc, CBBc, bBbb

3. Find a language generated by the grammar G = ({S,A},{0,1},S,P) where P = {S0A,S1,A00} 4. Determine the language generated by the following grammar. (i) S0S1, S01, SA (ii) SaA, AaA, AbB, BbB (iii) BcC, Bc, CcC, Cc

5. Construct a regular grammar generating the language L(G) = {0m1n| m, n 1} 6. Determine a context-free grammar for the language L(G) = {a2n bc2n | 0} 7. Find the language generated by the grammar having the productions S aSAc, Sabc, cAAc, bAbb. 8. Find a regular grammar G generating the language L consisting of all words in a and b with an even number of as. 9. Find the language generated by the grammar having the production S ABC|, ABBA, BAAB, A a, Bb 10.Find the language generated by the grammar having the following productions: S AB, AaAb, BbBa, A , B 11.Draw the derivation tree for the word (i) abaaba using the grammar having the productions S a | aAS, AbS 12.Draw a derivation tree for the word bcabbbbbcb using the production S abS, S bcS, SbbS, Sa, Scb. 13.Prove that the following grammar is ambiguous. G = ({S,A},{a,b},S,P) where P = {S aAb, SabSb, S a, A bs, AaAAb} 14.Draw a derivation tree for the string cbaba generated by the grammar G = {S, A, B, C}, {a,b,c}, S, P) where P = { SAB, ACa, BBa, BBa, BCb, Ccb, Cb} UNIT V SECTION A 1. 2. 3. 4. 5. 6. 7. 8. A Domain expert is -----------------The term End-user is ----------------An Expert System is ----------------Expert-system-building tool is ----------------------Knowledge engineering is --------------------------Knowledge engineer is -------------------------Representation is -------------------------

9. Define Search 10.Define Support environment 11.Define the term Tool 12.Define Tool builder 13.Explain the term User 14.Explain Algorithm. 15.Define certainty factor 16.Explain domain knowledge 17.Define frame 18.Define Heuristic 19.Explain Inference engine 20.Define Interpreter 21.Define Knowledge 22.Define knowledge representation 23.Define knowledge-based system 24.Define knowledge base 25.Define rule 26.Define Scheduler 27.Explain Semantic net. 28.Define explanation facility 29.Explain Meta knowledge 30.Explain problem reformulation 31.Define real-world problem 32.Define Robustness 33.Define Scaling Problem 34.Define search space 35.Explain skill 36.Define symbol 37.Explain Symbolic reasoning 38. 39.Define Interpretation 40.Define prediction 41.Define diagnosis 42.Explain Design planning monitoring 43.Explain Debugging Repair 44.Define instruction 45.Define Control