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 1 > Flashcards

Quiz Sail Part 1 Flashcards

1
Q

For a Hold and wait condition to prevail:
A: A process must hold at least one resource and not be waiting to acquire additional resources
B: A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes
C: None of the mentioned
D: A process must be not be holding a resource, but waiting for one to be freed, and then request to acquire it

A

B: A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes

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

What is ‘separation’ in security of Operating systems?
A: To have separate Hard disk drive/partition for different users
B: It means keeping one user’s objects separate from other users
C: None of the mentioned
D: To have separate login for different users

A

B: It means keeping one user’s objects separate from other users

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

The main disadvantage of spinlocks is that:
A: they are unreliable sometimes
B: they require busy waiting
C: they are too complex for programmers
D: they are not sufficient for many process

A

B: they require busy waiting

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

What is characteristics of Authorization?
A: 3 way handshaking with syn and fin
B: RADIUS and RSA
C: Deals with privileges and rights
D: Multilayered protection for securing resources

A

C: Deals with privileges and rights

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

The two phase locking protocol consists of:
A: destruction & creation phase
B: growing & shrinking phase
C: shrinking & creation phase
D: creation & growing phase

A

B: growing & shrinking phase

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

To organise file systems on disk,:
A: information about files is added to each partition
B: all of the mentioned
C: they are made on different storage spaces
D: they are split into one or more partitions

A

A: information about files is added to each partition

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

Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called:
A: fragmentation
B: paging
C: none of the mentioned
D: mapping

A

B: paging

Mapping refers to the process of associating a logical address (virtual address) with a physical address in memory.

Paging is a memory management technique that allows the operating system to divide the virtual memory space of a process into fixed-size blocks called pages.
It provides a mechanism for translating virtual addresses used by a program into physical addresses in main memory.

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

To find a particular file on a disk, refer to the disk’s:
A: buffer
B: table of contents
C: directory
D: control unit

A

C: directory

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

If a pointer is lost or damaged in a linked allocation:
A: there would not be any problems
B: none of the mentioned
C: the entire file could get damaged
D: only a part of the file would be affected

A

C: the entire file could get damaged

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

Standard set of functions through which interacts with kernel is defined by:
A: kernel code
B: system libraries
C: utility programs
D: compilers

A

B: system libraries

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

Scheduling is done so as to:
A: decrease CPU utilization
B: keep the CPU more idle
C: increase CPU utilization
D: None of the mentioned

A

C: increase CPU utilization

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

Multithreaded programs are:
A: lesser prone to deadlocks
B: not at all prone to deadlocks
C: none of the mentioned
D: more prone to deadlocks

A

D: more prone to deadlocks

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

A deadlock avoidance algorithm dynamically examines the –?– to ensure that a circular wait condition can never exist.
A: resources
B: resource allocation state
C: operating system
D: system storage state

A

B: resource allocation state

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

It is __________ to reread a page from the file system than to write it to swap space and then to reread it from there.
A: none of the mentioned
B: more efficient
C: useless
D: less efficient

A

B: more efficient

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

If relocation is static and is done at assembly or load time, compaction:
A: cannot be done
B: must be done
C: can be done
D: must not be done

A

A: cannot be done

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

What is meaning of right-set?
A: None of the mentioned
B: It is a subset of all valid operations that can be performed on the object
C: It is a subset consist of read,write and execute
D: It is a subset consist of read and write

A

B: It is a subset of all valid operations that can be performed on the object

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

The mount request is mapped to the corresponding –?– and is forwarded to the mount server running on the specific server machine.
A: CPU
B: System
C: IPC
D: RPC

A

B: System

A mount server, also known as a file server or network file server, is a computer or device that provides file-level storage services over a network.

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

Because the kernel thread management is done by the Operating System itself:
A: none of the mentioned
B: kernel threads are faster to create than user threads
C: kernel threads are slower to create than user threads
D: kernel threads are easier to manage as well as create then user threads

A

C: kernel threads are slower to create than user threads

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

The most effective technique to keep dispatch latency low is to:
A: make it user programmed
B: run less number of processes at a time
C: provide preemptive kernels
D: provide non preemptive kernels

A

C: provide preemptive kernels

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

The register context and stacks of a thread are deallocated when the thread:
A: unblocks
B: spawns
C: blocks
D: terminates

A

D: terminates

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

Which protocol establishes the initial logical connection between a server and a client?
A: mount protocol
B: transmission control protocol
C: user datagram protocol
D: datagram congestion control protocol

A

A: mount protocol

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

The child process can:
A: cannot have another program loaded into it
B: be a duplicate of the parent process
C: never be a duplicate of the parent process
D: never have another program loaded into it

A

B: be a duplicate of the parent process

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

Virtual memory is a –?– of memory contents.
A: physical model
B: mirror image
C: duplicate
D: logical model

A

D: logical model

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

The operating system –?– the links when traversing directory trees, to preserve the acyclic structure of the system.
A: none of the mentioned
B: deletes
C: ignores
D: considers

A

C: ignores

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

In virtual memory. the programmer –?– of overlays.
A: does not have to take care
B: all of the mentioned
C: none of the mentioned
D: has to take care

A

A: does not have to take care

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

The –?– swaps processes in and out of the memory.
A: CPU
B: Memory manager
C: User
D: CPU manager

A

B: Memory manager

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

Binding of instructions and data to memory addresses can be done at:
A: All of the mentioned
B: Execution time
C: Load time
D: Compile time

A

A: All of the mentioned

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

Address Binding is:
A: going to an address in memory
B: locating an address with the help of another address
C: binding two addresses together to form a new address in a different memory space
D: a mapping from one address space to another

A

D: a mapping from one address space to another

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

When the head damages the magnetic surface, it is known as:
A: magnetic damage
B: head crash
C: all of the mentioned
D: disk crash

A

B: head crash

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

Which mechanism is used by worm process?
A: Fake process
B: Trap door
C: VAX process
D: Spawn Process

A

D: Spawn Process

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

A relative block number is an index relative to:
A: the end of the file
B: the beginning of the file
C: none of the mentioned
D: the last written position in file

A

B: the beginning of the file

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

The process invoking the wait operation is:
A: none of the mentioned
B: stopped until the next process in the queue finishes execution
C: waiting for another process to complete before it can itself call the signal operation
D: suspended until another process invokes the signal operation

A

D: suspended until another process invokes the signal operation

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

The larger the block size, the –?– the internal fragmentation.
A: lesser
B: same
C: greater
D: none of the mentioned

A

C: greater

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

To create a file:
A: allocate the space in file system & make an entry for new file in directory
B: allocate the space in file system
C: make an entry for new file in directory
D: none of the mentioned

A

A: allocate the space in file system & make an entry for new file in directory

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

Management of metadata information is done by:
A: file-organisation module
B: application programs
C: logical file system
D: basic file system

A

C: logical file system

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

The deletion of a link, –?– the original file.
A: deletes
B: does not affect
C: none of the mentioned
D: affects

A

B: does not affect

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

The two steps of a process execution are:
A: OS & Memory Burst
B: CPU & I/O Burst
C: Memory & I/O Burst
D: I/O & OS Burst

A

B: CPU & I/O Burst

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

The request and release of resources are:
A: special programs
B: interrupts
C: command line statements
D: system calls

A

D: system calls

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

Which operation is performed by an interrupt handler?
A: Once done handling, bringing back the system to the original state it was before the interrupt occurred
B: All of the mentioned
C: Saving the current state of the system
D: Loading the interrupt handling code and executing it

A

B: All of the mentioned

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

The data structure used for file directory is called:
A: process table
B: file table
C: mount table
D: hash table

A

D: hash table

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

If binding is done at assembly or load time, then the process –?– be moved to different locations after being swapped out and in again.
A: may
B: can
C: must
D: can never

A

D: can never

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

When using counters to implement LRU, we replace the page with the:
A: none of the mentioned
B: largest time value
C: smallest time value
D: greatest size

A

C: smallest time value

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

What will happen if a non-recursive mutex is locked more than once?
A: Deadlock
B: Starvation
C: Aging
D: Signaling

A

A: Deadlock

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

What is theft of service?
A: This violation involves unauthorized use of resources
B: This violation involves unauthorized modification of data
C: This violation involves unauthorized destruction of data
D: This type of violation involves unauthorized reading of data

A

A: This violation involves unauthorized use of resources

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

Which principle states that programs, users and even the systems be given just enough privileges to perform their task?
A: principle of process scheduling
B: none of the mentioned
C: principle of least privilege
D: principle of operating system

A

C: principle of least privilege

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

The set of tracks that are at one arm position make up a:
A: magnetic disks
B: electrical disks
C: assemblies
D: cylinders

A

D: cylinders

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

A device driver can be thought of as a translator. Its input consists of –?– commands and output consists of –?– instructions.
A: low level, complex
B: high level, low level
C: low level, high level
D: complex, simple

A

B: high level, low level

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

To create a new file or find an existing file, a program executes:
A: a read instruction
B: a save command
C: an open command
D: a load command

A

C: an open command

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

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

A

B: It selects which process has to be executed next and allocates CPU

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

The reason for using the LFU page replacement algorithm is:
A: all of the mentioned
B: an actively used page should have a large reference count
C: it is extremely efficient and optimal
D: a less used page has more chances to be used again

A

B: an actively used page should have a large reference count

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

Which algorithm of disk scheduling selects the request with the least seek time from the current head positions?
A: FCFS scheduling
B: LOOK scheduling
C: SCAN scheduling
D: SSTF scheduling

A

D: SSTF scheduling

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

–?– is a unique tag, usually a number, identifies the file within the file system.
A: File name
B: File identifier
C: File type
D: None of the mentioned

A

B: File identifier

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

The series of accesses between the open and close operations is a:
A: file session
B: program
C: transaction
D: procedure

A

A: file session

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

During compaction time, other normal system operations –?– be permitted.
A: is
B: none of the mentioned
C: can
D: cannot

A

D: cannot

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

To create a new file application program calls:
A: logical file system
B: basic file system
C: file-organisation module
D: none of the mentioned

A

A: logical file system

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

If a kernel thread performs a blocking system call:
A: the kernel must schedule another thread of a different application for execution
B: the kernel can schedule another thread in the application for execution
C: the kernel must schedule another thread of the same application on a different processor
D: the kernel cannot schedule another thread in the same application for execution

A

B: the kernel can schedule another thread in the application for execution

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

Which buffer holds the output for a device?
A: output
B: spool
C: magic
D: status

A

B: spool

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

Real time systems need to –?– the interrupt latency.
A: not bother about
B: none of the mentioned
C: minimize
D: maximize

A

C: minimize

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

Cascading termination refers to termination of all child processes before the parent terminates:
A: Normally or abnormally
B: Abnormally
C: None of the mentioned
D: Normally

A

D: Normally

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

In UNIX, each process is identified by its:
A: None of the the mentioned
B: Process Control Block
C: Device Queue
D: Process Identifier

A

D: Process Identifier

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

The file management function incorporates routines that allow the user or programmer to:
A: create files by name
B: delete files by name
C: all of the mentioned
D: modify files by name

A

C: all of the mentioned

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

What is Domain?
A: None of the mentioned
B: Collection of protection policies
C: Set of all objects
D: Set of access-rights

A

D: Set of access-rights

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

For large data transfers, –?– is used.
A: none of the mentioned
B: controller register
C: programmed I/O
D: dma

A

D: dma

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

The time for the disk arm to move the heads to the cylinder containing the desired sector is called:
A: disk time
B: sector time
C: arm time
D: seek time

A

D: seek time

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

Which process can be affected by other processes executing in the system?
A: child process
B: parent process
C: cooperating process
D: init process

A

C: cooperating process

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

Each set of operations for performing a specific task is a:
A: all of the mentioned
B: transaction
C: code
D: program

A

B: transaction

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

The information about all files is kept in:
A: none of the mentioned
B: swap space
C: operating system
D: seperate directory structure

A

D: seperate directory structure

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

When hardware is accessed by reading and writing to the specific memory locations, then it is called:
A: port-mapped I/O
B: bus-mapped I/O
C: none of the mentioned (Cause its memory-mapped I/O)
D: controller-mapped I/O

A

C: none of the mentioned (Cause its memory-mapped I/O)

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

What is the ready state of a process?
A: when process is using the CPU
B: when process is scheduled to run after some execution
C: none of the mentioned
D: when process is unable to run until some task has been completed

A

B: when process is scheduled to run after some execution

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

The switching of the CPU from one process or thread to another is called:
A: process switch
B: context switch
C: task switch
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
71
Q

The solution to starvation is:
A: the number of resources must be included in resource preemption
B: resource preemption be done instead
C: the number of rollbacks must be included in the cost factor
D: all of the mentioned

A

C: the number of rollbacks must be included in the cost factor

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

The ability to execute a program that is only partially in memory has benefits like:
A: All of the mentioned
B: Programs for an extremely large virtual space can be created
C: Throughput increases
D: The amount of physical memory cannot put a constraint on the program

A

A: All of the mentioned

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

Dynamic loading is:
A: loading multiple routines randomly
B: none of the mentioned
C: loading multiple routines dynamically
D: loading a routine only when it is called

A

D: loading a routine only when it is called

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

The processor fetches and executes one instruction during each:
A: instruction cycle
B: machine cycle
C: execution cycle
D: clock pulse

A

B: machine cycle

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

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

A

C: each file must occupy a set of contiguous blocks on the disk

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

If we preempt a resource from a process, the process cannot continue with its normal execution and it must be:
A: terminated
B: rolled back
C: queued
D: aborted

A

B: rolled back

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

By using FAT, random access time is:
A: not affected
B: increased
C: decreased
D: the same

A

C: decreased

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

An asynchronous call:
A: does not return immediately and waits for the I/O to complete
B: returns immediately, without waiting for the I/O to complete
C: is too slow
D: consumes a lot of time

A

B: returns immediately, without waiting for the I/O to complete

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

The replacement of a bad block generally is not totally automatic because:
A: data in bad block can not be replaced
B: bad block does not contain any data
C: none of the mentioned
D: data in bad block is usually lost

A

D: data in bad block is usually lost

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

A mount point is:
A: a location where every time file systems are mounted
B: is the time when the mounting is done
C: an empty directory at which the mounted file system will be attached
D: none of the mentioned

A

C: an empty directory at which the mounted file system will be attached

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

Preemptive, priority based scheduling guarantees:
A: none of the mentioned
B: protection of memory
C: soft real time functionality
D: hard real time functionality

A

C: soft real time functionality

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

Cancelling a thread asynchronously:
A: none of the mentioned
B: spoils the process execution
C: may not free each resource
D: frees all the resources properly

A

C: may not free each resource

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

The bounded buffer problem is also known as:
A: Dining – Philosophers problem
B: Producer – Consumer problem
C: Readers – Writers problem
D: None of the mentioned

A

B: Producer – Consumer problem

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

What is best practice in firewall domain environment?
A: Create a Demilitarized zone
B: Create two DMZ zones with one untrusted domain
C: Create strong policy in firewall to support different types of users
D: Create two domain trusted and untrusted domain

A

A: Create a Demilitarized zone

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

One way to ensure that the circular wait condition never holds is to:
A: impose a total ordering of all resource types and to determine whether one precedes another in the ordering
B: to never let a process acquire resources that are held by other processes
C: to let a process wait for only one resource at a time
D: all of the mentioned

A

A: impose a total ordering of all resource types and to determine whether one precedes another in the ordering

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

Signals are identified by:
A: signal actions
B: none of the mentioned
C: signal handlers
D: signal identifiers

A

D: signal identifiers

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

The amount of memory in a real time system is generally:
A: same as in PCs
B: they do not have any memory
C: less compared to PCs
D: high compared to PCs

A

C: less compared to PCs

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

The host controller is:
A: none of the mentioned
B: controller built at the end of each disk
C: controller at the computer end of the bus
D: all of the mentioned

A

C: controller at the computer end of the bus

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

The ways of aborting processes and eliminating deadlocks are:
A: Abort all processes
B: Abort one process at a time until the deadlock cycle is eliminated
C: Abort all deadlocked processes
D: All of the mentioned

A

B: Abort one process at a time until the deadlock cycle is eliminated

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

A consistency checker –?– and tries to fix any inconsistencies it finds.
A: compares the data in the directory structure with the data blocks on disk
B: compares the data in the secondary storage with the data in the cache
C: compares the system generated output and user required output
D: all of the mentioned

A

A: compares the data in the directory structure with the data blocks on disk

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

Which one of the following is a synchronization tool?
A: semaphore
B: pipe
C: socket
D: thread

A

A: semaphore

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

In internal fragmentation, memory is internal to a partition and:
A: is being used
B: is not being used
C: none of the mentioned
D: is always used

A

B: is not being used

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

To solve the problem of external fragmentation, –?– needs to be done periodically.
A: formatting
B: replacing memory
C: compaction
D: check

A

C: compaction

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

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

A

A: C-SCAN

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

In an interrupt driven input/output:
A: the CPU runs a user written code and does accordingly
B: the CPU receives an interrupt when the device is ready for the next byte
C: the CPU writes one data byte to the data register and sets a bit in control register to show that a byte is available
D: the CPU uses polling to watch the control bit constantly, looping to see if device is ready

A

B: the CPU receives an interrupt when the device is ready for the next byte

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

A single thread of control allows the process to perform:
A: all of the mentioned
B: only one task at a time
C: multiple tasks at a time
D: only two tasks at a time

A

B: only one task at a time

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

The technique in which the CPU generates physical addresses directly is known as:
A: real addressing
B: virtual addressing
C: relocation register method
D: none of the mentioned

A

A: real addressing

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

The operating system keeps a small table containing information about all open files called:
A: directory table
B: open-file table
C: file table
D: system table

A

B: open-file table

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

The entry of all the PCBs of the current processes is in:
A: Process Table
B: Process Register
C: Program Counter
D: Process Unit

A

A: Process Table

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

A process is selected from the –?– queue by the –?– scheduler, to be executed.
A: ready, long term
B: wait, long term
C: ready, short term
D: blocked, short term

A

C: ready, short term

101
Q

In the Zero capacity queue:
A: none of the mentioned
B: the queue can store at least one message
C: the sender blocks until the receiver receives the message
D: the sender keeps sending and the messages don’t wait in the queue

A

C: the sender blocks until the receiver receives the message

102
Q

What is principle of least privilege?
A: None of the mentioned
B: Users should be given just enough privileges to perform their tasks
C: Users can get temporary high privilege access
D: Less privileges provide difficulty in executing admin tasks

A

B: Users should be given just enough privileges to perform their tasks

103
Q

In the following cases non – preemptive scheduling occurs:
A: When a process switches from the waiting state to the ready state
B: When a process switches from the running state to the ready state
C: When a process goes from the running state to the waiting state
D: All of the mentioned

A

C: When a process goes from the running state to the waiting state

104
Q

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

A

B: holds the only copy of the data

105
Q

The UNIX sytem uses a/an –?– stored at the beginning of a some files to indicate roughly the type of file.
A: identifier
B: virtual number
C: extension
D: magic number

A

D: magic number

106
Q

In Unix, Which system call creates the new process?
A: create
B: fork
C: new
D: none of the mentioned

A

B: fork

107
Q

A process can be terminated due to:
A: all of the mentioned
B: normal exit
C: fatal error
D: killed by another process

A

A: all of the mentioned

108
Q

Virtual memory is normally implemented by:
A: demand paging
B: buses
C: virtualization
D: all of the mentioned

A

A: demand paging

109
Q

A locality is:
A: none of the mentioned
B: a set of pages that are actively used together
C: an area near a set of processes
D: a space in memory

A

B: a set of pages that are actively used together

110
Q

A file being read or written sequentially should not have its pages replaced in LRU order, because:
A: it is not efficient
B: the most recently used page will be used last
C: all of the mentioned
D: it is very costly

A

B: the most recently used page will be used last

111
Q

In a multiprogramming environment:
A: the programs are developed by more than one person
B: the processor executes more than one process at a time
C: more than one process resides in the memory
D: a single user can execute many programs at the same time

A

C: more than one process resides in the memory

112
Q

The FCFS algorithm is particularly troublesome for:
A: multiprogramming systems
B: operating systems
C: multiprocessor systems
D: time sharing systems

A

A: multiprogramming systems

113
Q

Who can add new rights and remove some rights?
A: owner
B: transfer
C: limited copy
D: copy

A

A: owner

114
Q

Global table implementation of matrix table contains:
A: object
B: domain
C: all of the mentioned
D: right-set

A

C: all of the mentioned

115
Q

To avoid deadlock:
A: inversion technique can be used
B: resource allocation must be done only once
C: all deadlocked processes must be aborted
D: there must be a fixed number of resources to allocate

A

D: there must be a fixed number of resources to allocate

116
Q

For effective operating system, when to check for deadlock?
A: every time a resource request is made
B: none of the mentioned
C: at fixed time intervals
D: every time a resource request is made at fixed time intervals

A

D: every time a resource request is made at fixed time intervals

117
Q

When a user job starts in a two level directory system, or a user logs in:
A: the master file directory is indexed by user name or account number, and each entry points to the UFD for that user
B: the users user file directory is searched
C: the system’s master file directory is not searched
D: all of the mentioned

A

A: the master file directory is indexed by user name or account number, and each entry points to the UFD for that user

118
Q

The usual effect of abnormal termination of a program is:
A: signal destruction
B: system crash
C: core dump file generation
D: program switch

A

C: core dump file generation

119
Q

The solution to the problem of reliability is the introduction of:
A: scheduling
B: disks
C: redundancy
D: aging

A

C: redundancy

120
Q

Programmers code at the –?– level.
A: source
B: load
C: object
D: machine

A

A: source

121
Q

Interfaces and control units execute:
A: object-level commands
B: machine-level commands
C: none of the mentioned
D: primitive commands

A

D: primitive commands

122
Q

An I/O port typically consists of four registers status, control, –?– and –?– registers.
A: data in, data out
B: flow in, flow out
C: input, output
D: system in, system out

A

A: data in, data out

123
Q

For system protection, a process should access:
A: all of the mentioned
B: all the resources
C: only those resources for which it has authorization
D: few resources but authorization is not required

A

C: only those resources for which it has authorization

124
Q

Contiguous allocation has two problems –?– and –?– that linked allocation solves.
A: internal – fragmentation & external – fragmentation
B: size – declaration & internal – fragmentation
C: external – fragmentation & size – declaration
D: memory – allocation & size – declaration

A

C: external – fragmentation & size – declaration

125
Q

Division by zero, accessing a protected or non existent memory address, or attempting to execute a privileged instruction from user mode are all categorized as:
A: errors
B: exceptions
C: all of the mentioned
D: interrupt handlers

A

B: exceptions

126
Q

For any type of access, contiguous allocation requires –?– access to get a disk block.
A: exactly two
B: at least two
C: only one
D: none of the mentioned

A

C: only one

127
Q

A terminated transaction that has completed its execution successfully is –?– otherwise it is –?–
A: committed, destroyed
B: aborted, destroyed
C: committed, aborted
D: none of the mentioned

A

C: committed, aborted

128
Q

The –?– becomes the name of the root of the newly mounted directory.
A: root of the previous directory
B: local directory
C: none of the mentioned
D: remote directory itself

A

B: local directory

129
Q

Given a start of file address, the location of any given record can be computed from its:
A: source structure
B: relative record number
C: data object
D: key

A

B: relative record number

130
Q

The number of the threads in the pool can be decided on factors such as:
A: all of the mentioned
B: number of CPUs in the system
C: amount of physical memory
D: expected number of concurrent client requests

A

A: all of the mentioned

131
Q

If working set window is too large:
A: it will cause memory problems
B: none of the mentioned
C: it will not encompass entire locality
D: it may overlap several localities

A

D: it may overlap several localities

132
Q

The undo and redo operations must be –?– to guarantee correct behaviour, even if a failure occurs during recovery process.
A: easy
B: idempotent
C: all of the mentioned
D: protected

A

B: idempotent

133
Q

A process is moved to wait queue when I/O request is made with:
A: non-blocking I/O
B: blocking I/O
C: asynchronous I/O
D: synchronous I/O

A

B: blocking I/O

134
Q

The disadvantage of real addressing mode is:
A: time consumption overhead
B: absence of memory protection between processes
C: there is a lot of cost involved
D: restricted access to memory locations by processes

A

B: absence of memory protection between processes

135
Q

Under –?– memory management, only active portions of a program are actually stored in main memory.
A: dynamic
B: fragmented
C: virtual
D: fixed-partition

A

C: virtual

136
Q

Semaphores are mostly used to implement:
A: None of the mentioned
B: System calls
C: System protection
D: IPC mechanisms

A

D: IPC mechanisms

137
Q

The direct access method is based on a –?– model of a file, as –?– allow random access to any file block.
A: tape, disks
B: tape, tapes
C: disk, disks
D: magnetic tape, magnetic tapes

A

C: disk, disks

138
Q

On most computers, a peripheral establishes communication with the opening system by sending:
A: a command
B: a request
C: a protocol signal
D: an interrupt

A

D: an interrupt

139
Q

In a multi level directory structure:
A: none of the mentioned
B: the subdirectories do not need protection once the directory is protected
C: a mechanism for directory protection will have to applied
D: the same previous techniques will be used as in the other structures

A

C: a mechanism for directory protection will have to applied

140
Q

The offset ‘d’ of the logical address must be:
A: between 0 and the segment number
B: greater than the segment number
C: between 0 and segment limit
D: greater than segment limit

A

C: between 0 and segment limit

141
Q

In domain structure what is Access-right equal to?
A: Access-right = read-name, write-set
B: Access-right = object-name, execute-set
C: Access-right = read-name, execute-set
D: Access-right = object-name, rights-set

A

D: Access-right = object-name, rights-set

142
Q

The One to One model allows:
A: increased concurrency
B: increased or decreased concurrency
C: decreased concurrency
D: concurrency equivalent to other models

A

A: increased concurrency

143
Q

Which of the following is the drawback of the One to One Model?
A: decreased concurrency provided by this model
B: creating a user thread requires creating the corresponding kernel thread
C: creating so many threads at once can crash the system
D: increased concurrency provided by this model

A

B: creating a user thread requires creating the corresponding kernel thread

144
Q

In a programmed input/output(PIO):
A: the CPU runs a user written code and does accordingly
B: the CPU receives an interrupt when the device is ready for the next byte
C: the CPU uses polling to watch the control bit constantly, looping to see if device is ready
D: the CPU writes one data byte to the data register and sets a bit in control register to show that a byte is available

A

C: the CPU uses polling to watch the control bit constantly, looping to see if device is ready

145
Q

The maximum number of frames per process is defined by:
A: instruction set architecture
B: none of the mentioned
C: operating System
D: the amount of available physical memory

A

D: the amount of available physical memory

146
Q

The Process Control Block is:
A: A secondary storage section
B: Data Structure
C: A Block in memory
D: Process type variable

A

B: Data Structure

147
Q

Which of the following system calls transforms executable binary file into a process?
A: longjmp
B: fork
C: exec
D: ioctl

A

C: exec

148
Q

The portion of the process scheduler in an operating system that dispatches processes is concerned with:
A: all of the mentioned
B: assigning ready processes to waiting queue
C: assigning running processes to blocked queue
D: assigning ready processes to CPU

A

D: assigning ready processes to CPU

149
Q

Which module gives control of the CPU to the process selected by the short-term scheduler?
A: interrupt
B: dispatcher
C: none of the mentioned
D: scheduler

A

B: dispatcher

150
Q

The disk bandwidth is:
A: the total number of bytes transferred divided by the total time between the first request for service and the completion on the last transfer
B: the total number of bytes transferred
C: total time between the first request for service and the completion on the last transfer
D: none of the mentioned

A

A: the total number of bytes transferred divided by the total time between the first request for service and the completion on the last transfer

151
Q

Which of the following objects require protection?
A: Memory
B: All of the mentioned
C: Monitor
D: Power supply unit

A

A: Memory

152
Q

The kernel is –?– of user threads.
A: unaware of
B: a part of
C: aware of
D: the creator of

A

A: unaware of

153
Q

The objective of multiprogramming is to:
A: To minimize CPU utilization
B: None of the mentioned
C: Have multiple programs waiting in a queue ready to run
D: Have some process running at all times

A

D: Have some process running at all times

154
Q

The major disadvantage with linked allocation is that:
A: there is no sequential access
B: external fragmentation
C: there is only sequential access
D: internal fragmentation

A

C: there is only sequential access

155
Q

Thrashing –?– the CPU utilization.
A: increases
B: none of the mentioned
C: keeps constant
D: decreases

A

D: decreases

156
Q

The first process launched by the linux kernel is:
A: init process
B: boot process
C: zombie process
D: batch process

A

A: init process

157
Q

To –?– to a safe state, the system needs to keep more information about the states of processes.
A: none of the mentioned
B: queue the process
C: roll back the process
D: abort the process

A

C: roll back the process

158
Q

If the semaphore value is negative:
A: no operation can be further performed on it until the signal operation is performed on it
B: none of the mentioned
C: it is invalid
D: its magnitude is the number of processes waiting on that semaphore

A

D: its magnitude is the number of processes waiting on that semaphore

159
Q

Which system call returns the process identifier of a terminated child?
A: get
B: fork
C: wait
D: exit

A

C: wait

160
Q

Which one of the following is not an attack, but a search for vulnerabilities to attack?
A: denial of service
B: memory access violation
C: dumpster diving
D: port scanning

A

D: port scanning

161
Q

When the memory allocated to a process is slightly larger than the process, then:
A: internal fragmentation occurs
B: external fragmentation occurs
C: neither internal nor external fragmentation occurs
D: both internal and external fragmentation occurs

A

A: internal fragmentation occurs

162
Q

When a file system is mounted over a directory that is not empty:
A: the system may allow the mount and the directory’s existing files will then be made obscure
B: the system may not allow the mount
C: the system must allow the mount
D: all of the mentioned

A

A: the system may allow the mount and the directory’s existing files will then be made obscure

163
Q

The first fit and best fit algorithms suffer from:
A: external fragmentation
B: all of the mentioned
C: starvation
D: internal fragmentation

A

A: external fragmentation

164
Q

The –?– determines the cause of the interrupt, performs the necessary processing and executes a return from the interrupt instruction to return the CPU to the execution state prior to the interrupt.
A: all of the mentioned
B: interrupt request line
C: interrupt handler
D: device driver

A

C: interrupt handler

165
Q

The –?– can be turned off by the CPU before the execution of critical instruction sequences that must not be interrupted.
A: nonmaskable interrupt
B: blocked interrupt
C: none of the mentioned
D: maskable interrupt

A

D: maskable interrupt

166
Q

An unrecoverable error is known as:
A: soft error
B: none of the mentioned
C: hard error
D: tough error

A

C: hard error

167
Q

In UNIX, the –?– system call is used to send a signal.
A: sig
B: kill
C: sigsend
D: send

A

B: kill

168
Q

Swapping –?– be done when a process has pending I/O, or has to execute I/O operations only into operating system buffers.
A: must
B: can
C: must never
D: maybe

A

C: must never

169
Q

In contiguous memory allocation:
A: the memory space is contiguous
B: all processes are contained in a single contiguous section of memory
C: none of the mentioned
D: each process is contained in a single contiguous section of memory

A

D: each process is contained in a single contiguous section of memory

170
Q

In most cases, if a process is sent a signal while it is executing a system call:
A: the system call is interrupted by the signal, and the signal handler comes in
B: the signal has no effect until the system call completes
C: the system call will continue execution and the signal will be ignored completely
D: none of the mentioned

A

B: the signal has no effect until the system call completes

171
Q

By operating system, the resource management can be done via:
A: space division multiplexing
B: none of the mentioned
C: both time and space division multiplexing
D: time division multiplexing

A

C: both time and space division multiplexing

172
Q

Which file is a sequence of bytes organized into blocks understandable by the system’s linker?
A: executable file
B: object file
C: source file
D: text file

A

B: object file

173
Q

If two routines each control a resource needed by the other and neither is willing to give in, –?– can occur.
A: an interrupt
B: deadlock
C: a race condition
D: a time-slice

A

B: deadlock

174
Q

For a direct access file:
A: there are no restrictions on the order of reading and writing
B: access is not restricted permission wise
C: there are restrictions on the order of reading and writing
D: access is restricted permission wise

A

A: there are no restrictions on the order of reading and writing

175
Q

On a mainframe, device-dependent I/O functions are assigned to:
A: a control unit
B: an interface
C: a buffer
D: a channel

A

D: a channel

176
Q

By –?– data (storing several logical records in a single block sector), disk space can be better utilized.
A: encoding
B: encrypting
C: compressing
D: blocking

A

D: blocking

177
Q

One problem with the global replacement algorithm is that:
A: a process cannot control its own page – fault rate
B: it is very expensive
C: many frames can be allocated to a process
D: only a few frames can be allocated to a process

A

A: a process cannot control its own page – fault rate

178
Q

The hardware mechanism that allows a device to notify the CPU is called:
A: driver
B: interrupt
C: polling
D: controlling

A

B: interrupt

179
Q

I/O is a –?– in system performance.
A: none of the mentioned
B: does not matter
C: minor factor
D: major factor

A

D: major factor

180
Q

In UNIX, domain switch is accomplished via:
A: file system
B: superuser
C: user
D: none of the mentioned

A

A: file system

181
Q

If a process fails, most operating system write the error information to a:
A: new file
B: another running process
C: log file
D: none of the mentioned

A

C: log file

182
Q

For sharable resources, mutual exclusion:
A: is required
B: is not required
C: may be or may not be required
D: none of the mentioned

A

B: is not required

183
Q

By preallocating the inodes and spreading them across the volume, we –?– the system performance.
A: decrease
B: improve
C: maintain
D: do not affect

A

B: improve

184
Q

To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it:
A: the process resumes execution without the resource being allocated to it
B: then the process waits for the resources be allocated to it
C: then all resources currently being held are preempted
D: the process keeps sending requests until the resource is allocated to it

A

C: then all resources currently being held are preempted

185
Q

The –?– is used as an index into the page table.
A: frame bit
B: frame offset
C: page offset
D: page number

A

D: page number

186
Q

The main memory accommodates:
A: user processes
B: all of the mentioned
C: operating system
D: cpu

A

C: operating system

187
Q

The data-in register of I/O port is:
A: Read by host to get input
B: Written by host to start a command
C: Written by host to send output
D: Read by controller to get input

A

A: Read by host to get input

188
Q

Termination of the process terminates:
A: no thread within the process
B: first thread of the process
C: all threads within the process
D: first two threads of the process

A

C: all threads within the process

189
Q

Which of the following is least secure method of authentication?
A: Password
B: retina pattern
C: fingerprint
D: Key card

A

A: Password

190
Q

Resource sharing helps:
A: an application have several different threads of activity all within the same address space
B: reduce the address space that a process could potentially use
C: all of the mentioned
D: share the memory and resources of the process to which the threads belong

A

C: all of the mentioned

191
Q

The initial program that is run when the computer is powered up is called:
A: boot program
B: initializer
C: bootstrap program
D: bootloader

A

C: bootstrap program

192
Q

The device-status table contains:
A: each I/O device address
B: each I/O device type
C: all of the mentioned
D: each I/O device state

A

C: all of the mentioned

193
Q

All the changes that were done from a transaction that did not commit before the system crashed, have to be:
A: none of the mentioned
B: saved
C: saved and the transaction redone
D: undone

A

D: undone

194
Q

Scheduling is done so as to:
A: increase the duration of a specific amount of work
B: None of the mentioned
C: decrease the throughput
D: increase the throughput

A

D: increase the throughput

195
Q

In paged memory systems, if the page size is increased, then the internal fragmentation generally:
A: remains constant
B: becomes more
C: becomes less
D: none of the mentioned

A

B: becomes more

196
Q

For each file there exists a –?– that contains information about the file, including ownership, permissions and location of the file contents.
A: process control block
B: metadata
C: file control block
D: all of the mentioned

A

C: file control block

197
Q

Indexed allocation –?– direct access.
A: none of the mentioned
B: is not related to
C: supports
D: does not support

A

C: supports

198
Q

The –?– consists of all processes whose memory images are in the backing store or in memory and are ready to run.
A: ready queue
B: secondary storage
C: wait queue
D: cpu

A

A: ready queue

199
Q

If no process is suspended, the signal operation:
A: suspends some default process’ execution
B: the output is unpredictable
C: puts the system into a deadlock state
D: nothing happens

A

D: nothing happens

200
Q

‘Aging’ is:
A: keeping track of how many times a given page is referenced
B: keeping track of what pages are currently residing in memory
C: keeping track of cache contents
D: increasing the priority of jobs to ensure termination in a finite time

A

D: increasing the priority of jobs to ensure termination in a finite time

201
Q

What are features of a tripwire file system?
A: It is used to secure UNIX system
B: None of the mentioned
C: It is a tool to monitor file systems
D: It is used to automatically take corrective action

A

C: It is a tool to monitor file systems

202
Q

The system periodically performs checkpoints that consists of the following operation(s):
A: Putting all the log records currently in main memory onto stable storage
B: putting all modified data residing in main memory onto stable storage
C: all of the mentioned
D: putting a log record onto stable storage

A

C: all of the mentioned

203
Q

The access method is added to the program load module by the:
A: linkage editor
B: compiler
C: internal component
D: programmer

A

A: linkage editor

204
Q

Restricting the child process to a subset of the parent’s resources prevents any process from:
A: overloading the system by using a lot of secondary storage
B: overloading the system by creating a lot of sub-processes
C: under-loading the system by very less CPU utilization
D: crashing the system by utilizing multiple resources

A

B: overloading the system by creating a lot of sub-processes

205
Q

The real disadvantage of a linear list of directory entries is the:
A: size of the linear list in memory
B: all of the mentioned
C: linear search to find a file
D: it is not reliable

A

C: linear search to find a file

206
Q

The atomic operation permissible on semaphores are:
A: none of the mentioned
B: wait
C: hold
D: stop

A

B: wait

207
Q

During recovery from a failure:
A: each pair of physical block is examined
B: first pair of physical block is examined
C: none of the mentioned
D: specified pair of physical block is examined

A

A: each pair of physical block is examined

208
Q

A process stack does not contain:
A: PID of child process
B: Return addresses
C: Function parameters
D: Local variables

A

A: PID of child process

209
Q

Protection is only provided at the –?– level.
A: lower
B: higher
C: none of the mentioned
D: central

A

A: lower

210
Q

Mutual exclusion implies that:
A: if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution
B: if a process is executing in its critical section, then no other process must be executing in their critical sections
C: none of the mentioned
D: if a process is executing in its critical section, then other processes must be executing in their critical sections

A

B: if a process is executing in its critical section, then no other process must be executing in their critical sections

211
Q

What are common security threats?
A: File sharing and permission
B: File integrity
C: File shredding and integrity
D: File Shredding

A

A: File sharing and permission

212
Q

What is a trap/exception?
A: none of the mentioned
B: user generated interrupt caused by an error
C: software generated interrupt caused by an error
D: hardware generated interrupt caused by an error

A

C: software generated interrupt caused by an error

213
Q

Mutual exclusion can be provided by the:
A: both mutex locks and binary semaphores
B: binary semaphores
C: none of the mentioned
D: mutex locks

A

A: both mutex locks and binary semaphores

214
Q

The scheduler admits a process using:
A: admission control algorithm
B: busy wait polling
C: two phase locking protocol
D: none of the mentioned

A

B: busy wait polling

215
Q

Instead of starting a new thread for every task to execute concurrently, the task can be passed to a:
A: none of the mentioned
B: thread queue
C: process
D: thread pool

A

D: thread pool

216
Q

What is breach of confidentiality?
A: This violation involves unauthorized destruction of data
B: This type of violation involves unauthorized reading of data
C: This violation involves unauthorized modification of data
D: This violation involves unauthorized use of resources

A

B: This type of violation involves unauthorized reading of data

217
Q

Which direction access cannot happen using DMZ zone by default?
A: Internet to DMZ
B: Company computer to DMZ
C: Internet to company computer
D: Company computer to internet

A

C: Internet to company computer

218
Q

In UNIX, exactly which operations can be executed by group members and other users is definable by:
A: the group’s head
B: the file’s permissions
C: all of the mentioned
D: the file’s owner

A

D: the file’s owner

219
Q

The implementation of the LFU and the MFU algorithm is very uncommon because:
A: they are too complicated
B: all of the mentioned
C: they are expensive
D: they are optimal

A

C: they are expensive

220
Q

When a page is selected for replacement, and its modify bit is set:
A: the page is dirty
B: the page has been modified since it was read in from the disk & page is dirty
C: the page is clean
D: the page has been modified since it was read in from the disk

A

B: the page has been modified since it was read in from the disk & page is dirty

221
Q

A swap space can reside in:
A: None of the mentioned
B: RAM
C: Cache
D: Separate disk partition

A

D: Separate disk partition

222
Q

An SJF algorithm is simply a priority algorithm where the priority is:
A: the inverse of the predicted next CPU burst
B: the predicted next CPU burst
C: anything the user wants
D: the current CPU burst

A

B: the predicted next CPU burst

223
Q

A process –?– lower the priority of another process, if both are owned by the same owner.
A: none of the mentioned
B: cannot
C: can
D: must

A

C: can

224
Q

In the Many to One model, multiple threads are unable to run in parallel on multiprocessors because:
A: only one thread can access the kernel at a time
B: many user threads have access to just one kernel thread
C: none of the mentioned
D: there is only one kernel thread

A

A: only one thread can access the kernel at a time

225
Q

What is known as sandbox?
A: It is a program which can be molded to do desired task
B: It is a special mode of antivirus
C: None of the mentioned
D: It is program that is controlled or emulated section of OS

A

D: It is program that is controlled or emulated section of OS

226
Q

Which one of the following connects high-speed high-bandwidth device to memory subsystem and CPU.
A: None of the mentioned
B: SCSI bus
C: PCI bus
D: Expansion bus

A

D: Expansion bus

227
Q

What is breach of integrity?
A: This violation involves unauthorized use of resources
B: This violation involves unauthorized modification of data
C: This type of violation involves unauthorized reading of data
D: This violation involves unauthorized destruction of data

A

B: This violation involves unauthorized modification of data

228
Q

–?– replacement allows a process to select a replacement frame from the set of all frames, even if the frame is currently allocated to some other process.
A: Universal
B: Local
C: Public
D: Global

A

D: Global

229
Q

In FIFO page replacement algorithm, when a page must be replaced:
A: random page is chosen
B: none of the mentioned
C: newest page is chosen
D: oldest page is chosen

A

D: oldest page is chosen

230
Q

What is compaction?
A: a technique for overcoming external fragmentation
B: a technique for overcoming fatal error
C: a technique for overcoming internal fragmentation
D: a paging technique

A

A: a technique for overcoming external fragmentation

231
Q

To ensure that the hold and wait condition never occurs in the system, it must be ensured that:
A: each process must request and be allocated all its resources before it begins its execution
B: a process can request resources only when it has none
C: all of the mentioned
D: whenever a resource is requested by a process, it is not holding any other resources

A

C: all of the mentioned

232
Q

The two kinds of semaphores are:
A: mutex & counting
B: binary & counting
C: counting & decimal
D: decimal & binary

A

B: binary & counting

233
Q

RAID level 1 refers to:
A: disk arrays with striping
B: disk mirroring
C: none of the mentioned
D: both disk arrays with striping and disk mirroring

A

B: disk mirroring

234
Q

The protection bit is 0/1 based on:
A: read – write
B: read only
C: none of the mentioned
D: write only

A

A: read – write

235
Q

The data structure for a sector typically contains:
A: header
B: trailer
C: data area
D: all of the mentioned

A

D: all of the mentioned

236
Q

A system is in the safe state if:
A: none of the mentioned
B: all of the mentioned
C: there exist a safe sequence
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

237
Q

The –?– is used by device controllers to request service.
A: blocked interrupt
B: maskable interrupt
C: nonmaskable interrupt
D: none of the mentioned

A

B: maskable interrupt

238
Q

The –?– are reserved for events such as unrecoverable memory errors.
A: maskable interrupts
B: none of the mentioned
C: blocked interrupts
D: non maskable interrupts

A

D: non maskable interrupts

239
Q

Most modern operating systems include:
A: file management
B: all of the mentioned
C: processor management
D: memory management

A

B: all of the mentioned

240
Q

The Zero Capacity queue:
A: none of the mentioned
B: is referred to as a message system with buffering
C: is referred to as a link
D: is referred to as a message system with no buffering

A

D: is referred to as a message system with no buffering

241
Q

To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. For implementing dynamic loading:
A: special support from both hardware and operating system is essential
B: user programs can implement dynamic loading without any special support from hardware or operating system
C: special support from operating system is essential
D: special support from hardware is required

A

B: user programs can implement dynamic loading without any special support from hardware or operating system

242
Q

When we write something on the disk, which one of the following can not happen?
A: successful completion
B: none of the mentioned
C: total failure
D: partial failure

A

B: none of the mentioned

243
Q

Which one of the following can not be scheduled by the kernel?
A: user level thread
B: kernel level thread
C: none of the mentioned
D: process

A

A: user level thread

244
Q

–?– replacement allows each process to only select from its own set of allocated frames.
A: Local
B: Public
C: Universal
D: Global

A

A: Local

245
Q

Associated with every interrupt is an identification number called a(n):
A: interrupt ID
B: interrupt description number
C: IDT
D: vector

A

D: vector

246
Q

What is the problem of mutually suspicious subsystem?
A: Service program can malfunction and retain some rights of data provided by user
B: Calling program gets unrestricted access
C: Calling program can get access to restricted portion from service program
D: Service program can steal users data

A

A: Service program can malfunction and retain some rights of data provided by user

247
Q

A problem encountered in multitasking when a process is perpetually denied necessary resources is called:
A: deadlock
B: starvation
C: aging
D: inversion

A

B: starvation

248
Q

The segment of code in which the process may change common variables, update tables, write into files is known as:
A: non – critical section
B: synchronizing
C: critical section
D: program

A

C: critical section

249
Q

In a memory mapped input/output:
A: the CPU writes one data byte to the data register and sets a bit in control register to show that a byte is available
B: the CPU receives an interrupt when the device is ready for the next byte
C: the CPU uses polling to watch the control bit constantly, looping to see if device is ready
D: the CPU runs a user written code and does accordingly

A

A: the CPU writes one data byte to the data register and sets a bit in control register to show that a byte is available

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