Quiznetik

Advanced Operating System | Set 1

1. What is operating system?

Correct : D. all of the mentioned

2. To access the services of operating system, the interface is provided by the

Correct : A. system calls

3. Which one of the following is not true?

Correct : C. kernel is made of various modules which can not be loaded in running operating system

4. Which one of the following error will be handle by the operating system?

Correct : D. all of the mentioned

5. The scheme used in the above question is known as _______ or ________.

Correct : B. forwarding

6. By operating system, the resource management can be done via

Correct : C. both (a) and (b)

7. . If a process fails, most operating system write the error information to a

Correct : A. log file

8. Which facility dynamically adds probes to a running system, both in user processes and in the kernel?

Correct : A. dtrace

9. Which one of the following is not a real time operating system?

Correct : D. palm os

10. The OS X has

Correct : B. hybrid kernel

11. The systems which allows only one process execution at a time, are called

Correct : A. uniprogramming systems

12. In operating system, each process has its own

Correct : D. all of the mentioned

13. In Unix, Which system call creates the new process?

Correct : A. fork

14. A process can be terminated due to

Correct : D. all of the mentioned

15. What is the ready state of a process?

Correct : A. when process is scheduled to run after some execution

16. What is interprocess communication?

Correct : B. communication between two process

17. A set of processes is deadlock if

Correct : A. each process is blocked and will remain so forever

18. A process stack does not contain

Correct : D. pid of child process

19. Which system call returns the process identifier of a terminated child?

Correct : A. wait

20. The address of the next instruction to be executed by the current process is provided by the

Correct : B. program counter

21. The number of processes completed per unit time is known as __________.

Correct : B. throughput

22. The state of a process is defined by :

Correct : D. the current activity of the process

23. The Process Control Block is :

Correct : B. data structure

24. The entry of all the PCBs of the current processes is in :

Correct : C. process table

25. The degree of multi-programming is :

Correct : D. the number of processes in memory

26. The objective of multi-programming is to : (choose two)

Correct : D. to maximize cpu utilization

27. Which of the following do not belong to queues for processes ?

Correct : B. pcb queue

28. When the process issues an I/O request :

Correct : A. it is placed in an i/o queue

29. When a process terminates : (Choose Two)

Correct : C. its process control block is de-allocated

30. What is a long-term scheduler ?

Correct : A. it selects which process has to be brought into the ready queue

31. If all processes I/O bound, the ready queue will almost always be ______, and the Short term Scheduler will have a ______ to do.

Correct : C. empty,little

32. What is a medium-term scheduler ?

Correct : C. it selects which process to remove from memory by swapping

33. What is a short-term scheduler ?

Correct : B. it selects which process has to be executed next and allocates cpu

34. The primary distinction between the short term scheduler and the long term scheduler is :

Correct : C. the frequency of their execution

35. The only state transition that is initiated by the user process itself is :

Correct : A. block

36. In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the :

Correct : B. ready state

37. In a multi-programming environment :

Correct : C. more than one process resides in the memory

38. Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the :

Correct : B. ready state

39. An unrecoverable error is known as _________.

Correct : A. hard error

40. Which of the following need not necessarily be saved on a context switch between processes ? (GATE CS 2000)

Correct : B. translation look-aside buffer

41. Which of the following does not interrupt a running process ? (GATE CS 2001)

Correct : C. scheduler process

42. the access takes place, is called a(n) ____.

Correct : C. race condition

43. Which of the following state transitions is not possible ?

Correct : A. blocked to running

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

Correct : A. dispatcher

45. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called

Correct : B. ready queue

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

Correct : B. turnaround time

47. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

Correct : A. first-come, first-served scheduling

48. In priority scheduling algorithm

Correct : A. cpu is allocated to the process with highest priority

49. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of

Correct : B. currently running process

50. Time quantum is defined in

Correct : B. round robin scheduling algorithm

51. Process are classified into different groups in

Correct : D. multilevel queue scheduling algorithm

52. In multilevel feedback scheduling algorithm

Correct : A. a process can move to a different classified ready queue

53. Which one of the following can not be scheduled by the kernel?

Correct : B. user level thread

54. What is the reusable resource?

Correct : A. that can be used by one process at a time and is not depleted by that use

55. Which of the following condition is required for deadlock to be possible?

Correct : D. all of the mentioned

56. A system is in the safe state if

Correct : C. both (a) and (b)

57. The circular wait condition can be prevented by

Correct : A. defining a linear ordering of resource types

58. Which one of the following is the deadlock avoidance algorithm?

Correct : A. banker’s algorithm

59. What is the drawback of banker’s algorithm?

Correct : D. all of the mentioned

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

Correct : C. both (a) and (b)

61. A problem encountered in multitasking when a process is perpetually denied necessary resources is called

Correct : B. starvation

62. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

Correct : A. resource allocation graph

63. To avoid deadlock

Correct : A. there must be a fixed number of resources to allocate

64. CPU fetches the instruction from memory according to the value of

Correct : A. program counter

65. A memory buffer used to accommodate a speed differential is called

Correct : B. cache

66. Which one of the following is the address generated by CPU?

Correct : C. logical address

67. Run time mapping from virtual to physical address is done by

Correct : A. memory management unit

68. Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called

Correct : B. paging

69. The address of a page table in memory is pointed by

Correct : B. page table base register

70. Program always deals with

Correct : A. logical address

71. The page table contains

Correct : A. base address of each page in physical memory

72. What is compaction?

Correct : C. a technique for overcoming external fragmentation

73. Operating System maintains the page table for

Correct : A. each process

74. In segmentation, each address is specified by :

Correct : B. an offset

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

Correct : A. one address, page number, offset

76. Each entry in a segment table has a :

Correct : C. segment limit

77. The segment base contains the :

Correct : B. starting physical address of the segment in memory

78. The segment limit contains the :

Correct : C. segment length

79. The offset ‘d’ of the logical address must be :

Correct : B. between 0 and segment limit

80. If the offset is legal :

Correct : A. it is used as a physical memory address itself

81. When the entries in the segment tables of two different processes point to the same physical location :

Correct : C. segments are shared

82. The protection bit is 0/1 based on : (choose all that apply)

Correct : C. read – write

83. If there are 32 segments, each of size 1Kb, then the logical address should have :

Correct : A. 13 bits

84. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block ?

Correct : C. 64

85. A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because :

Correct : B. it helps to reduce the size of page table needed to implement the virtual address space of a process

86. The three general methods for delivering content from a server to a client across a network are :

Correct : D. multicasting

87. Unicasting delivers the content to :

Correct : A. a single client

88. Broadcasting delivers the content to :

Correct : B. all clients, regardless whether they want the content or not

89. Multicasting delivers the content to :

Correct : C. a group of receivers who indicate they wish to receive the content

90. RTSP stands for :

Correct : B. real time streaming protocol

91. HTTP is __________. (choose two)

Correct : D. a protocol that does not maintain the status of its connection with the client

92. In the SETUP state :

Correct : C. the server allocates resources for the client session

93. In the TEARDOWN state :

Correct : A. the server breaks down the connection and releases the resources allocated for the session

94. RTP stands for :

Correct : D. real time transport protocol

95. The problem with unicast delivery is that the :

Correct : B. server must establish a seperate unicast session for each client

96. The difficulty with multicasting from a practical point of view is : (choose all that apply)

Correct : D. the clients must be close to the server

97. To let a client have random access to a media stream :

Correct : A. the protocol used must not be stateless

98. The model in which one kernel thread is mapped to many user-level threads is called :

Correct : A. many to one model

99. The model in which one user-level thread is mapped to many kernel level threads is called :

Correct : B. one to many model

100. In the Many to One model, if a thread makes a blocking system call :

Correct : A. the entire process will be blocked