ME CSE QUESTION PAPERS SEMESTER II

DEC 2010 CS9221 — DATABASE TECHNOLOGY

1. What is query processing? 2. Define concurrency control. 3. What is persistence? 4. Give two features of object oriented databases. 5. What is Data warehousing? 6. List any two features of web databases. 7. What is Normalization? 8. Define Integrity. 9. What are Deductive Databases? 10. Mention two features of parallel Databases.

11. (a) Compare Distributed databases and conventional databases. Or (b) Discuss in detail the architecture of distributed databases. 12. (a) Explain the multi–version locks and recovery in query languages. Or (b) Describe modeling and design approaches for object oriented databases. 13. (a) Explain the features of Data warehousing and data mining. Or (b) Discuss client/server model and mobile databases. 14. (a) Give the features of Temporal and spatial databases. Or (b) (i) Explain E–R model with an example. (8) (ii) Discuss the optimization and research issues. (8) 15. (a) Discuss multimedia databases in detail. Or (b) Explain the features of active and deductive databases in detail

DEC 2010 CS9222 — ADVANCED OPERATING SYS.

1. What is meant by disabling interrupt mechanism? 2. What are the two major differences between deadlock and starvation? 3. State the important issues that arise in the design of a distributed operating system. 4. What are the main design issues in the Suzuki-Kasami’s broadcast algorithm? 5. List any two advantages of distributed shared memory. 6. What are the advantages of bulk data transfer? 7. What are the major problems associated with the backward-error recovery approach? 8. Write the characteristics of atomic actions. 9. What are serializable logs? 10. Give the requirements of a database operating system.  11. (a) (i) Give a brief introduction of four advanced operating systems. (6)

(ii) Give an account of any three synchronization problems. (5) (iii) Write about any three models of deadlocks. (5) Or (b) (i) Illustrate the Owicki-Gries axiomatic method for verification of parallel programs with an example. (8) (ii) Explain the three operations of a process on the general resource graph with examples. 12. (a) (i) Illustrate a limitation of Lamport’s clocks with an example. (6) (ii) Explain any two solutions to the Byzantine agreement problem. (10) Or (b) (i) How does one measure the performance of mutual exclusion algorithms? (6) (ii) Discuss the clock synchronization in distributed systems application of agreement algorithm. (10) 13. (a) Discuss the issues in the design and implementation of distributed file systems. (16) Or (b) (i) Discuss the issues of granularity and page replacement in the design of a distributed shared memory system. (8) (ii) Write about the four components of a load distributing algorithm. (8) 14. (a) Describe the algorithm of Juang and Venkatesan for asynchronous checkpointing and recovery with an example. (16) Or (b) (i) Describe the Two-Phase Commit protocol. (8) (ii) Illustrate the working of the majority based dynamic voting protocol proposed by Jajodia and Mutchler with and example. (8) 15. (a) Describe the timestamp based concurrency control algorithms. (16) Or (b) (i) Give an account of Kernel-Level Threads. (8) (ii) Explain the theory of serializability. (8)

DEC 2010 CS 9223 — ADV SYSTEM SOFTWARE

1. What is Lex compiler? 2. List the importance of device drivers. 3. Differentiate local symbol table from global symbol table. 4. What is ICAN for intermediate code? 5. Define Alias analysis. 6. What do you mean by local stack frame? 7. What are the two parts of a P-Code virtual machine? 8. State the features of CLI. 9. What do you mean by code-location problem? 10. Name the various classes of Grid users.

11. (a) (i) Explain the different phases of a compiler. (8) (ii) Discuss the issues in the design of a code generator. (8) Or (b) (i) Describe the memory management strategies. (8) (ii) Explain the dynamic binding of method calls to methods. (8) 12. (a) (i) Explain the structure of symbol table. (8) (ii) Discuss the features of high level, medium level and high level languages. (8) Or (b) Explain the Optimization in detail. (16) 13. (a) Explain the leaf routine optimization and shrink wrapping. (16) Or (b) Discuss the following: (i) Code scheduling (8) (ii) Speculative scheduling (8) 14. (a) Explain the Java Virtual Machine architecture in detail. (16) Or (b) Describe the various garbage collectors. (16) 15. (a) (i) Discuss the instruction set issues of IA-32. (8) (ii) Explain the migration of Virtual Machines in VMotion. (8) Or (b) (i) What is profiling? Explain the profiling during interpretation. (8) (ii) Discuss the characteristics of an ideal grid. (8)

JUNE 2010 CS9221 — DATABASE TECHNOLOGY

1. What is Fragmentation? 2. What is Concurrency Control? 3. What is Persistence? 4. What is Transaction Processing? 5. What is Client/Server Model? 6. What is the difference between data warehousing and data mining? 7. Why do we need Normalization? 8. What is Integrity? 9. Give two features of Multimedia Databases. 10. What are Deductive Databases?

11. (a) Explain the architecture of Distributed Databases. Or (b) Write notes on the following : (i) Query processing. (8) (ii) Transaction processing. (8) 12. (a) Discuss the Modelling and design approaches for Object Oriented Databases. Or (b) Explain the Multi-Version Locks and Recovery in Query Languages. 13. (a) Discuss in detail Data Warehousing and Data Mining. Or (b) Discuss the features of Web Databases and Mobile Databases. 14. (a) With an example, explain E-R Model in detail. Or (b) Explain the features of Temporal and Spatial-Databases in detail. 15. (a) Explain the features of Parallel Databases and Text Databases in detail. Or (b) Discuss the Rules, Knowledge Bases and Image Databases.

JUNE 2010 CS9222 — ADVANCED OPERATING SYS.

1. What are the advantages and disadvantages of layered approach for operating system design? 2. What are the differences between deadlock and starvation? 3. What are the similarities and differences between network operating system and distributed operating system? 4. Differentiate: resource and communication deadlock. 5. What is file replication and how it differs from file caching? 6. Differentiate: load balancing and load sharing. 7. Define the term(s) failure and fault. 8. What are the differences between lovelock and deadlock? 9. Differentiate: tightly and loosely coupled systems. 10. State the requirements for the database operating systems.

11. (a) (i) Describe the classification of advanced operating systems. (6) (ii) Illustrate the Banker’s algorithm for deadlock avoidance with suitable example. (10) Or (b) (i) What is a semaphore? Explain how semaphores are used to solve the reader’s writer’s problem. (5) (ii) Describe the models for deadlock each with example. (6) (iii) Construct a general resource allocation graph for the following scenario and determine if the graph is completely reducible: R1, R2 and R3 are reusable resources with a total of two, two and three units. Process P1 is allocated one unit each of R2 and R3 and it is requesting one unit of R1. Process P2 is allocated one unit of R1 and is requesting two units of R3. Process P3 is allocated one unit each of R1 and R2 and is requesting one unit of R3. (5) 12. (a) (i) Describe the design issues in RPC. (8) (ii) Illustrate the Lamport's algorithm for distributed mutual exclusion. (8) Or (b) (i) Describe the major issues in the design of distributed operating system. (8) (ii) Illustrate Chandy-Misra-Hass algorithm for deadlock detection in distributed system. (8) 13. (a) (i) Why availability is considered one of the important issues in the design of distributed file system. (8) (ii) Describe the components of a load distributed algorithm. (8) Or (b) (i) What are the advantages and disadvantages of distributed shared memory? (6) (ii) Describe the issues in determining the efficiency of task migration. (10) 14. (a) (i) Discuss the classification of failures in detail. (8) (ii) Describe the majority based dynamic voting protocol. (8) Or (b) (i) What is meant by backward error recovery and discuss the problems in this approach? (8) (ii) Describe the approaches proposed to implement resilient processes. (8) 15. (a) (i) Discuss the implementation of threads at the user-level and kernellevel and also state merits and demerits of each of them. (8) (ii) Describe the issues in the design of fault tolerance multiprocessor operating systems and the fault tolerance features of SEQUOIA system. (8) Or (b) (i) What are the atomic hardware instructions for process synchronization? Describe how they can be used to implement P and V operations. (8) (ii) Discuss the lock based concurrency control algorithms. (8)