Download 16MCA24 - PESIT South

PESIT- Bangalore South Campus
Hosur Road (1km Before Electronic city)
Bangalore – 560 100
Department of MCA
COURSE INFORMATION SHEET
Operating System(16MCA24)
1.
GENERAL INFORMATION
Academic Year: 2017
Semester(s):I
Title
Code
OPERATING SYSTEM
16MCA24
Duration
Lecture 52 Hrs
Total:
52 Hrs
2. FACULTY DETAILS
Name
Department
Room
E-mail
Contact Hours
Consultation
PESIT-BSC-COURSE INFORMATION-SEMII
Deta
RICHA SHARMA
MCA
517 5TH FLOOR
[email protected]
Office Hours
By Email
3. VENUE AND HOURS/WEEK
All lectures will normally be held in
500. Lecture Hours/week: 4Hr
2. PRE REQUIREMENT STATEMENT
This course provides a comprehensive introduction to understand the underlying principles,
techniques and approaches which constitute a coherent body of knowledge in operating systems.
In particular, the course will consider inherent functionality and processing of program execution
. The emphasis of the course will be placed on understanding how the various elements that
underlie operating system interact and provides services for execution of application software.
3. COURSE OBJECTIVES
4. CO U RS E OUTCOMES: The STUDENT WILL BE ABLE :
1.Gain extensive knowledge on principles and modules of operating system.
2.Understand key mechanisms in design of operating system modules.
3.Understand process management, concurrent processes and threads, memory
management, virtual memory concepts, deadlocks.
4.Be familiar with multithreading
5.Master concepts of memory management including virtual memory
6.Master system resources sharing among the users
7.Master issues related to file system interface and implementation, disk management
8.Be familiar with protection and security mechanisms
9.Be familiar with various types of operating systems including Unix
10.Produce algorithmic solution to process synchronization problems.
11.Practice with operation system concepts such as process management,
synchronization.
PESIT-BSC-COURSE INFORMATION-SEMII
5. MODULE SPECIFICATION:
PESIT-BSC-COURSE INFORMATION-SEMII
% of syllabus
Class
Theme
3.
3
5
Distributed Systems, Clustered
Systems,
Real - Time Systems ,Handheld
Systems
, Feature Migration, Computing
Environments.
4
5
6
Computer
and
Operating
Systems
Structure
System
Components, Operating –
System Services
System Calls, System Programs
9
System Structure, Virtual Machines,
10
System Design and Implementation
11
System Generation.
12
Cumulative % of
Portions Covered
1
The Memory Hierarchy, Cache
Memory, I/O Communication
Techniques,
Introduction to Operating
System,
Mainframe
Systems,
Desktop Systems, Multiprocessor
Systems
2.
8
covered
Basic Elements, Processor Registers,
Instruction Execution, Interrupts
1.
7
Topic Outline & Readings
7
9
11
34
13
15
17
19
21
23
13
Process, Process States, Process
Description, Process Control
25
14
Execution of the
Operating System, Security Issues
26
15
Processes and Threads,
Symmetric Multiprocessing(SMP)
28
16
CPU Scheduler and
30
PESIT-BSC-COURSE INFORMATION-SEMII
Scheduling.
17
CPU Scheduler and
Scheduling.
32
18
CPU Scheduler and
Scheduling.
34
19
Principles o f Concurrency, Monitors
36
20
Mutual Exclusion
Support
21
Process
Management
and Mutual
Execution
:
Hardware
48
Semaphores
38
40
22
Message Passing
23
Readers/Writes Problem
45
24
Readers/Writes Problem
48
25
Principles of Deadlock, , Deadlock
Avoidance, Deadlock Detection,
An Integrated Deadlock
Strategy,
Dining Philosophers Problem
26
Deadlock Prevention
27
28
Deadlock and
Memory
Management
52
54
76
An Integrated Deadlock Strategy
Dining Philosophers Problem
30
Readers
31
Swapping, Contiguous Memory
Allocation
Paging
33
50
Deadlock Detection
29
32
42
Segmentation, Segmentation with
Paging
56
64
66
68
34
Demand Paging, Process Creation
70
35
Page Replacement
72
36
Allocation of Frames
37
Thrashing
76
38
File Concept, Access Methods,
Directory Structure,
78
File – System Mounting, File
Sharing, Protection
39
40
74
80
File
– System File – System Structure,
&
Secondary
Storage
82
94
84
43
File – System Implementation,
Directory Implementation
Allocation Methods
44
Free –Space Management.
88
45
Disk Structure, Disk Scheduling
90
46
Disk Scheduling ,Disk Management,
47
User Authentication, The Security
Problem,
Program Threats, System Threats.
41
48
49
50
51, 52
Computer
Security
Linux System , Linux history
,
Design
Principles,
Kernel
modules
Case study of
Linux Operating
system:
Process management, scheduling,
Memory management, File systems,
Input and output, Inter-process
Communications.
PESIT-BSC-COURSE INFORMATION-SEMII
86
92
94
96
96
100
98
100
PESIT-BSC-COURSE INFORMATION-SEMII
Literature /References
TEXT BOOKS
1. Silberschatz, Galvin, Gagne, “Operating System Concepts” John Wiley, Sixth Edition, 2004
2. William Stallings, “Operating Systems – Internals and Design Principles” Pearson,
6th edition, 2012
REFERENCE BOOKS
1.Chakraborty , “Operating Systems” Jaico Publishing House, 2011.
2. Dhananjay M. Dhamdhere, “Operating Systems – A Concept – Based Approach”, Tata
McGraw – Hill, 3rd Edition, 2012
Elmasri, Carrick, Levine, “Operating Systems – A spiral Approach”, Tata McGraw – Hill, 2012
3.
Internal Assessment
S.No
1.
2.
3.
4.
5.
Activity
Seminar
Quizzes (surprise test)
Overall Participation
Assignment
Internal Tests
TOTAL
Marks
5
5
5
5
30
50
Seminar: A group of 2 students each will present either a case study. The
presentation has to be approved by me before presenting in class.
Assignment:
Question Bank
Part - A
1. What is an operating system?
2. What is the kernel?
PESIT-BSC-COURSE INFORMATION-SEMII
3. What are batch systems?
4. Differentiate tightly coupled systems and loosely coupled systems.
6. What is real time system?
8. What do you mean by system calls?
10. What is a process?
11. What is process control block?
12. What is scheduler?
13. What are the use of job queues, ready queues and device queues?
14. What is meant by context switch?
15. What is independent process?
16. What is co-operative process?
17. What are the benefits OS co-operating processes?
19. State the advantage of multiprocessor system.
20. What is the use of inter process communication?
22. What are the benefits of multithreaded programming?
23. Compare user threads and kernel threads.
24. What is the use of fork and exec system calls?
Part - B
1. Explain the various types of computer systems.
2. (i) what is the purpose of system calls? Briefly explain the types of system calls provided by
a typical operating system.
(ii)Explain how co-operating process communication with each other via an IPC.
3. Discuss briefly the various issues involved in implementing Inter process communication
(IPC) in message passing system.
4. Explain in detail about the threading issues.
5. Explain about Multi-Threading Models.
PESIT-BSC-COURSE INFORMATION-SEMII
6. Explain in detail about Review of Computer Organization.
7. Write short notes about Process concept and process scheduling.
UNIT-II
PROCESS SCHEDULING AND SYNCHRONIZATION
1. Define CPU scheduling.
2. What is preemptive and no preemptive scheduling?
3. What is a Dispatcher?
4. What is dispatch latency?
5. What are the various scheduling criteria for CPU scheduling?
6. Define throughput.
7. What is turnaround time?
8. Define race condition.
9. What is critical section problem?
10. What are the requirements that a solution to the critical section problem must satisfy?
11. Define entry section and exit section.
12. What is a semaphore?
13. Define busy waiting and spin lock.
14. Define deadlock.
15. What are conditions under which a deadlock situation may arise?
16. What is a resource-allocation graph?
17. Define request edge and assignment edge.
18. What are the methods for handling deadlocks?
19. Define deadlock prevention.
PESIT-BSC-COURSE INFORMATION-SEMII
20. Define deadlock avoidance.
21. What are a safe state and an unsafe state?
22. What is banker’s algorithm?
Part - B
1. Write about the various CPU scheduling algorithms.
2. What is critical section problem and explain two process solutions and multiple
process solutions?
3. Explain what semaphores are, their usage, implementation given to avoid busy waiting
and binary semaphores.
4. Write about critical regions and monitors.
5. Give a detailed description about deadlocks and its characterization.
6. Explain about the methods used to prevent deadlocks
7.Explain the Banker’s algorithm for deadlock avoidance.
8. Consider the following snapshot of a system:
Process Allocation max available
Answer the following questions using the banker’s algorithm:
1) What is the content of the matrix need?
2) Is the system in a safe state?
3) If a request from process p1 arrives for (0, 4, 2, 0), can the request be granted immediately?
9. Consider the following set of process, with the length of the CPU-burst time given in
milliseconds:
PESIT-BSC-COURSE INFORMATION-SEMII
process
P1
Burst time
Priority
10
P2
3
1
P3
1
2
3
P4
1
4
P5
5
2
The processes are assumed to have arrived in the order p1, p2, p3, p4, p5, all at time 0.
a) Draw four Gantt charts illustrating the execution of these process using FCFS, SJF,
a nonpreemptive priority (a smaller priority number implies a higher priority), and RR
(quantum=1) scheduling.
b) What is the turnaround time of each process for each of the scheduling algorithms in part a?
c) What is the waiting time of each process for each of the scheduling algorithms in part a?
d) Which of the schedules in part a results in the minimal average waiting time (over
all processes)?
UNIT-III-STORAGE MANAGEMENT
1. Define logical address and physical address.
2. What is logical address space and physical address space?
3. What is the main function of the memory-management unit?
4. Define dynamic loading.
5. Define dynamic linking.
6. Define swapping.
7. What are the common strategies to select a free hole from a set of available holes?
8. What do you mean by best fit?
9. What do you mean by first fit?
10. What is virtual memory?
PESIT-BSC-COURSE INFORMATION-SEMII
11. What is Demand paging?
12. Define lazy swapper.
13. What is a pure demand paging?
14. Define effective access time.
15. Define secondary memory.
16. What is the basic approach of page replacement?
17. What are the various page replacement algorithms used for page replacement?
18. What are the major problems to implement demand paging?
19. What is a reference string?
20. What are the advantages of Contiguous allocation?
21. Define Paging.
22. Define Segmentation.
Part - B
1. Explain about contiguous memory allocation.
2. Give the basic concepts about paging.
3. Explain the basic concepts of segmentation.
4. Explain the various page replacement strategies.
5. Consider
the
following
page-reference
string: 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6
How many page faults would occur for the following replacement algorithms, assuming
frame size is
4.Remember that frames are initially empty. (i)LRU
replacement (ii)FIFO replacement
(iii)Optimal replacement
6. Explain in detail about swapping and thrashing.
7. Write in detail about Virtual memory.
PESIT-BSC-COURSE INFORMATION-SEMII
UNIT-IV FLE SYSTEM
1. What is a file?
2. List the various file attributes.
3. What are the various file operations?
4. What is the information associated with an open file?
5. What are the different accessing methods of a file?
6. What are the operations that can be performed on a directory?
7. What are the most common schemes for defining the logical structure of a directory?
8 What are the various layers of a file system?
9. What are the structures used in file-system implementation?
10. What are the functions of virtual file system (VFS)?
11. Define seek time and latency time.
12. What are the allocation methods of a disk space?
13. What are the advantages of Contiguous allocation?
14. What are the drawbacks of contiguous allocation of disk space?
15. What are the advantages of Linked allocation?
16. What are the disadvantages of linked allocation?
17. What are the advantages of Indexed allocation?
18. Define rotational latency and disk bandwidth.
19. How free-space is managed using bit vector implementation?
Part - B
1. What are files and explain the access methods for files?
2. Write in detail about file concept.
PESIT-BSC-COURSE INFORMATION-SEMII
3. Write notes about the protection strategies provided for files.
4. Write in detail about directory structure.
5. Write in detail about File-System Implementation.
6. Write in detail about Allocation methods.
UNIT-V-I/O SYSTEMS
1. Define buffering.
2. Define caching.
3. Define spooling.
4. What are the various disk-scheduling algorithms?
5. What is low-level formatting?
6. What is the use of boot block?
7. What is sector sparing?
8. Define rotational latency and disk bandwidth.
9. What is mean by streams?
10. Define seek time.
11. What is mean by FCFS and SSTF scheduling algorithms?
12. Define SCAN and C-SCAN scheduling algorithms.
13. What is Look Scheduling?
14. Define RAID.
15. Difference between stable storage and tertiary storage.
Part - B
1. Write about the kernel I/O subsystem.
2. Explain the various disk scheduling techniques
PESIT-BSC-COURSE INFORMATION-SEMII
3. Write notes about disk management and swap-space management.
4. A hard disk having 2000 cylinders, numbered from 0 to 1999. the drive is currently serving
the request at cylinder 143,and the previous request was at cylinder 125.The status of the
queue is as follows
86, 1470, 913, 1774,948,1509,1022,1750,130
What is the total distance (in cylinders) that the disk arm moves to satisfy the entire
pending request for each of the following disk-scheduling algorithms?
(i)SSTF) (ii) FCFS (iii) SCAN (IV) C-SCAN
5. Explain in various RAID Level.
6.Write notes about Stable storage and tertiary storage.
PESIT-BSC-COURSE INFORMATION-SEMII