Quality checking for unit test-1 Question paper
Name of subject: Operating System Class- TYCW Name of Faculty:- Mrs. S .K .Beladar
Suggested Specification Table For question paper Design of 70 Marks
Levels from Cognition Process
Chapter Total
Unit Name Dimension
No. Marks
R Level U Level A Level
1 Operating System services and components 2 4 8 14
2 Process Management 4 4 6 14
3 CPU Scheduling 2 6 8 16
4 Memory Management 2 6 8 14
5 File Management 2 4 4 12
Total 12 30 30 70
specification Table for setting Internal Unit test paper of 20 Marks
Unit Numbers : 3,4,4 Total Marks : 36
Common Factor = 42/42= 1
Levels from Cognition Process
Chapte Total
Unit Name Dimension
r No. Marks
R Level U Level A Level
3 CPU Scheduling 2 6 8 16
4 Memory Management 2 6 8 16
5 File Management 2 4 4 10
Total 6 16 20 42
Question paper format for quality checking
Level Q1 Attempt any Five 10
.
1R A Define virtual memory 02
2R B Define following terms: 02
i)Segmentation ii) Fragmentation
2R C List any four scheduling criteria. 02
3R D List any four scheduling criteria. 02
3U E List any four file operations. 02
3U F Define 1) Swapping 2) Compaction 02
G
Level Q. Attempt any FIVE 20
2
1U A Describe Single level and two-level directory structure. 04
3A B Given a page reference string with (03) pages frames. Calculate the page faults with 04
“Optimal” and “LRU” page replacement algorithm respectively. 7, 0, 1, 2, 0, 3, 0, 4, 2, 3,
0, 3, 2, 1, 2, 0, 1, 7
2A C Describe conditions for deadlock prevention. 04
2U D Explain variable partitioning technique of memory management with suitable example. 04
2A E List free space management techniques with neat diagram explain anyone in detail. 04
3A F Explain Bankers algorithm with example. 04
DKTE SOCIETY’S
YASHWANTRAO CHAVAN POLYTECHNIC, ICHALKARANJI
UNIT TEST- 1I
Course Name: OSY Course Code: 315319
CLASS: TY CW TIME: 1.5 Hrs.
SEMESTER: V MARKS: 30
DATE: 14/10/2025
C301.3 Implement various CPU Scheduling algorithms and evaluate their effectiveness.
C302.4 Analyze the Memory Management techniques used by an Operating System.
C303.5 Apply techniques for effective File Management in an Operating System.
Q.1 Q.2
Q.N
a. b. c. d. e. f. g. a. b. c. d. e. f. g.
Marks 2 4
CO C301. C301. C301. C301.
C301.4 C301.4 C301.3 C301.5 C301.4 C301.3 C301.5 C301.4 C301.3 C301.3
3 5 4 4
Level R R R R R U U A A A U U A A
Instructions: 1. All questions are compulsory. 2. Illustrate your answer with neat sketches wherever necessary.
3. Figure to right indicate full marks.4. Assume suitable data if necessary.
Q1. Attempt any Five Marks: 10
A. Define virtual memory
B. Define: I) Segmentation II) Fragmentation
C. Explain the term Demand Paging.
D. List any four file operations.
E. Define 1) Swapping 2) Compaction
F. Compare best fit, worst fit, first fit
G. Define deadlock with diagram.
Q.2 Attempt any Five Marks: 20
A. Describe Single level and two-level directory structure.
B. Given a page reference string with (03) pages frames. Calculate the page faults with “Optimal” and
“LRU” page replacement algorithm respectively. 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7
C. Describe conditions for deadlock prevention.
D. Explain variable partitioning technique of memory management with suitable example.
E. List free space management techniques with neat diagram explain anyone in detail.
F. Explain Bankers algorithm with example.
G. What is the average turnaround time for the following process using?
i) FCFS scheduling algorithm
ii) SJF non-preemptive scheduling algorithm
iii) Round Robin Scheduling algorithm. (Time Quantum = 2ms)
Process Arrival time Burst time
P1 0 10
P2 1 4
P3 2 9
P4 3 6