STUPIDSID
Short Questions
1(a)
The operating system is the interface between _______ and _______ .
1 M
1(b)
Two basic functions of operating system are _______, _______ .
1 M
1(c)
Draw structure of THE operating system.
1 M
1(d)
A system call to create a child process is _______ .
1 M
1(e)
A process running in background is called _______ .
1 M
1(f)
Define: Race Condition and Mutual Exclusion.
1 M
1(g)
Explain GREP command of Linux OS.
1 M
1(h)
Define fragmentation.
1 M
1(i)
Define Deadlock.
1 M
1(j)
State the four conditions which must occur to have deadlock in the system.
1 M
1(k)
Define Hard link and Symbolic link.
1 M
1(l)
Define Physical dump and Incremental dump.
1 M
1(m)
List the different filters that are used in Linux programming.
1 M
1(n)
How files are protected in UNIX/LINUX file system?
1 M
2(a)
State different types of operating system. Explain any one of them.
3 M
2(b)
Draw process state diagram. Explain each transition among them in detail.
4 M
Solve any one question from Q.2(c) & Q.2(d)
2(c)
Explain producer-consumer problem and solve it using semaphore. Write pseudo code for the same.
7 M
2(d)
What is Mutex? Write a pseudo code to achieve mutual exclusion using mutex.
7 M
Solve any three question from Q.3(a), Q.3(b), Q.3(c) & Q.3(d), Q.3(e), Q.3(f)
3(a)
List the four events that cause processes to be created. Explain each in brief.
3 M
3(b)
Consider a soft real time system with three periodic events, with periods of 100, 200 and 500 msec respectively. If these events require 50, 30 and 100 msec, will the system be schedulable?
4 M
3(c)
Following table gives arrival time and expected run time of five processes.
Ignore process switching overhead. Find average turnaround time for following scheduling algorithm.
1. Round robin (quantum = 1 sec)
2. Shortest Job First.
| Process |
Expected Run time (in sec.) |
Arrival Time (in sec.) |
| A | 8 | 1 |
| B | 1 | 4 |
| C | 2 | 2 |
| D | 1 | 5 |
| E | 5 | 6 |
Ignore process switching overhead. Find average turnaround time for following scheduling algorithm.
1. Round robin (quantum = 1 sec)
2. Shortest Job First.
7 M
3(d)
Explain monolithic operating system structure.
3 M
3(e)
How TSL instruction can be used to achieve mutual exclusion? Explain with proper pseudocode.
4 M
3(f)
If FIFO page replacement algorithm is used with 4 page frames and 8 pages, how many page faults will occur with reference string 0124720347 if four page frames are initially empty? Solve the same problem for LRU page replacement algorithm.
7 M
Solve any three question from Q.4(a), Q.4(b), Q.4(c) & Q.4(d), Q.4(e), Q.4(f)
4(a)
Which algorithms are used to allocate memory for a newly created process or any existing process being swapped in from disk?
3 M
4(b)
How deadlock can be prevented? Explain any two ways of doing deadlock prevention.
4 M
4(c)
Explain thread implementation in user space with its advantages and disadvantages.
7 M
4(d)
What is called TLB? How does it help to speed up paging?
3 M
4(e)
Explain Bankers' algorithm to avoid deadlock.
4 M
4(f)
Explain the structure of a page table entry. If a machine has 48 bit virtual addresses and 32-bit physical addresses and pages are of 8 KB, how many entries are needed for the page table?
7 M
Solve any three question from Q.5(a), Q.5(b), Q.5(c) & Q.5(d), Q.5(e), Q.5(f)
5(a)
What is called segmentation? How it differs from paging?
3 M
5(b)
What is called device driver? Explain its function in brief.
4 M
5(c)
List the different file implementation methods and explain them in detail.
7 M
5(d)
What is RAID? Explain in brief.
3 M
5(e)
What is I-node? Explain in detail.
4 M
5(f)
Disk requests come in to the disk driver for cylinders 10, 22, 20, 2, 40, 6, and 38, in that order. A seek takes 6 msec per cylinder moved. How much seek time is needed for
1. First-come, first served
2. Elevator algorithm. (initially moving upward)
In all cases, the arm is initially at cylinder 20.
1. First-come, first served
2. Elevator algorithm. (initially moving upward)
In all cases, the arm is initially at cylinder 20.
7 M
More question papers from Operating System