Computer Engineering Department

Government Engineering College Dahod

OPEARATING SYSTEM(3130702)

Date: 30/1/2025

ASSIGNMENT-1(Introduction)
1. What is an operating system? List the types of operating system and explain in brief.

2. List and briefly define four elements of Computer System. Briefly explain different operating
system services (OS functions).

3. Explain multiprocessor operating system types in brief.

4. Explain Distributed operating system in brief .also give its advantages of it.

5. Give the view of OS as Resource Manager.

6. Give the features of Time Sharing System and Real Time Operating System.

7. Give the features of Batch Operating System.

8. Differentiate: Multi-Programming, Multi-tasking, Multi-processing.

9. Give Difference between multi-processor and Multi-core System,

10. Describe the differences between symmetric and asymmetric multiprocessing. What are
three advantages and one disadvantage of multiprocessor systems?

11. Define Following term and describe its use: System Call, Bootstrap loader

12. Draw Microkernel and Monolithic kernel structure of Operating system and explain it.

13. Some CPUs provide for more than two modes of operation. What are two possible uses of
these multiple modes?

14. Distinguish between the client–server and peer-to-peer models of distributed systems.

15. What are the three main purposes of an operating system?

 Computer Engineering Department
Government Engineering College Dahod

Note:
 All the students have to write assignment in Notebook..
 Answer all the questions in order as per given assignment.
 Submit your assignment on or before 21/04/2025.

ASSIGNMENT-2(Process and Threads Management)

1.
What is Process? Give the difference between a process and a program.

2.
What is PCB? Discuss its major fields.

3. Draw Five state process state diagram and explain all states and various queues generated at each
stage.
4. Draw Seven state process state diagram and explain all states and various queues generated at
each stage.
5.
Explain Context switching.

6.
What is scheduler? Draw and explain queuing diagram representation of process scheduler.

7. Give the use of scheduler. Describe the differences among short-term, medium-term and long-term
scheduling.
8.
Differentiate process and thread. How do you create and terminate the process?

9.
What is thread? Explain thread structure.

10. Suppose that the following processes arrive for the execution at the times indicated. Each process
will run the listed amount of time. Assume pre-emptive scheduling.
Process Arrival Time(ms) Burst Time(ms)
P1 0.0 8
 Computer Engineering Department
Government Engineering College Dahod

P2 0.4 4
P3 1.0 1
Explain scheduling of process with shortest process next policy.
11. Five batch jobs A to E arrive at same time. They have estimated running times10,6,2,4 and 8
minutes. Their priorities are 3,5,2,1 and 4 respectively with 5 being highest priority. For each of
the following algorithm determine mean process turnaround time. Ignore process swapping
overhead Round Robin, Priority Scheduling, FCFS, SJF.
12.
Explain the classical thread model with its implementation strategies.

13. Consider the following set of processes with length of CPU burst time given in milliseconds.
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
Assume arrival order is: P1, P2, P3, P4, P5 all at time 0 and a smaller priority number implies a
higher priority.
a) Draw Four Gantt charts illustrating the execution of these processes using FCFS, SJF, non-pre-
emptive Priority, pre-emptive priority scheduling and Round Robin ( quantum =1 ) scheduling.
b) Find the average waiting time of all processes for each of the scheduling algorithms in part a?
c) Find the average Turnaround time of all processes for each of the scheduling algorithms in part
a?
14.
Explain Round Robin, Shortest Job First and Priority Scheduling Algorithms with illustration.

15.
Define: Throughput, Thread, Waiting Time,. Turnaround Time, Response Time, utilization

16. 1. Five jobs A through E arrive at a computer center with following details
Job Arrival Time CPU Time
A 0 9
B 1 5
C 2 2
D 3 6
E 4 8
Calculate the Turnaround Time and Waiting Time for all processes applying (i) First Come First
 Computer Engineering Department
Government Engineering College Dahod

Serve (ii) Shortest Job First and (iii) Round Robin (with Time Quantam=3) algorithms.
17.
Multithreading and Multitasking.

18. 2. Explain Context Switching. Discuss performance evaluation of FCFS (First Come First Serve) &
RR ( Round Robin) scheduling .
Note:
 All the students have to write assignment in Notebook..
 Answer all the questions in order as per given assignment.
 Submit your assignment on or before 21/04/2025.

ASSIGNMENT-3 (Concurrency and Inter Process Communication)

1. What is race condition? Explain the producer -consumer problem with a fatal race condition.

2. What is Semaphore? Give the implementation of Bounded Buffer Producer Consumer

Problem using Semaphore.

3. What is Semaphore? Give the implementation of Readers-Writers Problem using Semaphore.

4. What is priority inversion problem in inter-process communication? How to solve it with

semaphore?

5. What is critical section? What is Mutual exclusion? Explain Peterson’s solution for mutual
exclusion problem.

6. Producer Consumer Problem using “Monitor”.

7. Explain IPC Problem – Readers & Writers Problem.

 Computer Engineering Department
Government Engineering College Dahod

8. Explain IPC Problem –Dining Philosopher Problem.

9. What is advantage of using Monitor? Give the implementation of Bounded Buffer

Note:

 All the students have to write assignment in Notebook..

 Answer all the questions in order as per given assignment.
 Submit your assignment on or before 21/04/2025.

ASSIGNMENT-4 (Deadlock)
1. Explain the differences between deadlock, live lock and starvation.
2. What is Deadlock ? When it occurs?
3. Discuss deadlock prevention techniques for each possible condition which leads to
deadlock.
4. What is Deadlock? List the conditions that lead to deadlock. How Deadlock can be
prevented?
5. Develop a matrix for the allocation state of the system of given [Link] deadlock
detection Algorithm to find the processes involved in deadlock.
 Computer Engineering Department
Government Engineering College Dahod

6. In the following system:

R1 R2 R3 R1 R2 R3 R1 R2 R3
P 3 6 8 P1 2 2 3 Total Allocation 5 4 10
1
P 4 3 3 P2 2 0 3
2
P 3 4 4 P3 1 2 4 Total Exists 7 7 10
3
Max Need Allocated
Resources
a) Is the current allocation state safe?
b) Would the following requests be granted in the current state by the banker’s algorithm?
i. Process P1 requests (1, 1, 0)
ii. Process P3 requests (0, 1, 0)
iii. Process P2 requests (0, 1, 0)
7. Explain any one method to avoid dead lock.

8. Would the following requests be granted in the current state by the banker’s algorithm?
R1 R2 R1 R2 R1 R2
P 2 5 P1 1 3 Total Allocation 3 4
1
P 3 2 P2 2 1
2
Total Exists 4 5

a. Process P2 requests (1, 0)

b. Process P2 requests (0, 1)
c. Process P2 requests (1, 1)
d. Process P1 requests (1, 0)
e. Process P1 requests (0, 1)

9. Demonstrate how Banker’s algorithm works for a single resource.

 Computer Engineering Department
Government Engineering College Dahod

10. What is deadlock? Explain the Banker’s algorithm for deadlock avoidance.

11. How Resource Trajectories can be helpful in avoiding the deadlock?

12. Discuss Methods of Deadlock recovery.

Note:

 All the students have to write assignment in Notebook..

 Answer all the questions in order as per given assignment.

 Submit your assignment on or before 21/04/2025.

ASSIGNMENT-5 (Memory Management and Virtual Memory)

1.
Name two differences between logical and physical addresses.

2.
Explain swapping in memory management
 Computer Engineering Department
Government Engineering College Dahod

3. Given memory partition of 100K, 500K, 200K, 300K, and 600K inorder, How would each of
the First-fit, Best-fit and Worst-fit algorithms place the processes of 212K, 417K, 112K and
426K in order? Which algorithm makes the most efficient use of memory? Show the diagram
of memory status in each cases.

4. What is Paging? What is Page Table? Explain the conversion of Virtual Address to Physical
Address in Paging with example. Also compare Paging with Segmentation.

5. Why are page sizes always powers of 2? Consider a logical address space of 64 pages of 1,024
words each, mapped onto a physical memory of 32 frames.
a. How many bits are there in the logical address?
b. How many bits are there in the physical address?

6.
Explain the difference between internal and external fragmentation.

7. Explain the concept of Segmentation for Memory Management. Explain why combined Paged
Segmentation is used with illustration.

8. Under what circumstances do page faults occur? Describe the actions taken by the operating
system when a page fault occurs.

9. What is Virtual Memory? Explain Demand Paging .Discuss the hardware support required to
support demand paging.

Explain FIFO, Optimal and LRU page replacement algorithm in detail. Also Compare FIFO &
LRU page replacement algorithm.

For the Page Reference String:

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0. 1. 7, 0, 1

Calculate the Page Faults applying (i) Optimal (ii) LRU and (iii) FIFO Page Replacement
Algorithms for a Memory with three frames.

10. 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
four frames? Remember all frames are initially empty, so your first unique pages will all
cost one fault each.
a. LRU replacement b. FIFO replacement c. Optimal Replacement

Note:

 All the students have to write assignment in Notebook..

 Computer Engineering Department
Government Engineering College Dahod

 Answer all the questions in order as per given assignment.

 Submit your assignment on or before 21/04/2025.

ASSIGNMENT-6 (I/O Management & Disk scheduling)

 Computer Engineering Department
Government Engineering College Dahod

1.
Explain RAID level system.

2.
Explain elevator algorithm for scheduling disk requests.

3.
Explain SSTF and LOOK disk scheduling algorithms.

4. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently
serving a request at cylinder 143, and the previous request was at cylinder 125. The
queue of pending requests, in FIFO order, is 86, 1470, 913, 1774, 948, 1509, 1022, 1750,
130. Starting from the current head position, what is the total distance ((in cylinders) that
the disk arm moves to satisfy all the pending requests, or each of the following disk
scheduling

a. FCFS b. SCAN

5. Disk requests come in to the disk for cylinders 10, 22, 20, 2, 40, 6 and 38. A seek takes 6
msec per cylinder move. How much seek time is for Closest cylinder next algorithm?
Initially arm is at cylinder 20.

6.
What are the uses of device driver and controller in OS? Explain.

7.
Write short note on single-bus and dual-bus memory architecture.

8.
Explain : Device Driver and Interrupt Service Routine

9.
What is system call? What is interrupt? How it is handled by OS?

10.
Explain Goals of I/O Software. Also Explain Device Independent I/O software.
 Computer Engineering Department
Government Engineering College Dahod

11.
Draw the block diagram for DMA. Explain the steps for DMA data transfer.

12.
Write short note on File Allocation Table and I-node.

13.
List and explain the attributes and operations you can perform on the file.

14.
Explain different file system implementation methods.

Note:

 All the students have to write assignment in Notebook..

 Answer all the questions in order as per given assignment.

 Submit your assignment on or before 21/04/2025.

 Computer Engineering Department
Government Engineering College Dahod

ASSIGNMENT-7 (Security & Protection)

1.
Which are the ways for the user authentication? Explain each in brief.

2.
Explain Access Control List. How Access Control List can be useful for managing file access?

3.
Explain domain protection mechanism in brief.

4.
Explain the Trojan Horse and Trap doors program threats

5.
Explain the Access metrics mechanism

6.
Write a note on Generic Security Attacks.

7.
Design Principles of Security.

Note:

 All the students have to write assignment in Notebook..

 Answer all the questions in order as per given assignment.

 Submit your assignment on or before 21/04/2025.

Computer Engineering Department
Government Engineering College Dahod