C 20830 (2 Pages) eee Baas Wag. Noa THIRD SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2006 CS/IT2K 30/PTCS2K 301—ENGINEERING MATHEMATICS—III ‘Time : Three Hours Maximum - 100 Marks Answer alll questions. L (a) Show that for the set of all polynomials of degree 4 the set S= be, x -2, ta 4x8 xt +t x, 1 is a basi tb) Show that every subset of a linearly independent eat is linearly independent. Bir a0: -00 co) Pn nn at at 3 | oO -1 8 2aao1 13 4 4 (d) Find therankof} > 3) _g|- 7 -4 7 =36, (e) Show that ifimaginary part of an analytic function is constant, then the function is itself a constazt. { Show that w =x*—3cy' + 3x°—45*+ 1 is harmonic and iff (z)= u + iv is analytic find © F +2) ai z= 0 in Taylor's series. (@) Expand f(t) = toe (h) Expand f(2)-= oa is Laurent’s series in the region 1 < |z+1! <2. (8x5 =40 marks) IL (a) G@ Orthogonalize the vectors v, = (0, 1,0, 1); 0, =(-2, 3,0, 1);2,= <1, 1,1, 5)in RY. (0 marks) 2-1 “2 ;| Oa 16 (ii) Find the linear transformation corresponding to the real matrix A = marks) Or ‘Turn over(b) I. (@) TV, iby (a) (b) fa) @) Gi) 2. © 20830 State and prove Sylvester's law of Nullity. (10 marks) Show that T (-u} = —T (1c) for all w € U and T is injective if and only if ker (T) = 10), where Tis Tinear transformation from vector space U to . (5 marke) a age f Verify Cayley Hamilton thesremfor A = |4 2 | andfind Ausingit. (8 marks) ee) s 6 fs # Find Ar, using Cayley Hamilton theorem, shan A= |) 5 (7 marks) Or Reduce the quadratic form 2xi + 6x, + 2x; + 8x,%, to canonical form by orthogonal ‘a reduetion, Find also the nature of the quadratie form, @ (ii @ 4) a @ Gi) (15 marks) Find the image of the region bounded by = 1; = Land y= 1 under w =z" is (8 marks) Find the bilinear transformation that maps the paints 1+ i,—i,2~¢ for z-plane into the points 0, 1, i in w-plane. (7 marks) Or Find the bilinear transformation, which maps i, —1, 1 from z-plane inte the points 0, 1, © of w-plane. «7 marks) Find the transformation that will map the strip x 2 1 and @ 2 y = 1 of the z-plane into the half plane (i) 0 > 0 and Gi} w> 0. (8 marks) Bvaloste [ ——°%_,. Cane ene =) boas Fae iat eee «7 marks) JB = Boos Or __608 20 d8. ss (8 marks) ~ 2a cond + a Evaluate [—* eer ox +e [4x 15 = 60 marks]C 20894 (Pages 2) Name., Reg. No. THIRD SEMESTER B.TECH. (7NGINEERING) DEGREE EXAMINATION, JUNE 2006 Information Technology CSIT O4 302—DATA STRUCTURES AND ALGORITHMS: (2004 admissions) ‘Time : Three Hours : Maximum : 100 Marks 1 IL I. @ a) © (a) fe) ii ( rey ) Answer all questions. Explain the asymptotic notation used to measure the Complexity of algorithms. Distinguish arrays and records. Can two stacks be implemented in a single array ? Explain. Write an algorithm to reverse a string using a stack. Explain how a tree is different. from binary tres, Is the set concept in Mathematics and Data Structure the same ? Explain. Give the time complexity of different sorting algorithms. Write short note on merge files. (8x & = 40 marks) (i) Discuss the advantages of linked lists over arrays. (8 marks) (ii) Write necessary algorithms to implement a circular queue. How are “full” and “empty” conditions handled ? (7 marks) Or (i) Design an algorithm to delete all nedes in a circular linked list, (8 marks) (Gi) Explain how to implement the concept of linked list using arrays. (7 marks) () Develop an algorithm to read a text file and print whether ar not a line of text is a palindrome, Your algorithm must make use of one or few stacks with appropriate pushes ands ar paps. . (8 marks) Gi) Write a non-recursive function ta reverse a singly linked list in 0 (7) time using constant extra space (7 marks) Or @) Explain the concept of priority queue. Give a suitable data structure for implementing the same. (8 marks) Gi} Compare the merits and demerits of singly linked list with that of doubly linked list. (7 marks) ‘Turn over