SAL INSTITUTE OF TECHNOLOGY AND

ENGINEERING RESEARCH
CE, CSE & ICT Department
Operating System (3140702)

Assignment-1 (Write any 5 Questions) (CO-1)

1) Define operating system. Give the view of OS as a resource manager. 7
2) Explain different service provided by operating system. 7

3) Explain following types of operating system neat sketch and give its pros and cons. 7
(a) Batch Operating System
(b) Multiprogramming Operating System
(c) Time Sharing Operating System
(d) Multiprocessor Operating System
(e) Clustered Operating System
(f) Distributed Operating System
(g) Network Operating System
(h) Real Time Operating System
4) What is system call? Explain steps for system call execution. 7

5) Define Kernel. Differentiate between Monolithic Kernel and Micro Kernel. 7

6) Define Program and Process. Differentiate between Program v/s Process. 7

7) Explain different states of process with process state diagram 7

8) Explain Process Control Block / Task Control Block. 7

 Assignment-2 (Write any 5 Questions) (CO-1,CO-2,CO-3)
1) Define Threads. Explain concept of multithreads and types of threads. 7

2) Define scheduler. Explain types of schedulers. 7

3) Define process context, context switch and dispatcher. 7

4) Define Scheduling criteria likes CPU Utilization, Throughput, Turn Around Time, and 7
Waiting Time and Response Time.
5) Differentiate: Non-preemptive v/s Preemptive scheduling. 7

6) Define Scheduling and explain different scheduling algorithm. Calculate average 7

waiting time and average turnaround time with gantt chart for following data with
different scheduling algorithm.

PROCESS ARRIVAL TIME TIME Required for

completion

P0 0 6

P1 1 4

P2 3 2

P3 5 1

7) Define Independent Process and Cooperating Process. 7

8) Define IPC (Inter-Process Communication). Give one application which uses IPC. 7
List out issues related to IPC. Gives advantages of IPC.

Assignment-3 (Write any 5 Questions) (CO-3)

1) Differentiate Shared Memory v/s Message Passing. 7

2) Define Process Synchronization and list out issues related to Process Synchronization. 7

3) Define Race Condition and explain Race Condition with example. 7

4) Explain Critical section and Mutual Exclusion in brief. 7

5) Describe three problems (Mutual Exclusion, Progress and Bounded waiting) of critical 7
section.
6) Explain Software based (using Peterson’s Solution) and Hardware based (using Locks) 7
 in brief.
7) Define Semaphore. Explain Binary and Counter Semaphore in brief. Describe 7
Semaphore implementation with no busy waiting. Describe deadlock, starvation and
indefinite blocking problem using busy waiting.
8) Explain following Classical IPC/Process Synchronization problems in brief. 7
i) Bounded-Buffer Problem / Producer – Consumer Problem
ii) Readers and Writers Problem
iii) Dining-Philosophers Problem

Assignment-4 (Write any 5 Questions) (CO-1,CO-3)

1) Explain Event Counter in brief. 7

2) Explain Monitor in brief. 7

3) Define Deadlock and explain four necessary conditions for dead lock to occur. 7

4) What is Resource Allocation Graph(RAG)? Explain briefly. 7

5) Explain Deadlock prevention in brief. 7

6) Explain the use of Banker’s Algorithm for multiple resources for Deadlock avoidance 7
with illustration.
7) List Deadlock Recovery Techniques and explain one of them. 7

Assignment-5 (Write any 15 Questions) (CO-4)

1) Define MMU and list out function of MMU. 7

2) Explain concept of Memory protection using base and limit registers. 7

3) Define Compile time, Load time and Execution time binding. 7

4) Differentiate Logical Address v/s Physical Address. 7

5) Explain Swapping in brief with example. 7

6) Explain Contiguous Memory Allocation Single process monitor 7

7) Explain Contiguous Memory Allocation multiprogramming with fixed partition. 7

8) Explain Contiguous Memory Allocation multiprogramming with dynamic memory 7
partition.
9) Differentiate Contiguous and Noncontiguous memory allocation. 7

10) Explain the following allocation algorithms: 1) First-fit 2) Best-fit 3) Worst-fit with 7
example.
11) Explain Fragmentation. Difference between Internal and External Fragmentation. 7

12) Explain Compaction in details. 7

13) Explain Paging in details. 7

- Explain the structure of a page table entry. If a machine has 48 bit virtual
addresses and 32-bit physical addresses and pages are of 8 KB, how many
entries are needed for the page table?
14) Explain TLB in details. 7
- Consider paging system with TLB, all page reference are found 75% times the
TLB, if 100ns are required for single memory reference and 20ns are required
for TLB search then calculate the effective memory access time?
15) Explain Multilevel Paging or Hierarchical Paging in details. 7

16) Explain Inverted Page Table (IPL) in details. 7

17) Explain Segmentation in details. 7

18) Differentiate Paging v/s Segmentation. 7

19) Explain Virtual Memory in details. 7

20) Explain concept of Demand Paging in memory management. 7

21) Consider the following reference string. Calculate the page fault rates for below page 7
replacement algorithm. Assume the memory size is 4 page frame.
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2
1. FIFO
2. LRU
3. OPTIMAL
Which algorithm is efficient?
22) What is Belady’s anomaly? Explain with suitable example. 7

23) Differentiate FIFO, LRU and Optimal Page replacement algorithm 7

24) Explain Thrashing in details. 7

Assignment-6 (Write any 10 Questions) (CO-1,CO-4,CO-5)

1) What is called device driver? Explain its function in brief. 7

2) What is DMA? Explain DMA cycle stealing with the help of diagram. 7

3) Explain the use of Controller in I/O transfer. 7

4) Write short note: RAID levels. 7

5) Assume that a disk drive has 200 cylinders, numbered 0 to 199. The drive is currently 7
serving a request at cylinder 100. The queue of pending requests is
23, 89, 132, 42, 189.
Calculate seek time FCFS and SSTFdisk scheduling algorithm.
6) Suppose that a disk drive has 200 cylinders. Numbered 0 to 199. The drive is currently 7
serving at cylinder 53 and previous request was at cylinder 43. The queue of pending
requests in FIFO order is
98, 183, 37, 122, 14, 124, 65, 67
Starting from the current head position what is the total distance (in cylinders) that the
disk arm moves to satisfy all the pending requests for each of following disk
scheduling algorithms.
(a) FCFS
(b) SSTF
(c) SCAN
(d) LOOK
(e) C-SCAN
(f) C-LOOK
7) List and Explain different File Attributes and Operations. 7

8) Explain following File Access Methods: 7

 (i) Sequential Access Method
(ii) Direct Access Method
(iii) Indexed Sequential Allocation
9) Explain following File Allocation Methods: 7
(i) Contiguous Allocation
(ii) Linked Allocation
(iii) Indexed Allocation
10) Define security. Explain following security goals: Confidentiality, Integrity and 7
Availability.
11) Explain the Trojan horse and Trap doors program threats. 7

12) Explain Authentication based on password. 7

13) Explain domain Protection Mechanism (Protection Domain, Access Control List) in 7
brief.
14) What is “inode”? Explain File and Directory Management of Unix Operating System 7

Assistant Professor, CE Dept., Head CE, CSE & ICT Dept.,

SAL Institute of Technology and Engineering SAL Institute of Technology and Engineering
Research Research