Scribd
Upload
13 views5 pages

Operating Systems T

The document outlines the curriculum for a PG course in Operating Systems, detailing course objectives, outcomes, and a structured syllabus divided into four modules covering process management, CPU scheduling, memory management, and file systems. It includes a model question paper with sections for detailed and short answer questions. The course aims to equip students with practical skills in developing multi-threaded applications, understanding memory management strategies, and implementing security measures.

Uploaded by

q92tycphw6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views5 pages

Operating Systems T

The document outlines the curriculum for a PG course in Operating Systems, detailing course objectives, outcomes, and a structured syllabus divided into four modules covering process management, CPU scheduling, memory management, and file systems. It includes a model question paper with sections for detailed and short answer questions. The course aims to equip students with practical skills in developing multi-threaded applications, understanding memory management strategies, and implementing security measures.

Uploaded by

q92tycphw6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

CBCS-2020 PG Sem - I Operating Systems

SEMESTER -I
OPERATING SYSTEMS
THEORY

Programme: PG Max. Hours: 60


Course Code : P20/CSC/DSC/102 Hours per week:4
Course Type : DSC Max. Marks: 100
No. of credits: 4

Course Objectives:

1. To define, explain, and apply introductory operating systems concepts like process
management, inter-process communication and memory management.
2. To explore and have an in-depth analysis of process scheduling and deadlocks.
3. To learn and analyze efficient memory management and storage structures.
4. To apply and explore different security and protection mechanisms.

Course Outcomes:

1. To develop multi-process and multi-threaded applications.


2. To design and implement an efficient concurrent program emphasizing on concept of
synchronization.
3. To illustrate criteria and algorithms for real time CPU scheduling.
4. To understand and apply various approaches to handle deadlocks and its effective
recovery.
5. To understand and apply various memory management strategies like demand paging
and page replacement approaches.
6. To explore different approaches like disk structures, RAID and storage
implementation.
7. To learn file management concepts like structure and implementation and to apply
cryptography for enabling efficient security.
8. To understand and learn basics of Linux operating system.

Department of Computer Science, St. Francis college for Women, Hyderabad-16


CBCS-2020 PG Sem - I Operating Systems

MODULE I: REVIEW OF OPERATING SYSTEM CONCEPTS & PROCESS


MANAGEMENT (15 Hrs)

Introduction: Computer-System Architecture, Operating-System Structure, Operating-System


Operations, Process Management, Memory Management, Storage Management, Protection-
Security, Kernel Data Structures, Computing Environments, Open-Source Operating Systems.
Operating-System Structures: Operating-System Services, User Interface for Operating-System,
System Calls, Types of System Calls, Operating-System Design and Implementation, Operating-
System Structure, Operating-System Debugging. Process Management: Process Concept,
Process Scheduling, Operations on Processes, Inter process Communication, Examples of IPC
Systems, Communication in Client–Server Systems. Threads: Overview, Multithreading Models,
Threading Issues. Process Synchronization: Concept, Critical-Section Problem, Peterson’s
Solution, Synchronization, Classic Problems of Synchronization, Semaphores, Monitors.

MODULE II: SERVICES OF OPERATING SYSTEMS - PROCESS SCHEDULING AND


DEADLOCKS (15 Hrs)

CPU Scheduling: Concepts, Scheduling Criteria, Scheduling Algorithms, Thread Scheduling,


Real-Time CPU Scheduling, Algorithm Evaluation. Deadlocks: System Model, Deadlock
Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance,
Deadlock Detection, Recovery from Deadlock.

MODULE III: MEMORY MANAGEMENT AND MASS STORAGE STRUCTURE


(15 Hrs)
Memory Management: Main Memory, Swapping, Contiguous Memory Allocation,
Segmentation, Paging, Structure of the Page Table. Virtual Memory: Demand Paging, Page
Replacement, Allocation of Frames, Thrashing, Memory-Mapped Files. Mass-Storage Structure:
Overview, Disk Structure, Disk Scheduling, Disk Management, Swap-Space Management,
RAID Structure, Stable-Storage Implementation.

MODULE IV: FILE SYSTEMS, SECURITY AND PROTECTION (15 Hrs)

File Systems: File Concept, Access Methods, Directory and Disk Structure, File-System
Mounting, Protection. File-System Structure and Implementation, Directory Implementation,
Allocation Methods, Free-Space Management, Recovery, Network File System. Protection and
Security: Goals of Protection, Principles of Protection, Domain of Protection, Access Matrix,
Access Control, Revocation of Access Rights, 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. Case Study: Linux System.

Department of Computer Science, St. Francis college for Women, Hyderabad-16


CBCS-2020 PG Sem - I Operating Systems

Text Books:

Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Concepts (9e)

References:

1. Thomas W. Doeppner, Operating systems in depth


2. Andrew S. Tanenbaum, Modern Operating Systems
3. William Stallings, Operating Systems – Internals and Design Principles
4. Dhananjay M. Dhandhere, Operating Systems-A Concept Based Approach

Department of Computer Science, St. Francis college for Women, Hyderabad-16


CBCS-2020 PG Sem - I Operating Systems

OPERATING SYSTEMS
MODEL QUESTION PAPER
THEORY

Course code: P20/CSC/DSC/102 Max. Time: 2 ½ hr


Credits : 4 Max. Marks: 60

SECTION - A

I. Answer the following 4 x 10 = 40 M

1. Discuss about Inter process communication in detail.


OR
2. Explain what is Critical-Section Problem and discuss about Peterson's Solution.

3. Explain the following scheduling algorithms and discuss their advantages and disadvantages:
a) Shortest Job First Scheduling
b) Priority Scheduling
OR
4. a) Discuss the methods to recover from deadlock.
b) Explain about Deadlock Prevention.

5. Explain demand paging in virtual memory management.


OR
6. Discuss various Disk Scheduling algorithms.

7. Explain the following File allocation methods


a) Continuous allocation method.
b) Linked allocation method.
OR
8. Discuss about Access Matrix.

Department of Computer Science, St. Francis college for Women, Hyderabad-16


CBCS-2020 PG Sem - I Operating Systems

SECTION - B

II. Answer any FIVE 5 x 4 = 20 M

9. Discuss about multithreading models.

10. Distinguish client server computing and peer-to-peer computing.

11. Explain about different scheduling criteria.

12. Explain characteristics of deadlocks.

13. Describe basic method of paging.

14. Explain FIFO Page replacement algorithm.

15. Describe Sequential access and direct access methods.

16. Discuss about one-time passwords & Biometrics.

Department of Computer Science, St. Francis college for Women, Hyderabad-16

You might also like