ll. a) Explain briefly the role of modern agricultural techniques an our food security concerns.

Transcription

1 Illltllflilililtilllillflil]tffillll M Reg.No. : Name :... Vl Semester B.Tech. (Regu larlsupplementaryllmprovement-l ncl ud i n g Part Time) Degree Examination, May 2012 (2007 Admn. & Onwards) PT2KG 2K6/EC/CS/ T/AE 601 : ENVIRONMENTAL ENGINEERING AND DISASTER MANAGEMENT Time : 3 Hours Total Marks: 100 lnstruction : Answer all questions. l. 1) What is the role of science? Engineering in the conservation of the environment. 2) List the instances pointing to the fact that man have affected earth's natural system. 3) What is afood chain? What is the impact of feililizer? Pesticide in food chain. 4) Write a short note on ecological pyramid. ) Explain the sources of marine pollution. 6) Discuss the types of natural calamities. 7) What is acid rain? 8) List major green house gases and their sources. (8x=40) ll. a) Explain briefly the role of modern agricultural techniques an our food security concerns. b) What are the naturally avaihble mineral resources? Discuss about the impact of extraction of them in environment. lll. a) Explain the energy flow in the ecosystem with an example. b) Discuss the Biogeographicalclassification of lndia. P.T.O.

2 M21220 I tililtf, fft ilil lllll llll lilll illl lill lv. a) Differentiate between Genetic, species and ecosystem biodiversity and explain the relevance of Preserving them. b) Explain the role of individual in preventing pollution and issues involved in enforcing environmental Iegislation. V. a) What is the role of value education? Explain. b) What is Ozone layer depletion? What are its effects?

3 rffim[lfl[m[ilmlffillll M Reg. No. :... Name: Vl Semester B.Tech. (Regular/Supplementary/Improvement - lncluding Part Time) Degree Examination, May 2A12 (2007 Admn. Onwards) 2K6 CSflT 602 : GRAPH THEY AND COMBINATICS Time : 3 Hours Max. Marks : 100 PART- A 1. Define (i) bipartite graph (ii) complete graph (iii) connected graph. 2. ln a graph G show that sum of the degrees of vertices is equal to twice the numberof edges" 3. Define Tree. Give any two properties of a Tree. 4. Show that for every T = (V, E) if lvl> 2 then T has atleast two pendant vertices.. There are'n' married couples at a party. Each person shakes hands with every otherthan her or his spouse. Find the total number of hand shakes. 6. Define Rook polynomials. Give an example. 7 " Solve the recurrence relation 3n = n an-, where n > 1 and ao=1. 8. Find the coefficienl of x27 in (# + x + x ;s" (8x=40) PART - B 9. a) Show that every Planar graph is S-colurable. 8 b) Explain Graph isomorphism. Give an example for isomorphic graphs. 7 P.T.O.

4 M ffiilffi[mffiml[]ffi 10. Define Chromatic polynomial, Find the Chromatic polynomial for the graph given below. 11. A graph of order'n' is a tree iff it is connected and contains n-1 edges Define spanning tree. Explain Kruskals algorithm with an example. a) Explain principle of inclusion and exclusion. b) State and prove binomialtheorem " a) ln how manyways can we distribute 7 apples and 6 oranges among 4 children so that each children gets atleast one apple. b) Determine the number of positive integers 'n' where 1 < n < 100 and n is not divisible by 2,3 or.. What are second order linear homogeneous recurrence relation with constant coefficients? Find and solve recurrence relation to find nth Fibonacci number. 16. a) Determine the coefficient of xb in (x - S1-t 1x - 2)-2. b) Find a recurrence relation for the number of binary sequences of length n > 1 that have no consecutive 0's.

5 rffi$[im[m[mlilmm M Reg. No. : Name :...,... Vl Semester B.Tech. (Regular/Supplementaryflmprovement-lncluding Part Time) Degree Examination, May 2012 (2007 Admn. Onwards) 2K6 CS 603 : DATABASE MANAGEMENT SYSTEMS Time : 3 Hours Max' Marks : 100 lnstruction : Answer all questions. 1. a) Define a data model. What are its categories? (8x=40) b) Define schemas, instances and states of a database. c) Explain with examples the basic SQL commands. d) lllustrate with example the insert, delete and update statements in SQL. e) What are the different operations possible on a file? f) Differentiate heap files and sorted files. g) Explain the deadlock prevention protocols. h) lllustrate the phases of optimistic concurrency control. 2. a) List out and explain the advantages of using DBMS. OH b) What are the notations used in ER-diagrams? Give an example. 3. a) With example explain the substring comparison, Arithmetic operations and ordering using SQL. 7 b) With example explain aggregate function and grouping. 8 c) Give detailed description of normalforms based on primary keys and the corresponding normalization. P.T.O.

6 M ilffi[rumfl[iilmffi 4. a) Define hashing. what are the different hashing techniques? b) Explain the dynamic multilevel indexes using B+ trees. a) Define serial, Non serial, conflict seriatizable schedules. How to test the conflict serializability of a schedule? b) Explain the ARIES algorithm. c) Explain how database is recovered from catastrophic failures. 10 (xa=60)

7 ililllilililllil llill lllil illl llll lill M Reg. No.: Name :... vl semester B.Tech. (Heg./sup./lmp. - lncluding part Time) Degree Examination, MaY 2012 (2007 Admn" Onwards) 2K6 CS 604 : COMPILER DESIGN Time: 3 Hours Max. Marks : 100 lnstruction : Answer all questions' l. a) what are the different compiler construction tools? b) what is LEX? Explain the structure of LEX program with an example' c) Explain the concept of YACC' d) Explain ambiguous grammar with example' e)defines.attributedandl-attributeddefinitions' f) What is the need for ICG? g) Explain the concept of Loop optimization' h) What is Bun time error handling? (8x=40) ll. a) what is a transition diagram? Represent a transition diagram for relational operations and for unsigned numbers' b) What is a regular expression? What are the algebraic properties of a regular expression? Explain the construction of an NFA from a regular expression. P.T.O.

8 M I iltilil ll! tflt tflt ilil ililt ilil tilt I ll. a) Explain the operator precedence algorithm for parsing with the help of operatorprecedence relations. b) Construct an SLR(1) parsing table for the following grammar : S -+ xay I xby I xaz A -+ as/q B-+Q lv. a) Explain bottom up evaluation of S-attributed definition with an example. b) Explain in detailthe different storage allocation strategies. V. a) what are the different code optimisation techniques? Exprain. b) Explain in detail, different types of errors and Error handling. (4x=60)

9 ililflt il Iilil ll1ll flilt lut lifl lil Reg. No. :... M Name:... Vl Semester BJech. (Regular/Supplementary/lmprovement - tnctuding Part Time) Degree Examination, May 2012 (ZOO7 Admn.) Onwards 2K6 CS 60 : DATA COMMUNICATION AND COMPIJTER NETWoRKS Time : 3 Hours Max. Marks : 100 lnstruction : Answer ail questions. l. a) Define network. What are its different types? b) Listoutthe advantages and disadvantages of OFC. c) With an example explain how hamming code is useful in error detection and correction. d) Describe the hidden and exposed terminal problems exist in wireless networks. e) compare distance vector routing and link state routir-rg. f) Write note on hierarchical routing. g) Describe the TCp segment structure. h) Briefly explain the mail accessing protocols. ll. a) with relevant figures illustrate the guided media. (8x=40) b) What are the different ways the wireless communication is possible? Explain. P"T.O.

10 M2' rffififfflilil]liluffiilillllt lll. a) Explainindetailtheprinciplecomponentsof Pointtopointprotocol (ppp). b) Explain the following : i) With figure illustrate the SONET layers? ii) Describe the SONET frame format. iii) Write note on SONET networks? lv. a) with example explain the link state routing algorithm? b) Explain the standardized internet multicast routing protocols. V. a) Explain with properfigures the TCP connection management by the client and the sever. b) Explain the following : i) FTP ii) MtME iii) HTTP. (x4=60)

11 ltffi$il$fii[ffiflfilffiffillll M Heg. No. : Vl Sernester B.Tech" {ReEular/Stlpplerxrentary/lmprovernent - lncluding Fart Time) Degree Hxamination, ftllay 2012 (2007 Adntn. Onwards) 2K6eS S$6 {A} : Bl$THnEuTHm &OIL{PUT'ING Tirne:3!-lours IMax. Marks : a) Bring out the limitations of distt'ibuted systernb) Compare the perforrnance of token and non token based algorithms. c) What are the issues in dead lock detection? i-low to resolve it? d) Write note on synehronous anclasynchronous eonnputations. e) With figure explain the working of ffipc. t) Define dead locks. g) Explain the erlge chasing algorithrm used in distrihurteri transactions. h) What are the classifications of mernory consistency rnodels? Explain. (8x= O) a) lllustrate in cletailtermination detection' b) 3. a) b) 4. a) Explain the issues in distributed operating systems' Explain in detailth* centralized deadlock detection algorithms. l-ist out and explain the applications *f asreement algorithms. Describe in detail aboutjava Hfvlfi? b) i) What ane the problenns associated with concurrent transactions? How to overcome it? ii) What are the problerns associated with transaction aborts? What are the ' solutionsto overcome the problems? 7 t I. a) Describe in detailthe recovery of the two pllase comrnit protocol. 0n b) Dernonstraie the design and frmptrernentation issues of OShtX. {8+7=} (x4=60)