Scribd
Upload
24 views1 page

Os QP

The document outlines an internal examination for an Operating System Concepts course. It contains two sections - the first with 5 short answer questions and the second with 5 long answer questions. The questions cover topics like logical vs physical addresses, paging, processes, context switching, disk scheduling algorithms and the process control block.

Uploaded by

jNgl Circus
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views1 page

Os QP

The document outlines an internal examination for an Operating System Concepts course. It contains two sections - the first with 5 short answer questions and the second with 5 long answer questions. The questions cover topics like logical vs physical addresses, paging, processes, context switching, disk scheduling algorithms and the process control block.

Uploaded by

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

II INTERNAL EXAMINATIONS – MAY 2024

SUBJECT: Operating System Concepts CODE No.: BCACACN403


Date of Examination: 29/05/24 Semester: IV
Duration: 1½ Hours Max. Marks: 30
1. Answer any 5 questions 5x2=10
a) Define logical and physical address.
b) Define thrashing and virtual memory.
c) What is paging and Page Fault?
d) What is a process? List the four section of the process.
e) What is Context switch?
f) What is ready queue and device queue?
2. Answer any 5 questions 5x4=20
a) Explain segmentation with a neat diagram.
b) Given the following reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 with 3 frames of
memory. Write the steps of optimal and LRU algorithm which shows the occurrence of page
fault.
c) Explain Contiguous Memory Allocation
d) Explain process state transition with neat diagram.
e) Explain First Come First Serve (FCFS) and Shortest Seek Time First (SSTF) disk scheduling consider
a disk with 200 tracks and the queue has random requests from different processes in the order:
55, 58, 39, 18, 90, 160, 150, 38, 184 Initially arm is at 100. Find the Average Seek length using
FIFO, SSTF.
f) What is PCB? Explain with diagram.

II INTERNAL EXAMINATIONS – MAY 2024


SUBJECT: Operating System Concepts CODE No.: BCACACN403
Date of Examination: 29/05/24 Semester: IV
Duration: 1½ Hours Max. Marks: 30
1. Answer any 5 questions 5x2=10
a) Define logical and physical address.
b) Define thrashing and virtual memory.
c) What is paging and Page Fault?
d) What is a process? List the four section of the process.
e) What is Context switch?
f) What is ready queue and device queue?
2. Answer any 5 questions 5x4=20
a) Explain segmentation with a neat diagram.
b) Given the following reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 with 3 frames of
memory. Write the steps of optimal and LRU algorithm which shows the occurrence of page
fault.
c) Explain Contiguous Memory Allocation
d) Explain process state transition with neat diagram.
e) Explain First Come First Serve (FCFS) and Shortest Seek Time First (SSTF) disk scheduling consider
a disk with 200 tracks and the queue has random requests from different processes in the order:
55, 58, 39, 18, 90, 160, 150, 38, 184 initially arm is at 100. Find the Average Seek length using
FIFO, SSTF.
f) What is PCB? Explain with diagram

You might also like