Operating System Online Test

1. Which two of the following are authentication algorithms?

2. An absolute path name begins at the _____________

3. Progressive download is most useful for ___________

4. What is Response time?

5. A mount operation includes the _____________

6. Broadcasting delivers the content to ___________

7. The mount request is mapped to the corresponding __________ and is forwarded to the mount server running on the specific server machine.

8. What is the host controller?

9. Thread pools are useful when ____________

10. In the Many to Many models when a thread performs a blocking system call ___________

11. The ___________ swaps processes in and out of the memory.

12. A process _____ lower the priority of another process if both are owned by the same owner.

13. The amount of memory in a real time system is generally ____________

14. What are characteristic of a DFS?

15. A set of processes is deadlock if __________

16. What are the levels in QoS?

17. The Zero Capacity queue __________

18. Cancelling a thread asynchronously ____________

19. Which module gives control of the CPU to the process selected by the short-term scheduler?

20. A binary semaphore is a semaphore with integer values ____________

21. The surface area of tape is ________ the surface area of a disk.

22. CineBlitz multimedia server supports ___________

23. Consider the following page reference string.
1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6
For FIFO page replacement algorithms with 3 frames, the number of page faults is?

24. A file control block contains the information about ____________

25. The interval from the time of submission of a process to the time of completion is termed as ____________

26. Which is not an example of state information?

27. The hardware mechanism that allows a device to notify the CPU is called _______

28. The series of accesses between the open and close operations is a _____________

29. Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.

30. Optical disks ______ magnetism.

31. A typical tape drive is ________ a typical disk drive.

32. The level that treats different types of traffics in different ways, giving certain traffic streams higher priority than other streams and with best efforts, but no guarantees are made ___________

33. Concurrent access to shared data may result in ____________

34. There is no __________ with linked allocation.

35. The backing store is generally a ____________

36. What are the characteristics of the Hydra system?

37. Management of metadata information is done by ____________

38. A process can never be sure that a signal it has sent _____________

39. RAID level ________ refers to disk arrays with striping at the level of blocks, but without any redundancy.

40. Sometimes the overhead of keeping track of a hole might be ____________

41. The child process can __________

42. Signals that occur at the same time, are presented to the process ____________

43. A state is safe, if ____________

44. The technique in which the CPU generates physical addresses directly is known as ____________

45. In paging the user provides only ________ which is partitioned by the hardware into ________ and ______

46. Which file is a sequence of bytes organized into blocks understandable by the system's linker?

47. What is a common problem found in distributed system?

48. Which layer lies between the transport layer and data link layer?

49. An SJF algorithm is simply a priority algorithm where the priority is ____________

50. For an effective operating system, when to check for deadlock?