Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Commodore DOS wikipedia , lookup
Copland (operating system) wikipedia , lookup
Process management (computing) wikipedia , lookup
Plan 9 from Bell Labs wikipedia , lookup
Distributed operating system wikipedia , lookup
Burroughs MCP wikipedia , lookup
Spring (operating system) wikipedia , lookup
OPERATING SYSTEMS UNIT I Syllabus: Operating Systems Overview-Operating systems functions, Overview of computer operating systems, protection and security, distributed systems, special purpose systems, operating systems structures operating system services and systems calls, system programs, operating system structure, operating systems generation. Process Management-Process concepts, threads, scheduling-criteria, algorithms, their evaluation, Thread scheduling. Objectives: To provide a grand tour of the major operating systems components To provide coverage of basic computer system organization To describe the services an operating system provides to users, processes, and other systems To discuss the various ways of structuring an operating system To explain how operating systems are installed and customized and how they boot To understand Process Concept and cooperating Process. To know Process Scheduling Lecture plan: S.No 1 2 3 4 Topic Overview of computer operating systems Operating systems functions Protection and Security Distributed Systems and Special purpose systems No. of lectures 1 1 1 1 5 6 7 8 9 10 Operating Systems Structures and Systems calls operating systems generation Process concepts threads scheduling-criteria algorithms Algorithms evaluation Thread scheduling 2 1 1 1 1 1 Assignments: 1. Explain the various types of computer systems. 2. Explain how protection is provided for the hardware resources by the operating system. 3. What are the system components of an operating system and explain them? 4. What are the various process scheduling concepts? 5. List five services provided by an operating system. Explain how each provides convenience to the users. Explain also in which cases it would be impossible for user level programs to provide these services. 6. Give an overview about threads. 7. Explain in detail about the threading issues. 8. Write about the various CPU scheduling algorithms. 9. What is critical section problem and explain two process solutions and multiple process solutions? 10. Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary semaphores UNIT II Syllabus: Concurrency – Process synchronization, the critical – section problem, Peterson’s solution, synchronization Hardware, semaphored, classic problems of synchronization, monitors, Synchronization monitors, Synchronization examples, atomic transactions. Principles of deadlock-system model, deadlock characterization, deadlock prevention, detection and avoidance, recovery form deadlock Objectives To understand the Deadlock. To understand how to take deadlock detection and prevention. Lecture plan: S.No 1 2 3 4 5 6 7 8 9 10 11 Topic Process synchronization the critical- section problem Peterson’s Solution and synchronization Hardware semaphores, classic problems of synchronization Monitors and Synchronization examples atomic transactions Principles of deadlock-system model deadlock characterization deadlock prevention detection and avoidance Recovery from deadlock No. of lectures 1 1 1 1 1 1 2 1 1 1 1 Assignments: 1. 1. Explain about address binding for a user program and discuss multi step processing of a user program. 2. What is Process Control Block? Explain its structure. 3. What is meant by process pre-emption? Explain with examples. 4. What is the need for mutual exclusion? 5. What is a critical resource? What is a critical section? What is starvation? 6. Write the resource allocation algorithm for Deadlock detection. 7. Explain how double buffering improves the performance than a single buffer for I/O. 8. Write the test for safety algorithm for Deadlock detection. 10.. Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary semaphores. UNIT III Syllabus: Memory Management : Swapping, contiguous memory allocation, paging, structure of the page table , segmentation, virtual memory, demand paging, pageReplacement, algorithms, Allocation of frames. Objectives: To understand what is memory management. To understand hoe to improve CPU speed and Users responses To know various Memory Management schemes. To understand Segmentation To understand Page Replacement algorithms Lecture plan: S.No 1 2 3 4 5 6 7 Topic Swapping contiguous memory allocation Paging structure of the page table Segmentation page-Replacement algorithms Allocation of frames Assignments: 1. What is swapping and what is its purpose? No. of lectures 1 1 1 1 1 2 1 2. 3. 4. 5. Explain the various page replacement strategies. What are files and explain the access methods for files? Explain the schemes for defining the logical structure of a directory. Write notes about the protection strategies provided for files UNIT IV Syllabus: File system Interface- the concept of a file, Access Methods, Directory structure, File system mounting, file sharing, protection. File System implementation- File system structure, file system implementation, directory implementation, allocation methods, free-space management, efficiency and performance. Mass-storage structure- overview of Mass-storage structure, Disk structure, disk attachment disk scheduling, swap-space management, RAID structure, stablestorage implementation, Tertiary storage structure. I/O systems-Hardware, application interface, kernel I/O subsystem, Transforming I/O requests Hardware operation, STREAMS, performance To understand what is file system. To know various Accesses methods. To understand File System Implementation. To understand free space management, performances. To understand completely about Mass storage structure. To understand Disk Structure. To know disk scheduling. To understand RAID structure. To know I/O, Kernel . To understand Streams and Performance. Lecture plan: S.No 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Topic The concept of a file and Access Methods Directory structure File system mounting and protection File system structure , Directory structure file system implementation and directory implementation allocation methods and free-space management the concept of a file and Access Methods efficiency and performance overview of Mass-storage structure Disk structure and disk attachment and disk scheduling swap-space management RAID structure stable-storage implementation Tertiary storage structure I/O systems Hardware and application interface kernel I/O subsystem Transforming I/O requests Hardware operation STREAMS, performance No. of lectures 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Assignments: 1. Explain various techniques implemented for free space management, discuss with suitable examples. 2. Discuss the criteria for choosing a file organization. Describe indexed file, indexed sequential file organization. 3. What is file mounting? 4. What are directory and file implementations? 5. What are the various access methods? Explain them in detail? 6. Discuss about N- step- SCAN policy for disk scheduling. 7. What is Mass-Storage Structure? 8. Explain briefly about RAID Structure? 9. What is Tertiary Storage Structure? 10.What is Stable-Storage Implementation. 11. Explain how double buffering improves the performance than a single buffer for I/O. 12. Differentiate between logical I/O and device I/O. 13. Write the test for safety algorithm for Deadlock detection. 14. Write about the kernel I/O subsystem. UNIT V Syllabus: Protection : Protection, Goals of Protection, Principles of Protection, Domain of protection Access Matrix, Implementation of Access Matrix, Access control, Revocation of Access Rights, Capability- Based systems, Language – Based Protection, Security. The Security problem, program threats, system and network threats cryptography as a security tool, user authentication, implementing security defenses, firewalling to protect systems and networks, computer –security classifications. Objectives: To understand how Process in OS must be Protected To understand principles of Protection To know Access protection To understand Various Protection mechanisms To know Security issues and tools used. Case study: UNIX, Linux and Windows. Lecture plan: S.No 1 2 3 4 5 6 Topic Protection, Goals of Protection, Principles of Protection Domain of protection, Access Matrix, Implementation of Access Matrix Access control, Revocation of Access Rights Capability- Based systems, Language Based Protection The Security problem, program threats, system and network threats cryptography as a security tool, user authentication Assignments: No. of lectures 1 1 1 1 1 2 1. List the various techniques followed by password crackers in learning password. 2. Compare active attacks with passive attacks. Give examples. 3. What is Access Control? Explain in Detail? 4. Explain about various security Threats in detail? 5. What is Cryptography?