B.Sc. (Entire Computer Science) II (Semester IV) (Old CGPA)
Examination, 2018
operating system ii (Paper
Day and Date Friday, 7-12-2018 Total Marks 70
Time 10.30 a.m. to 1.00 p.m.
Instructions Figures to the right indicate full marks.
All questions are compulsory.
1. Choose and write correct answer from given four alternatives. 14
UNIX operating system is an
Time sharing OS Multiuser OS
Multitasking OS All of these
FIFO algorithm
executes first job that last entered the queue
executes first job that first entered the queue
executes first job that has been in the queue the longest
executes first job with the least processor needs
Run time mapping from virtual to physical address is done by
Memory management unit CPU
PCI None of these
The address of a page table in memory is pointed by
stack pointer page table base register
page register program counter
In UNIX, which system call creates the new process
fork create new none of these
File name, size, type, time, date and user identification are the file

Content Attributes
Properties None of these
The is used as an index into the page table.
frame bit page number
page offset frame offset
In contiguous memory allocation, the memory is usually divided into two
partitions, one for the resident operating system and one for
System processes User processes
Ready processes None of these
begins at the root and follows a path down to the specified
file.
Relative Path Name Absolute Path Name
Standalone Path Name All of these
10) Physical memory is broken into fixed sized blocks called
Pages Frames Blocks Segments
11) allocates the largest holes available in the memory.
Best Fit Worst Fit
First Fit None of these
12) Bankers algorithm is a
Deadlock avoidance algorithm
Deadlock prevention algorithm
Deadlock detection algorithm
None of the above
13) File type can be represented by
File name File extension
File identifier None of the mentioned
14) When a deadlock occurs, the system has to be in
Safe state Unsafe state
Any one of two states None of these
2. Solve any seven of the following 14
What is demand paging
What is physical address and logical address
What is rollback
What is file
Define deadlock.
Define dynamic loading and dynamic linking.
Define safe state and unsafe state.
What is compaction
What is shell
3. Attempt any two of the following 10
Explain virtual memory.
Explain architecture of the UNIX OS.
Explain Deadlock detection technique.
Write a note on swapping. 4
4. Attempt any two of the following 14
Explain segmentation.
Explain structure of buffer header and buffer pool.
Consider the following snap shot of a system having 5 processes (P0 to
P4) and 4 resource types D.
Process Allocation M ax Available
ABCD ABCD ABCD ABCD
P0 0012 0012 1520
P1 1000 1750
P2 1354 2356
P3 0632 0652
P4 0014 0656
By using Bankers algorithm answer the following questions
What will be the content of the Need matrix
ii) Is the system in safe state
iii) If a request from process P1 arrives for can the request be
granted immediately
5. Attempt any two of the following 14
Explain process states and transitions in detail in UNIX.
Explain Directory structure.
Consider the following page reference string. 6.
How many page fault would occur for the following page replacements
algorithms ?Assuming an allocation of 3 frames LRU ii) FIFO.