Scribd
Upload
7 views

Assi OS123

Assignment free

Uploaded by

sakibgrow
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Assi OS123

Assignment free

Uploaded by

sakibgrow
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Assignment -1 (chap-1,2,3).

1. What is an operating system? Draw the abstract view of operating system.


2. Explain user mode and kernel mode of operating system.
3. Enlist different types of operating system
4. Differentiate soft and hard real time operating system.
5. Describe mainframe operating system.
6. Explain operating system as a resource manager.
7. Explain smart card operating system and embedded operating
System.
8. Describe sensor node operating system.
9. Explain multiprocessor operating system.
10. Explain server operating system.
11. Enlist the components of computer hardware and explain any two in
Details.
12. Explain handheld operating system.
13. Explain functions of Operating system.
Chap-2
14. Explain Process in brief.
15. Define: Waiting time, Completion time, Arrival time, Response time, Turnaround time.
16. Give the formula of Waiting time ,Turnaround time
17. Explain Process State with diagram.
18. Write short note on process control block (PCB).
19. Explain Process Creation and Termination.
20. Draw the gantt chart and calculate the average waiting time and
average turnaround time according to SJF (Preemptive) scheduling algorithm for the
following processes:
Processes Arrival Time Burst Time
A 0 4
B 1 3
C 2 1
D 3 5

21. Draw the Gantt chart and calculate the Average Waiting Time and
Average Turnaround Time according to First Come First Serve
(FCFS) scheduling algorithm for the following processes:
22. Draw the Gantt chart and calculate the average waiting time and
average turnaround time according to Shortest Job First
(SJF) scheduling algorithm for the following processes:

23. Draw the Gantt chart and calculate the Average Waiting Time and
Average Turnaround Time according to Round Robin algorithm for
the following processes. Arrival time=0, Take time quantum T=3:

24. Draw the timeline chart and calculate average waiting time and
average turnaround time according to SJF scheduling algorithm for
following processes:

25. Draw the timeline chart and calculate average waiting time and
average turnaround time according to priority scheduling algorithm for
following processes: (Non-Preemptive,lowest priority = 1).
26. Draw the gantt chart and calculate the average waiting time and
average turnaround time according to SJF (non-preemptive)
scheduling algorithm for the following processes:

27. Using round robin scheduling algorithm draws the gantt chart and find
Out average turnaround time and average waiting time. (Time Quantum=2).

Processes Arrival Time Burst Time


A 0 4
B 0 3
C 0 1
D 0 5

28. Draw the gantt chart and calculate the average waiting time and
average turnaround time according to Priority scheduling algorithm
(Pre-emptive),Priority:4(H) for the following processes:

Processes Priority Arrival Time Burst Time


1 2 0 2
2 1 1 5
3 4(H) 2 3
4 3 3 4

29. Draw the gantt chart and calculate the average waiting time and
average turnaround time according to SJF (non-preemptive)
scheduling algorithm for the following processes:
Processes Arrival Time Burst Time
1 0 7
2 2 5
3 3 3
4 4 1

30. Draw the gantt chart and calculate the average waiting time and
average turnaround time according to Priority scheduling algorithm
(Pre-emptive),Priority:4(H) for the following processes:

Processes Priority Arrival Time Burst Time


P1 3 0 2
P2 2 1 5
P3 4(H) 2 3
P4 1 3 4

Chap-3

31. Define Interprocess communication and race condition

25. How Peterson’s solution will help to achieve mutual exclusion?

26. Enlist types of semaphore and define any one.

27. Enlist conditions to avoid race condition.

28. How to achieve mutual exclusion using critical region? Explain it with
a suitable diagram.

29. Enlist any two issues of IPC.

30. Explain any two operations available for semaphore.

31. Describe monitors.

32. Explain critical section. Describe Mutex.

33. Explain message passing.

***************************** The End *********************************

You might also like