Posts
(Department of Computer Science)
Course: Operating System Concepts (903) Semester: Autumn, 2010
Level: BS (CS) Total Marks: 100
Pass Marks: 40
1. PLAGIARISM OR HIRING OF GHOST WRITER(S) FOR SOLVING THE ASSIGNMENT(S) WILL DEBAR THE STUDENT FROM AWARD OF DEGREE/CERTIFICATE, IF FOUND AT ANY STAGE.
2. SUBMITTING ASSIGNMENTS BORROWED OR STOLEN FROM OTHER(S) AS ONE’S OWN WILL BE PENALIZED AS DEFINED IN “AIOU PLAGIARISM POLICY”.
ASSIGNMENT No. 1
Note: All questions carry equal marks.
Q.1 (a) Define essential properties of Batch, Interactive and Time Sharing Operating Systems.
(b) Define essential properties of Real Time, Network and Distributed Operating Systems. (20)
Q.2 (a) What are the difference between Monolithic Systems and Layered Systems?
(b) What are the basic functions of an Operating System? (20)
Q.3 (a) What mechanisms are available for Inter process Communication (IPC)?
(b) Explain Context Switching. What is the role of PCB Context Switching? (20)
Q.4 (a) Define different types of Short Term Scheduling Algorithms. Which one is better and why?
(b) Explain the main differences between Short Term Scheduling and Long Term Scheduling. (20)
Q.5 (a) What criteria are considered while CPU Scheduling. Explain significance of each.
(b) Compare and contrast the following features of process scheduling algorithms.
(i) Fairness
(ii) Efficiency
(iii) Response time
(iv) Turnaround time
(v) Throughput (20)
ASSIGNMENT No. 2
Total Marks: 100 Pass Marks: 40
Note: All questions carry equal marks.
Q.1 (a) Explain the difference between Internal and External Fragmentation. How it can be avoided?
(b) Differentiate between paging and segmentation. Also discuss their pros and cons. How page faults are handled by an operating system? (20)
Q.2 (a) Briefly define different Page Replacement Algorithms.
(b) Differentiate between Swapping and Overlaying. (20)
Q.3 (a) In which case Virtual Memory is required. Is it useful or harmful, Explain?
(b) What are interrupts? Describe the instruction cycle with interrupts with the help of suitable figures. (20)
Q.4 (a) Briefly explain all the File Systems supported by Windows XP.
(b) Differentiate DMA Device Controllers and Channel Controllers. (20)
Q.5 (a) What are the reasons of Deadlock in an O.S.
(b) How Deadlock can be avoided. (20)
903 Operating Systems
Recommended Book: Modern Operating System 3rd Edition by Andrew S Tanenbaum
Course Outlines:
Unit No. 1 Introduction:
a) What is an Operating System
b) History of Operating System
c) Operating System Concepts
d) Operating System Structure
Unit No. 2 Process
a) Introduction to Processes
b) Inter-Process Communication
c) Classic IPC Problems
d) Process Scheduling
Unit No. 3 Memory Management
a) Memory Management Without Swapping Or Paging
b) Swapping
c) Virtual Memory
d) Page Replacement Algorithms
Unit No. 4 File Systems
a) Files
b) Directories
c) Files System Implementation
d) Security
e) Protection Mechanisms
Unit No. 5 Input/Output
a) Principles of I/O Hardware
b) Principles of I/O Software
c) Disks
d) Clocks
e) Terminals
Unit No. 6 Deadlock
a) Resources
b) Deadlocks
c) Deadlock Detection
d) Deadlock Recovery
e) Deadlock Avoidance
f) Deadlock Prevention
g) Other Issues
Unit No. 7 An Overview of Major Operating Systems
a) O/S2
b) UNIX
c) NT
d) Os/400
e) Windows
Unit No. 8 Distributed Operating Systems
a) Network Operating System
b) Distributed Operating System
Unit No. 9 Case Studies
a) UNIX
b) NT
c) Windows