C 20753 G Pages) Name... Reg. No. FIFTH SEMESTER B.Tech. (ENGINEERING) DEGREE EXAMINATION, JUNE 2006 CS 2K 5021T 2K 506 A~NUMERICAL ANALYSIS AND OPTIMIZATION TECHNIQUES ‘Time ; Three Hours Maximum : 100 Marks Answer all the questions. 1. (a) Find a positive root of x o* = 2 by the Regula Palai method (by Find a polynomial of degree four which takes the values. 2 4 6 & 10 oO oa 1 0 0 o 1 Evaluate a using trapezoidal rule with k= 0.2. lez Compute y (0.25) using Modified Buler method for >" = 2 xy, 9 (0) ‘Write notes on : (i) Basie solution te) @) fe) (ii) Optimal solution, (Explain Charnes Big-M-method. (g) Explain the Vogel's approxitiation method for solving a transportation problem. (h) Solve the following 4 job 4 machine problem : Machines MM, MM, M, reeromee Ts Maly 16 Jobe gd 6, 509) 6 ied Test Out? Uegayad) 1280) (8 x5 = 40 marks) 2 (a) ti) Solve by Crout’s method : Qxtytde= 12 Bx-3y+22=20 da+ily-2=33 (7 marks) (ii) Using Newton's forward formula, find sin (0.1604) from the following table :— ie LG) 9.161 0.162 sing : 16931 0.160305 0.161292 (8 marks) Or ‘Turn overZ C 20753. (bo) G ) Solve by Gauss-Seidel method Bxaysz=4 zt2y teed atyt2esd (7 marks) (ii) Using Lagrange’s formula, find the cubic function from the table below : x oO 2 3 6 FO) 659 705 729 804 (8 marks) (a) G@)_ Find the values of y (0,1) and y (0.2) using taylor series method, given 3” = Sx + es andy (0)= 1. 47 marks) (ii) Solve fory atz=12 from y = 2° * ©" win y ay=0. = +xe" (8 marks) Or ) (Find y (0.1) by Picard’s method, given 9’ = Fine: with y (0) = 1 (7 marks) Gi) Find y (0.4) using Milne’s predictor corrector formula, given y’ = 3 6 xt} andy (0)= 1,7 (0.1) = 06, y (0.2)= 1.12, y (0.8) =L.21. (8 marks) . (a) Use Charnes Big-M-technique to : Maximize Z=3x,-x, subject to the constraints 2x +2,22 a, +32,58 x, 24,x,,x, 20. {15 marks) Or (b) Solve by dual simplex method : Minimize Z=10x-6y +22 subjectto -z+y 4221 Bz+y—z22, x, y,220. (15 marks)3 © 20753 5. (a) A military equipment is to be transported from origins 1, 2, 3 to destinations 1, 2, 3, and 4 ‘The supply at the origins, the demand at the destinations and time of shipment is shown below. Work out a transportation plan so that the time required for shipment is minimum Destination iene Ace supply. 1 Sion eae 8 Origin 2 | 15 | 20 13 3 [20 [12 u Demand 6 11 (15 marks) Or (h) Four different jobs are to be done on four different machines, The setup and production ‘times are probability high for change over. Assign jobs to different machines eo that the total ‘cost is minimized. Machines Pena Te Se Fells 6G Jobs aE 5 9 ra Mrayaa 10 7) 410 aa (15 marks) [4.x 14 = 60 marks)C 20754 (Pages : 2 Rice eee Reg. No FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2006 CS 2K 509PTCS 2K 503—PROGRAMMING LANGUAGE CONCEPTS ‘Time - Three Hours Maximum : 100 Marks Answer all questions, PartA I. (@) How semantics are useful as Isnguage descriptors ? What are the other styles of language doscriptors available ? (&) What is an activation tree ? Give example. (©) What are the important features of Object Oriented Programming ? Briefly explain them. (@) With example, explain the concept of virtual fanetion. (©) With example, explain how expressions are evaluated in functional programming. © What is 2 list ? What are the operations on lists ? Give example, (@) What are rules and facts in logic programming ? (i) Wha is deadlock ? How it can be prevented ? (8 « 5 = 40 marks) Part B TL (a) @ Whet are the benefits of higher level languages. (7 marks) (Gi), With an example explain the use of structure charts. @ marks) Or (b) What are the different methods of parameter passing ? Explain them in detail with example. IIL. (a) @) What is in-line function expansion ? List its usage in programming languages_ (7 marks) (@) What is information hiding ? How it is useful in object oriented thinking? (8 marks) Or &) G@) Discuss the importance of constructors and destructors in Object Oriented Programming. (8: marks) (i) What is inheritance 7 With example explain hase and derived classes. (@ marks) Turn over2 20754 IV. (a) fi) What is an iterator ? Give example forit. (7 marks) Gi) Write the essential characteristics of functional programming languages. (8 marks) Or (b) Explain the storage allocation and dealloeation for lists in deta: V. (a) With example, explain how control is achieved in programming language. Or (b) Explain the concept of concurrent programming with sbared variables. (4% 16 = 60 marks)‘3 IV. (@) @ Whatis an iterator ? Give example for it. (@) Write the essential characteristirs of functional programming languages. Or ) Explain the storage allocation and deallocation for lists in detail. With example, explain how control is achieved in programming language. Or (®) Explain the eoneept of concurrent programming with shared variables. 20754 (7 marks) (@ marks) (4% 15 =60 marks)C 20755 Wines Eng: Meee FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2006 CSPTCSIT 2K 504—DIGITAL DATA COMMUNICATION ‘Time -Three Hours Maximum - 100 Marks L Answer all questions () Define Gi) Attenuation ; (ii) Distortion. (S) What are propagation delay and path less? (c} What is bit synchroaization 7 Explain. (G) What are the types of cyclic codes ? Explain about aay one. (©) Explain the basics of network protocol. () What is link management ? {g) What is HDLC ? List its function, (h) What are the limitations of half-duplex protocol ? (8 x 5 = 40 marks) Describe in detail the consequences of failure of a node or link in all the topologies. Or G) “Explain the components fonction of data communication systems. 4) Discuss about MAN and WAN. (a) Describe in detail the need and principles of time division multiplexing. Or &) G@ Explain about cyclic redundancy check. (Gi) Explain the principles of data compression. G . (2) Describe in detail about stop and wait and sliding window protocols, Or ®) G) Explain in detail about link utilization. Gi) Explain the basics of protocel. (a) Deseribe in detail about character oriented protocols. Or (b) Tabulate the differences between half-duplex protocol and full-duplex protocol (4 15 = 60 marks)C 20756 (Pages : 2) FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2006 CS/IT 2K 505—OPERATING SYSTEMS ‘Time : Three Hours Maximum : 100 Marks Answer all questions Part A 1. (a) What is a thread ? How scheduling and co-ordination take place in a thread model ? (b) Explain the steps involved in performing an output operation in a system that uses interrupts, (c) What is scheduling ? Differentiate between pre-emptive and non-pre-omptive sehoduling. (a) Differentiate between safe, unsafe and deadlock state in a process state diagram, (e) Explain the fixed partition memory strategy used for bateh processing syatems. (® Whatis a page fault ? If page fault occurs, how it is handled by operating system, (g) What is an inverted file ? What are its advantages and disadvantages. (h) Write notes on authorization mechanisms. (6x55 40 marks) Part B 2. (a) Explain the four categories under which OS functions are elassified, in detail. r Or (b) Diseuss in detail the three implementation mechanisms used in OS design. (15 marks} 3. (a) Gi) Differentiate between Pre-omptive and Non-pre-emptive scheduling, (7 marks} Gi) Assume the following jobs are to be executed with one processor, with the jobs arriving in the order listed below : If the following scheduling policies FCFS, SJN are adopted — ¥ Create Gantt chart illustrating the execution of these processes. 4 Find the turnaround time for the processes. + Find the average wait time. for the processes. Gua Or (b) What is 2 semaphore ? Explain how it can be used to solve readers-writers problem. Turn over4. (a) 3) 5. (ay (b> 2 C 20756 ‘Write in detail about = @ Swapping G Caching. Or Discuss in detail how segment memory management is implemented with its merits and demerits. ‘What are directories "Explain the various dirviorystrocares and how they areimplemeated in , Or ‘Write in detail, the important aspects of UNIX operating system in detail. (4 15 = 60 marks) ;C 20757 (Pages: 2) Name. Reg. No... FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2006 PT. CS 2K 506.0 “GseKsosc : DATA MODELLING AND DESIGN ‘Time : Three Hours ‘Maximum ; 100 Marks Answer all questions I. (a) Explain whet do you mean by encapsulation with an example. (b} What do you mean by dynamic binding ? (ec) Explain the UML notation for associations with help ef an example. () What is 2 state diagram ? Explain with an example. {e) Discuss the various levels of encapsulation. (® What is meant by encumbrance ? What is its use ? (g) What are components ? Discuss any four of its properties. (h) What is the danger of polymorphism ? (8x 5 = 40 marks) IT (A) Explain any five Software concepts used in Object Oriented Systems. (18 marks) Or (B) G) What is a message ? How is a message sent from one object to.a second object ? 48 marks) ii) An object oriented system is eas to be Reusable, Robust, Extensible and Reliable. Justify ‘the statement. (7 marks) TIL (A) () Explain the generalization construct in UML, (8 marks) Gi) Draw a sequence diagram for an operation of yeur choice. Why are such diagrams needed ? (7 marks) Or (B) Explain with examples the following diagrams — ) Window layout. @ Window navigation. Ga} UML package diagram. (15 marks) Turn over2 20757 TV, (A) What is meant by connascence ? Discuss all its varieties, How dogs it improve system maintainability ? (15 marks) Or {B) G) Explain the principle of Type conformance. (8 marks) Gi) What is meant by class cohesion ? Explain its different types (F marks) V. (A) @ Explain the concept of Mix-In classes with example. @ marks) Gi) Compare and contrast ‘Objects ind Components’, (7 marks) Or (B) Explain the State support and Behaviour support in a Class Interface. (16 marks) [4 15 = 60 marks}C 20762 4 (Pages 2) Time UL Reg. No. FIFTH. SEMESTER B.TECH, (ENGINEERING) DEGREE EXAMINATION, JUNE 2006 If 2K 502—GRAPH THEORY AND COMBINATORICS: : Three Hours Maxirnum : 100 Marks Part A Answer all questions, (a) Explain the Chinese postman problem, (b) Find the chromatic polynomial of the graph. (c) Write the Dijkstra’s algorithm. (a) Write the Kruokal's algorithm to find minimal spanning tree. (co) How many different plates are there that involve 1, 2, 3, letters followed by 1, 2, $ or 4. digits ? (6) Hove many different arrangements are there of the letters a, a, a, bande, (g) Solved, ~a, 1 = 3 (nm — 1), where n= 1, and ag = 2. th} Salve a,? — 2a, for n2 1, where ag = 2, (8x8 = 40 marks} Part B {a) Define Hamiltonian graph G and show that ifdeg(v) Z./2 for allv¢ V, then G is Hamiltonian, where a is number of vertices af G. Or (b) Explan the appliations of Kurtowski's theorem. (a) Write the Floyd-Warshall algorithm and using that find the maximum flow in the following network : Turn over2 C 20762, (b) Define Matching, Maximum matching in a graph with example. Also mention the necessary and sufficient condition for a graph to have maximum matching with proof. 2 (a) How many ways are there to distribute 20 chocolate doughnuts, 12 cherry-filled doughauts and 24 cream-filled doughnuts to 4 different students ? Also find that how many ways can the different kinds of doughnuts be distributed to the students, if each student receives at least 2 of each kind of doughnuts ? (8 marks) (b) In how many ways can the letters (5.a,4.5,3.c) be arranged so that all the letters of the same kind are not in a single block 7 Bee (T marks) Or (@) Show that for n= 2, (i) Cla, 1) = 2C (n, 2)+ 3C fa, 3)... + (1-1 nOla, a) = O and Gi) Cn, 1) + 8C tn, 3)4 SC Un, 5) +... = 2 C fn, 204 4C Ge, 4) +. 2? (G6 marks) ‘State and prove binomial theorem. (7 marks) 1+ 10a, _.=0forn 22 by generating function. 48 marks) +10a,_9= 738+ #4. (7 marks) Or {Q Solve a, -7a,,5 = 2n, where nm = 3* for k2 I anda, = 5/2. 6 marks) (@) Solve the recurrence relation due to Fibonacci numbers. (Tmarks) [4 x 15 = 60 marks}C 20763 (Ce) Name.. Reg. No.. FIFTH SEMESTER B.Tech. (ENGINEERING) DEGREE EXAMINATION, JUNE 2006 IT 2K 503—INFORMATION THEORY AND CODING bree Hours: Maximum : 100 Marks Answer all questions, 1 (a) Explain Huffman eoding procedure. (b) Derive channel capacity formula for symmetri¢ channel, tc) Explain about systematic format af a block code. (d) Define cyelic eode and explain. fe} Prove that every finite field has a primitive element. (Show that any irreducible polynomial over binary field of degree m divides X™ 4g) What is meant by free distance of a convolutional code ? Explain. (bh) What is meant by eatastrophic eode ? Explain. (8x5 = 40 marks) Il (a) State and prove properties of diserete entropy. m Or pe ie 0 ib) Find the channel capacity of the channel with matrix] 0 bP P 0 1-p a By deocd oll I, (a) Consider the following generator matrix aver binary fied G = |1 9 0 1 1 Oh ele: sade 4) Generate all possible eode words (ii) Find paricy check matrix. Construct the standard array. 4iv) How many errars can this code detoct and corcect ? (8+ 2+6+6= 15 marks) Or (bh) Let the polynomial g(X) = x" 4x4 x°4X'4X? +41 be the generator polynomial of a cyelie code over binary field with block length 16. (i) Find the generator and parity cheek matrices in systematic form Gi) How many errors can this code detect and correct? Gi) Construct encader and syndrome circuit, (6444 5= 15 marks) ‘Turn over2 © 20763 TV. (a) @) Whatismeantby minimal polynomial? Show that minimal polynomial of a field element is irreducible, (10 marks) (i) Explain the axioms of veetor spaces, (5 marks) Or (b) Find the generator polynomials and the minimum distance of the Reed-Soloman code (15, 111 ¥. (a) Consider the convolutional encoder described by its generator transfer matrix : D Su (i sp5 DD: G(iD)=|D?-o 0 1+D oO Ms OeeDy 6 D* @) Draw the circuit realization of this encoder. (ii) Is this a catastrophic code 7? Why ? (iii)_Is this code optimal in the sense of the Heller bound on free distance. (5 +5 +5 = 15 marks) Or tb) -G) Explain about soft- output veterbi algorithm. (8 marke) (i) Explain about distance bounds for convolutional codes. G7 marks) [4 15 = 60 marks]ee ee C 20746 Name. Reg. Noon FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2006 EC 2K 502—ELECTROMACNETIC FIELD THEORY ‘Time ; Three Hours ‘Maximum : LOD Marks. I.) State and prove Stoke's Theorem (h) Find the electric field a distance % above the midpoint of a straight line segment of length 2E, which carties a uniform line charge 4, (©) Define surface current density and volume current density. (d) Write the difference between diamagnets, paramagnets and Ferromagnets 4e) What is meant by displacement current ? Give expression. (® Express Maxwell's oquations in matter. (2) Write short notes om vertical and horizontal polarization. ¢h) Write short notes an phase velocity and group velocity (8 8 = 40 marks} Tl. (a) Gi} Discuss electrostatic boundary conditions. (10 marks) fii) Express Gauss law in presence of dielectrics, (6 marks) Or ©) G4 Gphysical) electric dipole consists of two cqual and opposite (2q) separated by a distance ¢. Find the approximate potential at points far from the dipole. (10 marks) 4ii) Discuss on monopole and dipole terms, (6 marka) UL. fa) Aspherical shell, of radius 8, carrying a uniform surface charge o, is set spinning at angular velocity w. Find the vector potential it produces at points ingide and outside the sphere. (15 marke) Or (b). State and prove flux rule for motional e.m.f, (15 marke) IV. fa) State and prove Poynting theorem, (15 marks) Or (bh) Devive the wave equations for Hand B in vacuum and in conductors. (15 marks) ¥. (a) Derive Prosnel’s equations and Brewster's angle. (15 marks) Or (by @_ Disenss wave equations of transmission lines GF markst Gi) Give some applications of Smith chart. {4 marks} Gi) Write short acts om impedance matching. (A marks) (3% 15 = 60 marks]C 20747 (2 Pages) Name... Reg. N FIFTH SEMESTER B.Tech. (ENGINEERING) DEGREE EXAMINATION, JUNE 2008 EC 2K 503—ANALOG COMMUNICATION Time : Three Hours ‘Maximum : 100 Marks Answer all questions. I. (a) Given the random process X(t] = ¥,(f) = 3¥, (¢ - 3) where Y, (¢) and ¥, (#) are independent white noise processes each with a variance equal to 0.5. Determine the autocorrelation of X (2) (b) State and prove any feo properties of power spectral density. (e) Explain the causes and effects of zolar noise. (4) Explain about signal to noise ratio and noise figure of a receiver. (e} Define amplitude modulation and explain with waveforms and spectrum (f) Write short note on “Tracking” of a AM receiver. ig) Derive the relationship between phase modulation and frequeney modulation (h) Explain about de-emphasis cireuit in FM receiver. (8x5 = 40 marks) TL. (a) ‘Anclementary random proceas X (t), — =» <# where o* variance, p-correlation coefficient between X and Y. Show that probability of both X Rod have samnetmmetes eeu to ; - + sin “(p). (15 marks) TIL fa) Gi) Write short note on transit time noise. (7 marks) 4ii)_ Two resistors of 20 kQ and 60 kQ are at room temperature of 15°C at 290 K. Fora given bandwidth of 100 kHz. Determine the thermal noise voltage generated by the two resistors in parallel. {8 marks} Turn over(b) m @ () v. (ay 4b) ti) i) @ Gb Gi) ti) Gib a (ii 2 C2077 Derive the nnise voltage across the parallel RLC eircuit, (GF marks) A casended 2-stage amplifier has heen shown below; The first stage has a nofat figure of 2 dB and a power gain of 12 dB and the 2nd stage bas a noise figure of 6 dB and a power gain of 10 dB, Find the overall noise figure in AB rls PE = ed I Ale 1208 a Ist stage Tind stage (8 marks) Derive the power content in amplitude modulated signal, (7 marks) Draw the circuit of linear diode deteetor and explain. {8 marks) Or Explain the faetors that govern the choice of intermediate frequency. (7 marks) Derive the expression for the output SNR in coherent detection, (8 marks) Derive an expression for FM signal and explain with its spectrum, (7 marks) Determine the relative power of the carrier wave and side frequencies when modulation index m,= 0.2 for 10 kW FM transmitter. Assume J, (0.2) = 0.99 and J, (0.2) = 0.099. {8 marks) Or Draw the etreuit of Fuster- Seeley discriminator for FM detection and explain, (8 marks) Explain about FM threshold reduction, (7 marks) [4x 15 = 60 marks]C 20748 Name eg Me FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2006 EC 2K 504—LINEAR INTEGRATED CIRCUITS Time : Three Hours, Maximum : 100 Marks 1 @ ©) () @ fe) @o ® a 2 @ ) ) Answer all questions. Draw the basic differential amplifier and explain its operation. Define CMRR and PSRR. List the CMOS Op-Amp parameters. ‘What is meant by cascode input Op-Amp ? Draw the inverting and non-inverting Op-Amp circuits. ‘Draw the block diagram of 4-quadrant multiplier. Draw the twin-T configuration. Draw the ideal LPF and HPF characteristics. (8x5 = 40 marks) ‘Discuss the need for compensation and various compensation schemes used in Op-Amp circuits. Or Explain the various stages of an operational amplifier, Explain the operation of wide swing constant transconductance differential amplifier: Or Explain the principle of CMOS Op-Amp without compensation. Explain the concept of monostable and astable circuits, or Draw the circuit of log amplifier using twe Op-Amps and explain. Discuss the frequency transformations to obtain HPF, BPF and BEF from normalized prototype LPF Or Discuss the first and second orders all pass filter realirations. (4 x 15 = 60 marks)sae” © 20749 Name... Reg. No... a FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2006 EC 2K 505—COMPUTER ORGANIZATION AND ARCHITECTURE ‘Time : Three Hours ‘Maximum : 100 Marke L®& ®) What are Interrupt cycle and fetch cycle ? Explain. What is meant by Complexity of computing ? Explain. Explain the functions of memory subsystems. Explain in detail about associative memory. Give an account on, Magnetic medium and Magnetic head’. © Enumerate the digital recording methods. Explain any one method. ) ®) &) Explain the architecture of memory subsystem. Give an account on ‘PCA and MCA bus’. (8x 5 = 40 marks) Describe in detail different types of computer systems and their interfaces. Or Draw neat block diagrams of ALU and CPU. Explain their principle of operation. Explain in detail about memory array Organization. Or Write notes on : Explain in detail about magnetic tape drive and contreller disk drive. Or : * Explain in detail about UO data transfer techniques. Give an account on = 2 Pipeline Hazards. 2 Micro architecture of Computer System Or Describe in detail the architecture of Computer system. [4% 15 = 60 marks]eS C 20751 Name.. Reg. No. FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, JUNE 2006 BC 2K 506 C—DIGITAL MOS CIRCUITS. ‘Time : Three Hours Maximum : 100 Marks exueneenwe we Answer all questions, Each correct answer carries 6 marks, Deseribe channel length modulation. ‘What are the different ways of connecting MOSFETs serially ? ‘What are the various sources of power dissipation occurring in MOS inverters ? How is interconnect delay ealeulated ? Draw a full adder using MOS logic and explain. ‘Why and how voltage bootstrapping done in MOS circuits ? How is charge sharing carried out in domino logic ? Explain briefly true single phase clock logic. (8 x5 = 40 marks) Answer alll questions Each correct answer carries 15 marks. ‘Why and how does barrier lowering happen through drain ? Explain. or ‘Why does velocity get saturated due to charge carriers ? Explain using expressions. ‘Draw a NMOS loaded inverter and cxplain its superiority to other types. Or ‘What are the various delay times that aflect the performance of a CMOS inverter ? Define each one of them and give their practical values. What are the ways to minimize them 7 ‘Draw the circuit diagram and give the truth table for C? MOS latch. Explain its operation. Write down the characteristic equation too. Or ‘What is « transmission gate ? How is it different from conventional logic gates ? What are its merits ? Explain with a circuit diagram. ‘What is precharge/evaluate logic ? What is its feature ? Explain with neat diagrams. or Explain bow simple functions are realized using domine logic, considering some examples. (4 15 = 60 marks)