Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

C191 Operating Systems for Programmers > Quiz Sail Part 3 > Flashcards

Quiz Sail Part 3 Flashcards

1
Q

A relative path name begins at the:
A: root
B: stem
C: current directory
D: leaf

A

C: current directory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

A block device transfers:
A: block of bytes as a unit
B: bytes one by one
C: with unpredictable response times
D: none of the mentioned

A

A: block of bytes as a unit

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

The address of a page table in memory is pointed by:
A: page register
B: program counter
C: page table base register
D: stack pointer

A

C: page table base register

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

A character stream device transfers:
A: bytes one by one
B: none of the mentioned
C: with unpredictable response times
D: block of bytes as a unit

A

A: bytes one by one

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

The heads of the magnetic disk are attached to a –?– that moves all the heads as a unit.
A: disk arm
B: spindle
C: none of the mentioned
D: track

A

A: disk arm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What are zombie systems?
A: These systems are previously compromised, independent systems
B: None of the mentioned
C: They are network of known hacking group
D: Are specific system which are designed to attack by manufacturer

A

A: These systems are previously compromised, independent systems

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

If the thread pool contains no available thread:
A: the server goes to another thread pool
B: the server runs a new process
C: the server waits until one becomes free
D: the server demands for a new pool creation

A

C: the server waits until one becomes free

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Managing a disk directory is a key function of the:
A: command processor
B: boot routine
C: file system
D: IOCS

A

C: file system

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

A deadlock free solution to the dining philosophers problem:
A: none of the mentioned
B: does not necessarily eliminate the possibility of starvation
C: eliminates any possibility of any kind of problem further
D: necessarily eliminates the possibility of starvation

A

B: does not necessarily eliminate the possibility of starvation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

In the two level directory structure:
A: each user has his/her own user file directory
B: none of the mentioned
C: the system doesn’t its own master file directory
D: all of the mentioned

A

A: each user has his/her own user file directory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Temporary storage called –?– can be used to adjust for the speed disparity between devices.
A: a control unit
B: a channel
C: a buffer
D: an interface

A

C: a buffer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

The run time mapping from virtual to physical addresses is done by a hardware device called the:
A: Virtual to physical mapper
B: Memory management unit
C: None of the mentioned
D: Memory mapping unit

A

B: Memory management unit

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

A –?– is a set of wires and a rigidly defined protocol that specifies a set of messages that can be sent on the wires.
A: node
B: bus
C: port
D: none of the mentioned

A

B: bus

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is Trojan horse?
A: It is a user which steals valuable information
B: It is a rogue program which tricks users
C: It’s a brute force attack algorithm
D: It is a useful way to encrypt password

A

B: It is a rogue program which tricks users

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

The only state transition that is initiated by the user process itself is:
A: wakeup
B: block
C: none of the mentioned
D: dispatch

A

B: block

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

A machine in Network file system (NFS) can be:
A: neither client nor server
B: both client and server
C: client
D: server

A

B: both client and server

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Multithreading an interactive program will increase responsiveness to the user by:
A: none of the mentioned
B: asking the user to decide the order of multithreading
C: waiting for one part to finish before the other begins
D: continuing to run even if a part of it is blocked

A

D: continuing to run even if a part of it is blocked

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called:
A: race condition
B: essential condition
C: dynamic condition
D: critical condition

A

A: race condition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

For processes to request access to file contents, they need to:
A: they need to run a seperate program
B: none of the mentioned
C: implement the open and close system calls
D: they need special interrupts

A

C: implement the open and close system calls

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Operating system routines that directly support application programs as they run are generally:
A: dynamic
B: transient
C: resilient
D: resident

A

D: resident

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

When the process issues an I/O request:
A: It is placed in the ready queue
B: It is placed in an I/O queue
C: It is placed in a waiting queue
D: It is placed in the Job queue

A

B: It is placed in an I/O queue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Message passing system allows processes to:
A: name the recipient or sender of the message
B: communicate with one another by resorting to shared data
C: share data
D: communicate with one another without resorting to shared data

A

D: communicate with one another without resorting to shared data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

A mutex:
A: None of the mentioned
B: must be accessed from only one process
C: can be accessed from multiple processes
D: is a binary mutex

A

B: must be accessed from only one process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

The CPU hardware has a wire called –?– that the CPU senses after executing every instruction.
A: interrupt bus
B: interrupt sense line
C: interrupt receive line
D: interrupt request line

A

D: interrupt request line

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

A swapper manipulates –?– whereas the pager is concerned with individual –?– of a process.
A: the entire process, parts
B: all the pages of a process, segments
C: none of the mentioned
D: the entire process, pages

A

D: the entire process, pages

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

The major part of swap time is –?– time.
A: waiting
B: none of the mentioned
C: execution
D: transfer

A

D: transfer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

What is a medium-term scheduler?
A: None of the mentioned
B: It selects which process to remove from memory by swapping
C: It selects which process has to be executed next and allocates CPU
D: It selects which process has to be brought into the ready queue

A

B: It selects which process to remove from memory by swapping

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

Thread pools limit the number of threads that exist at any one point, hence:
A: none of the mentioned
B: helping a limited number of processes at a time
C: not serving all requests and ignoring many
D: not letting the system resources like CPU time and memory exhaust

A

D: not letting the system resources like CPU time and memory exhaust

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q

Dispatch latency is:
A: the time of dispatching a process from running to ready state and keeping the CPU idle
B: none of the mentioned
C: the time to stop one process and start running another one
D: the speed of dispatching a process from running to the ready state

A

C: the time to stop one process and start running another one

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q

Semaphore is a/an –?– to solve the critical section problem.
A: integer variable
B: none of the mentioned
C: hardware for a system
D: special program for a system

A

A: integer variable

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
31
Q

Because of virtual memory, the memory can be shared among:
A: processes
B: none of the mentioned
C: instructions
D: threads

A

A: processes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
32
Q

What is role of base/bound registers?
A: This technique doesn’t protects a program’s address from modification by another user
B: Program’s addresses are neatly confined to space between the base and the bound registers
C: They give starting address to a program
D: They provide encrypted environment

A

B: Program’s addresses are neatly confined to space between the base and the bound registers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
33
Q

In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of:
A: currently running process
B: init process
C: parent process
D: all process

A

A: currently running process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
34
Q

If key routines are stored –?–, a programmer can incorporate them in his or her program and thus avoid rewriting them.
A: on disk
B: in a library
C: in an object
D: in memory

A

B: in a library

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
35
Q

There is no –?– with linked allocation.
A: all of the mentioned
B: starvation
C: internal fragmentation
D: external fragmentation

A

D: external fragmentation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
36
Q

A collection of instructions that performs a single logical function is called:
A: transaction
B: operation
C: function
D: all of the mentioned

A

A: transaction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
37
Q

Smaller page tables are implemented as a set of:
A: queues
B: counters
C: registers
D: stacks

A

C: registers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
38
Q

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: C-SCAN
B: C-LOOK
C: LOOK
D: SCAN

A

D: SCAN

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
39
Q

An actual update is not allowed to a data item:
A: before the corresponding log record is written out to stable storage
B: all of the mentioned
C: until the whole log record has been checked for inconsistencies
D: after the corresponding log record is written out to stable storage

A

A: before the corresponding log record is written out to stable storage

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
40
Q

Time taken in memory access through PTBR is:
A: slowed by a factor of 2
B: extended by a factor of 2
C: slowed by a factor of 3
D: extended by a factor of 3

A

A: slowed by a factor of 2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
41
Q

Logical memory is broken into blocks of the same size called:
A: none of the mentioned
B: pages
C: backing store
D: frames

A

B: pages

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
42
Q

When a cycle exists, the reference count maybe non zero, even when it is no longer possible to refer to a directory or file, due to:
A: the possibility of one hidden reference
B: the possibility of two hidden references
C: none of the mentioned
D: the possibility of self referencing

A

D: the possibility of self referencing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
43
Q

The priority of a process will –?– if the scheduler assigns it a static priority.
A: none of the mentioned
B: remain unchanged
C: change
D: depends on the operating system

A

B: remain unchanged

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
44
Q

The state of a process is defined by:
A: the activity just executed by the process
B: the current activity of the process
C: the activity to next be executed by the process
D: the final activity of the process

A

B: the current activity of the process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
45
Q

Each entry in a segment table has a:
A: segment peak
B: none of the mentioned
C: segment base
D: segment value

A

C: segment base

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
46
Q

When keeping a list of all the links/references to a file, and the list is empty, implies that:
A: the file has no copies
B: none of the mentioned
C: the file is deleted
D: the file is hidden

A

C: the file is deleted

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
47
Q

A file control block contains the information about:
A: file ownership
B: all of the mentioned
C: file permissions
D: location of file contents

A

B: all of the mentioned

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
48
Q

File system fragmentation occurs when:
A: used space is not contiguous
B: multiple files are non-contiguous
C: unused space or single file are not contiguous
D: unused space is non-contiguous

A

C: unused space or single file are not contiguous

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
49
Q

Scheduling is:
A: making proper use of processor
B: all of the mentioned
C: none of the mentioned
D: allowing a job to use the processor

A

D: allowing a job to use the processor

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
50
Q

The segment limit contains the:
A: starting logical address of the process
B: none of the mentioned
C: starting physical address of the segment in memory
D: segment length

A

D: segment length

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
51
Q

As disks have relatively low transfer rates and relatively high latency rates, disk schedulers must reduce latency times to:
A: reduce data transfer speeds
B: ensure high bandwidth
C: make sure data is transferred
D: ensure low bandwidth

A

B: ensure high bandwidth

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
52
Q

In –?– information is recorded magnetically on platters.
A: magnetic disks
B: assemblies
C: electrical disks
D: cylinders

A

A: magnetic disks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
53
Q

In segmentation, each address is specified by:
A: a value & segment number
B: an offset & value
C: a segment number & offset
D: a key & value

A

C: a segment number & offset

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
54
Q

A –?– is a full duplex connection between a device driver and a user level process.
A: Stream
B: Bus
C: Flow
D: I/O operation

A

A: Stream

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
55
Q

If exec is called immediately after forking:
A: all the threads will be duplicated
B: none of the mentioned
C: the program specified in the parameter to exec will replace the entire process
D: all the threads may be duplicated

A

C: the program specified in the parameter to exec will replace the entire process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
56
Q

The time taken to move the disk arm to the desired cylinder is called the:
A: positioning time
B: rotational latency
C: random access time
D: seek time

A

D: seek time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
57
Q

The code that changes the value of the semaphore is:
A: none of the mentioned
B: non – critical section code
C: critical section code
D: remainder section code

A

C: critical section code

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
58
Q

The address of the next instruction to be executed by the current process is provided by the:
A: Pipe
B: Program counter
C: Process stack
D: CPU registers

A

B: Program counter

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
59
Q

Transient operating system code is code that:
A: never enters the memory space
B: comes and goes as needed
C: stays in the memory always
D: is not easily accessible

A

B: comes and goes as needed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
60
Q

With –?– a requested page and several subsequent pages are read and cached.
A: read ahead
B: free-behind
C: add-front
D: write ahead

A

A: read ahead

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
61
Q

The essential content(s) in each entry of a page table is / are:
A: Virtual page number
B: Page frame number
C: Both virtual page number and page frame number
D: Access right information

A

B: Page frame number

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
62
Q

Swapping requires a:
A: keyboard
B: backing store
C: monitor
D: motherboard

A

B: backing store

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
63
Q

CPU fetches the instruction from memory according to the value of:
A: program counter
B: status register
C: program status word
D: instruction register

A

A: program counter

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
64
Q

The process of dividing a disk into sectors that the disk controller can read and write, before a disk can store data is known as:
A: partitioning
B: swap space creation
C: low-level formatting
D: none of the mentioned

A

C: low-level formatting

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
65
Q

Using transient code, –?– the size of the operating system during program execution.
A: increases
B: decreases
C: changes
D: maintains

A

C: changes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
66
Q

One difficulty of contiguous allocation is:
A: finding space for a new file
B: costly
C: inefficient
D: time taking

A

A: finding space for a new file

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
67
Q

In the optimized technique for sequential access –?– removes a page from the buffer as soon as the next page is requested.
A: write ahead
B: free-behind
C: add-front
D: read ahead

A

B: free-behind

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
68
Q

The main problem with access control lists is:
A: all of the mentioned
B: their maintenance
C: their permissions
D: their length

A

D: their length

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
69
Q

An admission control scheme assigns a –?– to each type of resource.
A: resource manager
B: all of the mentioned
C: processor
D: memory location

A

A: resource manager

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
70
Q

Which is an unsolvable problem in access-matrix?
A: Owner override
B: Access denied
C: Brute force
D: Confinement

A

D: Confinement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
71
Q

The stub provided by an RPC:
A: packs the parameters into a form transmittable over the network
B: transmits the message to the server where the server side stub receives the message and invokes procedure on the server side
C: locates the port on the server
D: all of the mentioned

A

D: all of the mentioned

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
72
Q

The internal code of any software that will set of a malicious function when specified conditions are met, is called:
A: code stacker
B: logic bomb
C: trap door
D: none of the mentioned

A

B: logic bomb

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
73
Q

A single parity bit can be used for:
A: all of the mentioned
B: few error corrections
C: detection
D: multiple error corrections

A

C: detection

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
74
Q

For large files, when the index itself becomes too large to be kept in memory:
A: index is called
B: secondary index files are created
C: all of the mentioned
D: an index is created for the index file

A

D: an index is created for the index file

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
75
Q

A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called:
A: aging
B: race condition
C: data consistency
D: starvation

A

B: race condition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
76
Q

The wait-for graph is a deadlock detection algorithm that is applicable when:
A: all resources have multiple instances
B: all resources have a single 7 multiple instance
C: all of the mentioned
D: all resources have a single instance

A

D: all resources have a single instance

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
77
Q

The disadvantage of the two level directory structure is that:
A: it does not solve the name collision problem
B: it solves the name collision problem
C: it does not isolate users from one another
D: it isolates users from one another

A

D: it isolates users from one another

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
78
Q

In UNIX, the open system call returns:
A: a file to the process calling it
B: pointer to the entry in the open file table
C: pointer to the entry in the system wide table
D: none of the mentioned

A

B: pointer to the entry in the open file table

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
79
Q

Each physical device attached to an MS-DOS system is described in a special file called a(n):
A: FAT
B: interrupt vector
C: block routine
D: device driver

A

D: device driver

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
80
Q

The processes that are residing in main memory and are ready and waiting to execute are kept on a list called:
A: process queue
B: job queue
C: ready queue
D: execution queue

A

C: ready queue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
81
Q

The –?– present a uniform device-access interface to the I/O subsystem, much as system calls provide a standard interface between the application and the operating system.
A: Device drivers
B: Buses
C: I/O systems
D: Devices

A

A: Device drivers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
82
Q

Reliability of files can be increased by:
A: keeping the files safely in the memory
B: by keeping them in external storage
C: making a different partition for the files
D: by keeping duplicate copies of the file

A

D: by keeping duplicate copies of the file

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
83
Q

In a –?– real time system, it is guaranteed that critical real time tasks will be completed within their deadlines.
A: soft
B: none of the mentioned
C: critical
D: hard

A

D: hard

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
84
Q

Which of the following is not the state of a process?
A: New
B: Running
C: Waiting
D: Old

A

D: Old

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
85
Q

A solution to the problem of external fragmentation is:
A: compaction
B: smaller memory space
C: none of the mentioned
D: larger memory space

A

A: compaction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
86
Q

Which of the following need not necessarily be saved on a context switch between processes?
A: All of the mentioned
B: General purpose registers
C: Translation lookaside buffer
D: Program counter

A

C: Translation lookaside buffer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
87
Q

The degree of multiprogramming is:
A: the number of processes executed per unit time
B: the number of processes in the I/O queue
C: the number of processes in memory
D: the number of processes in the ready queue

A

C: the number of processes in memory

88
Q

To enable a process to wait within the monitor:
A: all of the mentioned
B: condition variables must be used as boolean objects
C: a condition variable must be declared as condition
D: semaphore must be used

A

C: a condition variable must be declared as condition

89
Q

Swap space is allocated:
A: all of the mentioned
B: separate from a file system
C: into a file system
D: as a chunk of disk

A

D: as a chunk of disk

90
Q

Which table contains the information about each mounted volume?
A: mount table
B: all of the mentioned
C: per-process open-file table
D: system-wide open-file table

A

B: all of the mentioned

91
Q

The pager concerns with the:
A: entire thread
B: entire process
C: first page of a process
D: individual page of a process

A

D: individual page of a process

92
Q

Remote Procedure Calls are used:
A: for communication between two processes on the same system
B: for communication between two processes remotely different from each other on the same system
C: for communication between two processes on separate systems
D: None of the mentioned

A

C: for communication between two processes on separate systems

93
Q

I/O hardware contains:
A: I/O port and its registers
B: All of the mentioned
C: Controller
D: Bus

A

B: All of the mentioned

94
Q

What is the mounting of file system?
: attaching portion of the file system into a directory structure
B: crating of a filesystem
C: removing portion of the file system into a directory structure
D: deleting a filesystem

A

: attaching portion of the file system into a directory structure

95
Q

The shrinking phase is a phase in which:
A: A transaction may obtain locks, and releases a few or all of them
B: A transaction may obtain locks, but does not release any
C: A transaction may release locks, and obtains new locks
D: A transaction may release locks, but does not obtain any new locks

A

D: A transaction may release locks, but does not obtain any new locks

96
Q

If each access to a file is controlled by a password, then the disadvantage is that:
A: it is not efficient
B: all of the mentioned
C: user will need to remember a lot of passwords
D: it is not reliable

A

C: user will need to remember a lot of passwords

97
Q

Random access in magnetic tapes is –?– compared to magnetic disks.
A: very slow
B: very fast
C: slow
D: fast

A

A: very slow

98
Q

A dedicated device is:
A: same as a sharable device
B: none of the mentioned
C: opposite to a sharable device
D: can be used concurrently by several processes

A

C: opposite to a sharable device

99
Q

Buffering is done to:
A: maintain copy semantics
B: cope with device speed mismatch
C: all of the mentioned
D: cope with device transfer size mismatch

A

C: all of the mentioned

100
Q

In –?– writes, the data is stored in the cache.
A: Regular
B: Irregular
C: Asynchronous
D: Synchronous

A

C: Asynchronous

101
Q

If a page number is not found in the TLB, then it is known as a:
A: TLB miss
B: All of the mentioned
C: TLB hit
D: Buffer miss

A

A: TLB miss

102
Q

The following three conditions must be satisfied to solve the critical section problem:
A: Progress
B: Mutual Exclusion
C: Bounded Waiting
D: All of the mentioned

A

D: All of the mentioned

103
Q

The server maintains a/an –?– that specifies local file systems that it exports for mounting, along with names of machines that are permitted to mount them.
A: import list
B: receiving list
C: export list
D: sending list

A

C: export list

104
Q

Signals of a given type:
A: are all sent as one
B: none of the mentioned
C: cannot be queued
D: are queued

A

A: are all sent as one

105
Q

What are drawbacks of the host based IDS?
A: Selective logging runs the risk of missed attacks
B: They are very fast to detect
C: They have to be programmed for new patterns
D: Unselective logging of messages may increase the audit burdens

A

D: Unselective logging of messages may increase the audit burdens

106
Q

On systems where there are multiple operating system, the decision to load a particular one is done by:
A: boot loader
B: bootstrap
C: file control block
D: process control block

A

A: boot loader

107
Q

The backing store is generally a:
A: disk large enough to accommodate copies of all memory images for all users
B: all of the mentioned
C: disk to provide direct access to the memory images
D: fast disk

A

B: all of the mentioned

108
Q

The index contains:
A: names of all contents of file
B: pointers to the various blocks
C: pointers to each page
D: all of the mentioned

A

B: pointers to the various blocks

109
Q

Copying data to disk for eventual input to an application routine is called:
A: queuing
B: dispatching
C: multiprogramming
D: spooling

A

D: spooling

110
Q

Scheduling is done so as to:
A: there is no relation between scheduling and turnaround time
B: keep the turnaround time same
C: increase the turnaround time
D: decrease the turnaround time

A

D: decrease the turnaround time

111
Q

If execution time binding is being used, then a process –?– be swapped to a different memory space.
A: must
B: has to be
C: may
D: can never

A

C: may

112
Q

What is true regarding tagged architecture?
A: It is very compatible to code upgrades
B: Extra bits are not used to identify rights to that word
C: Extra bits are used to do padding
D: Every word of machine memory has one or more extra bits

A

D: Every word of machine memory has one or more extra bits

113
Q

Time quantum is defined in:
A: priority scheduling algorithm
B: multilevel queue scheduling algorithm
C: round robin scheduling algorithm
D: shortest job scheduling algorithm

A

C: round robin scheduling algorithm

114
Q

By using the specific system call, we can:
A: write into the file
B: read the file
C: open the file
D: all of the mentioned

A

D: all of the mentioned

115
Q

The page table contains:
A: page size
B: page offset
C: none of the mentioned
D: base address of each page in physical memory

A

D: base address of each page in physical memory

116
Q

In tree structure, when deleting a directory that is not empty:
A: contents of the directory are not deleted
B: none of the mentioned
C: The contents of the directory are safe
D: The contents of the directory are also deleted

A

D: The contents of the directory are also deleted

117
Q

The time that is required to bring a disk drive up to speed and position the access mechanism is called:
A: rotational delay
B: access time
C: seek time
D: execution time

A

C: seek time

118
Q

The strategy of making processes that are logically runnable to be temporarily suspended is called:
A: Preemptive scheduling
B: First come First served
C: Shortest job first
D: Non preemptive scheduling

A

A: Preemptive scheduling

119
Q

Round robin scheduling falls under the category of:
A: None of the mentioned
B: All of the mentioned
C: Non preemptive scheduling
D: Preemptive scheduling

A

D: Preemptive scheduling

120
Q

The pointer overhead of indexed allocation is generally –?– the pointer overhead of linked allocation.
A: less than
B: keeps varying with
C: equal to
D: greater than

A

D: greater than

121
Q

Run time mapping from virtual to physical address is done by:
A: None of the mentioned
B: Memory management unit
C: PCI
D: CPU

A

B: Memory management unit

122
Q

When a subroutine is called:
A: none of the mentioned
B: it does not define a new locality
C: it is in the same locality from where it was called
D: it defines a new locality

A

D: it defines a new locality

123
Q

Magnetic tape drives can write data at a speed –?– disk drives.
A: none of the mentioned
B: much lesser than
C: much faster than
D: comparable to

A

D: comparable to

124
Q

A disk that has a boot partition is called a:
A: all of the mentioned
B: start disk
C: boot disk
D: end disk

A

C: boot disk

125
Q

The monitor construct ensures that:
A: all of the mentioned
B: only one process can be active at a time within the monitor
C: n number of processes can be active at a time within the monitor (n being greater than 1)
D: the queue has only one process in it at a time

A

B: only one process can be active at a time within the monitor

126
Q

The kernel data structures include:
A: close file table
B: open file table
C: process table
D: all of the mentioned

A

B: open file table

127
Q

The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is:
A: the cost incurred
B: the memory used
C: the CPU used
D: all of the mentioned

A

A: the cost incurred

128
Q

–?– mounts, is when a file system can be mounted over another file system, that is remotely mounted, not local.
A: none of the mentioned
B: cascading
C: trivial
D: recursive

A

B: cascading

129
Q

File type can be represented by:
A: none of the mentioned
B: file extension
C: file identifier
D: file name

A

B: file extension

130
Q

When there is a large logical address space, the best way of paging would be:
A: the page table itself
B: all of the mentioned
C: a two level paging algorithm
D: not to page

A

C: a two level paging algorithm

131
Q

With paging there is no –?– fragmentation.
A: external
B: internal
C: none of the mentioned
D: either type of

A

A: external

132
Q

For non sharable resources like a printer, mutual exclusion:
A: must exist
B: none of the mentioned
C: may exist
D: must not exist

A

A: must exist

133
Q

Increasing the RAM of a computer typically improves performance because:
A: Larger RAMs are faster
B: None of the mentioned
C: Virtual memory increases
D: Fewer page faults occur

A

D: Fewer page faults occur

134
Q

A process can never be sure that a signal it has sent:
A: has been sent
B: has which identifier
C: all of the mentioned
D: has not been lost

A

D: has not been lost

135
Q

Caching:
A: holds a copy of the data
B: is fast memory
C: holds output for a device
D: holds the only copy of the data

A

A: holds a copy of the data

136
Q

A section of disk at the beginning of each partition is set aside to contain the table in:
A: linked allocation
B: fat
C: indexed allocation
D: hashed allocation

A

B: fat

137
Q

The state of the data accessed by an aborted transaction must be restored to what it was just before the transaction started executing. This restoration is known as ________ of transaction.
A: roll – back
B: protection
C: safety
D: revert – back

A

A: roll – back

138
Q

The context of a process in the PCB of a process does not contain:
A: the value of the CPU registers
B: memory-management information
C: the process state
D: context switch time

A

D: context switch time

139
Q

When a page fault occurs before an executing instruction is complete:
A: the instruction must be completed ignoring the page fault
B: the instruction must be restarted
C: none of the mentioned
D: the instruction must be ignored

A

B: the instruction must be restarted

140
Q

What is used to protect network from outside internet access?
A: A trusted antivirus
B: Firewall to separate trusted and untrusted network
C: 24 hours scanning for virus
D: Deny users access to websites which can potentially cause security leak

A

B: Firewall to separate trusted and untrusted network

141
Q

Turnaround time is:
A: the total time spent in the running queue
B: the total waiting time for a process to finish execution
C: the total time spent in the ready queue
D: the total time from the completion till the submission of a process

A

D: the total time from the completion till the submission of a process

142
Q

In the stack implementation of the LRU algorithm, a stack can be maintained in a manner:
A: none of the mentioned
B: whenever a page is used, it is removed from the stack and put on bottom
C: the bottom of the stack is the LRU page
D: the top of the stack contains the LRU page and all new pages are added to the top

A

C: the bottom of the stack is the LRU page

143
Q

What is raw disk?
A: disk lacking logical file system
B: empty disk
C: disk having file system
D: disk without file system

A

D: disk without file system

144
Q

The aim of creating page replacement algorithms is to:
A: increase the page fault rate
B: decrease the page fault rate
C: replace pages faster
D: to allocate multiple pages to processes

A

B: decrease the page fault rate

145
Q

Each connection arriving at multi threaded servers via network is generally:
A: is kept in a normal queue and then sent to the blocking queue from where it is dequeued
B: is wrapped as a task and passed on to a thread pool
C: none of the mentioned
D: is directly put into the blocking queue

A

B: is wrapped as a task and passed on to a thread pool

146
Q

A state is safe, if:
A: the system does not crash due to deadlock occurrence
B: the state keeps the system protected and safe
C: all of the mentioned
D: the system can allocate resources to each process in some order and still avoid a deadlock

A

D: the system can allocate resources to each process in some order and still avoid a deadlock

147
Q

Under –?–, programs are divided into fixed length pieces.
A: segmenting
B: dynamic memory management
C: fixed partitions
D: paging

A

D: paging

148
Q

Which one of the following is not a secondary storage?
A: RAM
B: Magnetic disks
C: None of the mentioned
D: Magnetic tapes

A

A: RAM

149
Q

What is correct regarding ‘relocation’ w.r.t protecting memory?
A: It is a process of taking a program as if it began at address 0
B: It is a process of taking a program as if it began at address 0A
C: All of the mentioned
D: Fence cannot be used within relocation process

A

A: It is a process of taking a program as if it began at address 0

150
Q

A heavy weight process:
A: has a single thread of execution
B: has multiple threads of execution
C: can have multiple or a single thread for execution
D: none of the mentioned

A

A: has a single thread of execution

151
Q

What is port scanning?
A: It is a software application designed to probe a server or host for open ports
B: It is software used to scan system for introducing attacks by brute force
C: None of the mentioned
D: It is a software used to scan system for attack

A

A: It is a software application designed to probe a server or host for open ports

152
Q

In UNIX, a link is:
A: a directory entry
B: implemented as an absolute or relative path name
C: a pointer to another file or subdirectory
D: all of the mentioned

A

D: all of the mentioned

153
Q

The two steps the operating system takes to use a disk to hold its files are –?– and –?– .
A: partitioning & logical formatting
B: logical formatting & swap space creation
C: caching & logical formatting
D: swap space creation & caching

A

A: partitioning & logical formatting

154
Q

There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called:
A: none of the mentioned
B: string algorithms
C: queue algorithms
D: stack algorithms

A

D: stack algorithms

155
Q

Sequential access method –?– on random access devices.
A: none of the mentioned
B: maybe works well and doesnt work well
C: doesnt work well
D: works well

A

D: works well

156
Q

The instruction being executed, must be in:
A: physical memory
B: none of the mentioned
C: physical & logical memory
D: logical memory

A

A: physical memory

157
Q

In UNIX, the return value for the fork system call is –?– for the child process and –?– for the parent process.
A: Zero, A Negative integer
B: A nonzero integer, Zero
C: A Negative integer, Zero
D: Zero, A nonzero integer

A

D: Zero, A nonzero integer

158
Q

What is incorrect methods of revocation of access rights?
A: Selective/General
B: Partial/total
C: Immediate/Delayed
D: Crucial

A

D: Crucial

159
Q

If the process can be moved during its execution from one memory segment to another, then binding must be:
A: preponed to compile time
B: preponed to load time
C: none of the mentioned
D: delayed until run time

A

D: delayed until run time

160
Q

Which one of the following is not shared by threads?
A: none of the mentioned
B: program counter
C: stack
D: both program counter and stack

A

D: both program counter and stack

161
Q

Which one of the following error will be handle by the operating system?
A: connection failure in the network
B: power failure
C: lack of paper in printer
D: all of the mentioned

A

D: all of the mentioned

162
Q

If the kernel is single threaded, then any user level thread performing a blocking system call will:
A: cause the entire process to block even if the other threads are available to run
B: cause the thread to block with the other threads running
C: cause the entire process to run along with the other threads
D: none of the mentioned

A

A: cause the entire process to block even if the other threads are available to run

163
Q

Contiguous allocation of a file is defined by:
A: size of the block
B: length & size of the block
C: total size of the file
D: disk address of the first block & length

A

D: disk address of the first block & length

164
Q

The accuracy of the working set depends on the selection of:
A: working set size
B: memory size
C: number of pages in memory
D: working set model

A

A: working set size

165
Q

Inter process communication:
A: allows processes to communicate and synchronize their actions without using the same address space
B: allows processes to communicate and synchronize their actions when using the same address space
C: allows the processes to only synchronize their actions without communication
D: none of the mentioned

A

A: allows processes to communicate and synchronize their actions without using the same address space

166
Q

For a deadlock to arise, which of the following conditions must hold simultaneously?
A: No preemption
B: All of the mentioned
C: Hold and wait
D: Mutual exclusion

A

B: All of the mentioned

167
Q

Using swap space significantly –?– system performance.
A: maintains
B: increases
C: does not affect
D: decreases

A

D: decreases

168
Q

To resolve the problem of data representation on different systems RPCs define:
A: machine dependent representation of data
B: none of the mentioned
C: machine representation of data
D: machine-independent representation of data

A

D: machine-independent representation of data

169
Q

Which one of the following is the address generated by CPU?
A: none of the mentioned
B: absolute address
C: logical address
D: physical address

A

C: logical address

170
Q

In the bakery algorithm to solve the critical section problem:
A: each process gets a unique number and the one with the highest number is served next
B: each process gets a unique number and the one with the lowest number is served next
C: each process receives a number (may or may not be unique) and the one with the lowest number is served next
D: each process is put into a queue and picked up in an ordered manner

A

C: each process receives a number (may or may not be unique) and the one with the lowest number is served next

171
Q

If a process does not call exec after forking:
A: all the threads should be duplicated
B: all the threads should not be duplicated
C: none of the mentioned
D: the program specified in the parameter to exec will replace the entire process

A

A: all the threads should be duplicated

172
Q

When memory is divided into several fixed sized partitions, each partition may contain:
A: at least one process
B: multiple processes at once
C: none of the mentioned
D: exactly one process

A

D: exactly one process

173
Q

Which of the following objects require protection?
A: Motherboard
B: Printers
C: CPU
D: All of the mentioned

A

B: Printers

174
Q

How does the software trigger an interrupt?
A: Executing a special operation called system call
B: Executing a special program calle interrupt trigger program
C: Executing a special program called system program
D: Sending signals to CPU through bus

A

A: Executing a special operation called system call

175
Q

Response time is:
A: the total time taken from the submission time till the completion time
B: the total time taken from the submission time till the first response is produced
C: none of the mentioned
D: the total time taken from submission time till the response is output

A

B: the total time taken from the submission time till the first response is produced

176
Q

A tree structure –?– the sharing of files and directories.
A: may restrict
B: none of the mentioned
C: allows
D: restricts

A

D: restricts

177
Q

Time duration required for scheduling dispatcher to stop one process and start another is known as:
A: process latency
B: execution latency
C: dispatch latency
D: interrupt latency

A

C: dispatch latency

178
Q

Some of the properties of real time systems include:
A: single purpose
B: small size
C: all of the mentioned
D: inexpensively mass produced

A

C: all of the mentioned

179
Q

What is basic need in protecting memory in multi-user environment?
A: We need a variable register
B: We need two registers one ‘start’ and other ‘end’
C: A fence register has to be used known as base register.
D: None of the mentioned

A

C: A fence register has to be used known as base register.

180
Q

One of the disadvantages of the priority scheduling algorithm is that:
A: it schedules in a very complex manner
B: its scheduling takes up a lot of time
C: none of the mentioned
D: it can lead to some low priority process waiting indefinitely for the CPU

A

D: it can lead to some low priority process waiting indefinitely for the CPU

181
Q

In indexed allocation:
A: all the pointers to scattered blocks are placed together in one location
B: each file must occupy a set of contiguous blocks on the disk
C: none of the mentioned
D: each file is a linked list of disk blocks

A

A: all the pointers to scattered blocks are placed together in one location

182
Q

Which one of the following is not a valid state of a thread?
A: blocked
B: ready
C: parsing
D: running

A

C: parsing

183
Q

Waiting time is:
: the total time spent in the running queue
B: the total time spent in the ready queue
C: the total time in the blocked and waiting queues
D: the total time from the completion till the submission of a process

A

B: the total time spent in the ready queue

184
Q

In the bounded buffer problem, there are the empty and full semaphores that:
A: none of the mentioned
B: count the number of empty and full buffers
C: count the number of empty and full memory spaces
D: count the number of empty and full queues

A

B: count the number of empty and full buffers

185
Q

Multithreading on a multi – CPU machine:
A: increases concurrency
B: can increase or decrease the concurrency
C: doesn’t affect the concurrency
D: decreases concurrency

A

A: increases concurrency

186
Q

Which hardware triggers some operation after certain programmed count?
A: none of the mentioned
B: interrupt timer
C: programmable interval timer
D: programmable timer

A

C: programmable interval timer

187
Q

A process having multiple threads of control implies:
A: it has to use only one thread per process
B: it can do more than one task at a time
C: it can do only one task at a time, but much faster
D: none of the mentioned

A

B: it can do more than one task at a time

188
Q

In UNIX, groups can be created and modified by:
A: the people in the group only
B: any user
C: a programmer only
D: superuser

A

D: superuser

189
Q

What is correct way the segmentation program address is stored?
A: name, offset
B: start, stop
C: offset, rights
D: access, rights

A

A: name, offset

190
Q

Mapping of network file system protocol to local file system is done by:
A: remote mirror
B: local file system
C: volume manager
D: network file system

A

D: network file system

191
Q

What is the reacquisition scheme to revoke capability?
A: Master key can be used compare and revoke.
B: Pointers are maintained for each object which can be used to revoke
C: When a process capability is revoked then it won’t be able to reacquire it
D: Indirect pointing is done to revoke object’s capabilities

A

C: When a process capability is revoked then it won’t be able to reacquire it

192
Q

When a process terminates:
A: It is removed from all queues
B: Its process control block is de-allocated
C: It is removed from all, but the job queue
D: Its process control block is never de-allocated

A

A: It is removed from all queues

193
Q

A memory buffer used to accommodate a speed differential is called:
A: stack pointer
B: disk buffer
C: accumulator
D: cache

A

D: cache

194
Q

When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called
A: priority removal
B: priority inversion
C: priority exchange
D: priority modification

A

B: priority inversion

195
Q

The VFS (virtual file system) activates file system specific operations to handle local requests according to their:
A: timings
B: size
C: file system types
D: commands

A

C: file system types

196
Q

A single swap space –?– reside in two places.
A: cannot
B: must not
C: none of the mentioned
D: can

A

D: can

197
Q

Sometimes the overhead of keeping track of a hole might be:
A: larger than the hole itself
B: very small
C: larger than the memory
D: all of the mentioned

A

A: larger than the hole itself

198
Q

A solution to the problem of indefinite blockage of low – priority processes is:
A: Starvation
B: Wait queue
C: Ready queue
D: Aging

A

D: Aging

199
Q

A process that is based on IPC mechanism which executes on different systems and can communicate with other processes using message based communication, is called ________
A: Remote Procedure Call
B: Inter Process Communication
C: Local Procedure Call
D: Remote Machine Invocation

A

A: Remote Procedure Call

200
Q

The disadvantage of a process being allocated all its resources before beginning its execution is:
A: None of the mentioned
B: Low resource utilization
C: Very high resource utilization
D: Low CPU utilization

A

B: Low resource utilization

201
Q

When the event for which a thread is blocked occurs:
A: thread moves to the ready queue
B: thread remains blocked
C: thread completes
D: a new thread is provided

A

A: thread moves to the ready queue

202
Q

Spinlocks are intended to provide –?– only.
A: Mutual Exclusion
B: Aging
C: Bounded Waiting
D: Progress

A

C: Bounded Waiting

203
Q

In polling:
A: busy – wait cycles wait for I/O from device
B: all of the mentioned
C: interrupt-request line is triggered by I/O device
D: interrupt handler receives interrupts

A

A: busy – wait cycles wait for I/O from device

204
Q

Metadata includes:
A: none of the mentioned
B: both file system structure and contents of files
C: contents of files
D: all of the file system structure

A

B: both file system structure and contents of files

205
Q

What is major feature of segmentation?
A: Program is divided into pieces having different access rights
B: Program is divided in data memory and program memory
C: Program is executed in segments
D: It has effect of an unbounded architecture

A

A: Program is divided into pieces having different access rights

206
Q

When the target thread periodically checks if it should terminate and terminates itself in an orderly manner, it is called:
A: Asynchronous cancellation
B: Systematic cancellation
C: Deferred cancellation
D: Sudden Termination

A

C: Deferred cancellation

207
Q

The amount of time required for the scheduling dispatcher to stop one process and start another is known as:
A: dispatch latency
B: interrupt latency
C: context switch
D: event latency

A

A: dispatch latency

208
Q

Which of the following is a good practice?
A: Grant limited permission to specified account
B: Give both read and write permission but not execute
C: Give full permission for remote transferring
D: Grant read only permission

A

A: Grant limited permission to specified account

209
Q

Which of the following is not TRUE:
A: Processes may send each other signals
B: Kernel may send signals internally
C: a field is updated in the signal table when the signal is sent
D: each signal is maintained by a single bit

A

C: a field is updated in the signal table when the signal is sent

210
Q

The valid – invalid bit, in this case, when valid indicates:
A: the page is in memory
B: the page is illegal
C: the page is not legal
D: the page is not in memory

A

A: the page is in memory

211
Q

In the layered approach of Operating Systems:
A: Highest Layer(N) is the User interface
B: Bottom Layer(0) is the User interface
C: Highest Layer(N) is the hardware
D: Bottom Layer(N) is the hardware

A

A: Highest Layer(N) is the User interface

212
Q

If no cycle exists in the resource allocation graph:
A: then the system will not be in a safe state
B: all of the mentioned
C: none of the mentioned
D: then the system will be in a safe state

A

D: then the system will be in a safe state

213
Q

In the One to One model when a thread makes a blocking system call:
A: none of the mentioned
B: other threads only from other processes are allowed to run
C: other threads are allowed to run
D: other threads are strictly prohibited from running

A

C: other threads are allowed to run

214
Q

The primary distinction between the short term scheduler and the long term scheduler is:
A: The length of their queues
B: The frequency of their execution
C: The type of processes they schedule
D: None of the mentioned

A

B: The frequency of their execution

215
Q

File attributes consist of:
A: type
B: identifier
C: name
D: all of the mentioned

A

D: all of the mentioned

C191 Operating Systems for Programmers (26 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions