VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK II SEMESTER CP7204 Advanced Operating Systems Regulation 2013 Academic Year 2016 17 Prepared by Dr.M.Senthil Kumar, Associate Professor /CSE

SUBJECT VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK : ADVANCED OPERATING SYSTEMS SEM / YEAR: II SEM/I YEAR UNIT I - FUNDAMENTALS OF OPERATING SYSTEMS SYLLABUS Overview Synchronization Mechanisms Processes and Threads - Process Scheduling Deadlocks: Detection, Prevention and Recovery Models of Resources Memory Management PART A Q.No Questions BT Level Competence 1. Define Process. BTL-1 2. Show How would you use context switching in processor? BTL-3 3. Explain the concept of mutual exclusion. BTL-4 4. Can you describe the concept of interrupt? BTL-1 5. Discuss race condition. BTL-2 6. How would you describe about the critical section problem? BTL-2 7. Quote the ideas shows resource reservation in real time Scheduling? BTL-1 8. How would you tell briefly about memory Management unit? BTL-1 9. Contrast usable and consumable resources. BTL-2 10. Label the Rules for the conditions that must hold for deadlock Prevention. BTL-1 11. Compare the algorithms available for deadlock Avoidance. BTL-2 12. What is meant by demand paging? BTL-1 13. Demonstrate the concept of page fault. BTL-3 14. Define thread BTL-1 15. Summarize life cycle of thread. BTL-4 16. Illustrate the need for semaphore in Synchronization? BTL-3 17. Explain CPU scheduling. BTL-5

18. Compare preemptive and non-preemptive scheduling. BTL-5 19. Prepare the properties of scheduling algorithm. BTL-6 20. Formulate the concept of priority inversion. BTL-6 PART B 1. (i) Classify synchronization Mechanisms. (ii) Explain in detail about various synchronization Mechanisms. 2. (i) Extend the diagrammatic representation of process life cycle process. (ii) Discuss about process life cycle in detail. 3. (i) List the thread states. (ii) Examine each states of thread in detail. 4. Examine the scenario of system in deadlock and use the graph Reduction Method to test the system state for deadlock. 5. (i) Deduce the scheduling algorithms. (ii) the priority and round robin scheduling in detail with suitable examples. 6. Summarize about algorithm evaluation for scheduling algorithms. BTL-2 BTL-1 BTL-1 BTL-5 BTL-2 7. (i) Quote the concept of deadlock detection BTL-1 prevention. (ii) Examine recovery techniques in detail. 8. Show in detail about memory management techniques. BTL-3 9. (i) How would you Compose models of resource? (ii) Rewrite a short note on monitors? 10. (i) Explain the constructs in Communication Sequential Process (CSP). (ii) Pointout the solution to readers- writers problem using CSP. BTL-6 BTL-4 11. Infer the thread creation, manipulation and synchronization. BTL-4 12. (i) Demonstrate a semaphore. (ii) Relate wait and signal operations in semaphores. BTL-3 13. Summarize the conversion of logical address into physical address. BTL_2 14. Examine issues in paging and virtual memory BTL-1

PART-C 1 Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Design a system is deadlock-free. BTL-6 Consider the following snapshot of a system: BTL-5 2 Answer the following question using the ALLOCATION MAX Available A B C D A B C D A B C D 0 0 1 2 0 0 1 2 1 5 2 0 1 0 0 0 1 7 5 0 1 3 5 4 2 3 5 6 0 6 3 2 0 6 5 2 0 0 1 4 0 6 5 6 Using Banker s algorithm decide: a. What is the content of the matrix need? b. Is the System in a safe state? c. If a request from process p1 arrives for(0,4,2,0) can the request be granted immediately? 3 4 Consider the following resource-allocation policy. Requests and releases for resources are allowed at any time. If a request for resources cannot be satisfied because the resources are not available, then we check any processes that are blocked, waiting for resources. Invent If they have the desired resources, then these resources are taken away from them and are given to the requesting process. The vector of resources for which the waiting process is waiting is increased the resources that were taken away. BTL-6 BTL-4 Contrast the scheduling algorithms and schedule the student details based on department order with an example.

UNITII - DISTRIBUTED OPERATING SYSTEMS SYLLABUS Issues in Distributed Operating System Architecture Communication Primitives Lamport s Logical clocks Causal Ordering of Messages Distributed Mutual Exclusion Algorithms Centralized and Distributed Deadlock Detection Algorithms Agreement Protocols. PART A Q.No Questions BT Level Competence 1. What are the limitations of Lamport Clock? BTL-1 2. Discover some of the issues in DOS. BTL-3 3. Illustrate Communication Primitives. BTL-3 4. Pointout, When did you use the clock skew? BTL-4 5. Tell the use of the RPC Mechanism. BTL-1 6. How would you infer fault tolerance? BTL-4 7. Recommend the ideas of physical and logical time. BTL-5 8. What can you say about casual ordering of message? BTL-1 9. Give Mutual exclusion BTL-2 10. List the basic requirements of mutual exclusion algorithm BTL-1 11. Comparison between one phase with two phase BTL-5 algorithm. 12. List out distributed deadlock detection algorithm BTL-1 13. What is meant by token based algorithm? BTL-1 14. Generalize the maekawas algorithm BTL-6 15. How would you explain byzantine agreement problem? BTL-4 16. Discuss consistent cut. BTL-2 17. Can you formulate agreement protocols. BTL-6 18. Demonstrate the concept of path pushing algorithm. BTL-3 19. Summarize the vector clock. BTL-2

20. Predict the rules on remote procedure calls. BTL-2 1. (i) List the issues in DOS? PART B (ii) Examine each issues in detail? 2. Discuss in detail about the architecture of DOS. 3. How would you tell about communication primitives? Give an example. 4. (i) With neat diagrams Examine the lamport s logical clock and vector clocks. (ii) Illustrate the chandy- Lamport s global state recording algorithm. 5. Express the concept about casual ordering of message. 6. Describe in detail about distributed mutual exclusion algorithm. 7. Demonstrate the concept of centralized deadlock detection algorithm. 8. (i) Contrast path pushing. (ii) Associate with edge pushing algorithm. 9. (i) How would you classify agreement problem? (ii) Relate any two problems in detail. 10. How would you measure the diffusion computing and global state detection algorithm? Explain in detail BTL5 11. Tell about contention based algorithms. 12. Point out the concept of Controlled algorithms. 13. (i) Infer about Ricart algorithms. (ii) Explain about Agrawala algorithms. 14. Will Suzuki / Kasami s algorithm is broadcast in nature. Justify/explain it. PART-C

1 In Lamport s algorithm, condition L1 can hold concurrently at several sites. Develop, Why then is L1 needed to guarantee mutual exclusion? 2 Maekawa s mutual exclusion algorithm gives the impression that message complexity of a distributed mutual exclusion can be O(N) instead of O(N), as in many other mutual exclusion algorithms. Explain how Maekawa s algorithm fundamentally differs from other algorithms and what problems it poses. 3 Consider that in the Ricart-Agarwala algorithm, the critical section is accessed according to increasing order of timestamps. Does the same hold true in Maekawa s algorithm? BTL6 BTL5 4 Design a Lamport s algorithm the critical section is accessed according to the increasing order of timestamps. BTL6

UNIT III - DISTRIBUTED RESOURCE MANAGEMENT SYLLABUS Distributed File Systems Design Issues - Distributed Shared Memory Algorithms for Implementing Distributed Shared memory Issues in Load Distributing Scheduling Algorithms Synchronous and Asynchronous Check Pointing and Recovery Fault Tolerance Two-Phase Commit Protocol Nonblocking Commit Protocol Security and Protection. PART A Q.No Questions BT Competence 1 Generalize the two important services present BTL6 in distributed file system? 2 What is known as mount point? 3 What is caching? 4 Tell How would you organize cache consistency? 5 What is the difference between a coherent system and a consistent system? 6 What ideas show load distribution? 7 Tabulate the difference between preemptive and non preemptive transfers. 8 Explain how to solve fault tolerance? 9 Show rules on commit protocols. 10 When did you use two phase commit protocols? 11 Explain voting protocol. 12 Compare internal versus external security. BTL5 13 Examine the difference between load balancing and load sharing algorithms. 14 Recommend the advanced models of protection BTL5 15 Pointout the statements support safety in access matrix model. 16 Rearrange the components of bell-lapadula model of BTL6 protection? 17 Summarize the facts would you select to show bulk data transfer? 18 How would you describe roll back recovery algorithm?

19 Interpret the reason for multiple site failure. 20 How would you examine design issues in distributed shared memory? PART-B 1 Illustrate in detail about distributed file system. 2 (i) Generalize about design issues in distributed resource management. (ii) Formulate each issue with examples. 3 (i) What facts would you select to show distributed shared memory? (ii) Demonstrate shared memory in detail. 4 (i) Summarize about centralized server. (ii) Explain migration algorithm. 5 Distinguish between read-replication and full-replication algorithm. 6 (i) Infer the issues in load distribution. (ii) Pointout any one issue in detail. 7 Describe the sender-initiated and receiver initiated load sharing. 8 (i) List the uses of asynchronous check point (ii) in Resource management. Describe in detail about recovery management 9 (i) Tabulate the two phase commit protocols. (ii) List where and when it is used. 10 Examine about security and protection in distributed resource management BTL6 BTL5 11 (i) caching in the operating systems. (ii) Infer Remote service in the process 12 management. Explain the concept of file replication.

13 Classification of Load distribution algorithm. 14 (i) Tell about non-blocking commit protocols in detail. (ii) Describe about the Security system in resource management. PART-C 15 Generalize the actions that belong to the transfer policy actions in the load sharing of the V System. BTL-6 16 Pointout the actions that belong to the location policy. BTL-4 17 Deduce how well the three load sharing implementations of load sharing that satisfy the scalability criteria. BTL-5 18 Invent all the overheads in a load sharing policy. BTL-6 UNIT IV - REAL TIME AND MOBILE OPERATING SYSTEMS SYLLABUS Basic Model of Real Time Systems - Characteristics- Applications of Real Time Systems Real Time Task Scheduling - Handling Resource Sharing - Mobile Operating Systems Micro Kernel Design - Client Server Resource Access Processes and Threads - Memory Management File system. PART A Q.No Questions BT Competenc 1 What is meant by real time operating system? 2 Tell the basic components of real time operating system. 3 Identify the characteristics of real time system. 4 Describe the rate monotonic scheduling.

5 List out the application of real time system. 6 Identify the types of real time systems 7 Summarize context switching overhead 8 How would you select and use priority inversion? 9 the issues in resource sharing protocols BTL5 10 Predict the significance of microkernel design? 11 Prepare the list of some mobile operating system. BTL6 12 Explain RTOS for safety critical systems. 13 Infer processes 14 How would you design thread? BTL6 15 Give the states of thread 16 How would you assess memory allocation strategies for a system? BTL5 17 Can you discuss the functions of memory manager. 18 What can you explain about Mac OS X architecture? 19 file accesses mechanism in mobile OS. 20 Discuss distributed file system. PART B 1 (i) Discuss in detail about basic models of real time systems. (ii) Express issues related to real time systems. 2 (i) Summarize the characteristics of real time systems. (ii) Assess the application of real time systems. 3 (i) Explain the real time task scheduling in RTS. (ii) Compare real time task scheduling with Round robin Scheduling. BTL5

4 (i) Illustrate the resource sharing. (ii) Relate the uses of resource sharing in distributed systems. 5 (i) Discuss the basic functionalities of mobile operating systems. (ii) Associate the functionalities with desktop operating systems. 6 Generalize the microkernel design with example. BTL6 7 (i) Explain client server resource accesses. (ii) Connect them with each other. 8 Tabulate about processes and thread states. 9 (i) Identify the memory management in mobile operating system. (ii) List the uses of it in Mobile OS. 10 Describe about the file system in detail 11 Show the Method of handling resources. 12 (i) List the various disciplines that impact the RTS. (ii) Describe any one application in Space technology. 13 (i) Briefly describe about various classified domains where RTS is applied. (ii) Demonstrate the RTS application in automation. 14 Explain EDF in detail with example. PART-C 15 Comparative Study of Different Mobile Operating systems. BTL-4 16 Generalize Symbian OS in detail. BTL-6 17. Design scheduling algorithms of real time system and prepare a BTL-6 case study about the services and applications of them. 18. Conclude which operating system is best and justify your answer. BTL-5

UNIT V - CASE STUDIES SYLLABUS Linux System: Design Principles - Kernel Modules - Process Management Scheduling Memory Management - Input-Output Management - File System - Interprocess Communication. ios and Android: Architecture and SDK Framework - Media Layer - Services Layer - Core OS Layer File System. PART A Q.No Questions BT Competence 1 What are the components of Linux system? 2 Demonstrate how the process is scheduled in Linux 3 system? What are the components of kernel modules? 4 Show the process states in Linux system. 5 Explain the kernel threads. 6 Describe process switching. 7 What is meant by memory fragmentation. 8 Tabulate the concept of shared virtual memory. 9 Examine block device, character device and network device. 10 Explain how the free space has to be managed? 11 Distinguish between synchronous and asynchronous IO in linux system. 12 Predict the reason,why does you use virtual file system in linux? 13 Extend the outline of disk portioned in linux system. 14 Generalize use of interprocesses communication? BTL6 15 Deduce the layers of IOS. BTL5 16 Show media layer in IOS. 17 Summarize service layer in IOS. BTL5 18 What is the main idea of designing core os layer in IOS? BTL6 19 Classify the file system in IOS.

20 Predict the rule on virtualization in Linux system. PART B 1 Design the principles of Linux system. BTL6 2 Examine in detail about kernel module. 3 (i) the process management scheduling in kernel system? (ii) Summarize the function of process management scheduling in kernel system in detail. 4 (i) Infer about process in Linux system. (ii) Connect the common functionalities with windows system. 5 Explain the concept of Input and output management in Linux system. 6 (i) Plan the criteria about design of file system in Linux. (ii) Integrate each criteria of the system. 7 Extend how would you give inter-processes communication in Linux System? Explain in Detail. 8 (i) Describe in detail about IOS architecture. (ii) Describe where and when the SDK BTL5 BTL6 framework is used. 9 Examine in brief about the layers of android IOS. 10 (i) Tabulate the key features of file system in Linux system. (ii) Compare it with unix system. 11 and (i) UNIX system. Give the components of linux system in detail. (ii) Associate with windows components in detail. 12 (i) Estimate the concept of Memory management in linux system. (ii) Interpret memory management with Mach OS. 13 Draw the device driver structure with appropriate explanation. 14 (i) Illustrate the methods found in IPC. (ii) Show the flow of process in IPC. PART-C

15 Linux runs on a variety of hardware platforms. what steps must the Linux developers take to ensure that the system is portable to different processors and memorymanagement architectures, and to minimize the amount of architecture-specific kernel code? 16 Multithreading is a commonly used programming technique. Describe three ways that threads could be implemented. Explain how these ways compare to the Linux clone mechanism. When might each alternative mechanism be better or worse than using clones? 17 In Linux, shared libraries perform many operations central to the operating system. Formulate the advantage of keeping this functionality out of the kernel? Are there any drawbacks? Explain your answer 18 The Linux source code is freely and widely available over the Internet or from CD-ROM vendors. Rewrite the three implications of this availability for the security of the Linux system? BTL-5 BTL-6 BTL-6