Skip to content
Previous Year Question Paper

AL-501 - Operating Systems

June 2025•AIML•SEMESTER-5
June 2025
Max Marks: 70
Duration: 3 Hours
Instructions:

• Attempt any five questions.

• All questions carry equal marks.

Q.1
a)Unit 1

What is real time operating system? What is difference between hard real time and soft real time operating system?

b)Unit 5

What is spooling? What are the advantage of spooling over buffering?

Q.2
a)Unit 1

What is kernel? Describe various operations performed by kernel?

b)Unit 1

Describe classification of operating system.

Q.3
a)Unit 3

Define semaphore? Give a scheme for implementation of semaphore primitives?

b)Unit 3

Define message passing and shared memory interprocess communication?

Q.4
a)Unit 3

What is the difference between pre-emptive and non preemptive scheduling, state why strict non preemptive scheduling is unlikely to be used in computer center? Explain the operation of multi level scheduling?

b)Unit 3

What do you understand by context switching and various processes involved in it?

Q.5
a)Unit 3

Describe Dekker's solution?

b)Unit 3

State and describe the producer consumer problem with its suitable solution?

Q.6
a)Unit 3

Consider the process CPU burst time and arrival time given below:

ProcessCPU Burst TimeArrival Time
P180
P241
P392
P453

Draw the Gantt chart and calculate the following by using SRTF CPU scheduling algorithms

i) average waiting time

ii) average turnaround time

b)Unit 3

Discuss and explain Bankers algorithm for avoidance of deadlock?

Q.7
a)Unit 4

Given memory partition of 100k, 500k, 200k, 300k and 600k in order how would each of the first fit, best fit, and worst fit algorithms place processes of 212k, 417k, 112k and 426k in order. Which algorithms make the most efficient use of memory?

b)Unit 4

Discuss the paging hardware with TLB?

Q.8
a)Unit 5

Discuss Disk scheduling algorithms?

b)Unit 2

Discuss free space management in disk, explain following term:

i) Bit vector

ii) Linked list

iii) Grouping

iv) Counting