Sno

2
3
4

5
6
7

8
9
10
11
12
13
14
15
16
17

18

19
20
21

22

23
24
25
26
27
28
29
30
31

32
33
34
35
36
37
38
39

40
41

42
43
44

45

46
47
48
49
50

51

52

53

54
55
56
57
58
59
60
61

62
63
64
65

66
67
68

69
70
71

72

73

74

75
76
77

78
79

80

81
82
83

84

85

86
87
88
89

90
91
92
93
94
95
96
97
98

99
100
Questions
Address Binding is :

Binding of instructions and data to memory addresses can be done at :

The run time mapping from virtual to physical addresses is done by a hardware device called the :
Dynamic loading is :

The advantage of dynamic loading is that :

The ___________ must design and program the overlay structure.
If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execu
priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues exec
variant of swapping is sometimes called :

If binding is done at assembly or load time, then the process _____ be moved to different locations after being swapped out
The minimum number of frames to be allocated to a process is decided by the :
When a page fault occurs before an executing instruction is complete :
Consider a machine in which all memory reference instructions have only one memory address, for them we need at least _
The maximum number of frames per process is defined by :
The algorithm in which we split m frames among n processes, to give everyone an equal share, m/n frames is known as :
CPU fetches the instruction from memory according to the value of
A memory buffer used to accommodate a speed differential is called
Which one of the following is the address generated by CPU?

Run time mapping from virtual to physical address is done by

Memory management technique in which system stores and retrieves data from secondary storage for use in mai
called
The address of a page table in memory is pointed by
Program always deals with
The page table contains

What is compaction?
Operating System maintains the page table for
Physical memory is broken into fixed-sized blocks called ________
Logical memory is broken into blocks of the same size called _________
Every address generated by the CPU is divided into two parts :
The __________ is used as an index into the page table.
The _____ table contains the base address of each page in physical memory.
The size of a page is typically :
With paging there is no ________ fragmentation.
The operating system maintains a ______ table that keeps track of how many frames have been allocated, how m
there, and how many are available.
Paging increases the ______ time.
Smaller page tables are implemented as a set of _______
The page table registers should be built with _______
For larger page tables, they are kept in main memory and a __________ points to the page table.
For every process there is a __________
Time taken in memory access through PTBR is :
Each entry in a Translation lookaside buffer (TLB) consists of :

An ______ uniquely identifies processes and is used to provide address space protection for that process.
Memory protection in a paged environment is accomplished by :

When the valid – invalid bit is set to valid, it means that the associated page
Illegal addresses are trapped using the _____ bit.
When there is a large logical address space, the best way of paging would be
In a paged memory, the page hit ratio is 0.35. The required to access a page in secondary memory is equal to 100 ns. The time req
a page in primary memory is 10 ns. The average time required to access a page is
To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not loaded until it is called
implementing dynamic loading,

In paged memory systems, if the page size is increased, then the internal fragmentation generally
In segmentation, each address is specified by
In paging the user provides only ________ which is partitioned by the hardware into ________ and ______
Each entry in a segment table has a :

The segment base contains the

The segment limit contains the :

The offset ‘d’ of the logical address must be

If the offset is legal

When the entries in the segment tables of two different processes point to the same physical location
The protection bit is 0/1 based on
Data cannot be written to secondary storage unless written within a ______
File attributes consist of
The information about all files is kept in
. A file is a/an _______ data type
The operating system keeps a small table containing information about all open files called

In UNIX, the open system call returns

The open file table has a/an _______ associated with each file.
The file name is generally split into two parts :
The larger the block size, the ______ the internal fragmentation.

In the sequential access method, information in the file is processed :

Sequential access method ______ on random access devices
The direct access method is based on a ______ model of a file, as _____ allow random access to any file block.
. For a direct access file :
A relative block number is an index relative to
The index contains

For large files, when the index itself becomes too large to be kept in memory :

What is the reusable resource?

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

A system is in the safe state if

The circular wait condition can be prevented by
Which one of the following is the deadlock avoidance algorithm?

What is the drawback of banker’s algorithm?

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

To avoid deadlock

 The number of resources requested by a process :

The request and release of resources are ___________
Multithreaded programs are ___

For Mutual exclusion to prevail in the system

For a Hold and wait condition to prevail____

Deadlock prevention is a set of methods

For non sharable resources like a printer, mutual exclusion
The disadvantage of a process being allocated all its resources before beginning its execution is
What is raw disk___
When a process closes the file___

To create a new file application program calls___

Which table contains the information about each mounted volume___
A file control block contains the information about____
Management of meta information is done by___
File system fragmentation occurs when___
Which of the following explains the sequential file access method__
Mapping of network file system protocol to local file system is done by___
Mapping of file is managed by___
What is the Mounting of file system___

which file is a sequence of bytes organized into blocks understandable by the system link__
File type can be represented by____
Option1 Option2
going to an address in memory locating an address with the help of
another address
Compile time Load time
Virtual to physical mapper Memory management unit
loading multiple routines dynamically loading a routine only when it is called

A used routine is used multiple times An unused routine is never loaded

programmer system architect
priority swapping pull out, push in

can must
the amount of available physical memory operating System
the instruction must be restarted the instruction must be ignored
One Two
the amount of available physical memory operating System
proportional allocation algorithm equal allocation algorithm
program counter status register
stack pointer cache
physical address absolute address

Memory management unit CPU

fragmentation paging
stack pointer page table base register
logical address absolute address
base address of each page in physical
page offset
memory
a technique for overcoming internal
a paging technique
fragmentation
each process each thread
frames pages
frames pages
frame bit & page number page number & page offset
frame bit page number
process memory
Power of 1 power of 2
internal external

page mapping
waiting execution
queues stacks
very low speed logic very high speed logic
page table base register page table base pointer
page table copy of page table
extended by a factor of 3 extended by a factor of 2
key value
address space identifieraddress process
address space locator identifier
protection algorithm with each page restricted access rights to users

is in the TLB has data in it

error protection
not to page two level paging algorithm

3.0 ns 68.0 ns
special support from hardware is required special support from operating system is
essential

becomes less becomes more

a segment number & offset an offset & value
one address, page number, offset one offset, page number, address
segment base segment peak
starting physical address of the
starting logical address of the process segment in memory
starting physical address of the
starting logical address of the process segment in memory

greater than segment limit between 0 and segment limit

it is subtracted from the segment base
to produce the physical memory
it is used as a physical memory address itself address
the segments are invalid the processes get blocked
write only read only
file swap space
name type
swap space operating system
abstract primitive
system table open-file table
pointer to the entry in the system wide
pointer to the entry in the open file table table
file content file permission
name & identifier identifier & type
greater lesser
one disk after the other, record access doesnt
matter one record after the other
works well doesnt work well
magnetic tape, magnetic tapes tape, tapes
there are restrictions on the order of reading
and writing
the beginning of the file
names of all contents of file
index is called
that can be used by one process at a time and that can be used by more than one
is not depleted by that use
mutual exclusion
the system can allocate resources to each
process in some order and still avoid a
deadlock
defining a linear ordering of resource types
banker’s algorithm
in advance processes rarely know that how
much resource they will need
deadlock
there must be a fixed number of resources to
allocate
must always be less than the total number
of resources available in the system
command line statements
lesser prone to deadlocks
at least one resource must be held in a non
sharable mode
A process must be not be holding a resource, resource and waiting to acquire
but waiting for one to be freed, and then
request to acquire it
to ensure that at least one of the necessary
conditions cannot hold
must exist
Low CPU utilization
disk without file system
Per-process table entry is not removed
Basic file system
Mount table
File ownership
file organization module
Unused space or single file are not contiguous
Random Access according to the given byte
number
there are no restrictions on the order
of reading and writing
the end of the file
pointers to each page
an index is created for the index file
process at a time
a process may hold allocated resources
while awaiting assignment of other
resources
there exist a safe sequence
using thread
round-robin algorithm
the number of processes changes as
time progresses
starvation
resource allocation must be done only
once
must always be equal to the total
number of resources available in the
system
interrupts
more prone to deadlocks
the processor must be a uniprocessor
rather than a multiprocessor
A process must be holding at least one
additional resources that are being
held by other processes
to ensure that all of the necessary
conditions do not hold
must not exist
Low resource utilization
Empty disk
system wide entries open count is
decremented
Logical file system
System wide open file table
file permissions
Logical file system
Used space is not contiguous
Read bytes one at a time, in order
Network file system Local file system
File metadata Page table
Creating of file system Deleting a file system

Object file Source file

file name File extension
Option3 Option4
binding two addresses together to form a new address in a a mapping from one address
different memory space space to another
Execution time All of the mentioned
Memory mapping unit Memory Mass unit
loading multiple routines randomly loading multilevel routing
randomly
CPU utilization increases CPU utilization decrease
system designer system service
roll out, roll in roll up,roll down

Never May
instruction set architecture Instructions of services
the instruction must be completed ignoring the page fault Both 2 and 3
Three Four
instruction set architecture Instructions set of services
split allocation algorithm Both 1 and 3
instruction register program status word
accumulator disk buffer
logical address IP address

PCI Primary memory management

mapping Segmentations
page register program counter
physical address relative address
page size Page up
a technique for overcoming
a technique for overcoming external fragmentation
fatal error
each instruction each address
backing store Segmentation
backing store Frames
page offset & frame bit frame offset & page offset
page offset frame offset
page frame
power of 4 Power of 7
Internal and External None of these

frame memory
context – switch Context-Frame
counters registers
a large memory space Both 1 and 2
page table register pointer page table base
pointer to page table Pointer to Segment table
slowed by a factor of 3 slowed by a factor of 2
bit value constant

address process identifier None of these

restriction on page visibility protection bit with each page
is the system’s physical address
is in the process’s logical address space space
valid – invalid access
the page table itself Six level paging algorithm

68.5 ns 78.5 ns
special support from both hardware and operating system is user programs can implement
essential dynamic loading without any
special support from hardware or
operating system

remains constant Both 2 and 3

a value & segment number a key & value
page number, offset, address None of these
segment value Paging base

segment length Paging length

segment length Paging length

greater than the segment
between 0 and the segment number number

it is added to the segment base to produce the physical

memory address All of above
segments are shared Paging are shared
read – write Delete
directory text format
identifier All of the mentioned
seperate directory structure Operating service
public Private
file table directory table

a file to the process calling it All of above

open count close count
extension & name type & extension
same All of above

one text document after the other Both 1 and 3

maybe works well and doesnt work well none of these
disk, disks All of above
 access is not restricted
access is restricted permission wise permission wise
the last written position in file None of these
pointers to the various blocks pointers to each segmentation
Segment is created for the
secondary index files are created segment file

that can be shared between various threads none of these

no resource can be forcibly removed from a process holding it All of the above

all None of these

using pipes Using segmentation
elevator algorithm karn’s algorithm

resource once available can disappear All of the above

inversion aging

all deadlocked processes must be aborted inversion technique can be used

must not exceed the total number of resources available in the must exceed the total number of
system resources available in the system
system calls special programs
not at all prone to deadlocks none of the mentioned

there must be at least one resource in a sharable mode Both 2 and 3

A process must hold at least one resource and not be waiting

to acquire additional resources All of above
to decide if the requested resources for a process have to be
given or not to recover from a deadlock
may exist both 2 and 3
Very high resource utilization All of above
Disk lacking logical file system Disk having file system
All of the above None of these

file organization module None of these

Per process open file table All of the above
Location of file contents All of these
Basic file system Application programs
Unused space is non contiguous Both 2 and 3
Read or write sequentially by record Read/write Randomly by record
Volume manager Remote mirror
Virtual memory File system
Attaching portion of the file system into a directory structure removing portion of the file system
into a directory structure
Executable file Text file
File identifier None of these
Answers
4

4
2
2

2
1
3

3
3
1
2
1
2
1
2
3

2
2
1

3
1
1
2
2
2
3
2
2

3
3
4
2
1
1
4
1

2
4

3
3
2

3
4

2
1
1
1

1
3
3
1
4
3
1
2

1
3
3
1

2
1
3
2
1
3

1
1
1

4
2

3
3
2

1
1
2
1
2

2
4
4
2
1
2
1
1
3

1
2