Question Bank: Unit-2 & Unit-3 2018-19

Course Code BTCS15F5100

Course Title Operating System and UNIX Internals
Semester V sem

QUESTION BANK

Unit-2: Process Management

Unit-3: Memory Management
Sl. Marks
Important Questions
No. (Approx.)
Define Inter Process Communication (IPC). With a neat diagram, describe
1. (07 Marks)
the two fundamental models of IPC.
What are the different methods used for logical implementation of a message
2. (05 Marks)
passing system? Explain any one.
Explain the implementation of producer - consumer processes using bounded
3. (08 Marks)
buffer in shared memory systems.
4. What is multithreading? Explain the benefits of multithreaded programming. (08 Marks)
5. Discuss various multithreading models with a neat diagram. (08 Marks)
6. Explain various Thread Libraries: POSIX, Win32 and JAVA Threads (10 Marks)
Why a thread is called a Light Weight Process (LWP)? Also explain any one
7. (05 Marks)
of the many threading issues.
8. With a neat diagram, explain the concept of scheduling queues. (06 Marks)
Explain the following in brief:
(i) Long-term scheduler
9. (10 Marks)
(ii) Short-term scheduler
(iii) Medium-term scheduler
Explain the following with a neat diagram:
10. (i) Multilevel queue scheduling (10 Marks)
(ii) Multilevel feedback queue scheduling
Consider the following set of processes:
Process Arrival Time Burst Time (ms)
P1 0 8
11. P2 1 4 (08 Marks)
P3 2 9
P4 3 5
Draw Gantt charts and calculate average waiting time and average

School of Computing and Information Technology 1

Question Bank: Unit-2 & Unit-3 2018-19

turnaround time using non-preemptive SJF and preemptive SJF (SRTF)

scheduling algorithms.
Consider the following set of processes:
Process Burst Time (ms) Arrival Time Priority
P1 10 0 2
P2 5 2 1
P3 2 3 0
12. (08 Marks)
P4 20 5 3
Draw Gantt charts and calculate average waiting time, average turnaround
time using the following CPU scheduling algorithms.
(i) Preemptive shortest job first
(ii) Non-preemptive priority (0 = HIGH priority).
Consider the following data about processes:
Process Arrival Time Burst Time (ms) Priority
P1 0 7 3
P2 3 2 2
P3 4 3 0
P4 5 1 1
13. (10 Marks)
P5 6 3 4
(i) Draw charts to illustrate execution using SRTF, non-preemptive priority
and Round-Robin (TQ = 1 ms) scheduling algorithms.
(ii) Compute waiting time in each of the cases.
(iii) Which of them provide minimal average waiting time and turnaround
time?
Consider the following set of processes, with the length of the CPU burst
time given in milliseconds:
Process Arrival Time Burst Time Priority
P1 0 10 2
P2 0 1 0
P3 3 2 3
P4 5 1 4
14. (10 Marks)
P5 10 5 1
(i) Draw Gantt charts illustrating the execution of these processes using
FCFS, SJF, Priority and Round-Robin (TQ = 2) scheduling algorithms.
(ii) Calculate average waiting time for each of the above scheduling
algorithms.
(iii) Calculate average turnaround time for each of the above scheduling
algorithms.
What do you mean by address binding? Explain with the necessary steps, the
15. (08 Marks)
binding of instructions and data to memory addresses.
16. Distinguish between Logical versus Physical address space. (05 Marks)
17. Explain the concept of Swapping and Paging. (10 Marks)
Memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, 600 KB (in order)
18. are available. How would first-fit, best-fit and worst-fit algorithms place (08 Marks)
processes of 212 KB, 417 KB, 112 KB and 426 KB (in order).

School of Computing and Information Technology 2

Question Bank: Unit-2 & Unit-3 2018-19

Which algorithm makes the most efficient use of memory?

Explain internal and external fragmentation problem encountered in a
19. (05 Marks)
contiguous memory allocation scheme.
Why is translation look-aside buffer (TLB) important? In a simple paging
20. (08 Marks)
system, what information is stored in TLB? Explain.
21. Explain the concept of Segmentation with neat diagram (10 Marks)

School of Computing and Information Technology 3