B.E, Examination 8YSI: Advance Operating System “Time: 3 hs. Mex, Marks: 100 Min, Pass marks: 35 ‘Note: Total no of question: 08, Attempt any five question All question cary equal marks Q.1 (@) In what respect distributed computing system is better than parallel processing system? Discuss some of the guiding principles for achieving transparency in any distributed operating system. (b) What is the main problem in making a system highly scalable? Why reliability is an important feature in the design ofa distributed system? Q.2(@) How marshaling arguments and results involve in implementation of RPC. Explain the implementation of RPC mechanism, () Define the RPC model withthe help of suitable example, How are stubs generated? Q3(@) Why do some di an easier programming paradigm and are typically more efficient than stateless server? ibuted application use stateless server in spite of the fact that stateful servers provide (b) what is role of Blocking VS Non blocking primitive primitives in distributed system communication? Give a mechanism to implement consistent order massage delivery in group communication. Q4 (@ Why is the deadlock avoidance strategy never used in distributed system for handling deadlocks? what are the problems has collective request deadlock prevention method? () what are the main advantages of this algorithm over the WFG-based distributed algorittum? What might be the reason for phantom deadlock ina distributed system? (Q5(@) why are election algorithm is needed in distributed system? Write ring based algorithm for conducting eleetion (©) Discuss various approaches for distributed clock synchronization algorithm. How can implement logical clocks by using counter? Q6(a) (b) Differentiate between handoff scheduling & affinity scheduling of threads and also explain models for organizing threads of process. (b) What is atomic broadcast? Explain synchronised atomic broadcast algorithm. Discuss the various commonly used models for configuring distributed computing system. Q.7(@) What is distributed file system? How to achieve location transparency in distributed file system, (&) How delayed write policy improve performance in file caching scheme? Define client server model & addressing with the help of suitable example Q8 Write short Notes on the following (any three), 1, Real Time Operating System 2.Network Operating System 3.RMI 4.Amoebafreer r S WOU OCLC CEOS OAR : we a VV VGO9GIBOS9S3999| Total Questions:8. B.E. Examination, OCT /NOV 2013 Data Warehousing and Data Mining CS/IT-BY52 Time: Three hours Note: Attempt any Five Questions. All questions carry equal marks. 1(a) Briefly explain data mining and define it. Discuss some of the reasons for growth in enterprise data. (b) What are the different operations which are generally performed on a data warehouse? Explain with the help of suitable examples. 2 (@) Describe different tasks and techniques of data mining. (b) What do you understand by discretization ? What is the importance of discretization in data mining ? 3(@) List the steps of a data mining process. How is it different than the waterfall software engineering process?, (b) Give the architecture of a data mining system. What are the essential ‘components of a data mining system? Desoribe the purpose of each of these components. 4(a) what is the aim of association rule mining ? when can this technique be useful ? Discuss with the help of suitable example (b) Describe any one algorithm for mining association rules. A database has four transactions. Let Minimum Support = 35% and Minimum Confidence =85% TD item-bought 700 A.B,D,K 200 ABCDE 300 CE 400 ABD (i) Find all frequent itemsets (ii) List all of the strong association rules along with their confidence PTO5(a) What do you understand by Post-mining? Why is it useful? List and explain some post mining operations. (b) Prove that if the support of a frequent itemset is greater than or equal to the minimum confidence required for the rule, then all association rules generated by such itemset or from its subset will have confidence at least equal to the minimum required confidence, 6 (a) Take any commercial data mining system and outline the major features of such a system. (b) What is supervised classification ? In what situations can this technique be useful ?, 7(a) What is clustering? Suggest any one application of data mining where clustering can be used for mining the hidden knowledge. (b) Write an essay on latest trends in data mining 8. Write the short notes on the following (any three): () Benefits of Pre- mining (i) Applications of data mining (il) Classification of Data Mining System (iv) Web content mining ~ SIAN SAMA © € € THM HR ReAe Maximum Marks: 106 B.E. Examination, Dee 2013 Neural Networks and Fuzzy systems (NGS/Old) 8553 sme: Three Hours Minimum pass Marks: 35, Note: Attempt any five questions. All questions carry equal marks. Missing data (if'any), may be suitably assumed, Qt Q2 Q3 Qa Qs 26 a) b) a) b) b) a) ») a) b) a) b) State the characteristics of artificial neural networks in detail, Explain the Hebb net model of neural network. Realize the logical AND operation with binary inputs and targets using this model. Explain the linear separability problem. Justify XOR fuunction is non linearly separable by a single decision boundary line . Mention different types of activation functions, along with their significance in different models. Derive the generalized delta learning rule, What are the factors that improve the convergence of learning in BPN networks? Explain the training algorithm of radial basis function network. Explain the architecture of @ counter propagation neural network? Name the different layers present in it. How the weights between layers are updated? Using the delta rule, find the weights required to perform the following classifications. Vectors (1 I =I -1), (-1 =I -1 -1), (I-11 1) are members of class (target vector 1); vectors (1 1 1 1) and (-1 «IT -1) are not members of class (target vector -1). Use learning rate of 0.5 and random starting weights. Using each training vector as inputs, test the response of the net. Describe 2 Hopfield neural network, Why are symmetrical weights and weights with no self conneetion important in discrete Hoptield network? Sketch the architecture of ART | network and discuss its training algorithm. What is membership function? Explain the features and inference method for assigning membership functions. What are the similarities and differences between fuzzy and neural systems? Explain,Q7 Qs a) Illustrate fixzzy subset hood theorem. What is the significance of this theorem? b) What is fuzzy associative memory? Explain, Write short notes on (any two) (Boltzmann and Cauchy Machine Gi) Crisp set and fuzzy set i) Self orgenizing map (iv) Fuzzy image transform coding °B.E. Examination- November / December 2013 S8Y71: Cellular & Mobile Communication (NGS/Old) ‘Time: Three Hours Max Marks: 100 Min, Pass Marks: 35, ” Note: Total Numbers of Questions are: 08. Atfempt any five questions. All questions carry equal marks. Qt (a) Write the limitations of a conventional mobile telephone system. Explain about a basic cellular system. (b) Explain the Architecture of GSM. Briefly describe the services offered by GSM system. Q.2(@ What do you mean by CDMA System? Demonstrate the working of CDMA. systems with the help of suitable example. (6) Explain about third generation wireless communication networks. Q3 (a) What do you mean by Adjacent channel interference? Derive the expression for Co-channel interference reduction factor. (b) What is Cell Splitting? What are the types of cell splitting techniques? Q.4(@) What do you mean by GPRS and higher data rates? Explain the Architecture of GPRS in brief. {b) Explain the protocol stack of IEEE 802.11 (WLAN). Which WLAN standard first adopted the 5 GHz band operation? Q.5 (2) What is Handoff? Explain the strategies of Handoff; Compare soft and hard Handoff. (©) What do you meen by Mobile IP? Demonstrate the working of Mobile IP with the help of example network. Q.6 (@) Write a comparison between TDMA, FDMA and CDMA. Also specify the shortcomings and advantages of each of the multiple division techniques. (b) Differentiate between Fixed Channel Assignment (FCA) and Dynamic ‘Channel Assignment (DCA) schemes.QT ‘Write short notes on any four of the following: (@) IEEE 802.11 a,b (b) Sensor Networks (c) Wireless application protocol (@) Mobile TCP (@) Frequency Reuse Concept Q8(@) Define and explain cellular digital packet data (CDPD). (b) What is the usefulness of Bluetooth technology? Discuss the Architecture of Bluetooth. Aone errenr etree Seana anasaar 9 SAR AR AAA arm maa eooon ooo€ é c B.E. Examination, Dec 2013 Artificial Intelligence & Expert Systems (GS/NGS/Old) € c TYS1 Time: Three Hours & Maximum Marks: 100/70 Minimum pass Marks: 35/22 e Note: Attempt any five questions. All questions carry equal marks. Missing data (if € any), may be suitably assumed, t Qa) Explain different characteristics of Production systems. e b) Explain AO* Algorithm with the help of example, c Q2 a) Explain the concept of symbolic representation of logic, c b) Explain algorithm for steepest hill climbing, PR Q3 2) What are the drawbacks of predicate logic used in representation of facts? Give three examples where itis difficult to use predicate logie for representation. : ©) Explain the process of reasoning with proper example. Why such reasoning c techniques are required in developing Al Systems. c Q4 a) What is knowledge representation? Explain knowledge representation using 7 proposition and predicate logie with an example. 7 5) Consider the following sentences and translate the sentences into formulas in 7 predicate logic and clause form. Prove * John likes peanuts” using resolution John like all kind of food. Apples are food, : Chicken is food, Anything anyone eats and is not killed by is food. ze Bill eats peanut and is stil alive. Sue eats anything Bill cats. : Q5 2) State and prove Bayes Theorem. b) Explain forward and backward reasoning with an example , Q6 a) How the knowledge representation is done through semantic networks? Explain with suitable example,Q7 Qs b) a) by What do you understand by Monotonic and non- monotonic reasoning? Explain with suitable example, What is Game Playing. How would the minmax procedure have to be modified to be used by a program playing @ three or four person game rather than @ two person game? Describe Alpha-Beta Pruning and give the other modifications to the minmax procedure to improve its performance. Write Short notes on (any two): a) Expert Systems 6) Block world problem in Robotics ©) Natural language processing 292A AaAn a 3 OAAanan @oo00 on COG AABROMD ©0B.E, Examination- November/ December 2013 C 7YS2: Compiler Design & Translator (GS/NGS/Old) . Time: Three Hours Max Marks: 100 Min, Pass Marks: 35 c Note: Total Number of Questions are : 08. Attempt any five questions. Q.1(@) Define Compiler? Explain important phases of compilation, process with the help t of suitable example? f (b) Describe the role of a lexical analyzer and also explain the concept of Input Buffering. . Q.2 (a) _List various lexical errors and actions to be taken to recover from lexical errors? \ (2) Write short notes on the following: (i) Recursive Predictive Parser Gi) Non Predictive Parser Q.3.(a) Discuss three pre-requisites of Predictive Parsing with the help of suitable examples. (b) Define First function and Follow Function, Calculate First and Follow funetion for the following grammar, B-TE’ BP ++TE’/e - ToFT 4 Porrr/e Fo (E)/id Q.4(@) What is handle and handle pruning? Give the reduction steps of the expression id + id * id for the following grammar. - E-E+E EEtE E~@) Eid (©) Prove that the following grammar is not a SLR grammar S—Aa S—bAc ‘ Sr de : S— dda AvdQ5 (a) Construct Non Recursive Predictive Parsing table for the following grammer E>TE’ BP o+TE’/e ToFT’ PortRr/e F>(@)/id ‘Also demonstrate parsing steps/ procedure with table for the following string id+id* id $ the help of constructed parsing () Find LEADING and TRAILING for the following grammar $— aAB/bA/e A—eAb/e Bo bB/C Q.6 (a) Write short note on Storage allocation strategies? (©) Discuss various issues in the design of a code generator? Q.7 Compute the canonical collection of sets of LR (0) items for the following grammar EOE+T ET ToT*F TOF Fo ® Fo id Construct DFA after calculating canonical collections Q.8 (@) Constmnet the collection of LR (0) item sets and draw the go to graph for the following grammar $ — SS/a/e. Indicate the conflicts (if any) in the various states of the SLR parser. (b) Write short notes on any fwwo of the following: (® Peephole optimization Gi) Semantic Anelysis ii) YACC samennenennas am LASR eon a4 € © € © © € c € € — © € © © © © € € € c € ©BE (Seventh Semester ) EXAMINATION NOV/DEC 2013 COMPUTER SCIENCE & ENGINEERING 7Y53 : Parallel Processing Time: Throe hour Note: Attempt any Five questions, All questions carry equal marks. \. (c}_ What do you undersland by the term Parallel Processing? Discuss some applications of parallel processing. (0) Write down the various parallel processing mechanisms and expiain any two of them. istinguish among computer terminologies in each of the following groups : + {)_Uni-processor systems Versus multiprocessor systems {i) Parallelism versus pipelining {il). Serial processing versus parallel processing {b) Describe at least four choractetistics of MIMD multiorocessors that Gistinguish them from multiple computer systems or computer networks. 3. {a)_ Explain the following terms {with reference to pipelining) : {) Reservation toble {i) Clock period fii) Latency (iv) Throughput {vy}. Speedup (0) Prove that a kstage linear pipeline can be af most k times faster than that of a non-pipelined serial processor. 4, (a) Discuss different approaches for branch Handling in pipeline system. {b) What do you understand by Pipeline chaining and vector loops? Discuss. 5. {a} Explain the following terminologies associated with SIMD computers: o (i) Barrel Shifting functions (i) — Mesh connected iliac network.(0) {a} (o) (} Discuss the architecture of CYBER. What do you understand by systolic array? Discuss its characteristics. How is the interprocessor communication handled in parallel computers? Discuss. What do you understand by the deadlock? List four necessary conditions for deadlock. State and explain the architectural configuration of multiprocessors. Explain loosely coupled and tightly coupled multiprocessors. Write the short notes on the following { Any four): (i) Choracteristics of vector processing (i) Parallel algorithm for array processor (ii) Semaphores (iv) Delta network () Handlers Clossification. OOMMOADBROAD DARAAARANRANRAA ray OAae @ aearnne© B.E Examination Nov-2013 7Y71: Networking with TCP/IP Time: Three Hours Max Marks: 100 Min. Pass Marks: 35 Note: Total number of questions are: 08.Attempt any five questions. All questions carry equal marks. Missing data if any assume suitably. Qnol a) Explain the architecture and interface of ISDN. Differentiate between N-ISDN and B- ISDN. b) Differentiate between virtual circuits and circuit switching? Quo? a) Explain ATM switching networks with block diagrams? How do the connections of virtual paths can be made? b) What is the difference between the access technique of IEEE802.3 and IEEE 802.117 Qno3 a) Discuss various ICMP message types? How can we determine if an IP packet is carrying an ICMP packet? b) One of the addresses in a block is 167.199.1 70.82/27. Find the number of addresses in the network, the first address, and the last address. Quod a) Explain with an example how distance vector routing is used to route the packet and why count-to-infinity problem arises and how does to get solved. b) When RARP is required. Explain how it works. What is the limitation of RARP? How BOOTP provides solution for it? QuoS a) Explain how the phenomenon called the silly window syndrome can arise and the steps that are taken at the client and server sides to avoid this happening. Explain how the Clark extension ‘orevents this from occurring. ~p) Explain the UDP Encapsulation and protocol layering. ‘Qno6 a) Explain the use of the following in TCP segment: (i) source and destination port number , (ii) sequence and acknowledgment numbers, Gii) code bits, (iv) _ window size, (v) urgent pointer, (vi) Options and the header length. b) Explain about the structure of UDP header.Quo? a) What is public key cryptography? What are the necessary conditions for public key cryptography? b) Explain how IP can be used over ATM? Qno8 a) Write short technical notes on any THREE: a) FIP b) Security principles ©) Virtual LANs 4d) HTTP e) SMTP. ,AMAMMAAR ADD CAMO ADAB.E. Examination, ‘7Y72: Internet Technology & Web Design (Non-Grading System) ‘Time: 3 brs. ‘Max. Marks: 100 Min. Pass marks: 35 Note: Total no of question: 08.Aitempt any five question. All question carry equal marks QI (@) Discuss the motives for internetworking. What is difference between bridge and router switching, devices? (b) Define the architecture in brief along with its main components. Explain the significance of a DNS Server. Q.2 (a) Discuss various type of web documents withthe help of suitable example. What fs purpose of HTTP? {(b) Define the architecture of web browser. Hlow does Web Server work? Q3 (@) Describe How can create byperlink and embed image in a web document? (b) How can use scripting language along with HTML documents? Define CSS (Cascade style sheet) swith the help of suitable example (Q4 (@) Discuss the role of Java Script in form processing, Write a javascript to multiply two integers. (b) How can perform email validation using Java Script and HTML? Q5 (@) Define different available objects in ASP. How can run ASP Prograras? (©) Discuss in detail how database processing happens in ASP. Q6 (a) How can achieve multiple inheritance in java? Why Jaya is Multithreaded and portable programming language? (b) Describe the concept of garbage collector in Java and define the life cycle of applet. Q.N(a) Deseribe various methods for managing fault and configuration in any web application, (© Explain various available ways for web based enterprise management. Q.8 Write short Notes on the following (any three) 1 Search Engine 2.URL 3.Session Cookies awwwce eee ee eo Oe eee eeeaA B.E, Examination ~ October/November 2013 6442/6¥42: Digital Signal Processing (GS) Time : Three Hour ‘Max Marks : 70 ‘Min Marks : 22 Total Number of Questions are 08. Attempt any five questions. 1 questions carry equal marks. Note: 2 Q.1 (a) Determine linear convolution of the sequences s(n) = 2"u(—n) and h(n) = u(n) (b) Determine the impulse response and the unit step response of the system described the difference equation : ; y(n) = 0.6 y(n-1) ~ 0.08 y(n-2) + x(n) Q.2 (a) Determine if the systems described by the following input output equations are linear or nonlinear : : (a) y(n) = ns(n) + (b)y(n) =a s(n)*B_ where a and B are constants (b) Sketch the direct form —I and direct form ~II network structures of the system, With transfer funetion H(z) +27 10.527 +0.062 Q.3 (a) Determine the inverse Z transform by partial fraction method SQ = ay @=Gaed (b) Determine the Z transform of given discrete time signal s(n) = A"u(n) é Q.4 (a) Compute the circular convolution of the two discrete time sequences y(n) = {1,2,1,2} and s2(n) = {3,2,1,4} (b) Determine the eight - point DFT of the signal X(a) = (1,1,1,1,1,1,0,0} and sketch its magnitude and phase. Q:5 (a) Write down properties of discrete fourier transform, (b) Give flow graph of complete decimation in frequency FFT algorithm (N=8), Q.6 (a) Discuss the properties of the Z transform, (b) Define window function. Discuss various types of window functions used in the design of FIR digital filter. Q.7 Describe the design of linear phase FIR filter using window and frequency sampling method. : Q.8 Write short notes on any two: (D Tellangen’s theorem i) BR filter design by bilinear transformationVEE EEE ECHOES OFOB OE SCOS SUSE EEBG9BB9an € B.E Examination Noy-2013 c 6771: Information Theory and Coding : “time: Three Hours Max Marks: 100 Min. Pass Marks: 35 Cote: Total number of questions are: 08.Attempt any five questions. All questions carry equal marks. CTissing data if any assume suitably. ‘QNol. a) Draw and Explain the block diagram of a typical message information communication system. £ b) Explain about entropy of a source .Briefly discuss about channel capacity of a discrete memoryless channel. . a) Explain Huffman encoding algorithm. b) A discrete memoryless source has an alphabet of five symbols whose probabilities of occurrence are as described here re Symbols: so Si S3 S4 S85 “Probabilities: 04 02 02 O1 O1 Compute the Huffman code for this source entropy and the average code word length of the £ source encoder. ‘QNo3. a) A code has the parity check matrix : 110100 tad 01101 (| Assuming that a vector (111011) is received. Determine whether the 101001 received vector is a valid code. b) Explain syndrome decoding in linear block code with example. ‘oNet a) Explain between block cipher and stream cipher. ) What are convolution codes? Explain encoding and decoding for convolution codes. . a) Describe briefly compression system? Why we need the compression system? z b) Explain JPEG encoding process in detail. ‘QNo6. a) Explain MPEG audio layers. b) Explain linear predictive coding. 2QNo7. a) Explain the Diffie-Hellman key exchange algorithm with suitable example. b) What do you mean by symmetric key and asymmetric key cryptography? What is Man in the Middle attack”? QNo8. Write Short Note on any four of the following: a) RSA algorithm b) Hamming coding ©) Shannon fanon algorithm d) Trellis Code ©) prefix codewe ee OoCeGoeacoe OSCSCSOFTSFGOAVSSSVOABSZIGBIS 9 w wAAANAA” c - B.E Examination Nov-2013 6Y53: Data Communication Time: Three Hours Max Marks: 100 Min. Pass Marks: 35 Note: Total number of questions are: 08.Attempt any five questions. All questions carry equal marks. Missing data if any assume suitably. QNol. a) What is the purpose of the physical layer? Discuss various physical media for data transmission? b) Discuss ATM layer. Why does ATM use small, fixed lengths cells? QNo2. 2) Discuss the various kinds of supervisory frames in HDLC? Explain the need of bit stuffing. b) Which switching method allows real-time data transfer? Mention the advantages of packet switching? QNo3. a) A channel has a bit rate of 4 kbps and a propagation delay of 20 msec, For what range of frame sizes does stop-and-wait give an efficiency of at least $0 percent? b) Two communicating devices are using a single-bit even parity check for error detection. The transmitter sends the byte 10101010 and, because of channel noise, the receiver gets the byte 10011010. Will the receiver detect the error? Why or why not? QNo4. a) Give an argument why the leaky bucket algorithm should allow just one packet per tick, independent of how large the packet is, b) If network topology never changes, which of the routing protocols, shortest path routing & Distance vector routing is preferred and why. QNoS. a) Explain the difference between symmetric encryption and public-key encryption. -b) List and briefly define the key elements of SNMP. QNo6. a) What is UDP? In situation where reliability is not of primary importance, UDP would make a good transport protocol. Give examples of specific situations. b) Explain how the TCP connection can be establish and reledse? QNo7. a) Explain about the principle of HTTP operation. b) What are the various type attacks on RSA? QNo8. Write Short Note on any four of the following: a) BSC b) Modem ©) Token Bus @) ATM Traffic Management e) TSAP wewee ew OCG YE GEOVEG he COCSCSCSCSCOSOGDSSSFEB9OBBFBZ990 wB.E. Examination, November 2013 Software Engineering 6Y54 (GS/NGS/OLD) Max marks-70 min pass marks-22 Time- 3 hours Note- attempt any five questions. All question carry equal marks. Que 1. (a) Define the term “Software Engineering”? Explain the major difference between software engineering and other traditional engineering disciplines, (b)What strategies of design should follow by a sofiware developer? Explain each type. Que 2. (2) Explain the layered architecture of software engineering? What are charters tics and components require for software engineering? (b) What is design? Discuss the objectives of software design. What makes software