C 32264 (Pages : 2) Name. Reg. No. ¥IFTH SEMESTER B.Tech. (ENGINEERING) DEGREE EXAMINATION, JUNE 2007 @B/IT 04 501—SOFTWARE ENGINEERING (2004 admissions) ‘Time : Three Hours Maximum : 100 Marks 1. (a) (o) (©) @ @ wo @® (h) 2. (a) (b) 3. (a) (b) Answer all questions. » Part A Define the term repairability with respect to a software system. Explain how a software life-cycle model is an abstraction of a software proces Define the term interface, implementation and information hiding with respect to modularisation. In brief, explain the major uses of software specification. ‘What is decision table-based testing ? Give example. What are the activities involved in the requirement analysis and specification phase of waterfall model of software production process ? ‘List some of the common risk items in software engineering management and tech ‘managing them. Differentiate between Procedural and Non-procedural languages. (8x5 = 40 marks) Part B Discuss the relationship between human interface aspects of software and reliability. Or Discuss the principles that may be useful in software development, and show how they are related to the principles of Software Engineering. Explain with example, how the stepwise refinement design is one of the popular and easy to adopt approach. Or A University Registration Office maintains details about courses, instructors and students. Construct an ER diagram for Registrar's office such that enrolment of students in courses and grades awarded to student in each course they are enroled. ‘Turn over4. (a) (b) 5. (a) (b) 2 32264 Discuss in detail the various requirements for verification in more systematic way. Or Explain how the software. quality factors are verified and the various issues involved in it in detail. Give an over-viéw of software production tools and how to-design and implement them. or Discuss in detail about various user interface mangaement tools and their usage in software development. (4x 15 = 60 marks)C 32173 (Pages 2) Name... Reg. No.. FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2007 Information Technology IT 2K 502—GRAPH THEORY AND COMBINATORICS, ‘Time : Three Hours ‘Maximum : 100 Marks Answer all questions, Part A 1. (a) Distingusih between adjacency matrix and incidence matrix in graph theory. (b) Define planar graph and Hamiltonian graph. (c) Write the Prim’s algorthm to find minimal spanning tree. (@) Write the Bellman-ford algorithm, (©) How many words of 8 distinct letters can be formed from the letters of the word MAST ? (©) From a group of 12 professors how many ways can a committee of 6 members be formed so 2ast one of professor A and professor B will be included. (s) (h) Solve Ya, - fo, -, -2 Ja, ~y =0 where a, =a, = 1 a, 1 +4,_ 9,02 2with dy =a, = (8x 5 = 40 marks) Part B I. (a) State Kurtowski's theorem. Explain its applications, Or (b) State and prove Euler's formula. III. (a) Find the minimal spanning tree for the following graph in Fig. 1. using Kruskal's algorthm. 9 Fig. 1. ‘Turn over2 32173 (b) Apply Dijkstra’s algorithm to find the shortest path of the graph below in Fig. 2. (from s to 1). @ 9 b Fig. 2. ¢ a TIL. (a) Out of 10 electric bulbs, 3 are defective but it is not known. In how many ways these (i) 3 bulb can be selected (ii) selection will include atleast one defective bulb’? (8 marks) (b) Find the value of n if p(n, 4) = p(12, 2) (7 marks) Or (© State and prove binomial theorem. (marks) (a) Show that C (n, 0) + C (n, 1) +... + Cla, 1) +... + (n,n) = 2". (7 marks) V. (a) Solve by method of generating function @, 70,2 +6a,-,=0, ay=8 a,=6 ay = 22 (8 marks) (b) Solve the recurrance relation a, 2-40, ,, +4a, = 0, (7 marks) Or (a) Find the solution ofa, ,-5,,, +64, = (8 marks) (b) Find the particular solution of o, , 20, _) +54, =2.3"- 4.7". (7 marks) [4 15 = 60 marks}C 32174 (Pages : 2) Name. Reg. No. FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2007 IT 2K 503—INFORMATION THEORY AND CODING (New Scheme) Time : Three Hours Maximum : 100 Marks 1. (a) Explain the steps to achieve maximum efficiency in Huffman coding. (b) State and explain Information capacity theorem, (©) Explain the properties of linear block codes. (d) What is a syndrome calculator ? Explain, (e) What is a Galois field ? Explain, (f) Give an account on ‘Vector spaces’ (g) Differentiate cyclic codes from convectional codes. (h) Explain the structure of encoder of Convolutional codes. (8 x 5 = 40 marks) IL. (a) (i) Define and explain Entropy. Obtain the conditions for obtaining maximum Entropy. (8 marks) (i) State and prove all the properties of Entropies. (7 marks) Or . (©) @ Derive expressions for Binary symmetric channel and Binary Erasure channel, (8 marks) GD Obtain the relation between mutual information and conditional entropies. (7 marks) TIL. (a) (i) Derive the matrix representation of Linear block codes, (8 marks) (ii) Design a single-error correcting code with a message block size example that the code can correct single errors. 11 and show by an (T marks) Or (b) ()_ Explain the significance of syndrome calculator in eyelic codes. Explain with an example (8 marks) (ii) A(5, 5) linear cyclic code has a generator polynomial. Bx) =Lex tx? txt x8 48 4 x10 Find the code polynomial for the message polynomial D (x: )=1+x? +24 (in a systematic form). (7 marks) Turn over2 WV. (a) (i) Explain the basic properties of Galois field. (ii) Explain the features of BCH codes. or (b) () Write a technical note on ‘Reads-almon codes’. Gi) Give an account on ‘Groups and fields’. 32174 (8 marks) (7 marks) (8 marks) (T marks) V. (a) (i) Explain the decoding procedure using majority logic decoding of convolutional codes with an example. (ii) Give an account on ‘Trellis code’. Or (b) Write short noes on : (i) Interleaved Convolutional codes. Gi) Viterbi decoding. (8 marks) (T marks) (8 marks) (7 marks) [4 x 15 = 60 marks]C 32270 (Pages : 2) FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2007 IT 04 504—INFORMATION THEORY AND CODING (2004 admissions) ‘Time : Three Hours Maximum : 100 Marks Part A Answer all questions. 1. (a) A diserete source emits one of 5 symbols once every millisecond with probabilities 16 °"4 jg Pespectively. Determine the source entropy and information rate, (©) What is binary symmetric channel ? Explain. (©) Define and explain the following :— (i) Code rate. (i) Minimum distance, (d) Show that the generator polynomial of a eyclie code is unique. (e) Define : @ Group. (ii) Field. (f) State the axioms of vector space. (g) Define free distance and explain (h) What are the advantages and disadvantages of convolutional codes ? (8 x 5 = 40 marks) Part B Tl. (@) Gi) State and prove source coding theorem. (8 marks) (i) Explain Lempel ziv coding technique (7 marks) Or (b) Derive channel capacity formula for band limited white Gaussian noise channel. (15 marks) TIL (a) Explain error detecting and correcting capabilities of linear block code. (15 marks) Or (b) Consider a (7, 4) eyclic code with generator polynomial g (X) 1+ +X3 (Find generator matrix and parity check matrix in systematic form. (Construct encoder and syndrome computation circuit. (8 +7 = 15 marks) Turn over2 © 32270 IV. (a) (i) Explain what is meant by characteristic of a field ? (ii) What is meant by extension field ? Explain. Or (b) Explain about encoding and decoding of RS code. (15 marks) Y. (a) Construct state diagram and trellis diagram for the convolutional code having generator sequences : 0,1), 8 =(,1,0, Or (b) Explain sequential decoding algorithm for convolutional code. (4 15 = 60 marks)D 32271 Name. Reg. No... FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION JUNE 2007 IT 04 505—GRAPH THEORY AND COMBINATORIES (2004 admissions) ‘Time : Three Hours Maximum : 100 Marks 1. (a) Define adjacency matrix and incidence matrix of a graph. (b) State and prove Euler's formula for planar graph. (c) Write the Prim’s algorithm for finding minimal Spanning tree. (d) Define a tree. Write any three properties of it. (e) State the principle of inclusion and exclusion. () Prove that nC) +nC,+n-C,+.....+0C, (g) Solve by method of generating function Gy 49 ~By 51 + 2dy = 03g = 2,0 = 3. 2} (8 x 5 = 40 marks) Il. (a) Prove that a given connected graph is an Euler graph if all its vertices are of even degree. Or (b) State and prove five colour theorem for planar graphs. TI. (a) State and prove max-flow-min-cut theorem. Or (b) Explain the Bellman-Ford algorithm with an example. IV. (a) Prove that the number of different permutations of n distinct objects taken r at a time when every object is allowed to repeat any number of times is n‘. Or (h) Find the generating function for the sequence (1,~ 1, 1,~1, 1, (b) Show that nC, + nC,_, = n41C-- (ii) Determine the number of diagonals that can be drawn by joining the nodes of octagon. V. (a) Solve by method of generating function : Ging ~ ggg + Oy = 2" 5 4q = 2 a,=1 Or (b) Using generating function, find how many ways can & indistinguishable balls be coloured with 4 colours, if there must be an odd number of balls coloured with first colour. (4 « 15 = 60 marks)C32167 (Pages : 4) Name... Reg. No.. FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2007 CS 2K 502/IT 2K 506 A-NUMERICAL ANALYSIS AND OPTIMIZATION TECHNIQUES (New Scheme) ‘Time : Three Hours Maximum : 100 Marks Answer all questions. I. (a) Find a root of the equation x*~3x-5=0 using Newton-Raphson method correct to three decimal places. (b) Using Newton's interpolation formula, find the value of y atx = 225 from the following table x [100 150 200 250 300 350 400 12 16 21 27 36 50 72 & (c) Obtain the value of o at x = 1.4 from the following table : z[ 12 18 14 15 16 1.5095 1.6984 1.9043 2.1293 2.3756 (a) Solve s =y—2,y(0)=1 fory (0.1) and y (0.2) by modified Euler's method, ¥ (e) Write down the duel of the following LP problem; solve the dual problem and hence find the optimum solution of the given problem : Min Z = 4x, +12x) +1815, subject to x, +8x3 23 xp +2x3 25, 4,%9,320 (Solve the following LP problem : Max Z = 5x + 2g subject to 4x +3x2 <12 xy x2 $4, H1t220. (g) Write down the LP representation of a general m x n transportation problem. ‘Turn over2 (h) Solve the following assignment problem : Job 34°05 2. (a) Find a root of the equation x4—x 19-9 by bisection method. Gi)” Given the following table, find the value of y at x [0 youl 8499 1.4918 Or (b) (i) Solve the following system by relaxation method x +y +32 =12 2x+4y+z2=25 x-y+82=5 (ii) Solve by Gauss-Seidel iterative method bx +2y 2 =10,2 + 7y +82 = 15, 2x y+ By =19, 2 8. (a) (i) Find x and Pe at x = 0.3 from the following table : z[ 0 Ol 02 03 04 05 06 ¥ | 3013 31.62 32.87 83.64 33.95 33.81 93.94 Gi) Given the differential equation 2 Picard’s method. 32167 (8x 5 = 40 marks) (7 marks) (8 marks) (7 marks) (8 marks) (7 marks) -¥¥(O)=1, obtain y at x = 0.2 and x = 0.4 using (8 marks)3 © 32167 (b) (i) Using R-K method of order 4 solve for y (0.1) and y (0.2) given that dy dx +97,9(O)=1 (8 marks) (ii) Solve the differential equation 2 x? +y?-2 y (0) = 1, y (1) = 0.89 y (0.2) = 0.7609 y (0.3) = 0.6172 using Milne’s predictor corrector method for y at x = 0.4 and x = 0.5. (7 marks) 4. (a) Solve the following LP problem by simplex method : Max Z = 8x, + 7xy + 10x5 subject to x, + 2x, + 2x, < 12, 2x, + xy + Bx, < 18, xy 2x <5, Xp) Xyp xy > 0. (15 marks) Or (b) Solve the following LP problem using dual theory : Min. Z=10x, +15x2 + 2025 subject to x1 +29 -x5 210 x2 +4x3 240 7 2x, x +xg 220 tg 20. 5. (a) Solve for Optimum solution of the following transportation problem Retail shop 12 3 4 5 Avail/week 1, [45 [147 a3 7 a6 [iz 80 Industry 1, [12 [a4] 9 | 11 | 8 90 i, Ls [9 | 6] 7 ]10 130 50 G0 70 80 40 Requirement/month (15 marks) Or4 C s2167 . (b) Solve the following assignment: problem of six jobs and six machines by Hungarian method Job Ook ewe A B Machine c D E F 160 im 101 120 132 145 182 106 98 130 125 133 175 99 93 115 122 158 179 15 101 145 135 145 181 121 105 150 129 151 175} 119) 104 149| 128} (15 marks) [4 x 15 = 60 marks)C 32272 (Pages : 2) Reg. No. FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2007 IT 04 506—DATA MODELLING AND DESIGN (2004 admissions) ‘Time : Three Hours Maximum : 100 Marks Answer all questions. 1, (a) Define attributes, operations and encapsulation. (b) Explain binding with examples. (c) Compare association and aggregation. (@ Explain deployment diagram. (©) Define Encumbrance and Class cohesion. (Different ‘type’ with ‘class’. () Explain mix-in class, (h) What is compile time polymorphism ? Explain. (8 x 5 = 40 marks) 2. (@) @ Discuss the salient features of object oriented approach. (8 marks) (ii) Consider the system of student information processing. Define at least two classes with proper attributes and member functions. (7 marks) Or () Explain the history or evolution of object orientation in detail. (15 marks) 3. (a) (i) What is sequence diagram ? Explain. (7 marks) (ii) Describe the features of architecture and interface diagrams. (8 marks) Or (>) Explain : Asynchronous messages. Concurrent execution Nested states ‘Transient states. (15 marks) 4. (a) @) What are the domains of object classes ? Explain. Also discuss the behaviour of classes and subclasses, (8 marks) (ii) Discuss preconditions and postconditions. (7 marks) Or ‘Turn over