Scribd
Upload
87 views2 pages

Assignment 1

The document discusses operating system concepts including processes, process scheduling, inter-process communication, concurrency issues like deadlocks and their prevention, memory management techniques like paging and segmentation, storage management and disk scheduling algorithms. It includes questions related to these topics and asks to explain key concepts, draw diagrams, solve examples and compare different algorithms.

Uploaded by

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

Assignment 1

The document discusses operating system concepts including processes, process scheduling, inter-process communication, concurrency issues like deadlocks and their prevention, memory management techniques like paging and segmentation, storage management and disk scheduling algorithms. It includes questions related to these topics and asks to explain key concepts, draw diagrams, solve examples and compare different algorithms.

Uploaded by

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

ASSIGNMENT 1

1. What is OS? Explain abstract view of components of computer.

2. Explain following terms Storage structure, I/O structure.

3. Explain computer system architecture with neat diagram.

4. Explain following terms Process management, Memory management ,Storage management& caching.

5. What is process ? Explain State diagram.

6. Explain Process Scheduling ?with queuing diagram.

7. Explain Process Operations?

8. Explain Inter Process Communication in detail.

9. Explain Multithreading programming with diagram.

10. Explain thread libraries and issues.

11. Explain Multithreading Model.

12. Consider the following set of processes, with length of the CPU burst time given in milliseconds.
Process Arrival Time Burst Priority
Time
P1 0 10 3
P2 0 1 1
P3 3 2 3
P4 5 1 4
P5 10 5 2
i. Draw four Gantt charts illustrating the execution of these processing using FCFS, SJF, a non
preemptive priority and RR (Quantum=2) scheduling.
ii. What is the turnaround time of each process for each scheduling algorithm in (i).
iii. What is waiting time of each process in (i)

13. Consider the following set of process:

Process Arrival Time Burst Time


P1 0 5
P2 1 1
P3 2 4
Compute average turnaround time and average waiting time using
i. FCFS
ii. Preemptive SJF and
RR (quantum-4).
ASSIGNMENT 2

1. Explain details of Petersons Solution.


2.Explain Following terms Bounded Buffer, Dining Philosophers problem.
3. Explain Three Requirements’s that a Solution Critical Section Problem must satisfy.
4.What is Deadlock ?explain preventation.
5.Explain Bankers algorithm.
6. Explain Deadlock Avoidance.
7. Explain process termination & Resource preemption to recover from deadlock.
8. Consider the following snapshot of a system:
Allocation Max Available
A B C A B C A B C
P0 0 1 0 7 5 3 3 3 2
P1 2 0 0 3 2 2
P2 3 0 3 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3
Answer the following questions using Banker's algorithm.
i) What is the content of the matrix need?
ii) Is the system in a safe state?
iii) If a request from process P1 arrives for (1 0 2) can the request be granted immediately?

8. Explain Paging Hardware with example.


9. Explain Paging Hardware TLB.
10. Explain Page fault or Demand Paging with neat diagram.
11. Solve the following paging example OPT & LRU
7012030423032120 1701
12.Explain different access methods.
13. What is Directory? Explain different types.
14. Explain 3 major methods of allocating disk space.
15.A disk queue with request for I\O to blocks on cylinders 98 183 37 122 14 124 65 67, if the disk head
is initially cylinder 53, find the total number of moments. (SSTF & Scan disk Scheduling)

You might also like