‘Time: eA aYAL 10. A 12, BE (FULL TIME) DEGREE END SEMESTER EXAMINATION APRIL/MAY 2014 ELECTRONICS & INSTRUMENTATION ENGINEERING BRANCH FIFTH SEMESTER (REGULATION 2008) EI 9301 / E1373 INDUSTRIAL INSTRUMENTATION - 1 3hr ‘Max Mark: 100 Answer All Questions Part — A (10 x 2= 20 Marks) . State the principle of stroboscope Draw a diagram showing the ion of the sttain gage in the proving ring and the placement of the strain gauge in the bridge circuit, What faotors affect the sensitivity of the ring? How a buoyaney gas balance instrument works. ‘Write the Baume standard adopted by the National Bureau of Standards. ‘What are the three basic pressure measuremeiit ‘What are elastic pressure gauges? Give two examples ‘How temperature is defined in ITS -90.above the melting point of silver Write the correction equation in °C for fully immersed thermometer and partial immersion thermometer. What metal are used for constructing J type and.K type thermocouple. State its polarity : ‘Why distance by spot ratio is important in IR thermometer PARTB - (5 x 16=80 marks) Hd i) Describe the construction end working of electrical balance. © ii) Describe the construction and working of magneto elastic and piezo electric load cell, (10) a) Discuss about the seismic displacement, seismic velocity and seismic acceleration transducer, (OR) b) With neat sketch, explain the principle of operation of float type densitometer and ultrasonic densitometer,13.a) i) Describe the construction and working of McLeond gauge and thermal conductive gauge. (12) ii) Draw different structures of bourdon tube 4) (OR) b) i) Explain, with neat sketch, the construction and working of piezo resistive pressure sensor, © ii) How pressure is measured using an elastic element with strain gauge. (6) iii) Draw different types of diaphragm and show how depth of corrugation influences the deflection (4 14, a) i) How industrial thermocouple are fabricated @ ii) Write the law of intermediate temperature and Jaw of intermediate metals (4) ii) Explain in detail about any four different types of reference junction compensation methods used for thermocouples. (8) (OR) b) i) Describe the construction and working of total radiation pyrometers and IR. thermometer a2) ii) How two colour radiation pyrometer differs from IR thermometer @) 15. a) i) Explain in dotail about two wire, three wire and four wire RTD connections. State the merit and demerit of each case. 2) ii) Draw a signal conditioning circuit for RTD @ (OR) b) i) State the sourees of error in filled in systems and how are they compensated 8) ii) Draw different types of bimetallic thermometer. Explain its working and state its application, 8)Roll No. B.E, (Full Time) Degree End Semester Examinations, April / May 2014 Department of Instrumentation Engineering V Sem B.E, (Electronics and Instrumentation Engineering) El 9303/El 083 Virtual Instrumentation (Regulation — 2008) Time: 3 Hours Max.Marks:100 Answer ALL Questions PART — A (10 X 2 = 20 Marks) 1, Define Virtual Instrumentation. 2. Sketch a typical FOR loop and the how to select the parameters of the same. 3. Define the resolution and accuracy of ADC, 4, Write the need for opto isolation, 5, List the features of MODBUS communication, 6. Write the popular protocols used in various layers of TCP/IP protocol. 7. Develop the V1 for first order level process. 8. Sketch the PID VI block and identify the inputs and outputs. 9, Define Virtual Laboratory. 10, Write any one virtual instrumentation application, PART - B (5x 16 14.(0) Explain the functioning of PC based DAQ card, (22) Gi) Write any two applications for Timers. @ 12{a) Describe the functioning of various units present in Virtual Instrumentation architecture and compare the features with conventional instruments, (oR) 12(b)(1)Write the function performed by formula node. ) (Gi) Discuss an application of your choice for the sequence structure. (42) 13 (a) (1) Write the features of USB communication, © (ii) Explain the operation of GPIB communication with timing diagram. (40) (oR) 13 (b)(i) Compare RS 232, RS 422 and RS 485, (6) (ii) Sketch and explain ISO/OSI Reference model. (10) 14(a) Develop front panel and block diagram for level process controlled by PID controller. (OR) 14(b) Develop the model of any process of your choice with controller. 15(@) Discuss the design of PC based oscilloscope with necessary hardware requirements and flowchart. (OR) 15 (b)(1) Discuss the hardware and software requirements for Virtual Laboratory. (8) (ii) Describe any one signal processing Vi application of your choice. @)ROLE NOS fee rere err B.E (Full Time) DEGREE END SEMESTER EXAMINATIONS, APRIL-MAY 2014 ELECTRONICS AND INSTRUMENTATION ENGINEERING FIFTH SEMESTER El 9302/El 371 CONTROL ENGINEERING (REGULATION 2008) Answer ALL Questions Time: 3 hours Max Mark: 100 Part-A (10 x 2 = 20 marks) ‘1. What is the effect of negative feedback on the noise of a control system? 2. State Mason’s gain formula and give the meaning of each notation. 3. Find the steady state error for unit step, unit ramp and unit parabolic inputs of the system whose transfer function is T(s)=100/{s2(0.1s+1)(0.01s+1)}. 4. Asecond order system has a 40% overshoot for a unit step input. What is Its damping ratio? 5. What is a minimum phase, non-minimum phase and all pass system? 6. Find analytically resonant peak, resonance frequency and bandwidth of the system whose transfer function is T(s)= 16/(s?+4.8s+16). 7. Check the stability of the system whose characteristic equation is 8"4857+18s7+16s+4=0. 8. State the magnitude and angle criteria of root locus technique. 9. What is a PID controller? How it can be realized using operational amplifier Based circuit? 10. State and give block diagrams of at least four type of controller configurations. Part-B (5 x 16 = 80 marks) 11) i) Discuss the structure, circuit realisation and identification of parameters based on frequency response of a lag compensator. (8)ii) Consider a unity feedback system whose open loop transfer function is G(s)=K/{s(0.1s+1)(s+1)}. Design a lead compensator such that the static velocity error constant Ky is 10sec", phase margin is 45° and gain margin is not less than 8 dB. (8) 12. a) i) Develop the transfer function model of a simple thermal system based on first principle. (5) ii) Describe briefly the structure and characteristic of AC servomotor. Obtain its transfer function model around an operating point. (6) iii) Reduce the block diagram of a system shown below and find C(s)/R(s). (5) =— R(s) —> ~% (G, Fi (OR) b) i) For the mechanical system shown below write system equations and obtain the transfer function X2(s)/F(s) B, 3% M, “7% B, K, M > C(s) (7)ii) Consider the control system whose signal flow graph is shown below. (9) Obtain the transfer function C(s)/R(s) using Mason’s gain formula. 13. a) i) Derive the expression for transient specifications of a second order system from its step response. (8) ii) A single loop feedback system has G(s)=Ki/{s(s+1)} and H(s)=1+Kas . Find Ki and Ke such that the peak overshoot of the system is 1.3% and the corresponding time is 1.06 sec. With that values find rise time and settling time. (3) (OR) b) i) Derive an expression for generalized error series for a feedback systems with inputs which are expressed as polynomials in time. 8) ii) Using generalized error series calculate the steady state error of a unity (8) feedback system having G(s}= 100/s(0.1s+1) for the input, r(t)=1+2t+t?/2. 14. a) i) The forward path transfer function of a unity feedback system is given as: K(s+1) GO) = > Se © = TrpoINd POINT TOs Using Bode plots find 1) the value of K for which gain margin of the system is 20dB. 2) the value of K for which phase margin of the system is 45°. (10) ii) Derive an expression for constant magnitude (M) circles of a closed loop system. Mention their properties. (6)(oR) b) i) For the unity feedback system with open loop transfer function K Gl ae (8) = (0.58 + 10.055 +) find using polar plot the phase and gain cross over frequency for K=1. (6) ii) Using Nichol’s chart to obtain the closed loop frequency response of a unity feedback system with forward transfer function G(3)= 10/(s(0.5s+1)(0.05s+1)} Hence find resonant peak, resonance frequency and bandwidth. (10) 15. a) i) Find the range of value of K for which the closed loop system will be stable whose open loop transfer function G(s)H(s) = K(s+1)/{s¢(s+4)(s+5)} using Routh table. (6) ii) Draw the root locus of a unity feedback system with forward path transfer function G(s)= K/{(s-+4)(s?+2s+4)}. Find the value of K for which the dominant closed loop poles have real part equal to -0.5. (10) (oR) b) i) Explain the principle of argument that is applied to Nyquist stability criterion. State Nyquist stability criterion of closed loop system interpreted through open loop Nyquist plot. (6) ii) Obtain the complete Nyquist plot for the following open loop transfer function and comment on the closed loop stability. G(s)H(s) = 2(s+0.25)/{s2(s#10(s+0.5)} (10)roan | | [I B.E/B.Tech ( FULL TIME) DEGREE END SEMESTER EXAMINATIONS, April/May 2014 Instrumentation Engineering Department Fifth semester £C9313/EI375 MICROPROCESSOR AND MICROCONTROLLER (Regulation 2008) Time: 3 Hours ‘Answer ALL Questions ‘Max. Marks 100 ©C@nNearena 1. PART-A (10 x 2 = 20 Marks) List the signals associated with Timing and Control unit of 8085 uP What is a stack? What is its function? How instructions are classified based on their length? Give one example in each ‘What do these instructions do? i)LDAX rp ii) STC Give the functions of the pins TXRDYand RTS of 8251 Define two key lock out and N-key rollover. ‘What are the segment registers available in 8086 1P? What are theit uses? ‘What is the function of XLAT instruction in 8086 uP What do you mean by bit jump and byte jump in 8051 HC. What is the use of TCON & TMOD function registers? Part - B (5 x 16 = 80 marks) (i) Draw the architecture of 8086 UP and explain. (10) (i)Explain the bus structure of 8085 uP. 6)12, 13, 14, 15. a) b) a) b) a) b) a) b) i) Draw and explain the timing diagram for the execution of the instruction LXIH,4500H. (8) il) Write a delay subroutine to create a delay of 5 seconds. (8) OR i) Give the addressing mode, size and function of the following instructions LDAX B, ORA B, CMA, DAD D. (8) ii) Write an Assembly Language program to sort ‘n’ numbers in ascending order. (8) Draw the architecture of 8265 PPI and explain the different modes of operation and command word formats. OR Explain the function of 8257 DMA controller with neat block diagram. How it can be interfaced with 8085 UP. i) Write an 8088 machine coding program to move a string in memory to a new string location which is just above the initial location (8) ii) Discuss about any four addressing modes of 8086 UP. @ OR i) Explain the physical memory organization in an 8086 system. (6) ii) Explain the function of the following signals of 8086 uP: 1).ALE_ 2).0T/R 3)DEN 4)LOCK 5) TEST SMNIMK T)RQ/GT 8)READY 9) MAG 10) BHE (10) i) Draw the 8051 architecture & discuss on internal and external memory organization. (12) il) Write an Assembly language program to multiply 2 strings, (4) OR Detail on the following (Timer operations in 8051 uC ,(i) Serial communication supported by 8051 1C.c = BE (FULL TIME) DEGREE END SEMESTER EXAMINATION APRIL/MAY 2014 ‘Time: ELECTRONICS & INSTRUMENTATION ENGINEERING BRANCH FIFTH SEMESTER (REGULATION 2008) E] 9021 / EI 071 FIBER OPTICS & LASER INSTRUMENTATION She ‘Max Mark: 100 Answer All Questions Part ~A (10 x 2=20 Marks) How graded index fiber is better than step index fiber Differentiate between APD and p-n junction photo diode A single mode step index fiber has a relative refractive.index difference of. 1% and a core refractive index of 1.5. The number of modes propagating at a wavelength of 1.3m is 1100, Estimate the diameter of the fiber core. 4, State the sources of error and compensation scheme in fiber optic sensor 5. What is meant by laser modes * 6, State the application where spatial coherence, temporal coherence and both are required for measurement using laser. Whai is meant by population inversion 8. How holograms are classified 10. ie 12, State any one type of laser and its specification which is used in the field of ophthalmology State the changes that take place during laser ~ cell interaction: PART B - (5x 16 = 80 marks) i.) Explain the following terms: meridian ray; skew ray, acceptance and critical angle for meridian ray, acceptance and critical angle for skew ray. 8) ii.) Describe the ‘construction and working of PIN photodiode and APD. State its merits and demerits, ® . a) Describe the construction and working of electro-optic modulator, magneto- optic modulator and bleachable dye modulator. State the merits and demerits of cach modulator. (OR)13. 14. 15. +) i) Explain the operation of optical pressure sensor which works on the principle of reflection concept, transmission concept, micro bending. concept and phase modulation type. (2) ii) Discuss in detail about any one interferometer method. (4) a) i) Explain in detail the generation of helium-neon laser with relevant encrey band diagram, Also explain how 0.632ym wavelength is selected by suppressing other two prominent wavelength of helium-neon laser ®) ii) With energy band diagram explain the generation of any one dye-laser. Explain the significance of triplet state and state the merit and demerits of liquid laser over gases and solid lasers @) (oR) b) i) Discuss in detail the properties of laser @) ii) Discuss in detail about Q-switching and mode locking ) a) i) How laser is used for the following material processing — heating, welding and melting, List out the specification and the type of laser used for these applications. 7 (12) ii) Discuss about different types of hetro structures of a semiconductor laser. State the merits and demerits of each structure, @ (OR) b) How distance, length, acceleration and velocity-are measured using laser. a) Discuss in detail about real time hologram, Double exposure hologram and ‘ime average hologram. Compare and state its application (OR) b) i) Discuss in detail about the application of laser in the field of medicine. (6) ii) How total losses, numerical aperture and the diameter of the optical fibers are determined. (10)[een T TELE TT B.E. DEGREE EXAMINATIONS, APRIL / MAY 2014 Electronics and Instrumentation Engineering Fifth Semester CS 9311 / EI 281 - DATA STRUCTURES AND ALGORITHM (Regulation 2008) ‘Time : Three hours Maximum ; 100 marks 10. i. 12. Answer ALL questions PART A — (10 x 2=20 marks) A 2D array P{-5:5, 0:5] is stored in a row major order with base address 2000 and byte size of 2. Find the address of the element P[2, 2]. Write the advantages of linked lists over arrays, ‘What are dequeues? Write the recursive function to define the HCF of two integers. Define binary search tree, What are threaded trees? Define Graph. Define minimum spanning tree of a graph. Write the conditions to define a hash function. Compare selection sort and bubble sort algorithms PART B— (5 x 16 = 80 marks) () Write the binary scarch algorithm to find an insert in an array. (4) Gi) Write algorithms to insert an item after a given location and to delete the first node in a singly linked list. (a2) (@) @) Write an algorithm to evaluate the postfix expression. © (ii) Write algorithms to insert and delete items in linear queue implemented with an array. (0) Or {b) Write an algorithm to insert and delete items in a pri implemented with a linked list. ity queue13. @ @ (ii) ) @ i Write a non-recursive algorithm to traverse a binary tree in pre- order. 0) Show the result of inserting 21, 10, 14, 35, 19, 3, 26 and 17 into an initially empty AVL tee. © Or Write an algorithm to find and insert an item in a binary search tree. (10) Create a heap tree by inserting 10, 23, 13, 1, 16, 51, 18, 25, 32, 9, 27 and 3, one at a time, into an initially empty heap tree, © 14, (a) Obtain the adjacency matrix, adjacency list and the path matrix from. the power matrix for the following graph. o) @ Gi) i. @ @ Gi) Write the Kruskal’s algorithm to find the minimum spanning tree of a graph and simulate it with an example. 0) Write the depth-first search and depth-first search algorithms to traverse a graph, 8) Explain with an example, the different techniques used in open addressing method to resolve collisions. (12) Sort the sequence 56, 30, 75, 54, 30, 90, 61, 12, 67 and 83 using insertion sort. a) Or () Write the non-recursive Quick sort algorithm and then simulate it with an example,Roll No B.E (Full Time) DEGREE END SEMESTER EXAMINATIONS, Nov/Dee 2014 DEPARTMENT OF INSTRUMENTATION ENGINEERING V SEMESTER EI8504 PROCESS CONTROL (R-2012) ‘Time : 3 Hours Max Marks :100 Answer ALL Questions PART-A —(10x2 =20 marks ) List four objectives of process control. How is the magnitude of differential gap selected in an on-off controller? Why is continuous cycling method not recommended for tuning controllers in some loops? Sketch the frequency response of a P+D controller. Define C, rating of a control valve. ‘What are the steps taken to avoid cavitation in a control valve? ‘What is split-range control? When is it used? Give a typical application of inferential control system. Find the thermal capacitance of a tank (80 em x 40 cm x 50 cm) which contains a liquid with specific gravity as 0.9, specific heat as 1.5 cal/gmy°C and temperature at 60°C, 10. A proportional controller has a range of 30 to 350 MP, and its proportional band is 20% Find the controller gain in mA/MP, , Pe AR ae PART-B (5x16 =80 marks ) 11. i) Explain the process reaction curve method of tuning controllers. How is this curve plotted in a control room? (8) ii) A thermal process consists of two time constants of 10 s and 25 s, The corresponding steady state gains are 0.9 and 3 respectively. When the setpoint is changed from 130°C to 170°C , the peak overshoot in the closed loop response is to be restricted to 8°C. Find the K, of the proportional controller. 8 12, a) i). What is meant by degrees of freedom of a process? Mention its significance. @ ii), Explain self regulation of a process with examples. @ ii) For the level process shown in figure, find the transfer function, "= (8) when hy= 3m, 5m, q = 60 Ipm , Ay = 0.8 m? and A, = 0.6 m’. (8)13. 14, 15. (OR) b)i) Bring out the difference between batch process and continuous process with examples. (4) ii) Explain the different types of heat exchangers used in process industry. 6) iii) Discuss any one procedure used to linearize a nonlinear system with an example. 6 a) i) Give the merits and demerits of using a three mode controller. @) ii) Draw the circuit diagram of an electronic PH controller and derive an expression for its output, (4) iii) What is meant by bumpless transfer? How is it done ? @ iv) AP+I controller has a PB of 25% and a reset time of 40s. At t=0, it is subjected to a step error of 3%, Find the time taken for the controller output to saturate, @ (OR) ‘b) i) Describe the nonlinear PID controller and PID controller with two degrees of freedom along with their applications, (10) ii) A second order process with a transfer function of Ges is controlled by a proportional controller(PB = 40%). Find the offset when the setpoint is changed from 28 to 32. © a) i) Explain with a sketch the working of a pneumatic actuator with positioner. Give the merits and demerits of using a positioner. (8) 4i) How are control valve bodies classified? Describe the characteristics of globe valve and butterfly valve with sketches. @&) (OR) b) i) Describe the working of an /P converter. @ ii) What is the difference between installed and inherent characteristics of a control valve? Explain the reason for the deviation of these two characteristics, © iii) What is meant by sizing of a control valve? Explain the importance of control valve sizing.(6) a) i) Explain FF-+FB control system with an example. Mention its advantages and disadvantages over FB control system. @) ii) Describe any two configurations of adaptive control system. ® (OR) b) i) What is cascade control? Explain with a block diagram and an example the advantages and limitations of cascade control system. (10) ii) Explain how the controller output is decided in a model predictive control system. ©vA [Rot No, LL | B.E/ B, TECH, (Full Time) DEGREE END SEMESTER EXAMINATIONS, OCT! NOV / DEC 2014 ELECTRONICS AND INSTRUMENTATION ENGINEERING V SEMESTER £1 8503 -PRINCIPLES OF DIGITAL SIGNAL PROCESSING (Regulation 2012) Time: 3 hour Max. Mari: 100 ‘Answer ALL Questions Part-A (10 x 2 = 20 Marks) Classify signals, Write any four advantages of digital signal processing. What is Decimation? Define Nyquist Rate. Write the conditions for stability of discrete time system in frequency domain. Find the IDTFT of X(ei) = eI”? fore 3. using convolution method (6) ENED ‘14a i) Explain time domain aliasing with relevant sketches. 4) il) Find the DFT ofa sequence x(n) = (1,1,1,4,1, 1, 1,0} using DIT-FFT algorithm, (12) Or (4b. Find the IDFT of the sequence X(k) = {10,—2 + j2,-2,-2 —j2} using direct computation method. Verify the result using DIF-FFT algorithm. (+8) 18a i) Design’a digital Butterworth filter using impulse invariant method for the following specifications: 08 <|H(e)[ <1. 0< w< 020 |H@*)|<02 06%<¢ w | | B.E/ B. TECH, (Full Time) DEGREE END SEMESTER EXAMINATIONS, OCT/ NOV/ DEC 2014 ELECTRONICS AND INSTRUMENTATION ENGINEERING V SEMESTER & s1//s 9302 -CONTROL ENGINEERING {Regulation 2008) Time: 3 hour Max. Mark: 100 Answer ALL Questions Part-A (10 x 2 = 20 Marks) ‘What are the effects of feedback on the system performance? Compare open loop and closed loop control systems. List out the standard test inputs used for system analysis. Define over damping. Mention the applications of Nichols chart. Write the advantages of frequency domain approach. State Routh's Hurwitz criterion. What is BIBO stable? Why compensation is required for control system? BOEeN@Peeona (0. Write the important characteristics of Lag compensator. Part-B (5 x 16 = 80 Marks) 111i) Determine the transfer function of block diagram shown Fig 1.using block diagram reduction technique. (8) Cts12a) Aunity feedback system has open loop transfer function G(s) = Find the undamped ma natura! frequency damping factor, peak time, rise time, peak overshoot and settling time. (10) ii) Find! the unit impulse response of a unity feedback system whose open loop transfer function is 6) = 345; @) Or 12b i) Explain the steady state error of control system using static error coefficients. Write its limitations. (8) il) A unity feedback control system has the forward path transfer function G(s) = 455. Find the generalized error coefficients and steady state error for the applied input r(t)=5t+10. (8) 13 ai) The open loop transfer function of control system is G(s) = Determine the resonant peak, ero resonant frequency and the bandwidth of the closed loop system. (8) ii) Explain the relation between time domain specifications and frequency domain specifications. (8) or 13 bi) Sketch the bode plot for the transfer function G(s)H(s) = ——S°— Determine wae Phase cross over frequency, Gain crossover frequency, Phase margin and Gain margin (12) ii) Explain the concept of relative stability with Gain Margin and Phase margin. 4) ‘14a |) Sketch the root locus for a unity feedback system having open loop transfer function G(s) = Scesheriy Determine the range of K for which the system is stable. (10) ii) Using Routh Hurwitz criterion, determine the stability of the system whose characteristic equation Is s? +9864 24s5 + 248% + 2483 + 245? + 23s + 1 =0. 6) Or 14b_ Sketch the Nya plot for the open loop transfer function of a unity feedback system G(S) = sayeeaszs: Comment on closed loop system stability. (16) 16a i) Explain the various types of compensator networks, Oy il) A unity feedback system has open loop transfer function G(s) = =“, Design a lead compensator to meet the following specifications -- Velocity error constant=12 sec". and phase margin = 40° (12) orbi) A certain unity feedback control system has forward path transfer function G(s) = aay Design a PID controller to achieve the following specifications:- Steady state etror for unit ramp input should be 0.1 peak overshoot for unit step input for the dominant roots is less than 16.3% and settling time for unit input is 5 sec for 2% tolerance (18)Reg. No. B.E. DEGREE EXAMINATION, NOVEMBER / DECEMBER 2014 Fifth Semester Electronics and Instrumentation Engineering, 18006 - FUNDAMENTALS OF DATA STRUCTURES AND ALGORITHMS (Regulation 2012) : ‘Time : Three hours Maximum : 100 marks Answer ALL questions PART A —(10 x 2= 20 marks) 1. A 3D array P{-2:7, 2:8, 1:9] is stored in a column major order with base address 8000 and byte size of 4. Find the address of the element Q[2, 4, 8]. 2. Write a function to insert an item into‘a stack. 3. Write the characteristics of priority queues. 4. Draw a binary tree for the expression (x * y + z) + ((a—b)/c). 8. Write the worst-case, average-case and best-case performances of bubble, insertion, merge and quick sorting, 6. Differentiate between AVL tree, binary search tree and complete binary tree. 7. Define Graph and Multi-graph. 8. Name the algorithms and their data structures used to examine the nodes of a graph. 9. _ List the points considered to define a better hash function. 10. What you mean by compaction? PART B— (5 x 16 = 80 marks) 11. () Write algorithms to insert a new node as a first node, as a last node and after a given node in a singly linked list. (12) (i) Convert the expression ((A + B) * C - (D - E) * (F + G)) to its equivalent prefix and postfix notations. 4) 12. (2) @) Write an algorithm to delete an item in a circular queue implemented with an array. Gi) Write the -non-recursive in-order traversal algorithm to traverse a binary tree. (10) Or (b) Write the algorithm to find and delete a data item in a binary search tree.13. 14, @ (b) @ b) @ ) (Write the heap sort algorithm which consists of two phases one to insert a data and another to delete the root and to re-heap in a heap tree. (12) (i) Obtain the AVL tree for the data 25, 31, 45,7, 8, 18, 22,16. (4) Or (Write the non-recursive quick-sort algorithm, Apply this to the array with the content 50, 47, 92, 78, 76, 7, 60, 36, 59, 30, 50, 43 and show the content of the array after the completion ofeach call. (12) (ii) Write the bubble sort algorithm to sort a set of numbers. 4 For the following graph, obtain the adjacency list, incidence matrix and the path matrix from the power matrix. Or (Write and explain how the Dijkstra’s algorithm is used to find a path from one node to another node. ) (ii) Write the Prim’s algorithm to obtain the minimum spanning tree of a graph and explain with an example. @) @ Discuss the separate chaining method to resolve collisions in hash functions with an example (8) (ii) Use extendible hashing with the initial hash function h(x) = x % 4 and a bucket size of 3 to create an index on a selation with the following search keys: 2, 3, 5, 7, 11, 17, 19, 23, 29 and 31. (8) Or (Discuss the hash functions division method, folding method and mid- square method with a suitable example. (0) (i) Obtain a 5-way B-tree by inserting the following keys into it. (6) 3, 7, 9, 23, 45, 1, 5, 14, 25, 24, 13, 11, 8, 19, 4, 31, 35 and 56.Reg No. BE DEGREE END SEMESTER EXAMINATIONS, Oct/Nov. 2014 ELECTRONICS AND INSTRUMENTATION V SEMESTER £19021 FIBER OPTICS AND LASER INSTRUMENTATION (R - 2008) Time: 3 Hour Maximum Mark: 100 Answer all questions PART ~ A (10x2=20 marks) 1, Brief how the refractive index of the core and cladding influences total internal reflection? 2. Which type of optical fiber minimized modal dispersion? 3. Bring out the difference in principle between Intrinsic and Extrinsic Fiber optic Sensor. 4. Differentiate extemal and direct optical modulation 5. Explain how population inversion is achieved in four level laser system? 6. List the materials that can serve as excimer lasers. 7. How laser can be used for current measurement? 8. What happens when laser interacts with tissue? 9. Bring out few applications where holography is used? 10. How laser is used in skin treatment? PART - B (5x16=80 Marks) 11. Explain the use of Laser in industrial material processing (16) 12. a. Elaborate about the various types of optical fiber and its significance? (16) OR b. Write short note on i. LED as an Optical source for a fiber link ii, Avalanche photodiode as optical detector (8+8)43. a, Discuss about the working principle of Optical Time Domain Reflectometer used for fiber attenuation measurement. List out its advantages over other loss measurement methods. OR (16) b. Explain how optical fibers are used as Temperature, Pressure, Displacement and level sensors. 14. a. Bring out the different modes of operation of laser for Ultra short pulse generation. OR b. Explain about any one type of solid and gas laser and its working principle 15. a. Explain about the role of Holography in non destructive testing of materials OR b, Bring out the use of lasers in plastic surgery and tumor removal. (16) (16) (16) (16)B.E Full Time) DEGREE END SEMESTER EXAMINATION OCT/NOV 2014 INSTRUMENTATION ENGINEERING FIFTH SEMESTER, EI 8011 POWER ELECRONIC DEVICES AND CIRCUITS (REGULATION 2012) Time: 3 Hours Answer ALL Questions Max Mark:100 Part-A (10 x2 =20 Marks) 1. The reverse recovery time of a power diode is 6s and the rate of fall of the diode current is 40A/js. Determine the storage charge and the peak reverse current. What is the effect of high dv/dt on SCR? How SCR can be protected from it? A 1-phase full wave bidirectional ac controller is supplied from a 120V (rms), 50 Hz source. If the firing angle is 30° determine the rms output voltage. 4. What is overlap angle in the operation of controlled rectifiers? 5. How a second quadrant de to de converter operates? 6. What are the functional elements of a switching mode regulator? 7. A 1-phase half bridge inverter has a input de voltage of 48V. Determine its THD. 8 9. 1 ee . List and draw different switch configurations used in ZCS resonant converters, Briefly explain the concept of vector control of ac drives, (0. What is the objective of FACT and capabilities of FACT controllers? Part-B (5 x 16 = 80 Marks) 11. i) With structural diagram and equivalent circuit explain the principle of operation of MCT. (10) ii) What kind of techniques are used for voltage equalization across series connected SCRs. How values of equalizing components are determined? (6) 12, a) i) Describe the operation of a 3-phase fully controlled bridge rectifier supplying a RLE load using necessary circuit and waveforms. Derive the expression for ts and average output voltages, (12) ii) Derive the relationship between the firing angles of two converters used in a circulating current type dual converter. What are the merits and demerits of this type of dual converter, @ (OR)b) i) A 3-phase fall converter is connected to a 400V,S0Hz supply. The load current is continuous and ripple free. If the average load current is 120A and source commutating inductance is 0.2mH, determine the overlap angle when the firing angle is 24°. @ ii) Discuss in detail the salient features and operating principle of “PWM controlled 1-phase ac voltage controller” and “matrix converter”. (12) 13.a) i) With equivalent cireuit and waveforms explain the different modes of operation of a step down de chopper. Derive an expression for peak to peak ripple current and condition for continuous load current. (10) i) How a four quadrant chopper operates? Explain with circuit diagram. (6) (OR) b) Explain the different modes of operation of a boost regulator with necessary circuits and waveforms. Derive an expression for peak to peak inductor current ripple and condition for continuous inductor current and capacitor voltage. 14,9) i) With suitable circuit diagrams and waveforms describe the principle of ‘operation of a 3-phase bridge inverter in 180° mode, Write the expression for instantaneous line and phase voltages. (10) ii) Discuss in detail the sinusoidal PWM technique for voltage and waveform control of bridge inverters. © (OR) b) i) With a circuit explain the operating principle of a half bridge series resonant inverter. @) ii) Explain the different modes of operation of a class E resonant inverter with circuits and waveforms. (8) 15.a) i) With a block diagram explain the closed loop control of a separately excited de shunt motor including field weakening. (10) ii) What is TCR and TSC? With a schematic diagram briefly explain the function of a static VAR compensator. ©) (OR) b) i) Explain with a block diagram the closed loop control of a 3-phase induetion motor by slip regulation scheme employing vif control and VSI 8) ii) Explain the different modes of operation of a flyback converter type switched mode power supply with a circuit and waveforms. (8)Reg. No. BE, B.TECH (FULL TIME) SEMESTER EXAMINATION Nov 2014 ELECTRONICS AND INSTRUMENTATION ENGINEERING Exaeg/' 'E19352 PROCESS CONTROL(R-2008) Time: Three hours : Maximum marks: 100 Answer ALL questions. PART A (10 x2 = 20 marks) 1. What do you mean by self regulation of a process? Differentiate in between interacting and non-interacting systems. Define ‘differential gap” of on-off controller. Discuss the factors that govern the choice of control mode for a given process. Why cavitation and flashing occur in control valve? aA Pen Draw the inherent valve characteristics of Linear, quick opening and equal percentage valves. 7. What do you mean by optimum controller tuning? 8. Write the significance of ISE and ITAE. 9. List the merits of FF+EB control over FB control system. 10, What is inferential control? PART B (5 x 16 = 80 marks) 11.1) Obtain the transfer function model of two capacity interacting liquid level system.(10) ii) Explain the steps involved in the formulation of the mathematical model. © 12a) Explain the procedure for obtaining the tuning parameters of a electronic PID controller. (16) or 12.(b) §) Describe the characteristics of derivative control action. Why is it not used alone? 8) ii) Explain why offset oceurs in a closed loop with Proportional controller. Also explain how it can be reduced. (8)13)(a)Discuss the factors to be considered before the selection of control valve for a given application. (16) or : 13)(b) i) Explain the principle of actuator with positioner and also list its merits and demerits, 8). ii) Explain the working of current to pressure converter and mention its applications. ) 14 (@) Explain the procedure for obtaining the Process reaction curve of a process and also explain how the tuning parameters of the controller can be obtained. (16) Or 14 (b) Explain how the frequency response method can be used to tune a process control loop. (26) 15. (a) i)Explain how two controllers in a cascade control system are tuned. (8) ii) Describe Model predictive control system (8) Or 15, (b) i) What is split range control? Explain it with a suitable example, 8) ii) With neat diagram explain any one type of adaptive control scheme. oyRoll No. B.E/ B.Tech ( Full Time ) DEGREE END SEMESTER EXAMINATIONS, APR / MAY 2014 COMPUTER SCIENCE AND ENGINEERING / INFORMATION TECHNOLOGY FIFTH Semester C9301 OBJECT ORIENTED ANALYSIS AND DESIGN (Regulation 2008) Time : 3 Hours ‘Answer ALL Questions Max. Marks 100 PART-A (10 x 2 = 20-Marks) What is object orientation? Draw a sample state diagram. List some of the ways to find conceptual classes. Draw an example sequence diagram and explain. Draw a figure which explains the idea of using Layers. List different types of visibility. ‘What are different ways that people wish to apply UML. Discuss the nature of UML tools. Explain the Polymorphism patter. 0. Desoribe any one of the GoF patterns. BOSONS HABHOE Part~B (5 x 16 = 80 marks) 11. Fora cricket score board display, (i) determine the system boundary, primary actors and goals (4) (i) identify use cases (6) (ii) write a brief use case for one of them. (6) 12. a) (i) Discuss the concept of multiplicity of links and associations in class modeling using appropriate diagrams. (8) (il) Describe some of the elements of supplementary specifications. (8) OR b) (@ Discuss the concept of branches in activity models in interaction modeling using appropriate diagrams. (8) (ii) Describe some of the sections of operation contracts. (8)43. 14, 15, ») a) b) () Clearly draw and explain each of the different sequence diagram notations, OR () Clearly draw and explain each of the communication diagram notations. Use an example and describe the steps in how designs are mapped to code. OR Use an example and describe the steps in test-driven development and refactoring, Write short notes on (i) Architectural Analysis (8) (ii) Package design (8) OR Write short notes on (|) Logical architecture refinement (8) Gi) Persistence framework (8)Roll No. B.E/ B.Tech ( Full Time ) DEGREE END SEMESTER EXAMINATIONS, APRIL / MAY 2014 COMPUTER SCIENCE AND ENGINEERING Fifth Semester CS 282 / CS 9302 - THEORY OF COMPUTATION (Regulations 2004/2008) Time : 3 Hours Answer ALL Questions Max. Marks 100 PART-A (10 x 2 = 20 Marks) 4. Convert the following e-NFA to DFA, =a iv ~ | sph xt| fpatl td 2. Design a nondeterministic finite automaton to accept the set of all strings containing either 101 or 110 as substring, over the alphabet {0,1}*. Convert the following regular expression to NFA with «- transitions: (01+4)* 4, Write a regular expression that recognizes the set of all strings that do not contain the substring 1011 over the alphabet (0+1)*, 5. — Show that the following grammar is ambiguous: $ > SbS|a Consider the context-free grammar given below. Give the leftmost derivation for the string bbaa using the grammar. $> bS|aT le T> aT|bUle "yale 7. If Lis a context-free language, then prove that Lis also a CFL. 8. Consider the Turing machine M = (qo, dn G2 dr h (0, 1h (0, 1, 8) 5, do. Bar}. Describe the language L(M) if & consists of the following set of rules: (40,0) = (a1, 1, R) 0(q1.1) = ( go, 0, R) 5(qnB) = (qn B, 9. Prove that if a language Land its complement are recursively enumerable, then L is recursive.10. 11. 12. 13. Give the binary cade for the Turing machine M = (qo, dx 92. da Gah (0, 1}, {0. 1, 8}, 5, qo. B, qs) where is given as qx, 0, R) 2, 0, R) qs. 1, R) Qs, 1, L) qs, 1, R) Ga 1b) qa 1, RY (qs,B) = (qz, 1, L) Part - B (5 x 16 = 80 marks) ()) Prove using structural induction that every tree has one more node than it has edges. (4), (ii) Construct a DFA that will accept the set of all strings which do not contain 001 over the alphabet {0, 1}. ©) (il) ID = (Qo, &, Bo, {qo Fo) is the DFA constructed from NFA N= (Qu, E, By do, Fu) by the subset construction, then prove that L(D) = L(N). ©) @) (Prove using Pumping lemma that the language {0” | n is a perfect square} is not regular. @) (ii) Prove that regular languages are closed under union and intersection. (8) OR ») (Consider the DFA given by the following transition table. Construct the minimum state equivalent DFA using the table filing algorithm, @ Vs {i)Consider the DFA given below: Give all the regular expressions Ry®. Simplify the expressions as much as possible, @) a) (i) Find a context-free grammar generating the language {a'b'c" | i= j+k} (10) Gi) Convert the grammar 5 SOSISOS | SOSOSIS | SISOSOS| toa PDA that accepts the same language by empty stack ) OR b) (i) IfL = M(Px) for some PDA Py = (Q, E, F, by, qo, Zo) that accepts by empty stack, then prove that there is a PDA P, that accepts by final state such that L = L(Pe).14. 15. b) b) (6) (ii) Design a push down automaton to accept the language {0"170"1" | m, n 21} over the alphabet {0, 1)". (10) (i Simplify the following grammar and convert to Chomsky Normal Form. (8) SABC | BaB A> aA|BaC| aaa B> bBb|a|D C>CALAC Dee (ii) If a context free grammar G; is constructed after eliminating SbS| a Consider the context-free grammar given below. Give the lefimost derivation for the string-bbaa using the grammar. S>bS|aT |e TP al |bUle “Uda le If Lis a context-free language, then prove that Lis also a CFL. Consider the Turing machine M = ((qo, dr. dz 4} (0, 1h {0, 1, BY Go, B. (ar). Describe the language L(M) if 5 consists of the following set of rules: 0(qo,0) = (4 1, R) (441) = (qo, 0, R) (91,8) = (4 BR) Prove that if a language L and its complement are recursively enumerable, then L is recursive.10. "1 12. | 13. Give the binary code for the Turing machine M = (qo, 9, dar dar Mh {0, 1}, (0, 1, 8}, 3, qo, 8, q4) where 5 is given as &(qo.0) = (gx, 0, R) 6(q1,0) = (gz. 0, R) 6(q2.0) = (qa, 1, R) 8(d2,1) = (dss 1, L) 8(42,B) = (qo, 1, R) 5(qs,0) = (ga, 1, L) 8(qs,1) = (ga 1, R) 5(qs.B) = (qa, 1.) Part—B (5 x 16 = 80 marks) (i) Prove using structural induction that every tree has one more node than it has edges. @) (ij) Construct a DFA that will accept the set of all strings which do not contain 001 over the alphabet {0,1}. ©) (iil) If D = (Qo,:2, Bo, {qo}, Fo) is the DFA constructed from NFA N = (Qu, 2 Om dos Fn) by the subset construction, then prove that L(D) = L(N). 6) a) () Prove using Pumping lemma that the language {0” | n is a perfect square} is not regular. (8) (ij) Prove that regular languages are closed under union and intersection. (8) OR b) (Consider the DFA given by the following transition table. Construct the minimum state equivalent DFA using the table filling algorithm. 8) (i)Consider the DFA given below: Give all the regular expressions Ri. Simplify the expressions as much as possible. (8) &4 ° 4 PU) V2 VN Ye) 43 * A Ga 2 a) (i) Find a context-free grammar generating the language {aH | i= j+k} (10) (i) Convert the grammar S> SOS1SOS | SOSOSIS | SLSOSOS | € fo a PDA that accepts the same language by empty stack ©) OR b) (If L = N(Py) for some PDA Py = (Q, £, F, by, do, Zo) thal accepts by empty stack, then prove that there is a PDA P; that accepts by final state such that L = L(Pr).14. 15. b) b) 6) (i) Design a push down automaton to accept the language {0170"1" | m, n 21} over the alphabet {0,1}*. (10) ()) Simplify the following grammar and convert to Chomsky Normal Form. (8) SABC | BaB A> aA|BaC | aaa B> bBb\a|D > CA|AC De (i) fa context free grammar G; is constructed after eliminating ¢-productions from the context free grammar G, prove that L(G;) = L(G)-«. 8) OR ( Design a Turing machine that will accept the language {ww* | w is any string of Os and 1s). @) {ii) Design a Turing machine that will increment the binary number given as input by one. @) () Define Ly the diagonal language. Prove that Ly is not recursively enumerable (6) (i)Prove that Ly, the universal language is recursively enumerable but not recursive, (10) OR (i) IfLis a recursive language, prove that the complement of L is also recursive (5) (ii) Define Lys, the nonempty language. Prove that Lye is recursively enumerable. (6) (ii) Define Post's Correspondence Problem. Explain with an example, ©)Roll No. B.E/ B.Tech (Full Time) DEGREE END SEMESTER EXAMINATIONS, APR / MAY 2014 COMPUTER SCIENCE AND ENGINEERING Fifth Semester €89304/CS481 Artificial Intelligence (Regulation 2008) Time : 3 Hours Answer ALL Questions Max. Marks 100 PART-A (10 x 2 = 20 Marks) 1. Define: Agent 2. What are the key features and limitations of Depth First Search? 3, What is a constraint satisfaction problem? 4, How chance nodes are helpful? 5. _ Represent few properties of categories. 6. Give the axioms of probability. 7. Whatis inductive learning? 8. Whatis Okhams razor? 9. How to overcome the ambiguity in natural language? 10. What is localization? Give the techniques available for it. Part - B ( 5 x 16 = 80 marks) 11. (1) Discuss about the various kinds of agents and their properties with neat diagram. (10) ci) How to avoid repeated search? (6) 42.) i) Prove that A* search technique is optimal and complete. (10) ii) Compare and contrast Hill climbing with simulated annealing search. ) (OR) b) 1) Describe backtracking search for the constraint satisfaction problem? ® ii) With a neat diagram, explain Alpha-beta pruning method. @) 13. a) i) Represent the following sentences in First Order Logic. (10) a) Parent and child are inverse relations. b) Two sets are equal if and only if each is a subset of the other.») 14. a) ») a) b) c) Connected is a commutative predicate d) Every student who takes French passes it. ) No person buys an expensive policy ii) Write short notes on : Backward chaining. 6) oR i) Discuss about Mental events and mental objects. ) ii) Describe Truth Maintenance systems in detail. (8) i) Present the importance of Decision tree learning and Construct decision tree for the given problem, (16) Table 14.2.) learning decision tree examples [Weekend (Example) feather [Parents Money Decision (Category) _ we unny Yes Rich | ‘Sunny [No at [Rich aay Yes (Rich [Cinema | Slay in jainy Windy” Windy jNo Rich ‘Shopping cor Fiera (Windy Yes 'Rich ‘Cinema | oR i) With neat algorithms, explain Passive Reinforcement Learning in detail (18) i) Explain the component steps of communication in detail. (10) il) write short notes on : Syntactic Analysis. ©) oR Write short notes on: i) mage Processing ®) ii) Robotic Perception @)Roll No. END SEMESTER EXAMINATIONS, Nov / Dec 2014 COMPUTER SCIENCE AND ENGINEERING V Semester CS8501 — DATA COMMUNICATION AND COMPUTER NETWORKS (Regulation 2012) Time: 3 Hours Answer ALL Questions Max. Marks 100 1. 12. ART-A (10 x 2 = 20 Mi: If there are n layers in a network protocol stack, and each layer adds a header of h bytes, how many bytes are transmitted into the network ? Suppose that you send an e-mail message whose only data is a Microsoft excel altachment. What would the header lines look like ? You are to design a reliable byte stream protocol using sliding window protocol. This protocol will run over a 1 Gbps network. The RTT of the network is 200ms. How many bits would you include in the Advertised Window field of your protocol ? When closing a TCP connection, why is the two-segmentlifetime timeout not necessary on the transition from LAST_ACK to CLOSED ?. Ifa UDP datagram is sent from host A, port P to host B, port Q, but there is no process listening to port Q at host B. What is B expected to do ? How will A know that such an event has happened ? Perform CIDR aggregation on the following /24 IP addresses: 128:56,24.0/24; 128.56.25.0/24; 128.56.26.0/24; 128.56.27.0/24 Determine the number of bits for the sequence number field in a sliding: window protocol fora 1 Mbps link with a one-way latency of 1.25 secs, assuming that each frame carries 1KB of data. Assuming, a framing protocol that-uses bit stuffing, show the bit sequence transmitted over a ‘link when the frame contains. the ~—bit_—-sequence 41414041111010011111101011111110. Mark the stuffed bits. Where are scrambling techniques used ? Why ? What are the transmission impairments that can occur in a communication system ? Part— B (5x 16 = 80 marks) (Question No.11 is Compulsory) (i) Trace the events that take place from the time you type www.20 ym/index in your web browser to the time that the page gets displayed to you. Give full details of all the protocol steps involved at all levels of the network stack. (10) (i) What is the role of the local name server and the authoritative name.serverin DNS? What are the resource records maintained in each of them ? © a) (i) Trace the TCP finite state machine transitions for twosites that execute a passive and an active open and step through the three-way handshake. (10)13. 14, 15. b) b) b) b) (il) Assume that one side transfers 512KB of data in packets of 16KB to tr. side. If the network is congested and every fifth packet is lost, show the sequ of packets that will be transmitted. How long’ will it take for the transfer complete? ) (oR) {) Discuss in detail about the Random early detection mechanisms used to avoid congestion in TCP. EHC) (i) Explain the silly window syndrome in TCP. How is it avoided? © (i) Design a subnet scheme to share a class-B address of 132.32 among 3 networks with 500 nodes and one network with 2000 nodes. (10) (i) Give the forwarding tables for switches 81 to S3 for all pairs of source and destinations of he folowing vitual crit network. 3) c D | 1 1 12 12 |2 A—- St HAS Qin SFE 13 43 13 (oR) (() Explain link-state routing protocol using the following sample network (w.rt node A). (40) 2r\4 M4 rN\ \ Am Bee 9 1 (ii) What is the necessity for the ARP protocol with {Pv4?: How is it avoided. in IPve? (6) (i) Explain and compare the IEEE 8025 and FDDI approaches to token ring networks, (10) (ii) Explain the hidden node and exposed node’ problems that occur in wireless networks: How are they avoided in the 802.11 networks? ©) (OR) () Discuss the sender side and receiver side functions of.an Ethemet adapter. Discuss the necessity for a minimum size of an Ethemet frame. (10) {i Suppose we want to transmit a message 1011000111101 and protect it from errors using the CRC polynomial x® + x’ + x + 4. Determine the CRC bits to be added, If an error occurs in the left most bit, show that this CRC will help detect the error. © () Discuss the characteristics of the different transmission media of wired networks. (10) (ity Discuss the sender side and receiver side functions of frequency hopping spread spectrum technique. ©) (OR) (}) Explain and compare the PCM and DM techniques to send analog data using digital channels. (10) (i) Encode the bit pattern 1011000111 using ASK, BFSK, and QPSK. ©{ Roll No. [ ay END SEMESTER EXAMINATIONS, Nov / Dec 2014 ( Computer Science and Engineering Semester V ©§8502- MICROPROCESSORS AND MICRO CONTROLLERS. (Regulation 2012) ; Time: 3 Hours Answer ALL Questions Max. Marks 100 Rewea a " 12. 13, PART-A (10 x 2 = 20 Marks) ‘The instructions in which BC and DE register pairs act as memory pointers. How does SIM instruction interpret the contents of the accumulator? Discuss the functions of the following instructions i) IDIV BX ii) TEST Write an 8088 ALP to perform the code conversion from BCD to excess-3 using XLAT instruction. How are the control signals generated in maximum mode of 8086? Mention the signals that are used for separating address and data from the multiplexed ADO-AD15, A16/§3-A19/36 bus of 8086. Write about Transmitter and Receiver signals of USART. Draw and write the cascaded mode of 8259. ‘What is the difference between a microprocessor and micro controller? In 8051 which bits of the PSW are responsible for selection of register banks? Part - B (5 x 16 = 80 marks (Question No.14 is Compulsory) i) Explain with a diagram the architecture of 8086 microprocessor? (10) ii) Explain how the processor utilization can be improved in a multiprocessor system by an instruction queue. 6) a) i) Show the allocated space and initialized data caused by the following statements DATA DB 10,6,-6,10H, ?. WORD_VAR DW 5 DUP(O,1,2,5),?,"MP”,10,256H (Show it row wise) (8) ji) Write an 8085 ALP to count continuously in hexadecimal from FFH to OOH in a system with clock frequency of 2MHz. Set up a one millisecond delay between each count. (8) (OR) b) 1) Discuss the interrupt structure of 8085 microprocessor ® i) Write an 8086 ALP to explain the functions of string primitives ® a) i) Compare and contrast various multiprocessor configurations of 8086. (8) ii) Explain the various bus access logic used to resolve bus arbitration problem in loosely coupled multiprocessor configuration. (8)14. 15, b) b) a) ») (OR) Assume that a loosely coupled multi processor system consists of the following two modules: Module A ~ An 8086 with a local memory Module B ~ An 8086 and an 8087 Determine the major bus interface devices required for each module. (16) Discuss the operation of a DMA controller and its interfacing with 8085 processor (16) (OR) i) Discuss the various modes of operation of Programmable Peripheral Interface and its interfacing with 8085 processor (12) ‘Write an ALP to set and reset bits of PC3 and PCS of 8255. (4) {)Draw and explain the architecture of 8051 microcontroller @) {i) Explain the arithmetic instructions of 8051 with suitable examples (8) (OR) ’) Draw and explain the interfacing of 4 KB external ROM memory with 8051 (8) ii) Assume that RAM locations 40-44 have the five values. Write an 8051 ALP to find the given number from the set of values. ®ewe TT TTT TI B.E, / B.TECH. (FULL TIME) DEGREE END SEMESTER EXAMINATIONS, NOV/DEC 2014 ‘Computer Science and Engineering FIFTH SEMESTER (CS8503 - SYSTEM SOFTWARE INTERNALS (Regulations 2012) Time: 3 Hours Max. Marks:|100 Answer All Questions PART-A (10 x 2= 20 Marks) { How are literals processed? Explain with an example. How relocation is handled in SIC machines? ‘What are the data structures used in one pass assembler? ‘Comment on the machine independent features of a loader. What is recursive macro expansion? Explain. ‘Compare and contrast binary translator with interpreter. Give a brief idea about object oriented VM. ‘What is dynamic class loading? List out the characteristics of Grid computing. . Explain the techniques used in virtualization giving emphasis to a commercial ©PPNBRAARONS 3 hypervisor. Pa 5x16 30 marks) 11. a) Explain the design of a linkirig loader with a suitable example and working algorithms. (12) b) What are the various loader design options? Explain. @) 12. a) i. Explain the architecture of SIC/XE. (10) ii. Assemble the following SICIXE source program. Show the symbol table, literal table and the corresponding object code. ) SUM START 1000 (opcode) FIRST LOX #0 04 LDA 40 00 LOOP ADD TABLE,X 18 TK =P'30° 2c JuT LOOP 38 STA TOTAL oc (P.1.0.)RSUB ac ‘TORG TABLE WORD 10, 15, 20, 25, 30, 35, 40, 45, 50, 55. TOTAL RESW 1 END FIRST OR b) Explain the design of assembler for control sections. Write suitable algorithms. 13.) Illustrate the design of one pass macroprocessor. With a suitable example show the simulation for the design. Write the algorithms. OR b) Explain the design of instruction set emulation. Write in brief about the various issues to be handled in emulation. 14. a) What is the need of virtual machines? Explain in detail the taxonomy of VMs. OR b) i. Explain the architecture of JVM. (10) ii, What are the drawbacks of virtualizing a conventional ISA? Justify how they are overcome in V-ISA? ©) 15. a) i, Discuss the various techniques used for garbage collection. (10) ii, Explain how migration is handled in VM. ©) OR b) i, What is the need of profiling? Explain the various techniques used in profiling. (10) ii, Write a short note on code optimization. (6)Roll No. | | B.E/ B.Tech (Full Time ) DEGREE END SEMESTER EXAMINATIONS, NOV / DEC 2014 Common to Computer Science and Engineering and Information Technology V Semester CS 8554 - Object Oriented Analysis and Design (Regulation 2012) Time: 3 Hours Answer ALL Questions Max. Marks 100 PAR’ 10 x 2 = 20 Marks Distinguish between Class and Object Diagrams . Explain “Design by Contract” Illustrate Public, Private & Protected Classes with a design example. How are the classes designed to minimize the Change Impact? Ilustrate Class, Responsibility and Collaboration in an ATM, How does the “Template Pattern’ simplify the Database Design? Distinguish between the Traditional & Extreme Programming. Distinguish between a Package and a Component. eer oars one How does “Object Constraint Language" reflect change in requirements? How is “Inheritance” modeled? 3 Part — B ( 5 x 16 = 80 mark: 11. Using the design and development of a software controlled elevator in a 5 - storey building illustrate the way UML facilitates Iteration, Parallel and Incremental Development. The following functionalities of the Software may be assumed. (18) a. Peak Hour Management b. Emergency Controls ¢, Generating Usage Patterns d, Security Measures including Surveillance Checks 12, @) How are Evolutionary Requirements specified using the Object Oriented Analysis. (16) (OR)b) a) ») a) ) a) b) wre LITT TTT How does the Domain Knowledge simplify the Analysis? Illustrate using a Telephone Billing System. (16) Design a framework using OOAD to improve the Quality of Service for i) Video Analysis (8) ii) Movie and Music players across the networks (8) The QoS parameters include Machine Scalability, No Jitter and No loss of frames. (OR) Explain various GRASP Patterns? Illustrate with examples. (18) Identify EIGHT test cases for an online Railway reservation system? Specify ‘the design of the system for which the test — cases are identified. (16) (OR) Distinguish between “Software Reuse” and “Software Refactoring’ using online screening test to shortlist candidates for the job interview. (18) Specify any four patterns to illustrate Responsibilities and Relationships in a Dems, (18) (OR) How does the package design improve the Reliabil , Efficiency, Maintainability and integration of the subsystems? (16)Roll No. LI] ; [ E/ B.Tech ( Full Time ) DEGREE END SEMESTER EXAMINATIONS, OCT/NOVIDEC 2014 COMPUTER SCIENCE AND ewowneerne Ap T FIFTH Semester $9301 - OBJECT ORIENTED ANALYSIS AND DESIGN (Regulation 2008) Time: 3 Hours Answer ALL Questions Max. Marks 100 " 12, Pal (40 x 2 = 20 Marks} 1. What do you mean by the term “analysis"?How is it different from "Design"? 2. Define Qualified association with example. 3. List the characteristics of unified process. 4, Whats operation contract? 5. Drawa state diagram only for the SoundingAlarm object of the timer system. 6. What kind of responsibilities do each object should contain in the design of software objects? 7. List out the asserts in Junit. 8. Give your comments for "UML as Programming Language". 9. What do you mean by patterns? 10. State the guidelines to refine logical architecture. Part — B (5x 16 = 80 marks) Design a Use case model and sequence diagram for each use case to the following application. (18) A smart phone application that uses a camera and head phones to guide the blind people. It should support the following features, ()To identify everyday items such as food, clothes, key etc., (i)To read books or bill receipt, identify colors, etc., (ii)To navigate(turn left,right,straight,stop) inside the building or outdoors to warn obstacles through voice indication. Identity and add any other two features to guide blind people and justify its importance. a) Design a class diagram for the agricultural information system. Show the muttipliciy, attributes, operations and various relationships that exhibits in the given model. (16) The agricultural information system provides its Farmers and researches to get online information about fertlizer, research institutes and researches, land availability, diseases, suitable soil concentration for the corresponding crops, subsidies, statistical information about exports and etc. The system should allow updating facilities only by the authorized persons in the corresponding institutes. (oR) b) What is FURPS+? Explain the FURPS+ requirement attributes and artifacts for Gmail login screen? (16)13. 44, 15, b) (Explain object design for Monopoly game system using GRASP patterns? (10) {i)Write short notes about logical layered architecture and its importance. (6) (OR) (What is use-case realization? Explain any two use-case realization for point sale system. (8) (i)What is visibility? Explain the four different ways to establish visibility between objects. ® (DExplain the test-criven development and its advantages with example? (8) (Explain the different methods of refactoring with examples? ® (OR) Explain the concept of mapping designs to code for online-shopping system? (16) Explain the concept of GoF patterns with example (18) (OR) Explain the persistence framework pattems with example? (16)B.E/ B.Tech (Full Time) DEGREE END SEMESTER EXAMINATIONS, NOV/DEC 2014 COMPUTER SCIENCE AND ENGINEERING Fifth Semester CS481/6S9304 Artificial Intelligence (Regulation 2008) Roll No. Time : 3 Hours Answer ALL Questions Max. Marks 100 PART-A (10 x 2 = 20 Marks) 4. What is a rational agent? 2. Is depth limited search optimal? Justify your answer. 3. Howto perform local search in continuous-spaces? 4. _ What is a game tree? 5. What are mental objects? 6. Give the Baye's rule. 7. Inwhich situation unsupervised learning are useful? 8 Inwhat way, Decision stumps afe useful? 9. Why verbs are sub-categorized? Give an example. 10. What is Monte Carlo localization? Part ~B( 5x16 = 80 marks) 11.7 2) Discuss about the performance of the different uninformed search strategies with neat examples. (10) if) Give the PEAS description for satellite image analysis system and Refinery Controller. ©) 12. a) i) Explain about the locat search algorithms and compare its performance in defail. (16) (oR) b) i) Write short notes on: Alpha-beta pruning method (8) ii) Describe arc consistency algorithm in detail. (8)13. 14 15. a) b) a) b) b) i) Deseribe unification with neat examples. i) Explain forward chaining with an example. Also give its algorithm, OR i) Discuss about ontological engineering, ii) Write short notes on: Reasoning with uncertain information i) Write short notes on: Inductive learning, ii) Present ensemble Jeaming with a neat algorithm. OR ') Describe temporal difference learning agent with algorithm. fi) write short notes on: Q-leaming. © (10) @ 8 (8) (8) (8) (8) i) Perform syntactic analysis for the sentence " The Wumpus is dead" and explain. (10) ii) What are the types of Ambiguity and how to handle it? OR i) Discuss about the various cues available in the visual stimulus. ii) Write about Robotic software architectures. eee (6) @) @)S Roll No. -| B.E/ B.TECH ( FULLTIME ) DEGREE ARREAR EXAMINATIONS, NOV / DEC 2014 COMPUTER SCIENCE AND ENGINEERING / INFORMATION TECHNOLOGY Semester V €s3 74/ Irs / IT 9304- DISTRIBUTED SYSTEMS (Regulation ..2008..) Time: 3 Hours ‘Answer ALL Questions Max. Marks 100 PART. 20 Marks} 40x. 1. What is called as Message-Oriented communication 7 2. Differentiate Unicasting , Multicasting and Broadcasting. 3. Give the advantages of Kernel-Level threads 4, Define Clock synchronization, 5. Write about.Munin. 6. What is Data centtric consistency model ? Give an example. 7. What is the need of Consistent checkpoints? 8, Illustrate the distributed fault tolerance condition with an'example. 9. Define Service object oriented architecture. How JINI is applied here? 10. Compare ActiveX, COM+, DirectX and OLE. Part ~ B ( § x 16 = 80 marks) 11. Compare and Contrast RPC and RMI. Explain in detail. (16) 12. a). i, Discuss about any four issues in distributed operating systems. (8) il. Discuss in detail about Lamport’s mutual exclusion algorithm, 8) (oR) b) Explain in detail about Deadlock Detection algorithms. (16) 43. a) i. What are thé protocols used for coherence maintenance?- Explain. (10) ii, The IVY-Explain. © (OR) b) . Explain and Compare the following Load Distributing Algorithms , (16) i. Sender Initiated Algorithms; il. Receiver initiated Algorithms; and il, Symmetrically Initiated Algorithms 1/2| Page14. a) b) 15. a) ») Explain in detail about Distributed Commit Protocols. (18) (OR) i. What are the Impossibilties of Fault-Tolerance? Explain 8) ii. Whatis Byzantine Fault Tolerance ? Discuss. 6) Discuss the following : i. CORBA RMI ®) ii, Component Based Middleware. (4) ili, Distributed Objects. @ (OR) Write notes on i, Distributed Object Middleware (4) ii, CORBA Services. 0) ii Architecture of CORBA and the components. ® 22iPRoll No. B.E./ B.Tech DEGREE END SEMESTER EXAMINATIONS, Nov / Dec 2014 COMPUTER SCIENCE AND ENGINEERING V Semester CS 8504 Theory of Computation (Regulations 2012) Time: 3 Hours ‘Answer ALL Questions Max. Marks 100 10. PART-A (10 x 2 = 20 Marks) Construct a deterministic finite automaton (DFA) that will accept all strings containing no more than one occurrence of the substring 11 and contains the substring 00 over the alphabet (0+1)*. Write a regular expression corresponding to the language of all strings containing both 401 and 010 as substrings over the alphabet (0+1)*. Write a CFG that will generate the language of all strings that do not contain the string abb over the alphabet (a+b)*. Simplify the following grammar: S> aSa|bSb|c A> aBb| bBa B> aB| bBl< Prove that context free languages are not closed under complementation. Convert the following context free grammar (CFG) to a push down automaton (PDA). SIS+TIT TITFIF FI Ola Encode the following Turing machine M as a binary string. M = ({q1, qs, ds}. {0, 1), (0, 1, 8}, 6, gx, B, ga) where dis given as (41,0) = (q1, 0, R) &(4s,1) = (qs, 1, R) 8(41,B) = ( ga, B, L) (q2,0) = (qr, 0, R) (2,1) = ( gs, B, R) Let L andT be complementary languages. If one of the two languages is recursively ‘enumerable but not recursive, what kind of language will be the other? Why? Define a programmed grammar. What is meant by ‘appearance checking’ mode in any derivation? Explain this with respect to matrix grammar.1. 12. 13, 14, Part - B (5 x 16 = 80 marks) (Question No.11 is Compulsory) (i) If L is a set accepted by an NFA with <-transitions, prove that L is accepted by an NFA without ¢-transitions CO) (ii) Minimize the following DFA using table filling algorithm. (8) a) () Let G = (V, T, P, 8) be a context-free grammar. Prove that S 3 a if and only if there is a derivation tree in grammar G with yield a. (8) (ii) Convert the following grammar to Greibach's normal form: ®) S>SS S>aSb Sab (OR) b) () Design a PDA that will accept the language L = faible" | /#i+ 4). ®) Gi) ) If L = L(W,) for some PDA M, = (Q, 3, , 5 , Go, Zo, F) that accepts by final state, then prove that there is a PDA (Mj that accepts by empty stack such that L = NM). (8) a) (i) Using pumping lemma, show that the language L = {a’ba" | n 2 0} is not context-free. ® (i) Design a Turing machine that will find the bitwise AND of two binary numbers placed on the tape. ®) (OR) b) Design a Turing machine that will accept the language L = {x € {a, b, c}* | na(x) = (x) = Ne(X)}- I(x), mo(x) and ne(x) are the number of a's b's and c's respectively in string x]. (16) a) () Define Lg the diagonal language. Prove that Ly is not recursively enumerable. ® (ii) State and prove Rice's theorem. @) (OR)15. ©) Consider the following Turing machine M = ((q1, da. ds, deh, (0, 1), {0, 1,%, Bh 5, ds B, qa) where O's given as (91,0) = ( qa, X, R) (42.0) = ( Ga, X, R) O(a. 1) = ( go, X, R) (45,0) = ( da, X, R) qs. X, R) (93,8) = (ds, X. R) and input string w = 010%, Construct a Modified Post's Correspondence Probiem (MPCP) instance from the Turing machine M. Check if the MPCP instance has a solution. Also show the sequence of moves made by M for the same input string. a) (i) Consider the following matrix grammar G = (N, T, P, S) where N= {S, A, B}; T= {a,b}: P= {P1, P2, P3, P4, PS} where PA: [S > AB] P2: [A> aA, B> abl P3:[A> bA, B> bB] P4:[A>a,B> al P5:[A> b,B> 6) Derive any two strings that belong to L(G). Deseribe the set of strings that belong to L(G). 8) (i) Consider the following L system. ‘Axiom: wif Production: f> f+ f—f—f+f Draw the images corresponding to the string generated for the derivation steps n= 0, 1, 2. The angle increment is 90°. Assume the step size to be any positive number. @) (OR) b) (i) Define a OL system. Consider the OL system $ = ({a,b.0}, a, {a > abso, b > bec, ¢ > ¢}). Derive any two strings that belong to L(S). Describe L(S). Is a) a DPOL language? Why? @) (ii) Discuss about splicing systems, @)Roll No. END SEMESTER EXAMINATIONS, Nov / Dec 2014 CSE /IT Semester 5 PTCS9027 Data Warehousing and Mining (Regulation 2009) Time: 3 Hours Answer ALL Questions ‘Max. Marks 100 PART-A (10 x 2 = 20 Marks) Define data warehousing. List the functionalities of ETL tool. Compare OLAP with OLTP. What is a query tool? List its uses, What are the common types of data that can be mined? What is pinning? Give an example. Define the term support and confidence in an association rule. ‘What are the limitations of neural network based classification? What is outlier? (0. What are the constraints in high dimensional data clustering? ge Prneeeene Part — B (5 x 16 = 80 marks) {Question No.11 is Compulsory} 11. (i) Describe the architecture of a data warehousing system. 8) (i) Explain how star schema is used for building a warehouse with an example. (8) 12. a) (i) List any four OLAP operations and explain their features. ®) (ii) List the commonly used business analysis tool and explain the reports that can be generated using them. @) (OR) b) () What is the need for multi-dimensional data model? Explain (8) (ii) Discuss the guidelines associated with OLAP. (8)13, 14. 45. a) b) b) (i) Explain how a data mining system can be integrated with a data warehouse. (8) (i) List and explain the various preprocessing steps involved in data mining. (OR) ()) Discuss the tasks involved in data mining. (i) Explain the classification of data mining systems ()) Explain the steps associated with Apriori algorithm with an example. (i)Explain any one decision tree based classification approach. (OR) (Explain the Bayesian classification technique. (i) What is rule based classification? Explain ()) Explain the k-means clustering algorithm. (ii) Explain any four applications of data mining techniques. (OR) List and explain various categories of clustering methods. (8) (8) (8) (8) 8) (8) 3) (8) 8) (16)voune. |_| [TTT] B.E/ B.Tech (Full Time ) DEGREE END SEMESTER EXAMINATION, NOV/ DEC 2014 COMPUTER SCIENCE AND ENGINEERING \V Semester CS 373/CS9305 DATA COMMUNICATION AND COMPUTER NETWORKS (Regulation 2004/2008) Time : 3 Hours Answer ALL Questions Max. Marks 100 PART-A (10 x 2 = 20 Marks) | What are the three guided media's commonly used for data transmission? | Give the purpose of spread spectrum technique. | What are the advantages of Layering? | what are the funetions performed at the data link layer? | 1s 196.16.144.99 / 23 is a host, network or a broadcast address? | What are the options available in IP header? | Specify the reasons for the occurrences of silly window syndrome in TCP? i | Suppose TCP operates over 125MB/sec link. Assume TCP could utilize the full BW continuously, how long would it take the sequence number to wrap around completely? 9. | What is the drawback of plain SMTP protocol? How does the MIME extension help to overcome this? SNOT YNE 10. | Why should each name server know the IP address of its parent instead of the domain name of its parent ? Part = B (5 x 16 = 80 marks) 11. (@ Trace the events that take place from the time you login to your account at gmail.com and send a mail to xxx@yahoo.com. xxx retrieves his/her mail using POP, Give full details of all the protocol steps involved at all levels of the network stack in this process. (0) (i) Discuss in detail about the purpose of DNS and how it works, © 12. a) Discuss the characteristics of guided transmission media, and the mechanisms used for data transfer in each medium. (16) OR b) i. Explain and compare the PCM and DM techniques to send analog data using digital channels. (20) ii. Encode the bit pattern 1011000111 using ASK, BFSK, and QPSK. © 13. a) Explain the token ring protocol used in 802.5 standard. (16) OR b) Explain the hidden node and exposed node problems that occur in wireless networks, How are they avoided in the 802.11 networks. (10) (ii)Suppose we want to transmit a message 1011000111101 and protect it from 8 2 errors using the CRC polynomial x +x +X-+ 1, Determine the CRC bits to be added. if an error occurs in the left most bit, show that this CRC will help detect the error. ©14. 15. a) (i Explain Distance Vector routing protocol using the following sample network (for node E), (10) (Gi) Consider sending a 4000-byte datagram that has arrived at a router R1 that needs to be sent over a link that has an MTU size of 1500 bytes to R2, Then it has to traverse a link with an MTU of 1500 bytes. Let the identification number of the original datagram be 159. How many fragments are generated? What are the parameters associated with these fragments? (6) oR b) (i) Discuss the various messages used in ICMP. qo (ii) Compare IPv4 and IPV6 protocol and also discuss the salient features of IPV6 protocol © a) Discuss the state transition diagram of TCP connection establishment and termination. OR b) Discuss the adaptive retransmission mechanisms used in TCP.Roll No, BE. / B.Tech (Full Time) DEGREE EXAMINATIONS, Nov/Dec 2014 Computer Science and Engineering V SEMESTER (Regulations 2008) ©8285 / CS 9302 - Theory of Computation Time: 3 Hrs Max, Marks: 100 ‘Answer ALL guestions i PART A— (10 x2=20 marks) 1. Differentiate proving contra-positive and proof by contradiction by stating the appropriate ‘statements. f 2. Draw a transition diagram for recognizing the language (0+1)" 3. Prove that the equivalence relations are transitive 4, Show that the language L = (0° | p is prime number) is not regular. 5. Check whether the following grammar is ambiguous or not E> E¥E | id 6. Define formally, “Acceptance by Empty Stack and Acceptance by Final State for a PDA. 7. Define a Turing machine. 8, Explain Non-deterministic Turing machine. 9.. Prove that union of two recursive languages is recursive 10. Define NP class of problems. ‘ PARTB marks) 11.4. Prove by induction that, “ A complete graph with ‘n’ nodes will have n(n-1)/2 edges”. @) ii. Construct a DFA equivalent to the following < - NFA. () be ee Page 1 of 212. a. i, Prove that if L = L (A) for some DFA A, then there is a regular expression R such that L = LCR). 8) ii, Using'the above theorem construct a regular expression for the following DFA. (8) (OR) b. i. Construct a NFA with ¢ transitions for the regular expression a (a"b')"+a*b*c* (8) ji, State and prove the properties of Regular Languages @) 13, a. i, Prove that if L=N (Mi) for some PDA My =(Q, 2,1, 51s do, Zo, ®) then there is a PDA ‘Mo such that L = L(Mz). ® ii, Construct a PDA to recognize the language defined by { 2"d"|n, > 1}. Check whether your PDA recognizes “aadd” or not. ® (OR) b. Convert the following PDA defined by ( {qo , 4: }, £0, 1}, {Z, X},8, qo , Z, ©) toa CFG where 6 is'defined as follows (16) 5 (qo, 1, Z)= (0, XZ}, 8 do, & Z)= {(@o, €)} 8 o, 1, X)= {(os XX}, 5 i, 1,X)= (Gr€)} 5(q0,0,X)= {1,9} 8 (41s 0Z)= (C0, Z)} 14, a. i, Convert the following grammar to CNF, where § is the start symbol @- S> aAa| bBb| € ADCla BOCib CCDBle D>AIBlab ii, Explain the procedure to convert a grammar to Greibach normal form. (OR) i a ae spe [morn ifmen b. Design « Turing machine to find mn where m:n {3 pices } 6) (16) 15.a, Prove that L, is recursively enumerable but not recursive (OR) b. Prove that PCP is undecidable. Page 2 of 2ere) BE. / B.TECH DEGREE (FULL TIME) END SEMESTER EXAMINATIONS, NOV / DEC 2014 rou. | | | B. E, - Computer Science and Engineering FIFTH SEMESTER 89303 - SYSTEM SOFTWARE INTERNALS. (Regulation 2008) Hours Max, Marks: 100 Answer All Questions PART-A (10 x 2 = 20 Marks) \Write the instruction formats of SIC/XE with examples. List out the machine independent features of assembler. What is Relocating loader? What are the functions of pass1 and pass2 of a linking loader? List out the machine independent features of macroprocessor. What is lexical analysis? Define virtual machine(VM) What do you mean by dynamic class loading? What are the techniques used in interpretation of VM? 40. What is migration? 1 2. 3. 4. 5. 6. 7. 8. 9. Part — B (5 x 16 = 80 marks) 11. Explain the SIC/XE Architecture with neat diagrams. Give examples for addressing modes and instruction format of SIC/XE. 12, a) Explain the control sections. Write suitable algorithms for assembler which will handle th control sections. OR b) Explain the design of a linking loader. Write algorithms for the above design. {(P.T.0.)13. a) Write algorithm for a macro processor. Explain the above design with an example. OR b) Explain the various phases of a compiler. 14, a) Draw the taxonomy of virtual machine. Explain. OR b) Explain Pascal p code or java virtual machine, 15. a) Explain the design of binary translator with an example. OR b) Write short notes on i. Shared libraries ii. Profiling ii, riedTH B.E/ B.Tech ( Full Time ) DEGREE END SEMESTER EXAMINATIONS, APRIL / MAY 2014 Information Technology Sth semester Regulations 2008 179301 Software Project Management Time: Three hours Maximum: 100 marks Answer ALL questions PartA (10x2=20 marks) . Define project management. . Compare and contrast strategic assessment and technical assessment. . Define effort in software project evaluation. . List any five types of risks in software development. . Compare and contrast PERT and CPM. . Enumerate any two tools used for cost evaluation. . Define earned value. . List any two tools used for scheduling project. CO ONAaRwn as ). Define Hackman job characteristics model. 10. Write any two healths and safety measures to be taken in organization.PartB (5x16 =80 marks) 11.()) Explain an overview of “stepwise project planning activities” with a neat diagram. (i) — Explain the various activities of software project management. Assume that you are a project manager for a software outsourcing industry and illustrate the activities of SPM. 12.(a)Explain how risks are handled in project with respect to any one real time application. (or) (b) Discuss the cash flow technology with different cost-benefit evaluation techniques. 13.(a)Explain the steps involved in risk planning and methodology used to evaluate risk in a project. (or) (b)Draw and explain the activity network at the completion of the forward pass. 14,(a)Explain elaborately the typical terms in contract management. (or) (b)Explain the steps involved in resource allocation in detail. 415.(a)Discuss the organizational behavior with examples. (or) (b)Explain the various organizational structure used in software projects.B.E/ B.Tech ( Full Time ) DEGREE END SEMESTER EXAMINATIONS, APR / MAY 2014 INFORMATION TECHNOLOGY 5% Semester 1T9302-MULTIMEDIA SYSTEMS. (Regulation 2008) Time: 3 Hours Answer ALL Questions Max. Marks 100 PART-A (10 x 2 = 20 Marks) 4. List any four multimedia applications. 2. Compare post script and true type fonts. 3. Write down the important features of H.261 algorithm, 4. Howis track ball different from a pen input device? 5. Give the structure of an opengl program. 6. How will you add a video into a web page using img element? 7. Give the characteristics of multimedia databases. 8. How is data read from CD-RW? 9. Why are ATM networks used for multimedia data transmission? 410. What are the message types supported by RTCP? PART-B (5 x 16 = 80 Marks) 11.) Discuss the challenges involved in handling image as a multimedia element. (8) (i) How are animations created? Explain the different animation techniques in detail with examples. 8) 12. (a)()) How is motion compensation estimated in MPEG compression scheme? (8) (i) Explain the chunks defined by RIFF specification. (8) OR (OX) Explain the different types of scanners, their scanning mechanisms and usage issues. 8) (i) Discuss on the symmetric operation of DCT based CODEC in JPEG compression (8) 13.(a) You are a multimedia designer. You are involved in the process of designing a web site for ane commerce web site. Explain in detail the process of inserting multimedia components into the above web site in the design phase. (16) OR (b) As a multimedia programmer how will you handle the multimedia components programmatically. Explain in detail with code snippets. (16) 14. (a) (i) Explain in detail Hypermedia linking and embedding with examples. (8)(i) Explain in detail the different schemes used for storage by considering throughput, speed and reliability. ® OR (b)() Explain the various real time scheduling algorithms with example for each. (8) (i) Discuss on the synchronization issues related to objects in a multimedia presentation system. ® 15. (a)() Discuss on error resilient entropy encoding mechanism in detail. ®) (i) Explain the SIP session initiation process in detail ®) OR (©)() Write short notes on: () Interactive TV 6) li) Broadcast schemes for Video on demand ©) (iii) Quality of multimedia data transmission (6)Roll we. | CT B.E/ B.TECH ( FULLTIME ) DEGREE ARREAR EXAMINATIONS, APRIL | MAY 2014 INFORMATION TECHNOLOGY Semester V Ts! sess) 9304- DISTRIBUTED SYSTEMS, ( (Regulation ..2008..) Time: 3 Hours ‘Answer ALL Questions Max. Marks 100 PART. 0.x 20 Marks) 7 4. What is Remote Object invocation 7 2. Differentiate Unicasting , Multicasting and Broadcasting. 3. Write down the issties of Distributed operating systems. 4, What is Data Centric Consistency Model and Client Centric Consistency Model ? 5. How Distributed Scheduling works ? 6. Define Clock Synchronization. 7. What are the requirements for Gonsensus Protocol ? 8. What is Distributed Fault Tolerance ? 9. How JINI service is more convenient than Java RMI 2 10. Where COM® services are applied ? Part — B (5 x 16 = 80 marks! 11. Explain in detail about Romote Procedure Call design issues and implementation. (16) 12. a). 1. What is a need for global state ? Explain with an example. (8) Discuss in detail about Chandy-Lampor's Global State recording algorithm. (8) (oR) ) Explain in detail about Deadlock Detection algorithms. (16) 43. a) i. What are the algorithms for implementing Distributed Shared Memory ?, (8) ii Eacs Notwork File System-Explain, ® (OR) b) Compare and Contrast the following Load Distributing Algorithms , (18) i, Sender Initiated Algorithms; ji, Recoiver Initiated Algorithms; and ii, Symmetrically Initiated Algorithms 14. a) Explain in detail about Distributed Commit Protocols. (16) yale(OR) What are the Impossibilities in Fault Tolerance? Explain. What is Byzantine Fault Tolerance ? Discuss. 15. a) i. Explain in detail about CORBA RMI. ii, Draw the architecture of CORBA and explain the components. (oR) b) Write short notes on . i, Distributed Object Middleware ii. Component Based Middleware ii, Distributed Objects iv. CORBA Services, 2/21 @ (8) (8) (8) (4) (4) (4) (4)(TH B.E/ B.Tech ( Full Time ) DEGREE END SEMESTER EXAMINATIONS, APRIL / MAY 2014 Information Technology 5th semester Regulations 2008 1T9301 Software Project Management Time: Three hours Maximum: 100 marks Answer ALL questions PartA (10x2=20 marks) . Define project management. , Compare and contrast strategic assessment and technical assessment. . Define effort in software project evaluation. . List any five types of risks in software development. . Compare and contrast PERT and CPM. . Enumerate any two tools used for cost evaluation. . Define earned value, . List any two tools used for scheduling project. ). Define Hackman job characteristics model. Cert ankRwn = 10. Write any two healths and safety measures to be taken in organization.PartB (516 =80 marks) 11.(i) Explain an overview of “stepwise project planning activities” with a neat diagram. (i) Explain the various activities of software project management. Assume that you are a project manager for a software outsourcing industry and illustrate the activities of SPM. 12.(a)Explain how risks are handled in project with respect to any one real time application. (or) (b) Discuss the cash flow technology with different cost-benefit evaluation techniques. 13.(a)Explain the steps involved in risk planning and methodology used : to evaluate risk in a project. (or) (b)Draw and explain the activity network at the completion of the forward pass. 14.(a)Explain elaborately the typical terms in contract management. (or) (b)Explain the steps involved in resource allocation in detail, 15.(a)Discuss the organizational behavior with examples. (or) (b)Explain the various organizational structure used in software projects.Roll No. END SEMESTER EXAMINATIONS, Nov/Dec 2014 DEPARTMENT OF INFORMATION TECHNOLOGY V Semester 17.8007 Graph Theory : (Regulation 2012) Time: 3 Hours Answer ALL Questions Max. Marks 100 10. PART-A (10 x. Marks) For which of the following does there exist a simple graph G specified conditions? {a) It has 3 components 20 vertices and 16 edges. (b)It has 7 vertices, 10 edges, and more than two components. | (V,E) satisfying the Suppose G is a finite cycle-free connected graph with at least one edge. Show that G has at least two vertices of degree 1. Hamiltonian path is a spanning tree. Prove it. | ‘Are the two graphs, G and H, shown in Fig 1. a u 2-isomorphic? Justify your answer. 6 26 - ore 4 If adjacency matrix of a graph is given; how do you determine whether the graph is connected or not? ‘What is uniquely colorable graph? Give an example graph. | How many ways can the letters in DATAGRAM be arranged so that all three A's together? | Determine the number of positive integers n, 1< 1 < 500, that are not divisible by 2.0r7. | Find the gonerating function forthe number of ways to select 10 candy bars from large | supply of 6 different kinds, 1 The number of virus affected files in a system is 1000 (approximately) and this doubles every six hours. Using @ recurrence relation, determine the number of virus affected files in the system after one day.11. 12, 13. a) b) b) Part ~ B (5x 16 = 80 marks) (Question No.11 is Compulsory) @ State and prove two theorems to show a graph is an Eulerian graph. {i) Seven children in‘a street play a game in a circular arrangement. If no child holds hands with the same playmate twice, how many times can this arrangement possible? Write all possible arrangements. (ii) State any two properties of a tree graph and prove them. (Gan you obtain any spanning {ree of a graph G from every other spanning tree? Justify your answer. (i) Prove that every circuit in a graph has even number of edges in common with any cut set. (i) For any graph, show that k(G) s NG) s 6(G) < [#4], where k(G) is vertex connectivity, MG) is edge connectivity and 8(G) minimum degree among all vertices. (oR) (i) State Kuratowski's Theorem and use it in order to prove the graph in Fig 2. is non- planar. (ii) Derive the formula for the number of regions in a planar graph, G with n vertices and ¢ edges. Also prove that a planar graph with triangle regions can have at most (8n-6) edges. If G is triangle free, then what can be the maximum number of edges? (i) Obtain the chromatic polynomial for the graph shown in Fig 3. Then find the chromatic number of the graph. {il) Prove the following: If A(G) is incidence matrix of a connected graph G with n vertices, ‘the rank of A(G) is n-1, (or) (i) State and prove five-color theorem. (il) Define the following and give one example to each. Complete Matching Minimal Covering Balanced Digraph Strongly Connected Digraph (6) (4) (6) 6) (4) (6) (8) (3) (10) (6)44. a) (i) Show that for all positive integers m and n, (4) ») 15. a) b) wre meme (EE) (i) How many distinct paths are there from (-1,2,0) to (1,3,7) in Euclidean (4) space? (iil) Find the value of sum if the given program segment executed. (8) main () { : int inc = 0, sum =0; int for (i=; 510; i++) for i+) ski ke) inc = inc + 1; sum = sum + inc; } } (or) (i) Determine the coetticient of x°y° in the expansion of (4y-x)'>. @ (ii) How many integer solutions are possible for x + x2 4+xg 4x4 +x5<40, (6) where x\2~3, 1815, (li) State and prove principle of inclusion and exclusion. (6) (), Two cases of soft drinks, 24 bottle of one type and 24 bottles of another, are (12) distributed among five surveyors who are conducting taste tests. In how many ‘ways can the 48 bottles be distributed so that each surveyor gets at least tWo botties of each type? And in how many ways can they be distributed so that each surveyor gets at least two bottles of one type and three of other type? Use generating function, (i) Find all partitions of integer 7. (4) (OR) () If ay, 2 0, is a solution of the recurrence relation ayy; da, =0, and (8) 3 = 153/49, ag = 1377/2401, what is d? (i) Find an explicit formula for the Fibonacci sequence. @)B.E/ B.Tech ( Full Time ) DEGREE END SEMESTER EXAMINATIONS, NOV / DEC 2014 INFORMATION TECHNOLOGY Fifth Semester IT 8503-GRAPHICS AND MULTIMEDIA. (Regulation 2012) Time: 3 Hours Answer ALL Questions. Max. Marks 100 PART-A (10 x 2 = 20 Marks) 1. Compute the height of the resized image 1024x768 to one that is 640 pixels wide with the same aspect ratio. 2. Give one example call back function in OpenGl for handling mouse events and specify its prototype. 3. Derive the general two dimensional rotation transformation matrix about a fixed point. 4, Use Liang Barsky algorithm to clip the line p1(-15,-30) p2(30,60) against the window having diagonally opposite corners as (0,0) and (15,15). 5. List the characteristics of effective visualization. 6. Define B spline blending function 7. Which image file format is used to represent a busy market place image? Why? 8 As a multimedia developer you are involved in the process of creating a portal for location based services. Which data structure would you use to store the location information? Justity. 9. Differentiate augmented reality and virtual'reality. 10. Suggest any three ways in which audio analytics can assist in video retrieval system. PART-B (5 x 16 = 80 Marks) 114. (I) Modify the Bresenhams line drawing algorithm to draw a dashed line and the length of dash is not dependent on slope, 8) (ji) Scan convert the first quadrant of the ellipse x°/38 + y7/100 = 1 using circle drawing algorithm. (8) 42, (a)() A mirror is placed such that it passes through (2,0) and (0,2). Find the reflected View of the triangle with vertices (3,4) (6,5) and (4,7) in this mirror, ®(ii) Write the steps involved in clipping @ polygon against a window using Sutherland Hodgman algorithm, @) OR (b){i) Discuss the concepts of two dimensional reflection in detail. ) (ii) Find the normatization transformation for window to viewport which uses the rectangle whose lower left corner (2,2) and upper right corner (6,10) as a window and the viewport that has lower left corner at (0,0) and upper right comer at (1,1). (8) 13.(a)(i) Rotate a cube given by A(30,15,30) B(45,15,30) C(45,15,15) 0(30,15,15) E(30,30,30) F(45,30,30) G(45,30,15) and H(30,30,15) about its diagonal poit ing away from the origin by 30 degrees. @) (i) Compare and contrast object space method and image space method for visible surface detection using an example for each. (8) OR (b)(i) Discuss on the various colour models in detail. (8) (ii) Given an unit cube apply the following transformation in succession: 30 degrees rotation about x axis and then decreasing the size by a factor of 2. (8) 14. (a) Given an Mpeg video how is it possible to identify various frames? Explain. Also explain the process of creation of all frames in detail (18) OR {b) As 2 multimedia designer you are assigned the task of creating an animation movie Explain the process of incorporating animation into three dimensional objects. (16) 15. (a)() Discuss the various authoring paradigms available for creating full fledged multimedia application. (8) (i) You are assigned the task of creating an image search engine. Explain the process of searching an object in image using various image feature sets, @) OR ()Wite short notes on: (i) Buffering in video on demand applications (8) (i) Intearctive multimedia application creation, (6) (ii) Virtual reality mark up language. ©)Roll No. [| | . B.E/ B.Tech ( Full Time ) DEGREE END SEMESTER EXAMINATIONS, NOV / DEC 2014 Information Technology V SEMESTER 118502: Distributed Systems (Regulation 2012) ' Time: Three Hours Answer ALL Questions Max.Marks: 100 PART-A (10 x2. = 20 Marks) ‘What are the various paradigms used in a distributed system? ‘What do you mean by scalability in a distributed environment? ‘What is phantom deadlock? Give example. Why do you necd state recording in a distributed system? Provide an application where it is used. Clearly distinguish between load balancing and load sharing. Explain the type of virtualization used in Xen with appropriate diagram, Distinguish between error, fault and failure using suitable examples. Using a diagram show that it is not possible to obtain an agreement in a three node system if one of the nodes is Byzantine. ‘What is the role of object adapter in CORBA? 0. State four advantages of virtualization, PART-B (5X 16 = 80 Marks) I1.a) Develop and describe schemes to discard duplicate messages received in the sender side in a non blocking RRA protocol using UDP. 8 b) Comment on how efficiency and security may be implemented inRPC? 8 aepe pray se 12.2) i) Explain Bully election algorithm with an example. Consider a situation where a failed coordinator comes back after the next coordinator has been elected using Bully algorithm. Explain what happens in this case, 8 ii) What is the problem of implementing a naive centralized deadlock detection mechanism in a distributed environment? Justify your answer. 8 (OR) 12.b) i) Explain the Chandy-Lamport’s global state recording algorithm. 8 ii) Justify using an example why the channels in the above algorithm need to be FIFO. 813.a) i) Describe the architecture of Sun NFS. Which is the most important component in this architecture? Justify. 8 ii) Name the different types of scheduling in a distributed system. Describe a receiver-initiated load distribution algorithm with suitable diagram. 8 (OR) 13.b)i) In the following diagram what consistency is achieved? Justify. 8 Pls Waa P2: Wo P3: Rb R&A BRR ii) What is HDFS? How is the concept of Map-Reduce used in Hadoop? 8 14) i) Explain how fault tolerance and commit protocols are related, What are the various types of commit protocols? 4 ii) Using an example of a Super Market having stores in various cities, show that using two phase commit protocol can be problematic. Explain how it can be resolved 2 (oR) 14) i) Why do we need to have agreement protocols in a distributed system? Explain with an example. 4 ii) Provide a suitable algorithm to come to agreement on a value of decision variable from a set of five values in the presence of failures. How many failures can this algorithm tolerate? Provide a mathematical formula for the same. 12 15.a) i) What is the basic concept of virtualization? Explain how server consolidation helps in providing improved service. 8 ii) What is Desktop virtualization? 4 iii) Provide the basic virtualization architecture adopted by VMware. 4 (OR) 15.b) i) Explain CORBA architecture in detail 8 ii) What are the various CORBA services? Explain any two services. 16Roll No. | | | B.E/ B.TECH ( FULL TIME ) DEGREE EXAMINATIONS, NOV / DEC 2014 INFORMATION TECHNOLOGY / INFORMATION SCIENCE & TECHNOLOGY semester WL 1T 8001- ADVANCED DATABASE TECHNOLOGY (Regulation ..2012..) Max. Marks.400~-—— oe Time: 3 Hours Answer ALL Questions ~"PART-A (10x 2 = 20 Marks) 1. What are skews ? List its types. 2. How Global unique time stamp is obtained ? 3. What are association and aggregation between classes? 4. What are the components in ODMG architecture? 6. Differentiate Data warehousing and Data base. 6 What is Knowledge discovery process in Data Mining? 7.What is frequency reuse in mobile systems 7 What i the need for that ? 8. How logs and check points are maintained in mobile database system ? 9. What is Fuzzy inference engine? 10. How does mult dimensional databases system work ? Part—B (5x16 = 80 marks) ‘11.4, How parailelism works in a query ? Explain the types. Give an example. @) li, List the commit protocols in distributed database and explain the phases involved with an example. (8) 12. a. Construct a E-R and UML Class diagram for university course registration scenarko (18) and give ODL schema for the above scenario with a suitable object oriented language. (oR) b. Consider an object oriented employee database & give syntax for the following i. How object types are created? (6) li, How to use object types in tables? ©) : fil. How to use tables as objects? @)13.8, For an employee database, i. Construct a XML Schema and represent the same in Hierarchical model. (8) ji, What are XPath and Xquety in XML? (4) il. Write separate XQueries to retrieve records of the employee who gets salary (4) more than Rs.70,000 PM and works more than 40 hours per week. (OR) b. i. What is Data Warehousing? Explain its architecture and components. involved.

Das könnte Ihnen auch gefallen

• Fear: Trump in the White House

  

  Von Everand

  Fear: Trump in the White House

  Bob Woodward

  Bewertung: 3.5 von 5 Sternen

  3.5/5 (738)
• A Man Called Ove: A Novel

  

  Von Everand

  A Man Called Ove: A Novel

  Fredrik Backman

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (4609)
• A Heartbreaking Work Of Staggering Genius: A Memoir Based on a True Story

  

  Von Everand

  A Heartbreaking Work Of Staggering Genius: A Memoir Based on a True Story

  Dave Eggers

  Bewertung: 3.5 von 5 Sternen

  3.5/5 (231)
• • Zeitschriften
  • Podcasts
  • Noten
• The Sympathizer: A Novel (Pulitzer Prize for Fiction)

  

  Von Everand

  The Sympathizer: A Novel (Pulitzer Prize for Fiction)

  Viet Thanh Nguyen

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (121)
• Grit: The Power of Passion and Perseverance

  

  Von Everand

  Grit: The Power of Passion and Perseverance

  Angela Duckworth

  Bewertung: 4 von 5 Sternen

  4/5 (588)
• Yes Please

  

  Von Everand

  Yes Please

  Amy Poehler

  Bewertung: 4 von 5 Sternen

  4/5 (1891)
• Devil in the Grove: Thurgood Marshall, the Groveland Boys, and the Dawn of a New America

  

  Von Everand

  Devil in the Grove: Thurgood Marshall, the Groveland Boys, and the Dawn of a New America

  Gilbert King

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (266)
• The Little Book of Hygge: Danish Secrets to Happy Living

  

  Von Everand

  The Little Book of Hygge: Danish Secrets to Happy Living

  Meik Wiking

  Bewertung: 3.5 von 5 Sternen

  3.5/5 (400)
• Never Split the Difference: Negotiating As If Your Life Depended On It

  

  Von Everand

  Never Split the Difference: Negotiating As If Your Life Depended On It

  Chris Voss

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (838)
• Shoe Dog: A Memoir by the Creator of Nike

  

  Von Everand

  Shoe Dog: A Memoir by the Creator of Nike

  Phil Knight

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (537)
• The Emperor of All Maladies: A Biography of Cancer

  

  Von Everand

  The Emperor of All Maladies: A Biography of Cancer

  Siddhartha Mukherjee

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (271)
• The Subtle Art of Not Giving a F*ck: A Counterintuitive Approach to Living a Good Life

  

  Von Everand

  The Subtle Art of Not Giving a F*ck: A Counterintuitive Approach to Living a Good Life

  Mark Manson

  Bewertung: 4 von 5 Sternen

  4/5 (5794)
• The World Is Flat 3.0: A Brief History of the Twenty-first Century

  

  Von Everand

  The World Is Flat 3.0: A Brief History of the Twenty-first Century

  Thomas L. Friedman

  Bewertung: 3.5 von 5 Sternen

  3.5/5 (2259)
• The Hard Thing About Hard Things: Building a Business When There Are No Easy Answers

  

  Von Everand

  The Hard Thing About Hard Things: Building a Business When There Are No Easy Answers

  Ben Horowitz

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (344)
• Principles: Life and Work

  

  Von Everand

  Principles: Life and Work

  Ray Dalio

  Bewertung: 4 von 5 Sternen

  4/5 (599)
• Rise of ISIS: A Threat We Can't Ignore

  

  Von Everand

  Rise of ISIS: A Threat We Can't Ignore

  Jay Sekulow

  Bewertung: 3.5 von 5 Sternen

  3.5/5 (137)
• Team of Rivals: The Political Genius of Abraham Lincoln

  

  Von Everand

  Team of Rivals: The Political Genius of Abraham Lincoln

  Doris Kearns Goodwin

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (234)
• The Gifts of Imperfection: Let Go of Who You Think You're Supposed to Be and Embrace Who You Are

  

  Von Everand

  The Gifts of Imperfection: Let Go of Who You Think You're Supposed to Be and Embrace Who You Are

  Brené Brown

  Bewertung: 4 von 5 Sternen

  4/5 (1090)
• John Adams

  

  Von Everand

  John Adams

  David McCullough

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (2409)
• The Glass Castle: A Memoir

  

  Von Everand

  The Glass Castle: A Memoir

  Jeannette Walls

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (1712)
• Hidden Figures: The American Dream and the Untold Story of the Black Women Mathematicians Who Helped Win the Space Race

  

  Von Everand

  Hidden Figures: The American Dream and the Untold Story of the Black Women Mathematicians Who Helped Win the Space Race

  Margot Lee Shetterly

  Bewertung: 4 von 5 Sternen

  4/5 (895)
• Her Body and Other Parties: Stories

  

  Von Everand

  Her Body and Other Parties: Stories

  Carmen Maria Machado

  Bewertung: 4 von 5 Sternen

  4/5 (821)
• Sing, Unburied, Sing: A Novel

  

  Von Everand

  Sing, Unburied, Sing: A Novel

  Jesmyn Ward

  Bewertung: 4 von 5 Sternen

  4/5 (1103)
• Angela's Ashes: A Memoir

  

  Von Everand

  Angela's Ashes: A Memoir

  Frank McCourt

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (440)
• Wolf Hall: A Novel

  

  Von Everand

  Wolf Hall: A Novel

  Hilary Mantel

  Bewertung: 4 von 5 Sternen

  4/5 (3811)
• A Tree Grows in Brooklyn

  

  Von Everand

  A Tree Grows in Brooklyn

  Betty Smith

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (1929)
• The Woman in Cabin 10

  

  Von Everand

  The Woman in Cabin 10

  Ruth Ware

  Bewertung: 3.5 von 5 Sternen

  3.5/5 (2322)
• The Light Between Oceans: A Novel

  

  Von Everand

  The Light Between Oceans: A Novel

  M.L. Stedman

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (789)
• The Constant Gardener: A Novel

  

  Von Everand

  The Constant Gardener: A Novel

  John le Carré

  Bewertung: 3.5 von 5 Sternen

  3.5/5 (104)
• The Perks of Being a Wallflower

  

  Von Everand

  The Perks of Being a Wallflower

  Stephen Chbosky

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (2102)
• The Art of Racing in the Rain: A Novel

  

  Von Everand

  The Art of Racing in the Rain: A Novel

  Garth Stein

  Bewertung: 4 von 5 Sternen

  4/5 (4200)
• Elon Musk: Tesla, SpaceX, and the Quest for a Fantastic Future

  

  Von Everand

  Elon Musk: Tesla, SpaceX, and the Quest for a Fantastic Future

  Ashlee Vance

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (474)
• The Outsider: A Novel

  

  Von Everand

  The Outsider: A Novel

  Stephen King

  Bewertung: 4 von 5 Sternen

  4/5 (1839)
• The Unwinding: An Inner History of the New America

  

  Von Everand

  The Unwinding: An Inner History of the New America

  George Packer

  Bewertung: 4 von 5 Sternen

  4/5 (45)
• The Yellow House: A Memoir (2019 National Book Award Winner)

  

  Von Everand

  The Yellow House: A Memoir (2019 National Book Award Winner)

  Sarah M. Broom

  Bewertung: 4 von 5 Sternen

  4/5 (98)
• On Fire: The (Burning) Case for a Green New Deal

  

  Von Everand

  On Fire: The (Burning) Case for a Green New Deal

  Naomi Klein

  Bewertung: 4 von 5 Sternen

  4/5 (73)
• Civ Pro Flowchart-1

  

  Dokument26 Seiten

  Civ Pro Flowchart-1

  MajesticDoge

  100% (1)
• Little Women

  

  Von Everand

  Little Women

  Louisa May Alcott

  Bewertung: 4 von 5 Sternen

  4/5 (104)
• Brooklyn: A Novel

  

  Von Everand

  Brooklyn: A Novel

  Colm Tóibín

  Bewertung: 3.5 von 5 Sternen

  3.5/5 (1937)
• Manhattan Beach: A Novel

  

  Von Everand

  Manhattan Beach: A Novel

  Jennifer Egan

  Bewertung: 3.5 von 5 Sternen

  3.5/5 (792)
• Bad Feminist: Essays

  

  Von Everand

  Bad Feminist: Essays

  Roxane Gay

  Bewertung: 4 von 5 Sternen

  4/5 (1015)
• Steve Jobs

  

  Von Everand

  Steve Jobs

  Walter Isaacson

  Bewertung: 4.5 von 5 Sternen

  4.5/5 (806)
• Dummy

  

  Dokument40 Seiten

  Dummy

  MajesticDoge

  Noch keine Bewertungen
• BPL bc10fwr

  

  Dokument1 Seite

  BPL bc10fwr

  MajesticDoge

  Noch keine Bewertungen
• 276 2600 Clawbot Inst 0512

  

  Dokument20 Seiten

  276 2600 Clawbot Inst 0512

  Cesar Chavez

  Noch keine Bewertungen
• Dummy

  

  Dokument40 Seiten

  Dummy

  MajesticDoge

  Noch keine Bewertungen
• Brother Mfl-Pro Suite Súbor Readme: 1. Centrum Technickej Pomoci Brother Solutions Center

  

  Dokument3 Seiten

  Brother Mfl-Pro Suite Súbor Readme: 1. Centrum Technickej Pomoci Brother Solutions Center

  crisjava

  Noch keine Bewertungen
• Dummy

  

  Dokument40 Seiten

  Dummy

  MajesticDoge

  Noch keine Bewertungen
• BPL bc10fwr

  

  Dokument1 Seite

  BPL bc10fwr

  MajesticDoge

  Noch keine Bewertungen
• Some Crap

  

  Dokument2 Seiten

  Some Crap

  MajesticDoge

  Noch keine Bewertungen
• Chemistry Investigatory

  

  Dokument27 Seiten

  Chemistry Investigatory

  MajesticDoge

  100% (1)
• Hello Tester

  

  Dokument1 Seite

  Hello Tester

  MajesticDoge

  Noch keine Bewertungen
• Ip Mapping

  

  Dokument1 Seite

  Ip Mapping

  MajesticDoge

  Noch keine Bewertungen
• Techm Corporatebrochure

  

  Dokument24 Seiten

  Techm Corporatebrochure

  grafikeyes

  Noch keine Bewertungen
• Ip Mapping

  

  Dokument1 Seite

  Ip Mapping

  MajesticDoge

  Noch keine Bewertungen
• I Don't Know What I Could Write

  

  Dokument1 Seite

  I Don't Know What I Could Write

  MajesticDoge

  Noch keine Bewertungen
• Kailangan Koy Ikaw1

  

  Dokument3 Seiten

  Kailangan Koy Ikaw1

  MajesticDoge

  Noch keine Bewertungen
• Help Tester

  

  Dokument1 Seite

  Help Tester

  MajesticDoge

  Noch keine Bewertungen
• Arts

  

  Dokument5 Seiten

  Arts

  MajesticDoge

  Noch keine Bewertungen
• Egypt

  

  Dokument3 Seiten

  Egypt

  MajesticDoge

  Noch keine Bewertungen
• Fungi

  

  Dokument6 Seiten

  Fungi

  MajesticDoge

  Noch keine Bewertungen
• A Simple Definition of Each Hierarchical Layer

  

  Dokument1 Seite

  A Simple Definition of Each Hierarchical Layer

  MajesticDoge

  Noch keine Bewertungen
• Kailangan Koy Ikaw1

  

  Dokument3 Seiten

  Kailangan Koy Ikaw1

  MajesticDoge

  Noch keine Bewertungen
• Rubber

  

  Dokument3 Seiten

  Rubber

  MajesticDoge

  Noch keine Bewertungen
• Vedic Astrology Seminar Course Materials - July 2011

  

  Dokument52 Seiten

  Vedic Astrology Seminar Course Materials - July 2011

  MajesticDoge

  Noch keine Bewertungen
• Scribd Failas 3000

  

  Dokument1 Seite

  Scribd Failas 3000

  MajesticDoge

  Noch keine Bewertungen
• Botany Exam 3 Terminology

  

  Dokument2 Seiten

  Botany Exam 3 Terminology

  MajesticDoge

  Noch keine Bewertungen
• Money Supply

  

  Dokument1 Seite

  Money Supply

  MajesticDoge

  Noch keine Bewertungen
• Hi

  

  Dokument1 Seite

  Hi

  MajesticDoge

  Noch keine Bewertungen