Roll NO. sos IV B.E. EXAMINATION APRIL — MAY 2012 8553 : NEURAL NETWORK & FUZZY SYSTEMS Time :3 Hours Maximum Marks : 100 ‘Minimum Pass Marks : 35, Question Attempt any Five questions. All questions carry equal marks. No. 1. (@) _ Define the Neural network. Compare the biological neuron with artificial neuron. (b) Explain McCulloch Pitts model of neural network. 2. (a) The input to a single input neuron is 2.0, its weight is 2.3 and its bias is -3, Find the net input to the transfer function A output. Also explain the mean square error. (b) Mention the different types of activation functions along different models. ‘their significance in 3. (a) _ Find the new weights when the network (Back Propagation) in Fig presented the input pattern [0.6 0.8 0 J and target output is 0.9. use learning rate = 0.3 and use binary sigmoid activation function, (b) What kind of problem can be solved with reinforcement learning algorithms? What are the advantages and disadvantages of this technique? (2) Using the perception learning rule, find the weights required to perform the following Classification vectors (1, 1, 1, 1) (-1, 4, -4, -1) (4, -1, -1, 1) are members of class {having target value 1); vectors (1 1 1 -) and (1, -1, -1, 1) are not members of class (having target value -1). Use learning rate of 1 and starting weight of 0. Using each of the c training and vectors as input, test the response of the net. {b) Realize the exclusive-OR function using Hebb net with bipolar input targets. 5. ‘AKohonen self organizing map is shown with weights in figure. (3) Using the square of Euclidean distance find the cluster unit C, that is closest to the input vector (0.3, 0.4) (i) Using a learning rate 0.3, find the new weights for unit C). (iil) Find new weights for C,s and Cy, if they are allowed to learn.6. 8, (a) (b) fa) (b) Write the training algorithm for counter propagation network. Also neocognitron. Explain the Architecture of ADALINE and MADALINE with suitable diagram. Draw the Architecture of ART. Also explain the training of ART. Explain the following : () Fuzzy entropy theorem (i) Fuzzy associative memory. ‘Write short notes (any Two) : (Comparison of fuzzy and neural systems (i) Kalman fitter controller (ii) Training of cross berg layer (iv) Cauchy training, eee ER RE explainTime : 3 Hours Maximum Marks : 100 Roll N IV B.E. EXAMINATION APRIL — MAY 2012 8YZ1 : CELLULAR AND MOBILE COMMUNICATION Question Attempt any Five questions. All questions carry equal marks, No. 1 4 5. (@) (b) (a) (b) (a) (b) (a) (b) (a) (b) (a) (b) Explain uniqueness of Mobile radio transmission medium in dete Explain performance criteria of cellular mobile communication. Explain Hand-off and cell splitting mechanism. During a busy hour, the number of calls per hour Q, for each of 10 cells is 2000, 1500, 3000, 500, 1000, 1200, 1800, 2500, 2800, 900. Assume that 60% of the car phones will bbe used during this period (6 = 0.6) and that one call is made per car phone. Calculate total allowed subscriber traffic Mt. Explain various models for path loss calculations. Explain free space and multipath propagation. Explain point to point model in detail. Describe functional architecture of GSM. Describe network access techniques. Describe different types of WLAN Standards. Explain fading models. Describe design and principle of WAP. ‘What Is mobile - TCP? Write a short notes : () Sensor networks (i) Channel assignment schemes (ii) Bluetooth (iv) Mobile-P eR REE Minimum Pass Marks : 35, Marks 15 05, 12 08 12 08 20 12 08 15 05 12 08, 20B.E, Examination . 8Y51: Advance Operating System Time: 3 hrs. ‘Max. Marks: 100 Min, Pass marks: 35 Note; All question carry equal marks. Attempt any five questions. 1 (@) Why is flexibility en important feature in the design of a distributed system? Discuss some of - the guideline principles for designing a scalable distributed system. (b) What are the important concepts with which the designer can improve performance of the . distributed system? What is the main problem in making a system highly reliable? Q2 (a) Describe the implementation of RPC mechanism with the help of suitable example, How ‘marshalling arguments and results involve in implementation of RPC? . (b) Differentiate stateful & stateless server. Why do some distributed application use stateless server in spite of the fact that stateful servers provide an easier programming paradigm and are typically more efficient than stateless server? Vv “C: Q3 (@)Explain what is meant by consistent and causal ordering of message? Give a mechanism to ‘implement each one. (b)Discuss variouis approaches for centralized clock synchronization algorithm. How distributed algorithm clock synchronization overcome the drawback of centralized clock synchronization algorithm? : A o 1 ote 4 5 6 7 Stage-l [x x x x Stage-2 x x Stage-3 x * (0) Prove that a K-stage linear pipeline can be at most K-time faster than that of a non-pipelined serial processor. (©) Discuss Delayed Branch Approach for handling Jump instructions in pipeline systemUNIT-3 3.(@) What are various unit of super computer ? Discuss in detail its architecture and how its memory is organized ? (©) Explain the significance of masking in array processors. (©) What do you understand by Pipeline chaining and Vector loop ? Discuss UNIT-4 4(@) What do you understand by Interconnection Network? What are the differences between Static and Dynamic Interconnection Networks? (b) Discuss the following : @ SIMD Matrix multiplication (i) Parallel Sorting (©) Explain the following : @° Barrel shifting function Gi) Shuffle exchange function UNIT-S 5(@) State and Explain the architectural configuration of multiprocessors. Explain loosely coupled and tightly coupled multiprocessors. (>) Write an essay on Transputes and its applications. 0) What do you understand by data flow computer ? Explain. robenesies eteB.E. Examination- April / May 2012 TY71: Networking with TCP / IP Time: Three Hours Max Marks: 100 Min, Pass Marks: 35 Note: Total numbers of questions are: 08. Attempt any five questions. All questions carry equal marks. Q.1 (a) Explain layering of protocols? Differentiate between TCP/IP and OSI model? (b) Write a comparison between IPV4 and IPV6 headers? Q.2 (a) Explain the Architecture of ISDN? Also discuss various services provided by ISDN? (b) Explain Ethernet and IEEE 802 encapsulation with the help of frame format? Also define the term trailer encapsulation? Q3 (a) What do you understand by Loopback interface? Explain with the help of suitable example. (b) Explain ATM layers in detail. Specify which AAL is used to carry IP packets in the Internet and Why? Q4(@) Explain how the TCP connection can be establish and release? (0) Discuss the SONET in detail? Q5 (a) Disouss the following: (i) SLIP: Serial Line IP and Compressed SLIP Gi) PPP: Point- to- Point Protocol (b) Contrast and compare Distance vector routing with Link state routing? Q.6 (a) Write short note on the following: ( Future of TCPAP Gi) HTTP (b) Explain the services provided by the system using 802.11 standard?Q.7 (a) Explain the Architecture of IEEE 802.11 (WLAN). Differentiate between IBEE 802.11 aand IEEE 802.11 b. (b) Explain ICMP packet format? Also discuss various ICMP message types? Qs. Write short notes on any four of the following (@ Netiquettes (b) TCP over ATM (©) USENET @ Digital IDs (©) DNS Peverrererrrtr too)ROI Nowsrsssss IV B.E. EXAMINATION APRIL — MAY 2012 1¥72/7445 : ATM NETWORKS Time :3 Hours Maximum Marks : 100 Minimum Pass Marks : 35, Question Attempt any Five questions. All questions carry equal marks. No. 1, (a) _ Differentiate between ISDN & BISDN services. {b) Which types of communication medium (cable) is used for ATM and why? {2) Explain Transmission Path, Digital Section & Regenerator Section. {b) Clearly discuss the various performance parameters for BISDN. 3. (a) Compare and contrast B-ISDN PRM and the OSt reference model. (b) Discuss cell delineation mechanism. 4. (a) What services are offered by AAL %?- Des services, message mode and streaming mode {b) What is meant by inverse multiplexing ATM? 5. (a) What is the impact of ATM on voice connections and how can one get rid of this? (b) Which security objectives should be met by ATM networks? Which security measures may be used? 6. (a) What do ATM multiplexers / cross connects / switches perform? (b) Describe self-routing and table controlled cell switching. 7. (2) What advantages can an ATM based LAN provide in contrast to legacy LAN € technologies? {b) What is meant by classical IP over ATM? a Write short notes on (Any Four) : (i) CBDS and smps (i) Header of ATM Cell (ii) PON (iv) VPI & vet wy t (vi) eeBE, Examination- April / May 2012 TY52: Compiler Design & Translator Time: Three Hours Max Marks: 100 Min, Pass Marks: 35 Note: Total numbers of questions are: 08. Aétempt any five questions. All questions carry equal marks. Qu (a) Define Compiler? Explain important phases of compilation process? (>) Compare and contrast the features of a single pass compiler with multipass compiler. Q2(a) Explain the difference between a compiled language and a interpreted language. Give examples of each. (b) _ List various lexical errors and actions to be taken to recover from lexical errors? Q3(a) Write short note on the following (@ Bootstrapping (i) Conventional vs incremental compiler (b) Explain the rote of symbol table in various phases of compiler Q4 (a) Write a LEX program to recognize white space, identifier, if then and else, (b) Describe the role of a lexical analyzer and also explain the concept of Input Buffering, Q.5 (a) Differentiate between top down and bottom up parsing. (b) Write short note on the following- () Storage organization (Gi) Recursive decent parser Q.6 (a) Write the algorithm / procedure for construction of the canonical-LR parsing table. (b) Discuss various issues in the design of a code generator? Q.7(@) Construct canonical LR parser of the following : S—Aa/bAc/Be/ bBa Aad Bod(b) Do left factoring in the following grammar: Av aAB/aA/a Bo bB/b remove the Left recursion. Q.8 Write short notes on any four of the following: (a) Type Checking : (b) Peephole Optimization () Error Handler (@ Static and Dynamic Binding (©) YACC Jee Heres cree beeRoll No IV B.E. EXAMINATION APRIL — MAY 2012 TY12 : INTERNET TECHNOLOGY & WEB DESIGNING Time :3 Hours Maximum Marks : 100 Minimum Pass Marks : 35 Attempt any five questions. (Q4. What is HTML? Explain in detail various tags to perform following task: 10 marks 2. Change paragraph. b. Divide web page into frames ©. Take input using text box d. To provide hypertink using anchor tag. fe. To change background colour of web page. Q2, What are different types of e-mail? What is the protocol used by mail servers to send and retrieve mails? Explain these protocols in detail 20 marks Q3. What are static and dynamic web pages? What are various ways to create dynamic web page? ‘Also explain use of java scripts in detail, 20 marks Q4, What is web browser? Is it a client or server program? Mention names of any five web browsers? What are the features provided by various web browsers? What will the web browser displays when it receives the code 404? 20 marks 05. a. Explain web management in detail, 10 marks b. What are various web browsers? Explain their working in detail. 10 marks Q6. What is internet? What are various ways by which a computer can connect to internet? Also explain the purpose of gateways. What do you mean by WAP gateway? 20 marks Q7. Differentiate between: 20 marks a. JSP & Servlets. b, JSP & Javascripts. ©. Servier & applets, a8. a. Explain various ways b. Explain how databases are connected to web application: session tracking in detail? 10 marks detail tOmarksrot Roll No. ....+: B.E. Examination, May 2012 (ME/EE/EC/CE/CSEAT/CM/BT) Basic Computer Engineering (2X73) Time: Three hours Maximum Marks: 70 Minimum pass Marks: 22 Note: Total no. of question is eight, Attempt any five questions. All questions carry equal marks, Missing data (if any), may be assumed suitably. Q1.-a) Draw a block diagram to illustrate the basic organization of computer system and explain the function of various units. ) Explain the mechanism of storing data in a personal computer. What are the different types of computer memory, explain each briefly? Q2. a) What is an operating system? Explain the different types of operating system? 'b) Explain the different services of an operating system? Q3, a) Explain different features of Object Oriented Programming. ») Differentiate Primary data types with composite data types with example. Q4.a) What is database management system? What are the advantages and disadvantages of DBMS? b) Explain different database management languages? QS. a) Explain the following terminologies associated with Computer Networks? ‘Repeaters ii) Hubs _ iii) Routers iv) Switches. v) Bridges _vi) Gateways b) Explain functions of different layers of TCP/IP model? Q6. a) What are the different types of inheritance in C++? ) What are different bases on which the computer networks can be classified? a) Write a program to find the factorial ofa given number? b) Explain the Different types of constructor with example. Q8. Write a short note of the following (any three): @ Network Security Gi) Detebase Schema Gi) Computer application in E-commercé _(iv) Overloading functionsBE LV Semester Examination, April-May 2012 Operating System (CSE, IT) 4¥52 (New) Time: farks: 70 ___ Minimum Pass Marks: 22 Note: Attempt any five questions. All questions carry equal marks, Missing data, if any, may be assumed suitably. 1.(@) Why operating system is necessary? List the services provided by the operating system for the convenience of the user and for the efficient operation of the computer system. (b) What do you mean by buffering and spooling? Explain time sharing system also in detail. 2. (@) For the jobs given below calculate the average turnaround time, average waiting time using FCFS, preemptive priority and round robin scheduling(Time quantum=1). Job___| Burst time | Arrival Time _ | Priority A 10 0 3 B 2 1 1 c 4 2 3 D 6 4 4 E 5 4 2 J ‘Assume 1 as the highest priority and 4 as the lowest priority. (b) Discuss long term, medium-term and short term schedulers. Explain dispatcher also. 3.(a) What is deadlock? Explain various scheme for deadlock detection, prevention and recovery. (b) What are semaphores? Can general semaphores be implemented by using binary semaphores? 4.(a) Consider the following snapshot of a system: Process | Allocation ‘Max ‘Available A [BIC [D {A ]B [Cc JD {A |B |C |D | PO 0 jo {i {2 fo Jo [1 j2 Ji [5 [2 fo PI 1 Jo Jo Jo |1 |7 /5 Jo | P2 143 |5 14 [2 13 |5 |6 P3 0 16 |3 {2 {0 /6 {5 |2 Pa o jo |i [4 fo Jo |5 |e L | Answer the following questions using the Banker’s algorithm | 7.0) |@ Gi. ) 5.(@) b) ‘What is the content of the matrix need? Is the system in a safe state? ‘What do you understand by memory management in computer? Why itis essential? Giving suitable examples, discuss segmentation scheme also. Explain segmented paging with example, Represent the sentence “We are Engg Students” in physical memory if page size is 5 characters and the entries in page table are~ 6.(@) ) 8 wreo 0 Assume physical memory size to be 55 characters. What is thrashing ? What kind of problems may occur due to thrashing? Consider the following page reference string- 123145621327634126 ‘How many page faults would occur for the following page replacement algorithms assuming six frames? All ftames are initially empty. @ LRU Gi) FIFO Gi) Optimal. Suppose the head of moving head disk with 200 tracks numbered 0 to 199 is currently serving a request at track 50 and has just finished a request at track 85.1 the queue of requests is kept in FIFO order. 100, 199, $6, 150, 25, 155, 70, 85 ‘A seek takes 6 millisecond per cylinder moved. How much seek time is needed for the following- SCAN (jv) LOOK (v) C-LOOK. @FCFS Gi) SSTF ‘Write explanatory short notes on any two of the following- @) Internal Fragmentation and external fragmentation Gi) Distributed Systems ii) Multiprocessor scheduling (iv) Demand pagingB, E. Examination, May 2012 Analog and Digital communication AYTL (CSE & IT) ‘Time: Three Hours ‘Maximum Marks: 70 ‘Minimum pass Marks: 22 Note: Attempt any five questions. All questions carry equal marks. Missing data (if any), may be suitably assumed. Qi a) ») Q2 a b) Q3 a) b) Q4 a) b) Qs. a) ») Q6 a) b) Q7. a) b) An oscillator when tumed on gives an output in the form of damped cosine wave. Find its fourier Transform and Spectrum? Find the Fourier transform of a single-side exponential function e~Pt u(t) . Also craw the spectrum, where u(t) is unit step fimetion ? State and Prove Parseval's theorem for energy signal and power signals? State and prove Sampling Theorem? Explain Balanced modulator technique for DSB-SC Generation, Explain different methods of SSB-SC Generation, Explain the method of generating FM signal using indirect method. ‘Compare AM and FM on the basis of application and Spectrum. Explain in detail about DPCM with suitable diagram, Draw the block diagram of an AM super heterodyne receiver and explain function of each block. Explain the concept of ASK and derive the relation for error probability of binary ASK. Enumerate the advantages and disadvantages of FSK over PSK system What is Entropy? Show that entropy is maximum when all the messages are equiprobable. ‘What is mutual information? Derive the expression for transferred information.Q8. ‘Write Short notes on (any two) 1) Huffman Coding 2) Cyclic Codes 3) Optimum Filterols B.E. Examination ~ April 2012 4Y42/4445(old) : Digital circuit and systems Time : Three Hour ‘Max Marks : 100 Min Marks : 35 Note : 1. Total Number of Questions are 08. Attempt any five questions. 2. All questions earry equal marks. Q.1 (a) Implement the following fumetion with NAND gates: FOcy,z) = (0,6) (b) Find the 10’s complement of (935). (©) Write gray code and BCD code for (18)10 (d) (327.4)s to its 8° complement and 7° complement. Q.2 (a) Minimize the expression using K-map and implement using NAND gate only : F(AB,C,D) = 5(2,3,4,5,13,15) +5: d (8,9,10,11) (b) Implement a full sub tractor with two half sub tractor and an OR gate. Q:3 (a) What is a shift register ? How a word is stored in a serial shift register ? () Design a synchronous 4 bit up-down counter. Q-4 (@) Draw the circuit of a Schmitt trigger and explain how the hysteresis is developed inits output. (©) Explain the race-around condition in relation to the J-K flip flop. How ean it be avoided using a Master-slave J-K flip-flop, explain with the suitable diagrams. Q5 (a) Explain the working of dual slope A/D convertor (©) Explain the look ahead carry generator and discuss its utility in adders. Q6 (a) Define the following (i) Propagation delay time of a logic gate. _({i) Figure of merit of digital IC. (ii) Fan out and Fan in (iv) Noise margin (b) Differentiate between MOS and CMOS on the basis of characteristic, advantages and disadvantages. Q7 (@) A combinational cirouit is defined by the functions F\(A,B.C) =¥ G,5,6,7) F (ABC) = ¥ (0,2,4,7) Implement the circuit with ¢ PLA having three inputs , four product terms and two outputs. (b) Generate the digital combinational circuit using MUX which detects the prime number in 4-bit binary code. Take the second bit from MSB side as the input to the MUX. Q.8 Write short notes on the following @ Sample and Hold cireuit ii) D/A convertor. (iii) PLA11 B.E. EXAMINATION APRIL — MAY 2012 COMPUTER ARCHITECTURE (4Y52) Time: Three hours Max. Marks: 100 Minimum Passing Marks: 35 Note: Total no. of questions are eight, Attempt any five questions. Ali questions carry equal marks. Missing data, if any, may be assumed suitably. QI (a) Describe the mechanism of an instruction fetching, decoding | 10 and execution using flow chart? What is an instruction? What are the different paris of an (&) _| instruction? A machine support 16-bit instruction format, the | 10 size of address field is 4-bit. The computer support expanding opcode technique and has 55000 Zero-address instruction and 100 One-address instructions. Find out the Number of two- address instructions supported by this machine. Explain various addressing modes. An instruction is stored at | 10 Q.02(@) | location 300 with its address field at location 301. The address field has the value 400. A processor register R1 contains the number 200. Evaluate the effective address if the addressing mode of the instruction is (@) Direct; (b) Immediate; (c) register indirect; (4) relative; (©) Index with RI as the index register ©) __| Differentiate between hardwired control and micro programmed | 10 control. Draw the block diagram of a basic hardwired control organization with two decoders , a sequence counter and a number of contro! logic gates? Q.03 (a) Describe in words and by means of a block diagram how | 10 matched word can be read out from an associative memory. @®)_|A virtual memory system has an address space of 8K words, a | 10 memory space of 4K words, and page and block size of 1K words. The following page reference changes occur during a given time interval. 420126140102357 Determine the four pages that are resident in main memory after each page reference change if the replacement algorithm used is 1)LRU_2) LFU 3) FIFO. Q04(@) [A digital computer has a memory unit of IMFI6 and a cache | 10 memory of 4K words. The cache uses direct mapping with a block size of eight words. How many bits are there in the tag, index, block and word field of address format? How many blocks can the cache accommodate? Also show the cache organization.6) Define the following: a) /O versus memory Bus b)1/O interface ©) Parallel versus serial data transfer 10 ‘Q05 @ What is interrupt? Describe different types of interrupts and their _use, How a processor handles a vectored interrupt? 10 &) Explain the responsibilities of a typical DMA controller. A DMA controller transfer 16 bit words to memory using cycle stealing. The words are assembled from a device that transmits character at a rate of 2400 character/sec, the CPU fetching and executing instructions at an average rate of 1 million instructions/sec. By how much will the CPU be slow down because of a DMA transfer? 10 Q06 @ Explain the different techniques used for interfacing 1/0 devices with 8085 processor. State the merits and demerits of each. 10 &) Describe the major hardware functional unit of 8085 microprocessor with a neat complete functional diagram. 10 Q07 @ Explain the operation of a multiprocessor system with multiport memory. 10 ®) Why does pipelining improve performance? What are the various instruction hazards which affect the performance of pipeline processors? Also explain their impact on throughput, 10 2.08 Write short notes on the following (Any Three): a) Microlnstruction formats >) micro-computer ©) UART @) Static RAM & Dynamic RAM 20 “B.E. Second Year Examination, April/ May 2012 Data Structures/ Data Structures and Algorithm (4Y51) Time:Three hours Note: Attempt any five questions. All questions carry equal marks 1 @). What do you understand by the tem Data Structure? Why are they used? List the various operations which are generally performed on them and discuss any two operations in details (b) Explain the followin i) Needs of Triangular Arrays ii) Structural Programming 2 (a) What do you understand by stack ? Describe PUSH and POP operations. Implement the stack and demonstrate PUSH and POP operations. (b) What is dequeue? Discuss the different applications of a Queue, 3(a) What do you understand by binary search tree (BST)? Explain with the help vf suitable example. (©) Discuss different traversing methods for binary tree. For each case give the suitable example. (a) A binary tree T has 9 nodes. The inorder and preorder traversals of T yield the following sequences of nodes : Imorder =: ~EACKFHDBG Preorder =: FAEKCDHGB Draw the tree T. (b) Write the bubble sort algorithm and apply this algorithm to sort the following data (show all the intermediate steps ). 10, 30, 60, 40, 80, 70, 90, 205(a) Discuss the open addressing methods of handling the collision in context of hashing (b) Write an algorithm to generate fully parenthesized infix expressions from their postfix form. What is the complexity of your algorithm? 6(a) What are the different operations which are performed on a graph? Explain with the help of examples. (b) Discuss different approaches for storing Graph in the memory. 7 (a) What do you understand by the minimum spanuing tree? Discuss any one method for obiaining minimum spanning tree from a given Graph. (b) Design a binary search tree from the following nodes ( demonstrate each step of the design): D,B.M,S.A,T,R,C,O,P,EN 8 Write short notes on the following (any three): (@® Threaded Binary Tree (ii) Complexity of an algorithm Gi) Multiway Search Tree (iv) Heap Sort 1 Seana EEBE, Examination 3Y51:Object Oriented Programming and Methodology Time: 3 hrs. Max. Marks: 70 Min, Pass marks: 22 Note: All question carry equal marks, Attempt any five questions. Q.1 (a) Describe the communication of objects using object oriented programming ? How does a class accomplish data hiding? (b) What is abstract data type? Write a C+ program for implementing data encapsulation and data abstraction, Q.2 (a) Describe the destructors with the help of suitable example. How do we invoke a constructor function? (b) What is copy constructor? How to create dynamic constructor using C++ object oriented programming language? Q.3 (@) what is role of ftiend function in object oriented programming? What is the main advantage of passing argument by reference? 7 (b) Describe the concept of fimetion overloading with the help of suitable example. <4 (@) why is it necessary to overload an operator? Describe the syntax of operator function, (0) Write a C+ program for overloading binary operator using friend function. Q5 (a) When do we use the protect visibility specifier to a class member? Describe the syntax of multiple inheritances in C++. (b) Differentiate virtual base class and abstract class with the help of suitable example, Q6 (@) Describe how an object of a class contain objects of another class. (b) How to override a function? Explain it with the help of suitable example. Q.7 (@) when do we make a virtual function “pure”? What are the implications of making @ function a pure virtual function? (©) Write a C+ program opening a file with constructor function and open function. Q. 8 Write short Notes on the following (any three) 1, Association and aggregation 2. Virtual function 3. Pointer to objects ; 4, Type castingQu Q2: Q3: Q4: B.E. IV Semester Examination-April/May 2012 442/445 : Digital Circuits and Systems Time: Three Hours Max.Marks : 100 Min.Pass Marks : 35, Note: 1, Total Number of questions:08 @ (b) @ ) @ 0) @ 2, Attempt any five questions. All questions earry equal marks. 3, Assume suitable data if missing. Convert the following: @ — 82)0= Oz Gi) (1101.101)2= Oro (ily (745.235)e= (a Gy) (785.625)10= Os (Using 10's complement subtract 69785 3456 Gi) Using 2's complement subtract 4000100 ~ 1010100 Draw the Kamaugh Map for WXYZ and hence find minimal expression by (i) Considering don’t care terms ; Gi) Without considering don’t care terms FCWKYZ) = Syn(0,1.2.3,5,8,9,1011,18) + Zo(4.14) Realize the above minimum expression using NAND gates only. Design a BCD adder. - Briefly describe the different types of flip-flops used in digital circuits. Discuss their merits ‘and demerits. Explain the combinational and sequential logic cireuits. How combinational logic circuits are different with sequential logic circuits. : Design a BCD-to-Decimal decoder.(b) () Q.6: @) () Q7z: @ ) Qk: Implement a full subtractor with two half subtractors and an OR gate. Explain the term fan-out. What is its importance? Determine the high level output voltage of ‘the RTL gate for a fan-out of 5. Implement the following function with a multiplexer: F(A, B, C,D) = ¥(0,1,3,4,8,9,15) Explain the race-around condition in relation to the J-K flip-flop. How can it be avoided using a Master-slave J-K flip-flop, explain with the suitable diagrams. ‘What is a multiplexer ? Explain the operation of a 4:1 multiplexer with enable input using NAND gates. Draw the circuit of an R/2R ladder type digital to analog converter using an Op-Amp. Discuss its working. Draw the circuit of a Schmitt trigger circuit and explain how the hysteresis is developed in its output. Write short notes on any four of the following: (Shift registers (i) Multivibrators (ii) Ring counters (iv) Semiconductor memories if (¥) Sample and Hold circuits (vi) Programmable Logic Array (PLA) cB.E. Second Year Examination, April/May 2012 Computer System Organization (3Y52) Time: Three Hours Note: Autemipt any five questions. All questions carry equal marks 1(@) Define firmware, software and hardware, Write the name of firmware used in 8085 microprocessor Trainer kits. (b) With the help of block diagram discuss the working of control Unit of a Basic Digital Computer? Also draw Flow chart of computer cycle control. 2(a) What do you understand by memory Organization? Discuss in detail. (©) Explain with an example; instruction cycle, machine cycle and states. 3(a) Discuss different type of instructions and for each case gives the suitable example. (0) Explain the following (@ Cache Memory (ii) Associative Memory 4(@) What do you understand by Direct Memory Access (DMA). Draw the block diagram of DMA controller. (b) Discuss in brief different mapping methods of Cache memory. 5(@) With the help of block diagram discuss the architecture of 8085 microprocessor. (b) What do you understand by Input-Output Organization? Discuss in detail. PTO6{@) 0) 7{a) 0) Diseuss various type of addressing mode of 8085 microprocessor. For each case give the suitable example, What do you understand by the term Parallel Processing? Discuss some applications of parallel processing. Explain the following :- (9 Clock period (il) Throughput Gil) Speed up Discuss how branch instructions are handled in an instruction pipe line? Write the short notes on the following: (Virtual Memory (ii). Multiprocessor System ii) Microinstruetion € (iv) Opcode encoding etmeeereeseneeeeRoll Ne Il B.E. EXAMINATION APRIL — MAY 2012 6Y52 : COMPUTER GRAPHICS & MULTIMEDIA Time :3 Hours Maximum Marks : 100 Minimum Pass Marks : 35 Question Attempt any Five questions, All Questions carry equal marks. No. 1. (a) Describe the following terms in very short : (i) Persistence, (ii) Refresh Rate, (li) Aspect Ratio, (Iv) Horizontal Retrace, (v) Autialiasing, {b) What are the logical classifications of input devices? Explain the working of light pen. 2. (a) What are prame grabbers? Are prame buffers different from prame grabbers? How are different shades of color generated on the RBG monitors? (b) Design Bresenham’s line drawing algorithm which works for a line segment having Positive slope greater than 1. 3. (a) Explain ray tracing rendering techniques. (b) Use the mid point circle generation algorithm to find the pixels needed to draw the arc of circle (x+1)* + (y-2)? = 9 from (-1, 5) to (4, 2). i 4. (a) Amodified 8 spline of order 4 is defined using control points By (1, 1), Bs (2, -1), Bs (3, 2) and By (4, 1). Another control point is added at Bz. What will be the effect on the change of curve? Sketch the two curves approximately. What are the knot vectors in the two cases (using integer increment values with first knot as 0)? (b) What do you mean by scan conversion? What methods are adopted to remove the side effects of scan conversion? 5. (a) What is the need of normalized device coordinates ? find normalized transformation that maps a window defined by the vertices A (1, 1), B (5, 3), C (4, 5) and D (0, 3) an to 2 view part that is the entire normalised device system. (b) A unit cube is placed at origin with its edges parallel to co-ordinate axis and three of edges touch the axis. Find the perspective projection of unit cube on XY plane when it Is viewed from the point (2, 3, 5). 6. (a) What is the homogeneous equation of a line? Write the formula for the intersection of, two lines specified in homogeneous form. What is the homogenous equation of a plane? : {b) What are the limitations of Cohen - Sutherland line clipping algorithm? Compare it with Cyrus back algorithm. Give a clipping window with comers as [ (0, 0), 5, 0}, (5, 5), (0, 5) J. Find using Cohen ~ Sutherland algorithm if the line P, P, with Py = {-6, -2) and Pa=(-4, 5) and line P3 Ps with P3 = (-1, 1) and P, = (6, 3) can be finally rejected.(@) {b) (@) (b) A polyhedral object is to be rendered on the screen using Gourand Shading. Describe the steps in detail. Explain HSV to RGB conversion algorithm. Why is synchronization are important issue in multimedia presentation? brief note on : Multimedia tools Color mode! (iil) —_Beizier Method (iv) World Coordinate system. ee KR RE og 12Rall No. M.Tech. (Second Semester) Examination, May 2012 COMPUTER SCIENCE AND ENGINEERING ADVANCE DATABASE MANAGEMENT SYSTEMS — MCSE 201 ‘Time: Three hours Maximum Marks: 70 Minimum Pass Marks: 28 Note: Total no. of question is eight. Attempt any five questions. All questions carry equal marks. Missing data, if any, may be assumed suitably. Qt." a) List significant differences between a file-processing system and a DBMS. b) Explain the difference between physical and logical data independence. c) What are the responsibilities of a DBA? If we assume that the DBA is never interested in running his or her own queries, does the DBA sfill need to understand query optimization? Why? Q2. a) A university registrar’s office maintains data about the following entities: (a) courses, including number, title, credits, syllabus, and prerequisites; (b) course offerings, including course number, year, semester, section number, instructor(s), timings, and classroom; (c) students, including student- id, name, and program; and (d) instructors, including identification number, name, department, and title. Further, the enrollment of students in courses and grades awarded to students in each course they are enrolled for must be appropriately modeled. Construct an E-R diagram for the registrar's office. Document all assumptions that you make about the mapping constraints. b) Consider a failure that occurs during 2PC for a transaction. For each possible failure, Explain how 2PC ensures transaction atomicity despite the failure Q3. (a) What are the various types of failure can occur in database? Discuss the log based recovery mechanistn? (b) Let relations (A,B,C) and r{C,D,E) have the following properties: ry has 20,000 tuples, rz has 45,000 tuples, 26 tuples of-r; fit on one block, and 30 tuples of ra fit on one block. Estimate the number of block accesses required, using each of the following join strategies for rs o¢ t2: i, Nested-loop join ji, Block nested-loop join iii, Merge joi iv. Hash join 4, Consider the employee database given below, where the primary keys are underlined. Give an expression in SQL for each of the following queries,employee (employee-name, street, city) works (employee-name, company-name, salary) company (company-name, city) manages (employee-name, managet-name) iL Find the names and cities of residence of all employees who work for First Bank Corporation. ii. Find the names, street addresses, and cities of residence of all employees who work for First Bank Corporation and eam more than $10,000. ii, Find all employees in the database who live in the same cities as the companies for which they work. iv. Find all employees in the database who live in the same cities and on the same streets as do their managers. \V_ Find all employees in the database who do not work for First Bank Corporation. Vi. Find all employees in the database who earn more than each employee of Small Bank Corporation. Q8. (a) Consider the following two transactions: 31: readi(A); read(B); if A= Othen B= B+ 1; write(®). 732: read(B); read(A); ifB = OthenA=A+ 1; write(A). . ‘Add lock and unlock instructions to transactions T31 and. T32, so that they observe the two-phase locking protocol. Can the execution of these transactions result in a deadlock? (©) Oracle Xi supports many different types of objects, explain with examples, How cah we selecting data from varying array? 6. (a) During its execution, a transaction passes through several states, unt it finally ‘commits or aborts. List all possible sequences of states through which @ transaction may pass. Explain why each state transition may occur. (b) How schedules can be tested for serialzablity? Explain with example, What are the different techniques used for testing serializabilty? 7. (a) What is an Object-oriented database? What are its advantages compared to relational database? Explain some applications where an object-oriented database may be useful. () What is Distributed DBMS? Write a C.J. Date rules for any system to claim for being a DDBMS. Q8. Wiite a short note on the following (any three) () Indexing of Spatial Data (ii) Multimedia database (ii) XML Database (iv) Mobile databaseom, CO Roll NOt Ul B.E. EXAMINATION APRIL ~ MAY 2012 6442 / 6Y42 : DIGITAL SIGNAL PROCESSING Time : 3 Hours Maximum Marks 100 Minimum Pass Marks : 35 Question Attempt any Five questions. All Questions carry equal marks, Marks No. 1. {a} Bymeans of DFT and IDFT, determine the response of the FIR filter with : 2 h(n) = (12,3) t x(n) = {1,2,2,1} t {b) Determine whether given signal is periodic: 08 x(n) = Cosn/3 Also plot the spectra of the signal, 2 {a) Describe the following properties of Discrete Fourier Transform (DFT) : 10 Time Shifting (iii) Symmetry (ii) Duality tiv) Circular convolution (b) Determine the N-point of following sequences : 10 ) x(n] = 5 (n—1) 0 Sm SN-1 + a® OSn x) = 2?[1-$ 29] Pee t-27] random variable X has the probability density function Determine and sketch the cumulative distribution function, F(x) of X. Let X be a random variable with uniform probability density furcctio to-#1, Determine : (i) mean of x, (il) Variance of X. oO xXS@ 1 fad= |e asxb the interval -1 Draw the flow graph for decimation in time FFT algorithm for M = 8 using radix - 2. Design a digital Butterworth filter satisfying the constraints : 0.707 < lH (e@)}| <| foros o © <= <2 lH(e)| < 0.2 for Swsn with T= 1 second. Use bilinear transformation approach. Write short notes on any Two : ()—Chirp-2 Transform (il) Goertzel Algorithm (i) Tellegen’s Theorem ee RE 10 10 10 10 10 20Roll No... Il B.E. EXAMINATION APRIL — MAY 2012 6551 : ANALYSIS & DESIGN OF ALGORITHM Time :3 Hours Maximum Marks : 100 Minimum Pass Marks : 35, Question Attempt any Five questions. ' All Questions carry equal marks. Marks No, 1. (a) Given an efficient algorithm to determine if there exists an integer i such that A,=iin 10 an array of integers Ay < Ay < Ay <..... Ay What is the running time of your algorithm? (b) What do you mean by abstract data types? Write an algorithm to evaluate a postfix 10 expression using stack and illustrate with the help of an example. hae 05 (2) Show that the maximum number of nodes in a binary tree of height H is, (b) Show that if binary tree T is full at level i, then it is full at every level j smaller than i. 05 (€)_ Give Pseudo code for the push and pop operations on a stack implemented using 10 linked —list. 3. (2) Show the following Knapsack problem using Greedy method : 10 p= (11, 21, 31, 33), w= (4,2, 15,11), c=31,n=4 (b) Write down the pseudo code of quick sort and determine the worst case time 10 complexity of quick sort. 4. (a) Using the concept of dynamic programming, give an O(n’) time complexity to find the 10. longest monotonically increasing subsequence of a sequence of n numbers. {b) Discuss a solution of travelling salesman problem based on branch and bound method. 10 5. (a) Explain traversal techniques for graph, 08 € (b) Show that g € o(f) but f ¢ o(g) when f{n) = = n? and g(n) = 37n? + 120n + 17. o7 {c) Solve the following recurrence relation : 05 Tn) = 9T(n/3)+4n8, 123. 6. (2) _ Which is the best algorithm design techniques to implement the n-queens problem. 10 Justify your answer with comparisons. {b) What are height balanced trees? Write the necessary steps to followed while inserting 10 ‘or deleting a node from a height balanced tree. 10 7. (a) Given input { 4379, 1323, 6173, 4199, 4444, 9769 } and a hash function h(x) (mod 10). Show the resulting with open addressing hash table using linear probing.{b) Suppose the following algorithm is used for evaluating the polynomial : BUX) = aX" + anak aK ae Bis ap; power x=1; for i= 1ton do power x= x* power x P=p+a* power end (i) How many multiplications and additions are done in worst case? (ii) How many multiplications are done in average case? (il) How can one improve this algorithin? Write short notes on any Two : () Brees (i) Merge-sort (ii) Strassen’s matrix multiplication (iv) Asymptotic speed up. ee RR RH 02 03 05 20Time :3 Hours Maximum Marks : 100 Minimum Pass Marks : 35 Question Attempt any Five questions. All questions carry equal marks, . (a) Draw the pin diagram of 8086 and explain it. {b) Why 8088 was made after 8086? 2. (a) Write a program to find Ifa given string is palindrome or not? (b) Draw the superscalar architecture of Pentium and explain it. 3. (a) Explain the working of ADC. {b) Draw the memory map of 2K RAM and explain its interfacing. 4, (a) What is USART? What are sequence of initialisation steps to aperate it? (b) Discuss the modes of 8254 PIC, write the steps the generate a square wave of 1 KHz using 2 MHz 8254 PIC, 5. (a) Write a control word to initiate 8255 PPI in Mode O for Port A, with Port C in Output, Mode and Port A in input Mode, Port 8 isnot used. (b) Explain various ICWs & OCWs used for 8259 PIC. 6. (a) Describe the main features of 8051 microcontroller. Explain the function of the following pins : ALE / PROG, PSEN, RST. {b) Explain the functions offered by : {) — TMOD (il) ScON fi TCON (iv) DPTR 7. a) Howisan embedded system different from microcontroller? (b) Explain interfacing of /o devices to 8054 chip. 8 ‘Write short notes (Any Four) : Roll No... ill B.E. EXAMINATION APRIL — MAY 2012 SY41/5441 : MICROPROCESSOR & INTERFACING () Addressing modes of 8051. (ii) Applications of embedded systems. (ii) LEDs. : (iv) Stepper rooter (wy) -RS232C (vi) Bus standards. ee RE REM. Tech, Examination, May 2012 Soft Computing MCSE 202 (CSE) ‘Time: Three Hours Maximum Marks: 70 Minimum pass Marks: 28. Note: Attempt any five questions. All questions carry equal marks. Missing data (if any), may be suitably assumed. Qi a) Explain different activation functions in neural network. Also give practical applications for each. b) Describe perceptron learning rule. Develop a perceptron for AND function. Would it be possible to train a perceptron using a variant of the perceptron algorithm with bias weights unchanged and only other weights are modified? Q2 a) What are recurrent and non-recurrent neural networks? Discuss the architecture of counter propagation neural network? Explain its different layers. b) With reference to Error Back Propagation algorithm, explain how weights are ‘updated? What is the importance of learning rate and momentum in improving the outputs. Q3 a) —_Explain different types of membership functions used in fuzzification process b) Explain fuzzy nule based inference model for an automatic washing machine. Q4 a) X= (2,3,4,5,6,7,8,9},¥ = (1,2,3,4,5,6} Caleulate the fuzzy relation for fuzzy mapping rule from X to Y. IF x is Medium, THEN y is small Where Medium and Small are fizzy subsets of X and Y characterized by the following membership functions. O41 03 07 1,107 ata tatstety7 03 Medium = 05 07 275 @° 9 1,1, 09, 06 ot Small =7+54+y44 3 +e b) Explain Sugeno Fuzzy Model. Compare it with Mamdani Model?Qs. Q6. Q7. Qs. a) b) b) a) b) Briefly discuss the convergence in Genetic Algorithm, Also explain the benefits of Genetic algorithm above other evolutionary methods, Determine the maximum of the function (x) = 2x — x?/16 which is defined on the interval [0, 31] using Genetic algorithm. Stopping condition is RM” = P® where P the initial population is and P™ is the next population. Explain the architecture of Adaptive Neuro Fuzzy Inference Systems (ANFIS). Also explain functionalities associated with each layer. Explain back propagation algorithm applied to fuzzy Model, Compare it with the basic error back propagetion algorithm? What do you mean by randomized algorithm? Explain Min-Cut Algorithm with the help of example, Let K be a Markoy chain with state space {1, 2}, initial distribution v= {1/3,2/3}and transition matrix [os 0.5 0.6 0.4 Calculate (i) P{XI=1} Gi) PEX3-21XI=1} . (ii) The limiting Distribution Gv) Classification of states Write short note on any two: 1) Hopfield Network 2) Binary planer Partition 3) Application of Genetic algorithmM.Tech. Examination MCSE 205: Adhoc & sensor based network ‘Time: 3 hrs. Max. Marks: 70, Min. Pass marks: 28 Note: All question carry equal marks. Attempt any five que Q11 (@) Compare and contrast infrastructure network with ad hoc networks, Why is back off timer used in CSMA/CA mechanism? (b) Elaborate some of the important issues in adhoc wireless networks, Q.2 Differentiate following MAC protocol for adhoe wireless network (any three) 1. MACAW and FAMA BTMA and RI-BTMA HRMA and SRMA/PA DPS and DWOP, ae Q3 (@) Desoribe routing mechanism of adhoc on demand distance vector routing protocol with the help of suitable example, (b) Define architecture reference model for multicast routing protocol. Q4 (@) wharis the main reasons behind throughput degradation that TCP faces when used in adhoc wireless networks? (b) Explain how security provisioning in adhoc wireless networks differs from that in infrastructure networks? Q5 (a) Describe the Layer and Cluster architecture of wireless sensor network with’ the help of suitable diagram. (b) Define various MAC protocol of witeless sensor network. (6 (a) How to data dissemination performs by rumor routing and sequential assignment routing? (b) Describe power-efficient Gathering for sensor information system and chain based three level ‘scheme in wireless sensor networks with the help of suitable diagram. Q.7 (@) Discuss various modification to the traditional TCP for improving performance in adhoc wireless networks. (b) Describe the network security attack with the help of suitable example. Q.8 Write short Notes on the following (any three) 1.Key Management approaches 2. Five phase reservation protocol 3. On demand routing protocol 4, Location discovery in WSNtl B.E. EXAMINATION APRIL — MAY 2012 5Y53 : THEORY OF COMPUTATION Time :3 Hours Maximum Marks : 100 Minimum Pass Marks : 35 Question Attempt any Five questions. All Questions carry equal marks. Marks No. 1. (2) Explain DFA. Construct DFA for the language L={X € {0, 1}*1Xends iniand does 10 not contain substring 00 }. {b) Convert the following mealy machine into Moore machine : 10 b/s € 2. (a) Construct a regular expression corresponding to the state diagram given in Fig. 10 {b) State and prove Myhill~ Nerode theorem. 10 3. {a)_ State and prove pumping lema for regular sets, Prove that following language is not 10 regular : L={a"b™c"d® | n=0,m20} (b) Design a F.A. which accepts set of strings containing number of 1's divisible by 3 and 10 number of 0's divisible by 5. 4, (a) Show that following grammar is ambiguous 10 SAB / aaB A> a/Aa Boa5. 8 (b) (a) (b) fa) (b) (a) 3) Convert the following grammar into Grelbach normal form : Ar Aras A AAL/D Aa ArAo/a Construct CEG for the following set (fab c"d" | mney (i) {ab | nad} What is Chomsky normal form? Convert the following CFG into an equivalent CFG in Chomsky normal form : A> BABIBle B+ o0|< Construct push down automata for language Le{atb™|n>2} S— aS/aA A> bA/b Construct turing machine to accept the following language : ={a"b’c* | nz1) Prove that the halting problem of turing machine is undecidable. ‘Write short notes on the following : () NP-complete problem, (i) Petrinet model. (lil) Properties of Regular Language. (iv) Context sensitive language. Kee RR EE 10 10 10 10 10 10 10 20B.E. Examination April/May-2012 CS 6555: System Programming ‘Time: 3 hrs Max marks: 100 Min pass marks: 35 ‘Note: Attempt any five questions. All questions carry equal marks. 1. (@) What are advantages and disadvantages to perform the assembly of the compiled program in the compiler rather than using the standard system assembler? (b) Discuss the following in brief; (@ Loader ii) Linker 2. (a) With the help of block diagram discuss the working of 2-pass assembler. (b) Discuss the following in brief; (@ Error indication schemes id Target code generation 3. (a) Define ‘Macro and Subroutine’, Giving suitable examples, explain the difference between macro and subroutine write their uses. (©) Explain the design of one pass macro processor with an algorithm. 4, (@) Explain clearly ‘Parsing’. Giving suitable examples. Explain different types of Parsing. (b) Write a three address code for following C statement, for (i#1; i<=10; i++) { 55 3 5. (a) Draw the block diagram of compiler and discuss the function of each phase in brief. (b) Write the list of various programming languages and mention their field of application.6. (@) What do you understand by code optimization? Why is it required? (©) If expression B=A & A=C*D'(D*C#B) is input to code generation phase, ‘what would be the output. Explain with flow charts. (a) Bxplain the structure of text editors and syntax directed editors. (0) Discuss the nature of the user interface for an interactive debugger. Write the short notes on the following (any three) @ Synthesis-storage allocation (ii) Nested macro Gif) Ambiguity (iv) Semantics AnalysisB.E Examination April-May 2012 Information Theory and Coding (IT6771) Time: Three Hours Min Marks:-35 Max Marks:-100 Note:-All questions carry equal marks and aitempt any five questions. Missing data if any assume suitably. QNot a) What is mutual information? Explain the concept of average mutual information. b) A discrete memory less source with alphabet X= {Sp, Si, S2} with respective probabilities P= {0.7, 0.15, 0.15} verify extension property of entropy. The order of the extended source is 2. QNo.2 a) Explain the procedure for Decoding Linear Block Codes with an Example. b) Show that the generator matrix G and the parity check matrix of the (7, 4) Hamming code satisfy the condition HG" =0 .The parity bits are expressed using the following equation, bo=motmytms; b=mo+m+mg; bsmytmytms, QNo3 a) Explain Binary Image Compression Scheme? 'b) What are the major advantages of the adaptive Huffman coding over static ‘Huffman coding? QNo4 a) Explain the principle of data compression and give the types of data compression? b) State and explain the requirement of full motion video compression, QNo5 a) What is encryption? What is decryption? Draw a block diagram showing plain text, cipher text, encryption and decryption? b) Distinguish between differential and linear cryptanalysis.QNo6 a) Given two prime numbers P=17 and Q=29, find out N, E and D in an RSA encryption process. ~ b) What is Mono alphabetic Cipher? How is it different from Caeser Cipher? QNo7 a) A discrete source emits 3000 symbols once every second. The symbol probabilities are {0.4, 0.25, 0.15, 0.1, 0.06, 0.04} respectively. Determine source entropy and information rate. b) Apply shano-fano encoding procedure to the following message symbols X={, Xp... %9} P= {0.49, 0.14, 0.14, 0.07, 0.07, 0.04, 0.02, 0.02, 0.01}.Find efficiency of coding. QNos ‘Write Short note on (any four):- a) Convolution code b) Generator polynomial c) MPEG 4) Non-Repudiation e) Hamming codeBE'V Semester Examination, April-May 2012 Database Management System (DBMS) (YI) Time: Three Hours Maximum Marks: 100 Minimum Pass Marks: 35 Note:‘Attemptiany five questions. All questions carry equal marks. Missing data, ifany, may be assumed suitably. 1. @ Discuss the overall system structure of a database management system. (©) Define the following terms in detail: i) Aggregation ii) Data independence 2. Consider the insurance database of Figure 1 below, where the primary keys are underlined, Construct the following SQL queries for this relational database. person (driver-id, name, address) car (license, model, year) accident (report-number, date, location) owns (driver-id, license) participated (driver-id, cat, report-number, damage-amount) Figure 1- Insurance database a) Find the total number of people who owned cars that were involved in accidents in 1989. b) Find the number of accidents in which the cars belonging to “John Smith” ‘were involved. ©) Add 2 new accident to the database; assume any values for required attributes. @)_ Delete the Mazda belonging to “John Smith”, ) Update the damage amount for the car with license number “AABB2000” in the accident with report number “AR2197” to $3000. (@) Draw the E-R diagram for course registration process of an engineering institute. Discuss strong and weak entity. (b) What is the role of database administrator? |. (a) Explain the network data model of DBMS with a suitable example. * (b)What do you understand by normalization? Illustrate BCNF with a suitable example. How BCNF is better than 3NF? .. (@) List the ACID properties. Explain usefulness of each, (b) What do you mean by Multivalued dependency? Discuss 4NF and SNF in detail with a suitable example, 6. (@) What are the necessary and sufficient conditions for deadlock occurrence? Explain the waitdie and wound-wait scheme of deadlock prevention. (b) What is a concurrent schedule? What is conflict scrializability in this context? 7 @.7.0)7. (@ Explain Query processing and query optimization, () Desoribe about Referential Integrity? How it can be achieved in sour 8° Write short notes on any four of the following: (@) Distributed Database (0) QBE © Crash management issues in databases. @ Candidate key (©) Database Packages (®) Log-based recoveryTime :3 Hours Question No, 1 a) (b) 2 fa) (b) 3. a) (b) 4. (a) (b) Roll No. 1 M.E. EXAMINATION APRIL — MAY 2012 MCSE-203 : ADVANCE ALGORITHM & DESIGN Minimum Pass Marks : 28 Attempt any Five questions. All questions carry equal marks. Explain the RAM model to find out the time complexity of an algorithm. Execute the RAM model in the given problem Algorithm arraymax (A, n) Input : An array A storing n 2 1 integers. Output : The maximum element in A. Current Max 1 Find the @ notation for 23 +3n? +30 Prove that Ig( O(nign) Write down the procedure MERGESORT and procedure MERGE & sort the following elements of Array = (310, 285, 179, 652, 351, 423, 861, 254, 450, 520). Draw the tree of calls of MERGESORT (1, 10) and MERGE for the above mentioned problem, Consider the following matrix and its dimensions : Matrix Dimension AL 30x35 Az 35x15 a3 15x5 A 5x10 AS 10x20 AS 20x25 Find optimal cost of multiplying AZ... Explain Task Scheduling Problem. Find the optimal schedule for the given problem : Using Greedy Method. Let n=4, (P:, Pa, Ps, Pa) = (100, 10, 15, 27) and (dy, da, ds, da) = (2, 2, 2, 1). Where P; are profits on processes or job and dj are deadline of completion. Find the optimal schedule.a (a) (b) (a) (b) (a) (b) Apply the bottom up dynamic programming algorithm to the following instance of the knapsack problem. Item Weight Value cs 3 25 2 2 20 3 1 15 4 4 40 5 5 50 Knapsack capacity w= 6 Explain longest common subsequence using a suitable example and apply the dynamic programming. What is the cost of minimum spanning tree of the following graph ~ Use Kruskal Algorithm, om Explain the Ford-Fulkerson Algorithm, | Write down the properties of Discrete Fourier Transform. Explain Strassen’s matrix multiplication, ‘Write short notes (Any Two) : ()_NP~Completeness i) The vertex cover problem t Merging Network (iv) Randomized algorithm. tee ERoll No.. Hl B.E, EXAMINATION APRIL — MAY 2012 GY54 : SOFTWARE ENGINEERING Time : 3 Hours Maximum Marks : 100 Minimum Pass Marks : 35 ~ Question Attempt any Five questions, All questions carry equal marks. Marks No. 1. (a) How should we define software? What are the important characteristics of good 10 software? {b) Giving suitable examples, explain any two of the following terms : 10 (Software product (i) Software process (ili) RAD model. 2. (2) What do you mean by software requirement engineering? Describe the various steps. 10 involved in requirement analysis. (b) Explain cyclomatic complexity. Find out the cyclomatic complexity of following pseudo 10 code: If ( (A>B) AND (C>D)) then Aza BeBe End if 3. (a) Explain object oriented design approaches along with its advantages and 10 disadvantages. 10 {b) Describe clearly how good design is influenced by the followin a) Cohesion and coupling (i) Horizontal and vertical partitioning, 4. (2) _ Explain function point metrics. Differentiate between function point and feature point 10 metrics. Give suitable examples. {b) Show why software metrics can improve the software process? Enumerate the effects 10 of metrics on software productivity. 5. (a) What are the different categories of software according to the COCOMO estimation 10 model? Suppose you are developing a software product in the organic mode, you have estimated size of product to be about 1,00,000 LOC. Compute nominal effort and development time. (b) What is software measurement? Discuss the various level of measurement with a 10 suitable example.fa) (b) fe) (b) Why testing of software is necessary? What is the distinction between ‘alpha’ and 10 ‘beta’ testing? Explain why these forms of testing are particularly valuable. Differentiate between validation and verification. Explain with example. 10 ‘What do you understand by PM-CMM? Write various project management activities 10, and explain in detail. What Is software reliability? Why it is difficult accurately quantify the rell of 10 software product. Write short notes on any four of the following : aS (i) CASE design (i) Decomposition techniques (iit) DFO (Data Flow Diagram) (iv) Data Dictionary (v) Spiral mode! (vi) Storage and processing time analysis. eee eeeTime :3 Hours Roll No. U1 B.E. EXAMINATION APRIL — MAY 2012 5Y52 : OPERATING SYSTEM Maximum Marks : 100 Question Attempt any Five questions. All Questions carry equal marks. No. L 3. fa) (b) fa) (b) ©) fa) (b) What are system calls? Explain about various types of system calls provided by an Operating System. For the ahead Jobs calculate the average turnaround time, waiting time and response time using FCFS, Pre-emptive SIF, priority and round robin \e quantum = y) Arrival time | Bursttime | priority Pa 0 9 oO Pa 1 5 i Ps 2 2 2 What is role of critical section in process synchronization? What is an interprocess communication? Consider a system calls with five process P, through P, and three resources types ABC resources, type A has 10 instances B has 5 instances and C has 7 instances, suppose at time to following snapshot of the system has been taken : Process Allocation Max. ‘Available ABC ABC ABC Po o 2 0 753 3°32 Py 270 0 32 2 Py 30 2 3 0 2 Ps 21 1 22 2 Pe 00 2 433 1. What will be the content of need matrix? Is the system in safe state? If'yes then what is the safe sequence? ‘What will be happen if process P requests one additional instance of resource type A and two instances of resource type C? Ifa request (3, 3, 0) by process P, arrives in the state defined by 3 can it be granted immediately? fa request (0, 2, 0) by process Po arrives then check whether it is granted or not? Consider a logical address space of eight pages of 1024 words each mapped onto a physical memory of 32 frames then : (i) wo Explain How many bits are in the logical address? How many bits are in the physical address? difference between internal and external fragmentation. ‘Minimum Pass Marks : 35 Marks 10 0s 05, 10 10 106. {a) (b) (a) (b) (a) (b) (a) (b) Consider a paging system with the page table stored in memory : () if a memory takes 200 nano seconds, how long does a paged memory reference take? (i) if we need TLB and 75% of all page table reference are found in the TLB’s what is the effective reference time? (assume that finding a page table entry in TLBs takes zero time, if the entry is there). Explain page fault handling method. If the contents of references using is 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3 and there are three frames available in the memory then calculate page fault in (i) FIFO, (li) LRU, (ii) OPTIMAL. Explain different types of system threats in detail ‘Suppose the moving head disk, with 200 tracks Is currently serving a request for tracks 143 and has just finished a request for track 125 if the queue of requests is kept in FIFO order 86, 147, 91, 177, 94, 150 what is total head movement for the following scheduling schemes (i) FIFS, (i) SSTF, (ii) C-SCAN Explain different file allocation method. Suppose the average page fault service time is 20 ms and memory access time is 200° nanoseconds suppose we wish to have less than 10% degradation in memory access when a page fault occurs, what must be the page fault rate less than? Explain segmentation and H/W support in segmentation? Write any Four Short Notes (Each $ marks) : () Demand paging (i) Virtual memory (il) Dead lock avoidance (iv) Paged - segmentation (v)— Semaphores eee eR RE 10 10 10 10 10 10 10 20M. Tech (CSE) Second Semester Examination, May 2012 Advanced Topics in Data Mining & Warehousing (MCSE 204) Time:Three Hours QI) ) Q2 (a) ) 23 (a) (b) Note: Attempt any five questions. All questions carry equal marks. What do you understand by the term “Data Mining”? Briefly explain with the help of real world instances, the significance of data mining in the present scenario. What do you understand by n-dimensional data cube? What are the different operations which are generally performed on the data cube? Differentiate between Operational database system and Data Warehouse. Also give the reasons behind maintaining a separate data warehouse. Describe the steps involved in deta mining when viewed as a process of Knowledge discovery in databases (KDD). What do you understand by association rule mining? Discuss some applications of the same. Write the Apriori algorithm 2 How efficiency of this algorithm can be improved? Give your suggestions by taking suitable example. Q.4 (a) What do you understand by Flexible Uniform Framework for mining association rales ? Discuss the salient features of this framework, (b) Discuss any association rule mining algorithm based on vertical data layout. O58 (a) Differentiate between following architectures for the integration of a data mining system with a database or data warehouse system (No Coupling )) Loose Coupling, (ii) Semi-Tight Coupling (iv) Tight Coupling State which architecture you think is the most popular and why? (b) What are advantages and disadvantages of decision tree approach over other approaches of data mining?26 (a) Describe CLS algorithm of the decision tree with the help of suitable database. Also give the strength end weaknesses of CLS algorithm when used as 4 decision tree classifier, (b) What is clustering ? Suggest any one application of data mining where clustering can be used for mining the hidden knowledge. Q7 Take any (commercial/tesearch prototype) data mining system and outline the ‘major features of such a system from multiple dimensional point of view, including data types handled, architecture of the system, data souree, data mining functions, data mining methodologies, coupling with database or data warehouse systems, visualization tools and graphical user interfaces, Q-8 Write short note on the following ( Any four) @ Mining Query Language (DMQL). (ii) Meta Rule Mining (iii) Constraint Based Association Rule Mining (iv) False Frequént Items (¥) Challenges in Data mining (vi) Data Reduction Techniques ao Eee eee Hee