0 ratings 0% found this document useful (0 votes) 4 views 10 pages OS
The document outlines the examination structure for a B. Tech. 4th Semester (CSE) Operating System course, including details on question types, compulsory questions, and topics covered such as memory allocation, process scheduling, deadlock, and disk scheduling algorithms. Candidates are instructed to answer five questions, selecting one from each section, with all questions carrying equal marks. Various concepts related to operating systems, such as semaphores, critical sections, and file management systems, are included in the examination content.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here .
Available Formats
Download as PDF or read online on Scribd
Go to previous items Go to next items
IROUNG. cana
3087
B. Tech. 4th Semester (CSE)
Examination — May, 2025
@ OPERATING SYSTEM
Paper : PCC-CSE-206-G
Time : Three Hours ] [ Maximum Marks : 75
Before answering the questions, candidates should ensure that they
have been supplied the correct and complete question paper. No
Complaint in this regard, will be entertained after examination.
Note: Attempt any five questions in all. Question No. 1
is compulsory, selecting one question from each
Section. All questions carry equal marks.
1. (a) What do you mean by Non-contigious memory
allocation ? 6x2.5=15
s (b) What is semaphore ?
(c) What is context switching ?
(d) What is the difference b/w Multiprograming and
Multitasking ?
3087-4150-(P-3)(Q-9)(25) P.T.O.(c) What are system calls? SECTION -D
(f) How operating system do the resource 8. What is Disk Scheduling ? Explain FCFS, Shortest seek
management ? time First, Scan C-Scan, disk algorithm by using these
requests:
-A
a (176,79, 34, 60, 92, 11, 41, 114) 18
2, What is operating system ? Explain different types of Current Head Position -50
ting stem ? 1
ae" 8 9, What is file management system ? Explain file access
3, What is Process Scheduler ? How many types f@ @ methods in detail. ic
process schedulers are in operating system ? Explain
with examples. 15
SECTION-B
4, What do you mean by deadlock ? How system could
prevent the occurence of deadlock ? 18
5, What is semaphores ? Implement read. Write problem
using semaphores. 15
SECTION -C
6. What is Paging ? Describe various page replacement @
algorithm ? 15
What is memory management ? Explain virtual
15
~
memory management in detail.
3087-4150-(-3(0-9)(25) (2) 3087-4150-(P-3)(0-9)(25) (3)3087
B. Tech (CSE) 4" Semester G-Scheme
Examination, May-2024
OPERATING SYSTEM
! Paper-PCC-CSE-206-G
Time allowed : 3 hours] _— [Maximum marks : 75
a Note ; Question No. 1 is compulsory. Attempt one question
Srom each unit.
1. Explain the following : ;
(a) What are the Minimum Conditions for deadlock
occurs ? : 2%
(b) Distributed system vs Centralized Systems. 2%
(c) _ Difference between paging and segmentation.
2%
(d) What is critical section problem? 2%
(e) Briefly define Reader's & Writer Problem. 2%
(f) What is the cause thrashing ? How does system
detect thrashing ? 2%
D : Unit-I
2. (a) Consider FCFS algorithm for three compute-bound
process. IF we have three processes P1 takes 15
seconds, P2 takes 4 seconds, P3 takes 6 seconds.
If arrive in order P1, P2, P3 what is:
(i) Turnaround time
(ii) Waiting time
(iii) Throughput 10
3087-P-3-Q-9(24) PTO.ed) 3087
(b) What is process scheduling? Explai
plain
switching in detail. ar
(a) What is an operating system and its functions»
lain the functi i
an \ctions and services of mening
0) See Explain its benefits and type,
: Unit-II 2 A
What is Deadlock? Explain various methods for :
detection, prevention, and recovery of deadlocks. 13”
(@) Whats critical section? Explain race condition
that occur in the critical section, ;
® Sempre ‘ ene
Unit-UI
Consider the following reference string : 15
1,2,3,4,2, 1.5.6, 2, 1.2,3.7,6,3,25 1,236
How many page faults will occur for :
(@ FO en
(>) LRU
Assuming 3 and 4 frames.
(@) Explainthe concept of virtual memory and how itis
obtained by demand paging and segmentation ? 10
(b) Briefly explain demand paging. 5
3087
3087
(3)
Unit-IV
Considering an ordered disk queue with requests
savolving tracks 98, 183,37, 122, 14, 124, 65, and 67-
Ifthe read/write head is intially at track 53, what is the
totat distance thatthe disk arm moves 10 satisfy all the
pending requests for FCPS and SSTF? 15
Write a short note on: 18
(i) Unix operating system
(i) Directory structure of Operating system
(ji) Disk Scheduling
(iv) Various access méthods of file system
3087Roll No, .....
3087
B. Tech. 4th Semester (CSE)
Examination - May, 2023
OPERATING SYSTEM
Paper : PCC-CSE-206-G
Time : Three hours ] [ Maximum Marks : 75
Before answering the questions, candidates should ensure that they
have been supplied the correct and complete question paper. No
complaint in this regard, will be entertained after examination.
Note: Attempt any five questions in all, selecting one
question from each Unit. Question No. 1 is
compulsory. All questions carry equal marks.
1. Explain the following briefly:
(a) Differentiate between paging and segmentation.
@ (b) Difference between process and program.
(c) What is the main purpose of system calls and
system program ?
(d) Explain process state transition diagram.
(e) Difference between contiguous and noncontiguous
memory allocation.
(f) Difference between long-term scheduler and
short-term scheduler. 2.5x6=15
3087-3400-(P-3)(Q-9)(23) FiO:2 (a)
cy
3 @)
Oy
4. (@)
©)
5. (a)
©)
UNIT -1
and
5
Difference between multiprogramming
multitasking operating system.
What is an operating system and its functions
Explain the functions and services of operating:
systems. 10
Write short notes on: Short term scheduler and
Dispatcher. 5
What do you understand by CPU Scheduling ?
What are scheduling criteria for FCFS, SJF and SRI
F? 10
UNIT —11
What is Deadlock ? Explain various methods for
detection, prevention, and recovery of deadlocks. 10
How to avoid deadlocks ? Explain Banker's
algorithm briefly.
What is Interprocess communication (IPC) ?
Explain Dinning Philosopher IPC Problem in
detail 8
What is Semaphore ? Explain counting and binary
semaphore in detail. 7
9087-3400-P-310-9}(23) (2)
a
6.
@
Explain the following, =
UNIT — It
of virtual memory and how it
Explain the concept
paging and segmentation ? 10
is obtained by demand
js Fragmentation ? Explain difference
(bo) What
etween internal and External fragmentation
briefly. >
15
Optimal Page Replacement and Least Recently
used (LRU)
@
(b) Demand Paging,
UNIT ~IV
the concept of booting from disk and bad
(a) Explain
10
block recovery in disk management.
describe various access methods of file
(b) Briefly
system. 5
(@)_ Explain architecture of Windows operating system
in detail. 7
(bo) Describe any fwvo disk scheduling algorithens with
the help of example. 8
es
'3087-3400-(P-3)(2-9)(23) (3)3087
[Link]. (CSE) 4th Semester (G-Scheme)
Examination, July-2022
OPERATING SYSTEM
Paper- PCC-(CSE-206-G)
Time allowed : 3 hours] [Maximum marks : 75
Note: Attempt any five questions in all. Question number
a 1 is compulsory. Select one question from each
gq section.
1. (a) Whatis the difference between multitasking and
multiprogramming operating system?
(b) What is critical section problem?
(c) What is a Process? Explain state transition
diagram.
(d) What is contiguous memory allocation?
(e) Whats context switching?
(f) - What is Schedular in operating system? 6x2.5=15
Section -A
2. What is operating system? Explain different types of
operating system. 15
3. What is Process Scheduling? What is the Scheduling
criteria for SRTF and Found Robin Scheduling? 15
3087-P-2-Q-9 (22) [P.T.0./
(2) 30g
Section - B
What is Semaphores? Implement Readers. Writg,,
problem using Semaphores. \ at
What is deadlock? What are the conditions to Prevent
deadlock in system? 15
Section - C
What is Paging? Describe various page replacement #
algorithm? 15
(a) What is memory management? Explain
Contiguous and Non-Contiguous memory
allocation? 8
(b) Explain Internal and External fragmentation with
example. 7
Section - D ~
What is File management system in operating system?
Explain all File access methods. 15
What is Disk scheduling? Explain FCFS, SSTF
Scan and C-Scan disk scheduling algorithm with @
example? 15
3087| 3087
B. Tech, 4th Semester (CSE)
Examination - July, 2021
OPERATING SYSTEM
i Paper : PCC-CSE-206-G
! Time : Three Hours ] [ Maximum Marks : 75
Before answering the. questions, candidates should ensure that they
have been supplied the correct and complete question paper. No
' complaint in this regard, will be entertained after examination.
Note: Attempt five questions in all, selecting one question
from each Section. Question No. 1 is compulsory.
All questions carry equal marks.
1. (a) What is the difference between multitasking and
multiprogramming operating system ?
(b) Whats critical section problem ?
(c) What is a process ? Explain state transition
‘diagram ?
i 3087-2750-(P-3)(Q-9)(21) P.T.O.SRT ATAATTS contagious memory alloc ao
(© Whatis scheduler in operating system ?
25x6=18
(©) Whatis context switching ?
SECTION- A
2 What is operating system ? Discuss the services
provided by an operating system. 16
&. What do you undeistand by CPU scheduling ? What is
scheduling criteria for FCPS, SJF, explain with
example ? 18
SECTION-B
4. What is critical section problem ? Explain IPC (Inter
Process Communication) Dining philosopher problem
‘with implementation using semaphore. 15
5. What is deadlock ? What are the necessary conditions
for a deadlock ? Explain the mechanism for deadlock
recovery. 18
SECTION-C
6. What do you mean by page replacement ? Describe
various page replacement algorithm, 18
3087-2750P-3(0-9\21) (2)
7. Wha rf Haviagement 7 Explain the concept of
SECTION-D
8. What do you understand by file system structure ?
Describe the various type‘of allocation methods. 15
9. Considering an ordered disk queue with request
involving tracks : 23, 89, 132, 42, 187, there are 200
‘cylinder (0-199), ifthe disk head is initially at track 100,
what is the total distance that the disk arm moves to
satisfy all the pending request for FCFS, SSTF, scan,
and C-Scan. 18
'9087-27504P-3)(0-9)(21) (3)