Sunbeam_Day4_OS_MCQ’s

1 Physical memory is broken into fixed-sized blocks called ________

Ans:A
2 Logical memory is broken into blocks of the same size called
_________
a) frames
b) pages
c) backing store
d) none of the mentioned

Ans:B
3 Every address generated by the CPU is divided into two parts :
a) frame bit & page number
b) page number & page offset
c) page offset & frame bit
d) frame offset & page offset

Ans:B
4 The __________ is used as an index into the page table.
a) frame bit
b) page number
c) page offset
d) frame offset
 Ans:B
5 The _____ table contains the base address of each page in physical
memory.
a) process
b) memory
c) page
d) frame

Ans:C
6 The size of a page is typically :
a) varied
b) power of 2
c) power of 4
d) none of the mentioned

Ans:B
7 With paging there is no ________ fragmentation.
a) internal
b) external
c) either type of
d) none of the mentioned

Ans:B
8 Virtual memory allows :
a) execution of a process that may not be completely in memory
 b) a program to be smaller than the physical memory
c) a program to be larger than the secondary storage
d) execution of a process without being in physical memory

Ans:A
9 Virtual memory is normally implemented by ________
a) demand paging
b) buses
c) virtualization
d) all of the mentioned

Ans:A
10 The valid – invalid bit, in this case, when valid indicates :
a) the page is not legal
b) the page is illegal
c) the page is in memory
d) the page is not in memory

Ans:C
11 A page fault occurs when :
a) a page gives inconsistent data
b) a page cannot be accessed due to its absence from memory
c) a page is invisible
d) all of the mentioned

Ans:B
12 In segmentation, each address is specified by :
a) a segment number & offset
 b) an offset & value
c) a value & segment number
d) a key & value

Ans:A
13 In paging the user provides only ________ which is partitioned by
the hardware into ________ and ______
a) one address, page number, offset
b) one offset, page number, address
c) page number, offset, address
d) none of the mentioned

Ans:A

14 Each entry in a segment table has a :

Ans:A
15 The segment base contains the :
a) starting logical address of the process
b) starting physical address of the segment in memory
c) segment length
d) none of the mentioned
 Ans:B
16 The segment limit contains the :
a) starting logical address of the process
b) starting physical address of the segment in memory
c) segment length
d) none of the mentioned

Ans:C
17 _____ is the concept in which a process is copied into main
memory from the secondary memory according to the
requirement.
a) Paging
b) Demand paging
c) Segmentation
d) Swapping

Ans:B
18 A process is thrashing if
a) it is spending more time paging than executing
b) it is spending less time paging than executing
c) page fault occurs
d) swapping can not take place
 Ans:A
19 The three major methods of allocating disk space that are in wide
use are :
a) contiguous
b) linked
c) indexed
d) all of the mentioned

Ans:D
20 In contiguous allocation :
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

Ans:A
21 In linked allocation :
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
 Ans:B
22 In indexed allocation :
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

Ans:C
23 Contiguous allocation of a file is defined by :
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

Ans:A
24 _______ and ________ are the most common strategies used to
select a free hole from the set of available holes.
a) First fit, Best fit
b) Worst fit, First fit
c) Best fit, Worst fit
d) None of the mentioned
 Ans:A
25 For each file there exists a ___________ that contains information
about the file, including ownership, permissions and location of the
file contents.
a) metadata
b) file control block
c) process control block
d) all of the mentioned

Ans:B
26 Metadata includes :
a) all of the file system structure
b) contents of files
c) both file system structure and contents of files
d) none of the mentioned

Ans:C
27 In the linked allocation, the directory contains a pointer to the :
I. first block
II. last block
a) I only
b) II only
c) Both I and II
 d) Neither I nor II

Ans:C
28 There is no __________ with linked allocation.
a) internal fragmentation
b) external fragmentation
c) starvation
d) all of the mentioned

Ans:B
29 The major disadvantage with linked allocation is that :
a) internal fragmentation
b) external fragmentation
c) there is no sequential access
d) there is only sequential access

Ans:D
30 Contiguous allocation has two problems _________ and _________
that linked allocation solves.
a) external – fragmentation & size – declaration
b) internal – fragmentation & external – fragmentation
c) size – declaration & internal – fragmentation
d) memory – allocation & size – declaration
 Ans:A
31 Each _______ has its own index block.
a) partition
b) address
c) file
d) all of the mentioned

Ans:C
32 Indexed allocation _________ direct access.
a) supports
b) does not support
c) is not related to
d) none of the mentioned

Ans:A
33 A memory page containing a heavily used variable that was
initialized very early and is in constant use is removed, then the
page replacement algorithm used is :
a) LRU
b) LFU
c) FIFO
d) None of the mentioned
 Ans:C
34 The aim of creating page replacement algorithms is to :
a) replace pages faster
b) increase the page fault rate
c) decrease the page fault rate
d) to allocate multiple pages to processes

Ans:C
35 A FIFO replacement algorithm associates with each page the
_______
a) time it was brought into memory
b) size of the page in memory
c) page after and before it
d) all of the mentioned

Ans:A

36 Optimal page – replacement algorithm is :

Ans:C
37 Optimal page – replacement algorithm is difficult to implement,
 because :
a) it requires a lot of information
b) it requires future knowledge of the reference string
c) it is too complex
d) it is extremely expensive

Ans:B
38 In the ______ algorithm, the disk arm starts at one end of the disk
and moves toward the other end, servicing requests till the other
end of the disk. At the other end, the direction is reversed and
servicing continues.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK

Ans:B
39 In the _______ algorithm, the disk head moves from one end to
the other , servicing requests along the way. When the head
reaches the other end, it immediately returns to the beginning of
the disk without servicing any requests on the return trip.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
 Ans:C
40 In the ______ algorithm, the disk arm goes as far as the final
request in each direction, then reverses direction immediately
without going to the end of the disk.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK

Ans:A