1. The integer value of ______semaphores can not be greater than 1.

Binary
2. A______ system collects physically separate . . . . .system maintains

Distributed

3. Wait and signal operations of semaphores were originally termed_____

P and V respectively
4. The total size of_____ in a system is equal to the size of its main memory

Physical address space

5. ______holds the smallest legal physical memory address for a process

Base register

6. Physical memory is broken into fixed-sized blocks, called _____

Frames, pages

7. When a_____ link is created, a directory entry for the existing file is
created

Hard

8. In each file is a linked list of disk blocks blocks may be scattered

anywhere on the disk
Linked Allocation
9. Shared libraries and kernel modules are stored in________ directory

/lib

10. Following is not the classical problem of synchronization

Counting Semaphore problem

11. The________ requires that no reader will be kept
First readers- writers problem

12. The problem of Deadlocks can be solved by_____ methods

Deadlock prevention, Deadlock avoidance, Allowing deadlock and

recovery

13. A process is _________if it is spending more time on paging

Thrashing

14. In______ page replacement algorithm oldest frame is replaced with

another
FIFO
15.The most important property of the working set is its__________

Size

16. Secondary storage memory devices have _________memory

Non-volatile

17._____ is caused due to un-send space in physical memory

Internal fragmentation

18. The size of a page is defined by_______

CPU

19. For some page replacement algorithms, the page fault rate may
increase . . . . increases
20. In the scan algorithm the disk________ starts at one end of the disk

Arm

21. In paged segmentation, we divide every segment in a process into ___

Fixed size

22. In paged segmentation, the logical address is legal if d is __________

Less than

23. Time from submission to completion of process is called __________

Turnaround time
24. In a case of a multi- processor environment, to ensure the atomic
Both lock the data bus and use a soft solution
25. In_______ frame allocation scheme free frames are equally divided

Fixed
26. In s command is used to create a _________ link

Soft
27. __________ automatically holds for printers and other non- sharables

Mutual exclusion
28. The main disadvantage of semaphore is__________
Busy waiting
29. Keeps in memory only those instructions and data that are needed at
any given time
Overlays

30. Is/are a memory management scheme that supports programmer view

of memory.
Segmentation
31. ________ is the time for the disk arm to move the head to the cylinder
containing the desired sector

Seek time

32. _____are used for communication between related or unrelated

processes on a UNIX/Linux system
Named pipe ( FIFO)

33. Java virtual machine executes programs that have been translated into

Java bytecode

34. What is different in parent and child processes

Process ID

35. Shell is the exclusive feature of

Unix

36. Round robin is very good for____ where response is an important issue
Time sharing system

37. _______ is a high speed cache used to hold recently referenced page
table entries a part of paged virtual memory

Translation Look aside buffer

38. The mechanism that brings a page into memory only when it is needed
is called
Demand paging
39. _________ happens when a dynamic memory allocation allocates some
memory and a small piece is left
Segmentation
40. Variable names are__________ addresses
Symbolic

41. The set of all logical addresses generated by a program form the
physical address space of a process

42. is created by the system when a symbolic link is created to an existing

file, allowing you to rename the existing file and share it without
duplicating its contents without

Link File

43. The _____ algorithm selects the request with the minimum seek time
from the current head position.
SSTF

44. In____________, the library files are linked at load time

Static linking

45. A set of processes are said to be in a ______ state if every process is

waiting for an event that can be caused only by another process in the
set
Dead Lock
46. Which command displays permissions and some other attributes for
prog1.c in your current directory
Is -l prog1.c

47. system call is used to open or create a file.

Open ()
48. Is the name of the technique that is designed to get rid of deadlocks by
changing the specifications of the system
Deadlock avoidance
49. Linux is a version of
UNIX

50. Semaphore can be used for solving

Wait and signal

51.Thrashing decreases the degree of multiprogramming

52. In memory management, a technique called as paging, physical memory

is broken into fixed-sized blocks called

Frames

53. Where does the swap space reside

Disk

54. ________ happens when a dynamic memory allocation

Internal Fragmentation

55. Which of the following statements is true for the Bankers algorithm
It is used to detect deadlock

56. A computer system that allows only one user to use the computer at a
given time is known as a single-user system.

57. You can terminate a foreground process by pressing

<Ctrl -C >

58. The priorities of processes in the _________________

 Kernel, User

59. Processes may want only to read the content of the shared object
Readers

60. An arrow from resource to process shows an instance of the resource

has been _________ to the process
Allocated

61. What do we name to an address that is generated by the CPU

Logical address

62. The set of all physical addresses corresponding to the logical

Physical address space

63. The run time mapping from virtual to physical addresses is done by a
piece of hardware
MMU
64. A page table needed for keeping track of pages of the page table

Page directory
65. Each page is a power of _______ bytes long in paging scheme.
4
66. is based on the locality of reference concept the least frequently used
page
Least frequently Used algorithm
67. In the _________ algorithm the disk arm starts at one end of the disk,
and moves toward the other end
 SCAN

68. In Linux directory structure, there is _________ root directory

1

69. The integer value of ____________ semaphores can not be greater than
1
Binary

70. The next layer above the hardware layer in the layered approach
Kernel

71. Priority of process is_______________ to the priority number of the

process
Greater
72. is the operating system’s attempt to improve the computer system’s
utilization and throughput.
Demand paging

73. States that as a process executes it moves from locality to locality

Locality of Reference

74. ______ is a way to establish a connection between file to be shared and

the
Link

75. A parent process calling _________ system call will be suspended until
children process terminates
wait
76. Only one process may use a resource at a time
Hold and wait

77. A page fault occurs

When the process enters the blocked state

78. Occurs in a dynamic memory allocation system when many of the free
blocks are too small to
Fragmentation

79. 1 kb is equivalent to
1024 bytes

80. A _________ is a region of code where shared resources are accessed

Critical region

81. __________ enable processes to communicate with each other

FIFO

82. When a __ link is created, a directory entry for the existing file is
created
Hard
83. In _______________, each file is a linked list of disk blocks
Linked allocation
84. The bottom layer in the layered approach of Operating system is
Hardware
85. Preemptive scheme of short job first scheduling is known as ________
Priority Scheduling

86. You can suspend a foreground process by pressing

<Ctrl Z>

87. Command line interpreter is often known as the

Shell

88. Where does the swap space reside

RAM

89. a binary semaphore

has the values one or zero

90. is used to point to the size of a process

Limit register

91. _____ Waste cpu cycles and hence a problem in real

Busy waiting

92. ______ commands in Linux is used to copy file

Cp
93. __ states that as a process executes it moves from locality to locality
Locality of Reference
94. A set of processes are said to be in a state if every process is waiting for
an event that can be caused only by another process in the set
Deadlock
95. Which one of the following is the correct syntax to copy file 1 to file 2
Cp file1/file2

96. ______ is a high speed cache used to hold recently referenced page tab
Translation look aside buffer

97. _____ is the process of mapping a name to an address

Addressing

98. _____brings all the pointers to the block together into a disk block
Index allocation