Chendu College of Engineering & Technology

Size: px

Start display at page:

Download "Chendu College of Engineering & Technology"

Karin Cook
6 years ago
Views:

Chendu College of Engineering & Technology (Approved by AICTE, New Delhi and Affiliated to Anna University) Zamin Endathur, Madurantakam, Kancheepuram District 603311 +91-44-27540091/92 www.ccet.org.

1 Chendu College of Engineering & Technology (Approved by AICTE, New Delhi and Affiliated to Anna University) Zamin Endathur, Madurantakam, Kancheepuram District /92 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING Subject Name: CS6401 Operating system Year/Sem: II/IV QUESTION BANK UNIT I OPERATING SYSTEMS OVERVIEW 1. What is an Operating system? 2. List out the function of operating systems. Nov/Dec What is PCB? Specify the information maintain in it. Nov/Dec What are the basic elements of Operating system 5. Define interrupt. 6. Write about instruction execution. 7. Why is the Operating System viewed as a resource allocator & control program? 8. List the memory hierarchy available in operating system. 9. Define catch memory. 10. What is Direct Memory Access 11. Define Multiprocessor. 12. Write about Multicore Organization. 13. List Evolution of Operating System 14. What is the Kernel? 15. What are Batch systems? 16. What is the advantage of Multiprogramming? 17. What is an Interactive computer system? 18. What do you mean by Time-sharing systems? 19. What are multiprocessor systems & give their advantages? 20. What are the different types of multiprocessing? 21. What is graceful degradation? 22..What is Dual-Mode Operation? 23. What are privileged instructions? 24. How can a user program disrupt the normal operations of a system? 25. How is the protection for memory provided? 26. What are the various OS Components? 27. Define system booting 28. What is the use of fork and exec system calls PART-B 1. Briefly explain in detail the types of systems calls provided by a typical operating. Nov/Dec Explain the operating system structure.nov/dec Explain the various types of computer systems. 4. Explain how protection is provided for the hardware resources by the operating system. 5. What are the system components of an operating system & explain them? 6. Write about the various system calls.

2 7. Explain the various memory hierarchies with neat block diagram. 8. Explain the different operations of processes. 9. Differentiate symmetric and asymmetric multiprocessing system. 10. In what ways is the modular kernel approach similar to the layered approaches 11. Explain the facilities provided by the following operating system 12. List out the services provided by operating systems to programs and to the 13. Define operating system and list out the function and component of operating system. UNIT II PROCESS MANAGEMENT 1. Differentiate a thread from a process. Nov/Dec How does real-time scheduling differ from normal scheduling? Nov/Dec Define semaphores. Mention its importance in operating system. Nov/Dec Describe the action taken by a kernel to context-switch between process. Nov/Dec Differentiate pre-emptive and non-preemptive scheduling. Nov/Dec What can the operating system do to recover from deadlock? 7. State the necessary condition for a deadlock situation to arise. Nov/Dec What are the various process scheduling concepts? 9. Explain about inter process communication. 10. Give an overview about threads. 11. Explain in detail about the threading issues. 12. What is a process? 13. What is a process state and mention the various states of a process? 14. What is process control block? 15. What are the use of job queues, ready queues & device queues? 16. What is meant by context switch? 17. What is co-operating process 18. Define a thread. State the major advantages of threads 19. Discuss the differences between symmetric and asymmetric multiprocessing. 20. Define mutex locks. 21. Discuss the critical section problem. State the basic requirements of critical section problem solution 22. What are the benefits of multithreaded programming? 23. Compare user threads and kernel threads. 24. What is User threads 25. Define Kernel threads 26. Define thread cancellation & target thread. 27. What are the different ways in which a thread can be cancelled? 28. Define CPU scheduling. 29. What is a Dispatcher? 30. What is dispatch latency? 31. What are the various scheduling criteria for CPU scheduling? 32. Define throughput? 33. What is turnaround time? 34. Define race condition. 35. What are the requirements that a solution to the critical section problem must satisfy? 36. Define entry section and exit section. 37. Give two hardware instructions and their definitions which can be used for implementing mutual exclusion. 38. Define busy waiting and spinlock. 39. What is bounded waiting in critical region? 40. Define deadlock.

3 41. Define deadlock prevention, avoidance. 42. What are the four necessary conditions a system should posses in order to avoid deadlock? 43. What is banker's algorithm? PART-B 1. Explain any three policies for process scheduling tha uses resource consumption information. what is response ratio.(16) Nov/Dec What are semaphores? how do they implement mutual exclusion?(8). Nov/Dec Give a solution for readers-writers problem using condition critical regions (8). Nov/Dec How does a deadlock can be avoided using banker s algorithm (8). Nov/Dec Discuss in detail the critical section problrms and also write the algorithm for readerswriters problem with semaphores. (8) Nov/Dec Explain the difference in the degree to which FCFS,RR,Non-preemptive SJF scheduling algorithm, discriminate in favour of short process. (16) Nov/Dec Explain the various scheduling criteria in evaluating scheduling algorithm. (8) Nov/Dec What is critical section? specify the requirements, for a solution to the critical section problem. (8) Nov/Dec Explain the banker s algorithm for deadlock avoidance with illustration.(8) Nov/Dec Write about the various CPU scheduling algorithms. 11. Write notes about multiple-processor scheduling and real-time scheduling. 12. What is critical section problem and explain two process solutions and multiple Process solutions? 13. Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary semaphores. 14. Explain the classic problems of synchronization. 15. Write about critical regions and monitors. 16. Give a detailed description about deadlocks and its characterization 17. Write in detail about deadlock avoidance. 18. Give an account about deadlock detection. 19. What is the important feature of critical section? State the dining philosophers problem and How to allocate the several resources among several processes in a deadlock and starvation free manner. 20. Consider the following five processes, with the length of the CPU burst time given in milliseconds. Process Burst time P1 10 P2 29 P3 3 P4 7 P Consider the First come First serve(fcfs),non Preemptive Shortest Job First(SJF), 22. Round Robin(RR) (quantum=10ms) scheduling algorithms. Illustrate the scheduling using Gantt chart. Which algorithm will give the minimum average waiting time? Discuss. Consider the following page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, How many page faults would occur for the following replacement algorithms, assuming three frames that all frames are initially empty? 24. Construct a Resource Allocation Graph for the following scenario. At time t ProcessP1 request for a resource X, process P2 requests for a resource Y. Both the

4 resources are Available and they are allocated to the requesting process. At time t1 where t1>t2 both the processes are still holding the resources, however process P1 request for Y which is held by P2, process P2 request for X held by P1. Will there be a deadlock? f there is a deadlock discuss the four necessary conditions for deadlock, else justify there is no deadlock 25. Consider the following snapshot of a system. Execute Banker's algorithm answer the following. Allocation Max Available A B C D A B C D A B C D P P P P What are the methods involved in recovery from deadlocks? 27. Explain implementation of producers/consumers problem using monitor. 28. Discuss the critical section problem. State the basic requirements of critical section problem solution UNIT III STORAGE MANAGEMENT 1. Differentiate local and global page replacement algorithm. Nov/Dec List out the step needed to implement page replacement. Nov/Dec Compare swapping and overlays. Nov/Dec Differentiate eternal fragmentation with internal fragmentation. Nov/Dec What is logical address space and physical address space? 6. What is the main function of the memory-management unit? 7. Define dynamic loading. 8. Define dynamic linking. 9. What are overlays? 10. Define swapping. 11. What are the common strategies to select a free hole from a set of available holes? 12. What do you mean by best fit? 13. What do you mean by first fit? 14. What is segmentation? 15. Why should we use virtual memory? 16. State what is required to support dynamic memory allocation in contiguous memory allocation? 17. What is thrashing? 18. What is Pre-paging? 19. Distinguish logical and physical address space. 20. Define virtual memory. 21. What so you mean by maskable and non maskable interrupt? PART-B 1. Differentiate local and global page replacement algorithm. Nov/Dec What is virtual memory? Mention its advantages. Nov/Dec What is the maximum file size supported by a file system with 16 direct blocks, single, double, and triple indirection? The block size is 512 bytes. Disk block number can be stored in 4 bytes. Nov/Dec List the steps needed to perform page replacement. Nov/Dec Explain with the help of examples FIFO and LRU page replacement algorithms.(8) Nov/Dec Differentiate external fragmentation with internal fragmentation. Nov/Dec 2013

5 7. Briefly explain and compare, fixed and dynamic memory partitioning schemes. Nov/Dec Explain with the help of examples FIFO and LRU, optical page replacement algorithms with example reference string. Mention the merits and demerits of each of the above algorithm. Nov/Dec Explain how paging supports virtual memory. With neat diagram explain hoe logical address is translated into physical address. Nov/Dec Explain memory management in Linux operating system. Nov/Dec Explain about contiguous memory allocation 12. Give the basic concepts about paging 13. Write about the techniques for structuring the page table. 14. Explain the basic concepts of segmentation. 15. What is demand paging and what is its use? 16. Explain the various page replacement strategies 17. What is thrashing and explain the methods to avoid thrashing? 18. Write short notes on swapping 19. Discuss the advantages of paging memory management and the conversion of logical address into physical address with necessary 20. Consider the following page reference string: 2, 3, 4, 2, 1, 5, 6, 4, 1, 2, 3, 7, 6, 3, 2, 1 Calculate the number of page faults would occur for the following page replacement algorithm with frame size of 4 and 5. (16) 21. Explain the page fault handling routine with diagram. 22. Explain Contiguous and Non contiguous memory allocation with example. UNIT IV I/O SYSTEMS 1. What is virtual memory? 2. What is file allocation strategy is most appropriate for random access files. Nov/Dec What is Demand paging? 4. Define lazy swapper. 5. What is a pure demand paging? 6. Define effective access time. 7. Define secondary memory. 8. What is the basic approach of page replacement? 9. What are the various page replacement algorithms used for page replacement? 10. What are the major problems to implement demand paging? 11. What is a reference string? 12. What is a file? 13. List the various file attributes. 14. What are the various file operations? 15. What are the information associated with an open file? 16. What are the different accessing methods of a file? 17. What is Directory? 18. What are the operations that can be performed on a directory? 19. Define lazy swapper. 20. What is a pure demand paging? 21. Define effective access time. 22. List out the disadvantages of FAT file system. 23. Define relative block number. 24. Give the example of relative and index file.

6 PART-B 1. Discuss the different techniques with which a file can be shared among different users. Nov/Dec Explain any two page replacement algorithm. Nov/Dec Explain the concept of demand paging and the performance issue of demand paging. Nov/Dec Explain linked file allocation method. Nov/Dec Explain various file directory structure. Nov/Dec What are files and explain the access methods for files? File definition 7. Explain the schemes for defining the logical structure of a directory. 8. Write notes about the protection strategies provided for files. 9. Explain the allocation methods for disk space. 10. State the various attributes of file and their purpose. 11. Discuss various file operations. 12. Give an example for an application that could benefit from operating system support for random access to indexed files. 13. List and briefly discuss the most common schemes for defining the logical structure of a directory. 14. With necessary diagram explain the different allocation methods of disk space. 15. List and discuss various methods for implementing a directory. Single-Level directory 16. Explain and compare different file access methods. 17. Explain the indexed and linked file allocation methods. Discuss the advantages and Disadvantages in those methods. 18. How are the processes and threads executed in Linux? UNIT V CASE STUDY 1. Define Linux Kernel. 2. What is Linux distribution? 3. How device driver support 4. Differentiate Development kernel and Production kernel. 5. How do you improve symmetric multiprocessor performance 6. Give some examples of Linux OS. 7. Define public domain 8. What are the components of Linux System? 9. What kernel it means? 10. Define System Library. 11. Describe System utilities. 12. Draw the diagram for components of Linux system. 13. Mention the terms of registration table. 14. Elaborate fork () and exec(). 15. What are the components of Linux Module? 16. Define Linux system. 17. What are the requirements for Linux System Administrator? 18. Define LINUX Multifunction Server 19. What is Domain Name System? 20. Define Local Network Services. 21. List the available Virtualization 22. What is VMware on Linux Host 23. List the Guest OS. 24. How development kernel operates in Linux OS?

7 PART-B 1. Explain about Linux system with suitable example. 2. Define Linux system Administrator and list the requirements of linux system administrator 3. Explain detail in Linux multiplication server 4. List local network services with example. 5. Write about Virtualization with example. 6. Briefly Explain about the Layers of Linux Operating System. 7. Explain about the Structure of Linux Kernel with necessary diagram. 8. Discuss in detail about Scheduling in Linux. 9. Illustrate Linux run queue and priority arrays. 10. Explain in detail about Memory Management in Linux.

CLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS UNIT I OPERATING SYSTEMS OVERVIEW

CLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS SYLLABUS UNIT I OPERATING SYSTEMS OVERVIEW Computer System Overview-Basic Elements, Instruction Execution, Interrupts, Memory