Operating System Online Test

1. A process can enter into its critical section ____________

2. In a system that does not support swapping ____________

3. A process is thrashing if ____________

4. A program is generally composed of several different localities, which _____ overlap.

5. Disks are segmented into one or more partitions, each containing a file system or ______

6. If a process is executing in its critical section, then no other processes can be executing in their critical section. What is this condition called?

7. The idea of overlays is to ____________

8. If the swap space is simply a large file, within the file system, ____________ used to create it, name it and allocate its space.

9. There are two processes P1 and P2, whose periods are 50 and 100 respectively. P1 is assigned higher priority than P2. The processing times are t1 = 20 for P1 and t2 = 35 for P2. Is it possible to schedule these tasks so that each meets its deadline using Rate monotonic scheduling?

10. What are the different ways in which clients and servers are dispersed across machines?

11. Lossy and lossless are classifications of ___________

12. RAID stands for ____________

13. Deadlock prevention is a set of methods ____________

14. An asynchronous call ____________

15. In which type of allocation method each file occupy a set of contiguous block on the disk?

16. Indexed allocation _________ direct access.

17. Multicasting delivers the content to ___________

18. Working set model for page replacement is based on the assumption of ____________

19. The phase change disk is coated with a material that can freeze into either _______ or ________ state.

20. Scheduling is done so as to ____________

21. Standard set of functions through which interacts with kernel is defined by ___________

22. 'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum of all their maximum needs is always less than m+n. In this setup, deadlock ____________

23. Swapping _______ be done when a process has pending I/O, or has to execute I/O operations only into operating system buffers.

24. RAID level _____ is also known as block interleaved parity organisation and uses block level striping and keeps a parity block on a separate disk.

25. The characteristic of the eye to retain the image for a short time after it has been presented is known as ___________

26. What if a pointer is lost or damaged in a linked allocation?

27. What is a valid network topology?

28. On systems where there are multiple operating system, the decision to load a particular one is done by _____________

29. A single swap space ______ reside in two places.

30. The segment base contains the ____________

31. What are the different ways to classify an IDS?

32. Mutual exclusion implies that ____________

33. If a process does not call exec after forking ____________

34. What is an operating system?

35. Which direction access cannot happen using DMZ zone by default?

36. Memory management units ____________

37. A non blocking system call _________________

38. The __________ is used as an index into the page table.

39. The algorithm in which we split m frames among n processes, to give everyone an equal share, m/n frames is known as ____________

40. The only state transition that is initiated by the user process itself is __________

41. The context of a process in the PCB of a process does not contain __________

42. Which of the following page replacement algorithms suffers from Belady's Anomaly?

43. Which of the following scheduling algorithms gives minimum average waiting time?

44. What are the connection strategies not used in distributed systems?

45. If one site fails in distributed system then ___________

46. Restricting the child process to a subset of the parent’s resources prevents any process from __________

47. The pager concerns with the ____________

48. When we write something on the disk, which one of the following can not happen?

49. Which of the following statements are true? (GATE 2010)

I. Shortest remaining time first scheduling may cause starvation
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time

50. In linked allocation _____________