Os Question Bank Objective Questions

Choose the correct alternative.

1 A monitor in operating systems is mainly used for: [ C]

a)Interrupt handling
b) Process scheduling
c) Synchronization and mutual exclusion
d) Memory allocation

A pipe allows communication between: [B ]

2 a) Any two processes on different machines

b) Only processes that have a parent–child relationship
c) Two threads of the same process only
d) Hardware devices.

3 Message queues provide: [B ]

a) Unstructured data transfer

b) FIFO or priority-based message delivery
c) Only semaphore-based signaling
d) Memory sharing between processes

4 The function used to create a shared memory segment in UNIX is: [A ]

a) shmget()
b) fork()
c) pipe()

d)msgget()

5 Which system call creates a message queue? [A ]

a)msgget()
b)msgsnd()
c)msgrcv()
d)msgctl()

6 Memory management technique in which system stores and retrieves [B ]

data from secondary storage for use in main memory is called?

a)fragmentationb)paging c)mapping d)noneofthementioned

7 Which algorithm chooses the page that has not been used for the [C ]
longest period of time whenever the page required to be replaced?
a) first in first out algorithm
b) additional reference bit algorithm
 c) least recently used algorithm
d) counting based page replacement algorithm

8 The page table contains ____________ [A ]

a) base address of each page in physical memory
b) page offset
c) page size
d) none of the mentioned

9 The relocation register helps in ____________ [C ]

a) providing more address space to processes
b) a different address space to processes
c) to protect the address spaces of processes
d) none of the mentioned

10 With relocation and limit registers, each logical address must be _______ [A ]
the limit register.
a) less than
b) equal to
c) greater than
d) none of the mentioned

11 When memory is divided into several fixed sized partitions, each [A ]

partition may contain ________
a) exactly one process
b) at least one process
c) multiple processes at once
d) none of the mentioned

12 The first fit, best fit and worst fit are strategies to select a ______ [C ]
a) process from a queue to put in memory
b) processor to run the next process
c) free hole from a set of available holes
d) all of the mentioned

13 What is the correct way the segmentation program address is stored? [A]
a) name, offset
b) start, stop
c) access, rights
d) offset, rights

14 In contiguous memory allocation ____________ [ A]

a) each process is contained in a single contiguous section of memory
b) all processes are contained in a single contiguous section of memory
c) the memory space is contiguous
d) none of the mentioned

15 Which one of the following is the address generated by CPU? [ [ C]

]
 a) physical address b)absolute address c)logical address

d)none of the mentioned

16 File type can be represented by ____________ [B ]

a) file name b) file extension c) file identifier d) none of the
mentioned

17 Swapping requires a [ ] [D ]

a) Motherboard b) keyboard c) monitor d) backing store

18 What will happen in the single level directory? [B ]

a) All files are contained in different directories all at the same level

b) All files are contained in the same directory

c) Depends on the operating system

d) None of the mentioned

19 The information about all files is kept in ____________ [C ]

a) swap space b) operating system c) Separate directory structure

d) none of the mentioned

20 In the tree structured directories [ ] [D]

a) the tree has the stem directory

b) the tree has the leaf directory

c) the tree has the root directory

d) all of the mentioned

21 File attributes consist of ____________ [D ]

a) name b) type c) identifier d) all of the mentioned

22 A file is a/an _______ data type. [A ]

a) abstract b) primitive c) public d) private

23 In contiguous allocation _____________ [D ]

a) each file must occupy a set of contiguous blocks on the disk
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed together in one location
d) none of the mentioned

24 The three major methods of allocating disk space that are in wide use are [ D]
_____________
a) contiguous b) linked c) indexed d) all of the mentioned

25 Contiguous allocation of a file is defined by _____________ [A]

a) disk address of the first block & length
b) length & size of the block
 c) size of the block
d) total size of the file

II Fill in the blanks:

1. Pipes are _unidirectional__byte streams which connects the standard output to

input.

2. The link between two processes P and Q to send and receive messages is called
Communication link

3. Inter Process Communication is involved in Process Communication &

Synchronization

4. Operating System maintains the page table for Each Process_

5. Inter Process Communication provides __Data Sharing

6. A solution to the problem of external fragmentation is _Paging_

7. Logical memory is broken into fixed –size blocks called ___Pages__

8. The __Page number___is used as an index into the page table.

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

Management Unit( MMU)_

10. The requested page is not present in main memory it is called as ___Page Fault___

11. In internal fragmentation, memory is internal to a partition and __Within the

Partition_____

12. In segmentation, each address is specified by __Segment number & Offset____

13. Each entry in a segment table has a _Base & Limit_

14. Physical memory is broken into fixed-size blocks called ____Frames______

15. Because of virtual memory, the memory can be shared among __Processes__

16. _External Fragmentation difficulty of contiguous allocation.

17. In the sequential access method, information in the file is processed_In a Fixed
Order___.

18. For non sharable resources like a printer, mutual exclusion_Must be Enforced___.

19. Contiguous allocation has two problems _External

fragmentation_and _Compaction__ that linked allocation solves.

20. Indexed allocation _Supports_direct access.

21. Consider a disk where blocks 2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 17, 18, 25, 26 and 27 are
free and the rest of the blocks are allocated. Then the free space bitmap would be
__00111101111110011001111000111 (1 = free, 0 = allocated)

22. The directory can be viewed as a symbol table that translates file names into their
_identifiers (I nodes )__.

23. The current directory contains, most of the files that are_Frequently used__.

24. Some directory information is kept in main memory or cache to __Improve

Performance_.

25. When an entire committed transaction is completed, _it is Committed__.