B.E.

4th Semester Examination, 2006

Operating Systems
Paper code: IT-402 Time: 3 hours Branch: IT Full Marks: 100

Answer Question I and any FOUR from the rest I. There are 20 multiple-choice questions, each with ONE correct answer. Write just correct answer number (A, B, C or D) in your answer script. 2*20 = 40 1. Which of the following is false? (A) Firmware is faster than software (B) Program counter and stack pointer both are register (C) Program counter is an essential part of a computer (D) Cache memory is faster than register 2. Windows 98 is an example of (A) Multiprogramming system (B) Multiprogramming time sharing system (C) Single user single tasking system (D) None of the above 3. Which of the following statements is false? (A) A process-scheduling algorithm is preemptive if the CPU can be forcefully removed from a process (B) Time sharing systems normally use preemptive CPU scheduling (C) Response time is more predictable in preemptive scTie3uTmg~" (D) Real time system normally use non-preemptive scheduling 4. Four fobs to be executed on a single processor system arrive at time 0+ in the order A, B, C, D. Their burst CPU time are 4, 1, 8, 1 time unit respectively. The completion time of A having round robin scheduling with time slice of one time unit is (A) 10 (B)6 (C)8 (D)9 5. A counting semaphore was initialized to 10. The four P operations and six V operations were completed on this semaphore. The resulting value of the semaphore is (A)0 (B)8 (Q10 (D) 12 . . 6. Consider the following problem: Process ___________ CPU burst time PI 30ms P2 6 ms

P3

8 ms

7.

8.

9.

10.

11.

12.

The time quantum is 5 ms. Average waiting time and average turn time are (A) 15, 29.66 (B)20,30 (0)13,30 (D) 14.25,30.12 Which of the following is false? (A) UNIX uses Bankers algorithm to avoid deadlock (B) Deadlock state space is a subset of unsafe state space (C) Deadlock prevention mechanisms result in poor resource utilization (D) Existence of safe sequence indicates that the resource allocation state is safe Which of the following system calls is not directly related with file operation? (A) fork (B) creat (C) open (D) opendir Name of a file in LINUX is stored in (A) data block (B) boot block (C) super block (D) I-node block Number of instruction cycles required for TSL is (A) 1 (B)2 (C)3 (D) 4 A C program is compiled and an executable file is generated in Linux system running on an Intel x86 machine. The executable file will run in (A) any Linux based system (B) any Intel x86 chip based machine (C) only Linux system running on Intel x86 chip (D) any computer that does have a C compiler To avoid the race condition, the number of processes that may be simultaneously inside their critical section is: (A)0 (B)2

(D) none of the above 13. In virtual memory, the page fault frequency is reduced when (A) page size is reduced (B) processes are mostly unbound (C) locality of reference is applicable to the process (D) shortest remaining time scheduling is used

14. Disk requests are received by a disk drive for cylinders 5, 2, 5, 18, 3, 39, 8 and 35 in that order. A seek takes 5 ms per cycle moved. How much seek time is needed to serve these requests for a shortest seek first algorithm. Assume that the arm is as cylinder 20 when the request is being made. (A) 125 (B) 750 (C) 275 (D) none of the above 15. An operating system contains 3 user processes each requiring 2 units of resource R. What is the minimum number of units of R such that no deadlock will ever arise is (A) 4 (B)5 (C)6 (D) cannot be determined 16. A computer system supports 32-bit virtual addresses as well as 32-bit physical addresses. Since the virtual address space is of the same size as the physical address space, the operating system designers decide to get rid of the virtual memory entirely. Which of the following is true? (A) Efficient implementation of multi-user support is no longer possible (B) Hardware support for memory management is no longer needed (C) The processor cache organization can be made more efficient now (D) CPU scheduling can be made more efficient now 17. Consider three processes (process id 0, 1 , 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time 0. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF gfving pTiorityro the process with the lowest process id breaks ties. Average turn around time is (A) 13 units (B) 14 units (C) 15 units (D) 16 units 18. Virtual memory (A) is a part of main memory (B) increases the degree of multiprogramming (C) is faster than back-up memory (D) is useless 19. Consider a computing system with following specification: Total no. of resources = 12 Process Max need Current allocation P0 10 5 PI 4 2 P2 9 2 Which of the following sequence is safe? (A)<P1,P2,PO> (B)<P1,PO,P2>

,(C)<P2,P1,PO> (D) does not exist 20. MS-DOS implements file systems by (A) contiguous allocation (B) link list allocation (C) link list allocation using Index (D) I-node What is system call? How it is implemented? What are the basic states of a process? Describe the state transition diagram of a process. Write short note on PCB. 5+5+5 III. Write short notes on i. Thread ii. Critical section problem II.

15

IV.

What do you mean by file system? What are the various methods to implement file systems? Write short note on Linux file system. 15

Define Deadlock. What are the necessary conditions for the occurrence of deadlock? Consider the following snapshot of a system: . Allocation Max Available A B C D A B CD ABCD P0 0 0 1 2 0 0 1 2 15 2 0 PI 1 0 0 0 1 75 0 P2 1 3 5 4 2 35 6 P3 0 6 3 2 0 65 2 P4 0 0 1 4 0 65 6 a. What ; the content of Need! b. Is the i i a safe state? c. If the request from PI arrives for (0, 4, 2, 0), can the request be granted immediately? 15 VI. What is memory fragmentation? How the problem is solved? What do you mean by fragmentation? 15
* * ""% "* T ^

V.

VII.

What do you mean by Virtual memory management? Describe demand paging method. Write short note on Thrashing. 15