Q. In fork() system call, the return value to the parent process and to the child process are respectively __________.
Q. Consider a vertical memory system with FIFO page replacement algorithm policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will __________.
Q. The strategy that allocates the smallest possible chunk of disk space that is sufficient for a file is __________.
Q. Which of the following is not an advantage of a thread?
Q. Consider a system which has m resources of the same type. The m resources are shared among three processes A, B and C which have high demands of 3, 5, 6 respectively. For what value of m will a deadlock not occur?
Q. Consider the following page trace: 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5. What is the percentage of page faults using FIFO for 4 frames at a time in memory?
Q. What is the shortest form of inter process communication in unix?
Q. A system uses FIFO page replacement algorithm. It has 3 page frames with no pages loaded to begin with. First 50 distinct pages are accessed in some order and then it accesses same 50 pages but now in reverse order. What is the number of page faults?
Q. When a process executes the following segment of code, then the number of new processes created are?
for (i = 1; i < 10; i++)
{
fork();
}
Q. Listed below are some operating system abstractions(in left column) and the hardware components(in right column). Which matching pairs are correct?
| a. Thread | 1. Interrupt |
| b. Virtual Address Space | 2. Memory |
| c. File system | 3. CPU |
| d. Signal | 4. Disk |
|
|
|
|
|
|
|
|
Q. Starvation of longer jobs happen in which one of the following scheduling algorithm?
Q. M : 1 multi-threading model is used in which of the following operating systems?
Q. In which of the page table the logical address space is broken into multiple page tables?
Q. Cache and interleaved memories are ways of speeding up memory access between CPUs and slower RAM. Which memory models are best suited(i.e. improves performance the most) for which program?
| i. Cached memory is best suited for small loops. |
| ii. Interleaved memory is best suited for small loops. |
| iii. Interleaved memory is best suited for large loops. |
| iv. Cache Memory is best suited for large sequential code. |
Q. The correct match for the following pairs is:
| a) Disk Scheduling | 1. Round Robin |
| b) Batch Processing | 2. SCAN |
| c) Time sharing | 3. LIFO |
| d) Interrupt Processing | 4. FIFO |
|
|
|
|
|
|
|
|
