1st Semester M Tech Computer Science and Engg (Dec-2013) Question Papers


Published on

Published in: Education
  • Be the first to comment

  • Be the first to like this

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide

1st Semester M Tech Computer Science and Engg (Dec-2013) Question Papers

  1. 1. ( USN S -r 12SCS11 ( l, First Semester M.Tech. Degree Examination, Dec.2013/Jarn.2Ul4 Gomputer Networks Time: 3 hrs. Max. Marks: 100 Notel Answer any FIVE 1 a. b. c. F= -=, full questions. Explain the following terms with examples: Bandwidth ii) Latency iii) Delay x Bandwidth product (06 Marks) (08 Marks) Discuss the requirements of computer networks. Suppose a 128-Kbps point-to-point link is setup between Earth and a rover on Mars. The distance from Earth to Mars is approximately 55 x 10e m, and data travels over the link at the speed of light 3 x 10E m/sec. Calculate the minimum RTT for the link. ii) Calculate the delay x bandwidth product for the link. (06 Marks) i) i) I *.^ Explain the working of sliding window algorithm. (06 Marks) Discuss how token ring maintenance takes place in 802.5 standard. (04 Marks) Suppose we want to transmil lhe message l0ll00l00l00l0l I and prolect it l'rom errors using the CRC-8 polynomial xE x2 'xr + l. i) Use polynomial long division to determine the message that should be transmitted. ii) Suppose the leftmost bit olthe message is inverted due to noise on the transmission link. What is the result ofthe receiver's CRC calculation? How does the receiver know that an error has occurred? (10 Marks) With an example. explain how signalling is used by an host to establish virlual circuir. (06 Marks) -a != d_g 6(! 6.9 5 2 a. b. c. 3 a. Yil .: E. b. Explain the ATM cell format for AAL 3l4layer. (04 Marks) c. Discuss how bridges use spanning algorithm to handle loops. Give an example. (10 Marks) 4 a. b. c. .. (08 Marks) Explain datagram forwarding in IP. Explain how routing takes place using routing table. (06 Marks) For the network given in Fig.Q4(c), give global distance-vector table, when Each node knows only the distances to its immediate neighbors. ii) Each node has reported the information it had in the preceding step to its immediate ne ighbors. i) ; o z a E Fig.Qa(c) I of 2 (06 Marks)
  2. 2. 12SCSl1 5 a. b. c. n ,y Explain how TCP establishes connection with the help ofTCP state-transition diagram. (10 Marks) (04 Marks) What is Silly widow Syndrome? Explain. What is UDP? Explain the format for UDP header. (06 Marks) -(di$p explain in detail FIFO queuing algorithrn Distinguish between FIFO and Fair queulp-$. List 'f7* the drawbacks ol FIFO. 'rd marks) *t pir"rs the different congestion avoidance mechanisms. .1ro ru.rr.") sr' &, o *4**- *') '/t' " 7 a. Expliffie sequence of mail gateways store and forward emaiJ fusrag"., with a neat (06 Marks) diagramlYlr'5 (04 Marks) b. What is SO/,@pxplain the SOAP message structure. ,QY (10 Marks) c. Explain the we@g of DNS. 1l}tr* (#", 8 write shorr notes a. Virtual networks b. tPV6 c. SNMP network d. FDDI '"* S) ""I#d*TuriIG$_ and "6)-'i7 -u*g"."nt I ^ t},r, ( ,.,tu-, (2oMarks) I, ..- l'/,t ^t .J 2 u ' Qix* ad,r'r, x * x"* rt O* of2 fi
  3. 3. 12SCS12 I]SN First Semester M.Tech. Degree Examination, Dec.2013 I Jan2Ol4. Advances in Operating Systems '5 g E q 1a. .! 39 a. b. .EA sil . Note: Answer any FIVE_full questions. b. -^l Max. Marks: 100 Time: 3 hrs. c. d. Distinguish between space multiplexing and time multiplexing with examples. (05 Marks) Describe the essential properties of following types ofoperating systems : i) Batch systems ii) Time sharing systems iii) Embedded systems (09 Marks) (06 Marks) Explain the different views of software as a tool in solving problems. Distinguish. between sequential computation and multithreaded cemputations. (05 Marks) Discuss the POSIX file operation system (05 Marks) Explain the following system cal1s, with examples : Fork ( Join ( Execvc ( t06 Marks) Write a windows program that creates a child process that prints a greeting, sleeps for 20 seconds, and then exits. The parent process should print a greeting before creating the child and then (04 Marks) calls. i) ) ii) ) iiD ). terminate. 3a. O'o Distinguish between Trusted software and urtrusted software. Give examples. (04 Marks) b. Explain the two techniques by which a program executing in user mode can request the Kernel's services. (06 Marks) c. Describe the l,rNIX Architecture, with a neat labeled diagram. (05 Marks) d. With a neat diagram, briefly explain the logical OS organization. (05 Marks) 4a. ,C -!r ^ aB- i.9 ;* a3 9- U< -..i .i b. c. With a neat figure, explain in detail the working of a monolithic and modular kernel. Discuss their advantages. (08 Marks) Describe the CHORUS Microkernel architecture, with a neat labeled diagram. (07 Marks) What are the major issues that distinguish distributed operating systems from network operating systems? (05 Marks) 5 a. Explain the four mechanisms used by the Linux Kernel to perform communica.lion, by a user process. b. c. 6 a. b. c. With a neat diagram, explain the process and resource management Write a short note on the virtual file system ts o E 7 a. b. c. . switch. c. (08 Marks) (04 Marks) With a neat diagram, explain the windows NT/2000 organization. (08 Marks) Explain the Win 32 API in windows NT/2000/XP system. (06 Marks) Explain with a figure as to how traps, interrupt and exception are handled by the Win NT (06 Marks) Give detailed explanation of five layers that constitute the Tcp - Ip protocol. (07 Marks) With a neat diagram, explain the various system calls that are involved in a connection oriented protocol. 107 Marks) Define clustering. What are the benefits of clustering? (06 Marks) 8 a. Distinguish between : i) b. process (08 Marks) organization in Linux. 2000 organization. z inter Reliability versus unreliability blocking process migration. What is process migration and what are the reasons for distributed systems? Explain the distributed algorithm for mutual exclusion. iD Blocking versus non (06 Marks) desirable in (06 Marks) (08 Marks)
  4. 4. 12SCS13 USN First Semester M.Tech. Degree Examination, Dec. 2Ol3l Jan20l4. Advances in Database Management Systems Time: 3 hrs. Max. Marks:100 o E Notet Answer ony FIVE 1a. full questions. Whal are the categories of conslraints on databases? Discuss the main types of constraints. (10 Marks) b. With suitable example, explain how update operations are dealt with constraint violation. (10 Marks) =_. 2a. b. dq! Explain the characteristics of Relations. (0E Marks) What is object identifier? What primary characteristics should an OID possess? What are its advantages and disadvantages? a. b. Explain object and literals with respect to ODMG. What is ODL? Explain graphical notations and object database schema UNIVERSITY database. (12 Marks) (10 Marks) lbr part ol (10 Marks) a. iE -+r 6r != With suitable examples, explain generalized model for Active Databases and Triggers in b. Oracle. (10 Marks) Explain briefly deductive databases and illustrate Prolog / Datalog notations with examples. (10 Marks) 5a. Explain different types of Temporal Relational databases. b. Explain the ways to horizontally partition a relation. CExplain distributed DBMS architecture. (,,j ,i .9 a= (05 Marks) (08 Marks) (07 Marks) }U a. ;: b. What is a distrjbuted deadlock? Explain the algorithms to detect distributed deadlocks. (I0 Marks) Explain Implementation techniques for OLAP. (10 Marks) a. b. Write and explain the algorithm for finding liequent item sets. With a diagram, explain a mobile ad_hoc network. (r< - z a E ..i 8 Write sho( notes on (10 Marks) (10 Marks) : a. Multimediadatabases. b. Constraints in GIS. c. MultidimensionalDatabasedesign. d. The Genome Databases. (20 Marks)
  5. 5. I2SCS/SCE14 USN First Semester M.Tech. Degree Examination, Dec. Z0l3/Jan. 2Ol4 Gomputer System Performance Analysis Time: 3 hrs. Max. Marks:100 Note: Answer any FIVE full questions. .1 a. Compare the three techniques for performance evaluation against the seven criteria for b. cd. selection. class. 2 a. b. -^t Yd b. c. of (05 Marks) (04 Marks) performance metrics with (04 Marks) Discuss the thee tlpes of benchmarks, with examples. Write and explain the sieve Kernel algorithm. c. How do you measure the performance of a banking d. 3 a. (07 Marks) evaluation. system. Write the ten steps for a systematic approach to performance Define nominal capacity and usable capacity of a Based on utility classification, state the different classes examples ofeach (06 Marks) (04 Marks) application using debit credit benchmark? What are the ten components of spec 1 .0? (05 Marks) (05 Marks) Depending upon the level of implementation, what are the 4 types of monitors used in perlormance measurement? (04 Marks) What are the issues in software monitor design? (08 Marks) Explain the stages in distributed system monitor along with the functionality ofeach stage. (08 Marks) 4a. b. c. d. .g What are the steps in capacity planning? (05 Marks) Discuss the problems in capacity planning. (05 Marks) What is an (04 Marks) Discuss the tlree phases ofoperation ofRTE when measuring the performance ofSUT. RTE? (06 Marks) 6 5a. =i 'ia b. o." c. Explain the following four terminologies in the context of experimental design : Response variable ii) Factor iii) Level iv) Interaction. (08 Marks) Find the number ofexperiments you have to perform using fuIl factorial design for 4 factors each at 3 levels. (04 Marks) For a 22 design. the.variqtiqn can be di ided into 3 points : qf. + 2" qis SST 2'qi + 2' i) - Deduce the equation. 6E 6a. b. c. -;o AF 7a. b. What are the six characteristics of a queuing system? Prove Little's law. Explain the four types of stochastic processes. ' (06 Marks) (06 Marks) (08. Marks) Find the expression for steady state probability of being in state n for a birrh and death process interms ofarrival rate, seruice rate and (12 Marks) For a MIM 1 queuing system define the term traffic intensity P and find the expression for steady state probability ofbeing in state n, in terms (08 Marks) P9. ofP. a z 8 a. tr (08 Marks) b. c. d. Write short notes on : Single and multi parameter histogram Markov model Central server queuing model ofa timesharing system Open, closed and mixed queuing networks. (20 Marks)
  6. 6. 12SCS1s2/12SCE152 USN First Semester M.Tech. Degree Examination, D ec.20l3 I J an.20l4 Gomputer Graphics & Visualization Time: 3 hrs. Max. Marks:100 Notet Answer any FIVE.full questions. E I a. b. Explain the concept of pinhole camera with a neat diagram. Find the co-ordinates of the point (x, y, z) when projected on a film mounted inside the box.on the side opposite to pinhole. Also find the expression for field of view. With a suitable diagram, explain the graphics pipeline and its components. (10 Marks) (I0 Marks) Write an OpenGL program components (not full program) to approximate a unit sphere -^t b. .gA Y.) 3a. b. 4 a. b. 'i -a a 5 --9 a E Explain the concept of transtbrmations in homogeneous co-ordinates. Find transformation matrix and its inverse in each case. (15 Marks) Consider a line obtained by joining the points ( 1 , 5, 7) and (3, 8, 1 1). Obtain the co-ordinates ofend poiirts ofthis line when it is rotated by an angle _of 38o about z-axis. (05 Marks) I 6 a. What are the various basic types ofthe light sources? Explain each. b. Explain how various material properties are specified in OpenGL. a. a. o (10 Marks) What are the various classes of logical input devices? With suitable diagrams, explain various input modes. (10 Ma rks) Given a unit circle, take 4 points which are equidistant and lie on circumference of this unit circle. Write program segments in OpenGL to rotate this square. (10 Marks) OpenGL. b. z (10 Marks) Explain the concept of perspective normalization trarsformation. Derive an expression for the perspective piojection matrix used in (20 Marks) qa .JE using the quadrilaterals. Explain the concept of Marching Squares to solve the Implicit equations. b. c. d. (12 Marks) (08 Marks) Explain the concept of Hermite form of curve interpolation by deriving various matrix forms. Explain the concept of general B-splines and the recursively defined Write shorl notes on the lollou ing: Axonometric projections. Quaternions. Phong shading. Rubber banding. (10 Marks) B-splines. (10 Marks) (20 Marks)