ee 3) Prove that (-pq) -+{-44-4p)] isa tautology with constructing truth table. ruth table (©) «Obtain the principle disjunctive normal form of (pq) v (pat) (qn) by constructing t 4. Ifthe coefficient of (2r+4)" and (r-2)" Solve the recurrence relation. value of r. terms in the expansion of (1+)! are equal, then find the val F,=SE,,-6F, Where Fy= 1 and F, = 4 patel | & The necessary and sufficient condition for a non-empty subset H of a group (G, *} to be a subgroup isa,beH= 4 ate H. 7 Write short note on Graph Homeomorphism, pats and circuits, PART- C (@escriptive/Analstical/Problem Solving/Design question). Autempt any four questions. (4 * 15 = 60) Define principle of mathemetical induction and hence prove that g(2), (2) is divisible by 43 foreach positive integer. 2. Write a note on: (@) FirstOrder Logic (©) Finite state machine as language recognizer. 3. Solve fora, given that a, = 0, 4. Write short notes on following (2) Monoid ©) Cosets (©) _ Homomorphism and isomorphism. $. Explain shortest path problem with example, B.Tech, IV Sem. Examination Paper Computer Science and Engineering 4CS1-02 Technical Communication Gand a, =—3a, ; + 10a,> +3.2 For n> Z. goa 2 Hours Moximum Marks : 80 Instructions to Candidates : \, four questions out of six grams must be shown wherever essumed ond stated clearly, Units of quantities used/calculated must be s fated clearly, PART- A (Answer should be given up to 25 words only). All questions re compulsory, Define technical communication, Discuss different types of technical documents, Why is a meeting agenda important for a productive meeting? What are the different types of technical project proposals? What isa straiegy for effective writing? (5x 2=10) Peet Paper’ [Move Tes PH. Twoh, IV Sem, Examination Paper Computer Gol and Engineering 4084-06 Theory of Computation Marimum Marks : 120 fart A, five questions out of seven questions from Part B and four questions out diagrams must be shown wherever necessary, Any data you feel missing may suitably be ‘of quantities vsed/ealeulated must be stated clearly, PART A (Answer should be gloen up to 28 words only). AU! questions are compulsory. (10 * 2 = 20) 1, Difference between melay & moore machine, 2. Give applications of pumping lenna, K. Define degree of ambiguity of W. 4, Kigplain context free grammar in brief 4. Givedefinition of PDA, 6, Write three properties of CPL, 1. Define indexed language in brief, 4, Prove the transpose closure property of context sensitive language, 9 Show) SAT in NP complete, 10, Define NP complete in brief, PART- B (Analytical/Problem solving questions), Auempt any five questions. 1, Write closure property of regular set. Ss 2, State the difference between deterministic and non deterministic finite automata. 3. Finda grammar in Chomsky Normal Form equivalent to Sra ADB, A-ra A/a, B —> bB/b, 4. If Lis context free language then prove that there exists PDA M such that L=N(M) 5. Write short note on Pumping Lemma for CFG. 6. Explain how a Turing machine with multiple tracks of the tape can be used to determine the given number is prime or ‘not, 6*8= 40) 7. Write algorithm for approximation for vertex cover problem with suitable example, PART- C (Deseriptive/Analytical/Problem Solving/Design question). Attempt any four questions. (4 * 1S = 60) 1, State and explain pumping lemma, Prove that the following language L = {a" : n is a perfect square} is not regular. 2, Give detailed description of ambiguity in context free grammar, 3. Construct a PDA accepting {a"ba {m,n 21} by null store, Construct the corresponding context free grammar accepting the same set? Make the comment on the following statement finite state machine with two stack is as powerful as Turing Machine. sales person problems using minimum spanning tree algorithm, Assume