Csse 1502
Quiz by , created more than 1 year ago

Operating Systems (OS) Quiz on os, created by Csse 1502 on 17/12/2017.

1526
14
0
Csse 1502
Created by Csse 1502 over 6 years ago
Close

os

Question 1 of 200

1

What is not a main structural element of a computer system?

Select one of the following:

  • Processor

  • Main Memory

  • I/O Modules

  • System Bus

  • Operating system

Explanation

Question 2 of 200

1

Which of the following registers are used by the processor to exchange data with memory?

Select one of the following:

  • MAR and MBR

  • PC and IR

  • Program status word

  • I/OAR and I/OBR

Explanation

Question 3 of 200

1

Which of the following registers are used by the processor to exchange data with input/output module?

Select one of the following:

  • MAR and MBR

  • PC and IR

  • Program status word

  • I/OAR and I/OBR

Explanation

Question 4 of 200

1

Which of the following element of a computer system controls the operation of the computer and performs its data processing functions?

Select one of the following:

  • System bus

  • Main memory

  • I/O modules

  • Processor

Explanation

Question 5 of 200

1

Which of the following element of a computer system stores data and programs?

Select one of the following:

  • Main memory

  • System bus

  • Processor

  • I/O modules

Explanation

Question 6 of 200

1

Which of the following provides for communication among elements of a computer system?

Select one of the following:

  • Main memory

  • System bus

  • Processor

  • I/O modules

Explanation

Question 7 of 200

1

Which of the following element of a computer system moves data between the computer and its external environment?

Select one of the following:

  • Main memory

  • Processor

  • System bus

  • I/O modules

Explanation

Question 8 of 200

1

The processor contains a single data register, called

Select one of the following:

  • PSW

  • PC

  • IR

  • AC

Explanation

Question 9 of 200

1

This register specifies a particular input/output device

Select one of the following:

  • Memory address register

  • I/OAR

  • Memory buffer register

  • I/OBR

Explanation

Question 10 of 200

1

This register is used for the exchange of data between an I/O module and the processor

Select one of the following:

  • Memory address register

  • I/OAR

  • Memory buffer register

  • I/OBR

Explanation

Question 11 of 200

1

This register contains the data to be written into memory or which receives the data read from memory

Select one of the following:

  • I/OAR

  • memory buffer register

  • memory address register

  • I/OBR

Explanation

Question 12 of 200

1

This register specifies the location in memory for the next read or write

Select one of the following:

  • Memory address register

  • I/OAR

  • Memory buffer register

  • I/OBR

Explanation

Question 13 of 200

1

Index register, segment register, and stack register are example of:

Select one of the following:

  • Address register

  • Data registers

  • Control registers

  • Status registers

Explanation

Question 14 of 200

1

Which register contains the address of the next instruction to be fetched?

Select one of the following:

  • instruction register

  • execution register

  • program counter

  • process counter

Explanation

Question 15 of 200

1

Which register contains the instruction most recently fetched?

Select one of the following:

  • instruction register

  • execution register

  • program counter

  • process counter

Explanation

Question 16 of 200

1

Which register contains condition codes set by the processor hardware as the result of operations?

Select one of the following:

  • Program counter

  • Accumulator

  • Program status word

  • Stack pointer

Explanation

Question 17 of 200

1

The fetched instruction is loaded into the

Select one of the following:

  • IR

  • Accumulator

  • Memory

  • PC

Explanation

Question 18 of 200

1

At the beginning of each instruction cycle, the processor fetches an instruction from the memory. The address of the instruction is held in

Select one of the following:

  • IR

  • MBR

  • MAR

  • PC

Explanation

Question 19 of 200

1

The processor is executing ‘Load AC from memory’ instruction. Choose the correct micro-instructions:

Select one of the following:

  • PC -> MAR
    M -> MBR
    MBR -> AC
    IR -> MAR
    M -> MBR
    MBR -> AC

  • PC -> MBR
    M -> MAR
    MAR -> IR
    IR -> MAR
    M -> MBR
    MBR -> AC

  • PC -> MAR
    M -> MBR
    MBR -> IR
    IR -> MAR
    M -> MBR
    MBR -> AC

  • PC -> MAR
    M -> MBR
    MBR -> IR
    IR -> MBR
    M -> MAR
    MAR -> AC

Explanation

Question 20 of 200

1

When an I/O device completes an I/O operation, the device issues an interrupt signal to the processor and then:

Select one of the following:

  • The processor stops execution of the current instruction without finishing it and responds to the interrupt

  • The processor loads the program counter with the entry location of the interrupt-handling routine

  • The processor saves information needed to resume the current program at the point if interrupt

  • The processor finishes execution of the current instruction before responding to the interrupt

Explanation

Question 21 of 200

1

When the time required for the I/O operation is less that the time to complete the execution of instructions between write operations in the user program, it is:

Select one of the following:

  • Fast I/O wait

  • Slow I/O wait

  • Long I/O wait

  • Short I/O wait

Explanation

Question 22 of 200

1

When the time required for the I/O operation will take much more time than executing a sequence of user instructions, it is

Select one of the following:

  • Slow I/O wait

  • Long I/O wait

  • Fast I/O wait

  • Short I/O wait

Explanation

Question 23 of 200

1

Most I/O devices are:

Select one of the following:

  • much slower than the processor

  • much faster than the processor

  • much shorter than the processor

  • much longer than the processor

Explanation

Question 24 of 200

1

If there no interrupts, after each write operation, the processor must

Select one of the following:

  • Load new PC value

  • Finish execution of current instruction

  • Save the PSW and PC onto control stack

  • Pause and remain idle until the I/O operation finishes

Explanation

Question 25 of 200

1

Complete the relationship concerning the memory systems: faster access time –

Select one of the following:

  • lower capacity

  • greater cost per bit

  • faster access speed

  • smaller cost per bit

Explanation

Question 26 of 200

1

Complete the relationship concerning the memory systems: greater capacity –

Select one of the following:

  • lower capacity

  • greater cost per bit

  • faster access speed

  • smaller cost per bit

Explanation

Question 27 of 200

1

Complete the relationship concerning the memory systems: greater capacity –

Select one of the following:

  • lower capacity

  • slower access time

  • greater cost per bit

  • faster access speed

Explanation

Question 28 of 200

1

The smaller, more expensive, faster memory is:

Select one of the following:

  • Disk drive

  • Cache

  • Main memory

  • Register

Explanation

Question 29 of 200

1

If the accessed word is found in the faster memory, that is defined as a:

Select one of the following:

  • bingo

  • win

  • hit

  • evrika

Explanation

Question 30 of 200

1

If the accessed word is not found in the faster memory, that is defined as a:

Select one of the following:

  • ricochet

  • miss

  • zero

  • Loss

Explanation

Question 31 of 200

1

The central idea in this system was the use of a piece of software known as the monitor

Select one of the following:

  • Time-sharing-system

  • Simple batch system

  • Multiprogrammed batch system

  • Serial processing

Explanation

Question 32 of 200

1

The concept of a batch operating system was developed to

Select one of the following:

  • Maximize processor utilization (To improve utilization)

  • Minimize response time

  • Support interactive mode

  • Minimize processor utilization

Explanation

Question 33 of 200

1

The concept of modes of operation (user mode, system mode) was introduced with

Select one of the following:

  • Time-sharing-system

  • Simple batch system

  • Multiprogrammed batch system

  • Serial processing

Explanation

Question 34 of 200

1

'Ease of evolution of an OS' corresponds to the following objective:

Select one of the following:

  • Efficiency

  • Convenience

  • Ability to evolve

Explanation

Question 35 of 200

1

The principal objective of the time-sharing system is to

Select one of the following:

  • Minimize response time

  • Minimize processor utilization

  • Maximize response time

  • Maximize processor utilization

Explanation

Question 36 of 200

1

The processor was often idle waiting for the I/O instruction to conclude. To overcome the problem the following approach was introduced: when one job needs to wait for I/O, the processor can switch to the other job. This was a

Select one of the following:

  • Multiprogramming or multitasking batch system

  • Simple batch system

  • Serial processing

  • Time-sharing-system

Explanation

Question 37 of 200

1

The programmer interacted directly with the computer hardware with

Select one of the following:

  • Simple batch systems

  • Serial processing

  • Time-sharing-systems

  • Multiprogrammed batch systems

Explanation

Question 38 of 200

1

Semaphore is a/an_to solve the critical section problem?

Select one of the following:

  • integer variable

  • special program for a system

  • complex structure

  • hardware for a system

Explanation

Question 39 of 200

1

'The OS as a resource manager' corresponds to the following objective:

Select one of the following:

  • Efficiency

  • Convenience

  • Ability to evolve

Explanation

Question 40 of 200

1

An un-interruptible unit is known as:

Select one of the following:

  • atomic

  • none of the above

  • static

  • single

Explanation

Question 41 of 200

1

A state is safe, if:

Select one of the following:

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

  • the system does not crash due to deadlock occurrence

  • all of the above

  • the state keeps the system protected and safe

Explanation

Question 42 of 200

1

'The OS as a User/Computer interface' corresponds to the following objective:

Select one of the following:

  • Efficiency

  • Convenience

  • Ability to evolve

Explanation

Question 43 of 200

1

This type of memory is nonvolatile

Select one of the following:

  • Secondary memory

  • Main memory

  • Register

  • Cache

Explanation

Question 44 of 200

1

An application programs is developed by the

Select one of the following:

  • Application programmer

  • End user

  • Operating system

  • Hardware

Explanation

Question 45 of 200

1

When a processor attempts to read a byte or word of memory, it firstly checks the:

Select one of the following:

  • Secondary memory

  • Register

  • Cache

  • Main memory

Explanation

Question 46 of 200

1

The end user views a computer system in terms of

Select one of the following:

  • a set of applications

  • a set of machine instructions

  • utilities

  • a set of system programs

Explanation

Question 47 of 200

1

The serial processing presented two main problems:

Select one or more of the following:

  • setup time

  • using a monitor

  • time slicing

  • multiprogramming

  • scheduling

Explanation

Question 48 of 200

1

The hardware and software used in providing applications to a user can be viewed in a:

Select one of the following:

  • layered fashion

  • classified fashion

  • sandwich fashion

  • leveled fashion

Explanation

Question 49 of 200

1

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:

Select one of the following:

  • data consistency

  • mutual exclusion

  • race condition

  • starvation

Explanation

Question 50 of 200

1

This contains the most frequently used functions in the OS:

Select one of the following:

  • Kernel (или nucleus)

  • Centre

  • Base

  • Root

Explanation

Question 51 of 200

1

The initial value of the semaphore that allows only one of the many processes to enter their critical sections,is?

Select one of the following:

  • 1

  • 10

  • 2

  • 0

Explanation

Question 52 of 200

1

Utilities are

Select one of the following:

  • Application program

  • System programs

  • Opcodes

  • Processor registers

Explanation

Question 53 of 200

1

Block size is:

Select one or more of the following:

  • The unit of data exchanged between cache and main memory

  • Larger block size yields more hits until probability of using newly fetched data becomes less than the probability of reusing data that have to be moved out of cache

  • (How much data should be transferred from main memory to cache)

Explanation

Question 54 of 200

1

There were no OS with

Select one of the following:

  • Simple batch systems

  • Serial processing

  • Time-sharing-systems

  • Multiprogrammed batch systems

Explanation

Question 55 of 200

1

Which of the following cannot be interrupted?

Select one of the following:

  • Process

  • Thread

  • Module

  • Atomic operation

Explanation

Question 56 of 200

1

Process is

Select one of the following:

  • a unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set

  • a job in secondary memory

  • contents of main memory

  • program in high level language kept on disk

Explanation

Question 57 of 200

1

Fill the blank space to complete the text.

This determines which cache location the block will occupy:

Explanation

Question 58 of 200

1

This resource can be created and destroyed

Select one of the following:

  • resumable resource

  • restartable resource

  • consumable resource

  • finite resource

Explanation

Question 59 of 200

1

This system handles multiple interactive jobs

Select one of the following:

  • Time-sharing-system

  • Simple batch system

  • Serial processing

  • Multiprogrammed batch system

Explanation

Question 60 of 200

1

Process(2.0) is:

Select one of the following:

  • A program in execution

  • Program in High level language kept on disk

  • Contents of main memory

  • A job in secondary memory

Explanation

Question 61 of 200

1

This system was developed by General Motors for the use on an IBM 701

Select one of the following:

  • Simple Batch Systems or GM-NAA I/O

  • Serial processing

  • Multiprogrammed batch system

  • Time-sharing system

Explanation

Question 62 of 200

1

This chooses which block to replace when a new block is to be loaded into the cache and the cache already had all slots filled with other blocks

Select one of the following:

  • replacement algorithm

  • write policy

  • cache size

  • locality of reference

Explanation

Question 63 of 200

1

Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and

Select one of the following:

  • hold and wait

  • deadlock avoidance

  • starvation

  • race condition

Explanation

Question 64 of 200

1

A task in a blocked state

Select one of the following:

  • is waiting for same temporarily unavailable resources

  • must still be placed in the run queues

  • is executable

  • is running

Explanation

Question 65 of 200

1

This type of system was developed at MIT by a group known as Project MAC for the IBM 709 in 1961

Select one of the following:

  • Serial processing

  • Multiprogrammed batch system

  • Simple batch system

  • Time-sharing-system

Explanation

Question 66 of 200

1

This resource can be safely used by only one process at a time and is not depleted by that use

Select one of the following:

  • refurbished resource

  • replenishing resource

  • reusable resource

  • refreshing resource

Explanation

Question 67 of 200

1

If the contents of a block in the cache are altered, then it is needed to save it back to main memory before replacing it. This is called:

Select one of the following:

  • write policy

  • mapping function

  • locality of reference

  • replacement algorithm

Explanation

Question 68 of 200

1

'Lost signals, duplicate signals received'. This is

Select one of the following:

  • Improper synchronization

  • Nondeterminate program operation

  • Failed mutual exclusion

  • Deadlocks

Explanation

Question 69 of 200

1

The systems which allows only one process execution at a time, are called

Select one of the following:

  • uniprogramming systems

  • unitasking systems

  • uniprocessing systems

  • unicasting systems

Explanation

Question 70 of 200

1

Deadlock inevitable region can be referred to as a

Select one of the following:

  • fun region

  • fatal region

  • final region

  • false region

Explanation

Question 71 of 200

1

In the non-blocking send, non-blocking receive:

Select one of the following:

  • the sending process keeps sending until it receives a message

  • the sending process sends the message and resumes operation

  • neither of processes are required to wait

  • the sending process keeps sending until the message is received

Explanation

Question 72 of 200

1

Which of the following is not a technique possible for I/O operations?

Select one of the following:

  • Direct memory access (DMA)

  • Manual memory access

  • Interrupt-driven I/O

  • Programmed I/O

Explanation

Question 73 of 200

1

'Two or more programs hung up waiting for each other'. This error is caused by

Select one of the following:

  • Falled mutual exclusions

  • Deadlocks

  • Nondeterminate program operation

  • Improper synchronization

Explanation

Question 74 of 200

1

This illustrates the progress of two processes competing for two resources

Select one of the following:

  • joint process diagram

  • joint ingres diagram

  • joint regress diagram

  • joint progress diagram

Explanation

Question 75 of 200

1

The processor issues an I/O command to a module and waits, periodically checking the status of the I/O module until it finds that the operation is complete.

Select one of the following:

  • Direct memory access (DMA)

  • Manual memory access

  • Interrupt-driven I/O

  • Programmed I/O

Explanation

Question 76 of 200

1

A monitor is a type of:

Select one of the following:

  • deadlock

  • low level synchronization construct

  • high level synchronization construct

  • none of the above

Explanation

Question 77 of 200

1

The state of a process is defined by:

Select one of the following:

  • the current activity of the process

  • the activity to next be executed by the process

  • the final activity of the process

  • the activity is just executed by the process

Explanation

Question 78 of 200

1

'When programs share memory and their execution is interleaved by the processor, they may interfere with each other by overwriting common memory areas in unpredictable ways. The results of a particular program depend on the activities of other programs in a shared system'. This is

Select one of the following:

  • Falled mutual exclusions

  • Deadlocks

  • Nondeterminate program operation

  • Improper syncronization

Explanation

Question 79 of 200

1

The I/O module performs the requested action and then sets the appropriate bits in the I/O status register but takes no further action to alert the processor.

Select one of the following:

  • Direct memory access (DMA)

  • Manual memory access

  • Interrupt-driven I/O

  • Programmed I/O

Explanation

Question 80 of 200

1

When each process in the set is blocked awaiting for resource siezed by another blocked process

Select one of the following:

  • it is a deadend

  • it is a deadlock

  • it is a softlock

  • it is a mortallock

Explanation

Question 81 of 200

1

Which of the following is not the state of a process?

Select one of the following:

  • Old

  • terminated

  • running

  • new

  • ready

Explanation

Question 82 of 200

1

The described technique is:

Select one of the following:

  • Direct memory access (DMA)

  • Manual memory access

  • Interrupt-driven I/O

  • Programmed I/O

Explanation

Question 83 of 200

1

Choose the storage management responsibility for "Many application programs require means for storing information for extended periods of time, after the computer has been powered down"

Select one of the following:

  • Long-term storage

  • Protection and access control

  • Automatic allocation and management

  • Process isolation

  • Support of modular programming

Explanation

Question 84 of 200

1

Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the:

Select one of the following:

  • Ready state

  • Running state

  • Terminated state

  • Suspended state

Explanation

Question 85 of 200

1

Which of the following statements is false:

Select one of the following:

  • compaction does not involve relocation of programs

  • the technique of storage compaction involves moving all occupied areas of storage to one end or other of main storage

  • compaction is also known as garbage collection

  • the system must stop everything while it performs the compaction

Explanation

Question 86 of 200

1

Choose the storage management responsibility for "Programmers should be able to define program modules, and to create, destroy, and alter the size of modules dynamically"

Select one of the following:

  • Protection and access control

  • Long-term storage

  • Automatic allocation and management

  • Process isolation

  • Support of modular programming

Explanation

Question 87 of 200

1

Which of the following state transitions is not possible?

Select one of the following:

  • blocked to running

  • running to blocked

  • blocked to ready

  • ready to running

Explanation

Question 88 of 200

1

The main disadvantage of this technique: it is a time-consuming process that keeps the processor busy needlessly.

Select one of the following:

  • Direct memory access (DMA)

  • Manual memory access

  • Interrupt-driven I/O

  • Programmed I/O

Explanation

Question 89 of 200

1

Memory is:

Select one of the following:

  • is the device where information stored

  • is a sequence of the instructions

  • is a device that performs a sequence of operations specified by instructions in memory

  • is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user

Explanation

Question 90 of 200

1

Choose the storage management responsibility for "The OS can achieve efficiency by assigning memory to jobs only as needed"

Select one of the following:

  • Protection and access control

  • Long-term storage

  • Automatic allocation and management

  • Process isolation

  • Support of modular programming

Explanation

Question 91 of 200

1

If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called

Select one of the following:

  • mutual exclusion

  • asynchronous exclusion

  • critical exclusion

  • synchronous exclusion

Explanation

Question 92 of 200

1

The processor issues an I/O command to a module and then go on to some other useful work.

Select one of the following:

  • Direct memory access (DMA)

  • Manual memory access

  • Interrupt-driven I/O

  • Programmed I/O

Explanation

Question 93 of 200

1

Processor is:

Select one of the following:

  • is the device where information stored

  • is a sequence of the instructions

  • is a device that performs a sequence of operations specified by instructions in memory

  • is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user

Explanation

Question 94 of 200

1

Choose the storage management responsibility for "The OS must allow portions of memory to be accessible in various ways by various users"

Select one of the following:

  • Protection and access control

  • Long-term storage

  • Automatic allocation and management

  • Process isolation

  • Support of modular programming

Explanation

Question 95 of 200

1

Interprocess communication:

Select one of the following:

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

  • allows processes to communicate and synchronize their actions when using the same address space

  • allows the processes to only synchronize their actions without communication

  • none of the above

Explanation

Question 96 of 200

1

The I/O module performs the requested action and alerts the processor to request service when it is ready to exchange data with the processor

Select one of the following:

  • Direct memory access (DMA)

  • Manual memory access

  • Interrupt-driven I/O

  • Programmed I/O

Explanation

Question 97 of 200

1

Choose the storage management responsibility for "The OS must prevent independent processes from interfering with each other's memory, both data and instructions"

Select one of the following:

  • Protection and access control

  • Long-term storage

  • Automatic allocation and management

  • Process isolation

  • Support of modular programming

Explanation

Question 98 of 200

1

Program is:

Select one of the following:

  • is the device where information stored

  • is a sequence of the instructions

  • is a device that performs a sequence of operations specified by instructions in memory

  • is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user

Explanation

Question 99 of 200

1

A sequence of instructions, in a computer language, to get the desired result, is known as?

Select one of the following:

  • program

  • process

  • instruction

  • algorithm

Explanation

Question 100 of 200

1

In operating system security and protection, authenticity:

Select one of the following:

  • Concerned with the proper verification of the identity of users and the validity of messages or data

  • Assuring that users cannot read data for which access is unauthorized

  • Protection of data from unauthorized modification

  • Concerned with protecting the system against interruption

Explanation

Question 101 of 200

1

The main disadvantage of this technique: consumes a lot of processor time, because every word of data that goes from memory to I/O module or from I/O module to memory must pass through the processor

Select one of the following:

  • Direct memory access (DMA)

  • Manual memory access

  • Interrupt-driven I/O

  • Programmed I/O

Explanation

Question 102 of 200

1

In operating system, each process has its own:

Select one of the following:

  • all of the mentioned

  • address space and global variables

  • set of data

  • program code

Explanation

Question 103 of 200

1

The memory allocation scheme subject to "external" fragmentation is?

Select one of the following:

  • segmentation

  • swapping

  • multiple contiguous fixed partitionings

  • pure demand paging

Explanation

Question 104 of 200

1

In operating system security and protection, availability is:

Select one of the following:

  • Concerned with the proper verification of the identity of users and the validity of messages or data

  • Assuring that users cannot read data for which access is unauthorized

  • Protection of data from unauthorized modification

  • Concerned with protecting the system against interruption

Explanation

Question 105 of 200

1

For each process OS creates and manages:

Select one of the following:

  • Process control block

  • Program code

  • Program

  • Thread control block

Explanation

Question 106 of 200

1

The processor issues an I/O command to a separate module, by sending the type of operation (read/write), the address of the I/O device, the starting location in memory for data, number of words. Then the processor continues with other work.

Select one of the following:

  • Interrupt-driven I/O

  • Programmed I/O

  • Manual memory access

  • Direct memory access (DMA)

Explanation

Question 107 of 200

1

The memory allocation scheme subject to "internal" fragmentation is?

Select one of the following:

  • segmentation

  • swapping

  • multiple contiguous fixed partitionings

  • pure demand paging

Explanation

Question 108 of 200

1

In operating system security and protection, confidentiality is:

Select one of the following:

  • Concerned with the proper verification of the identity of users and the validity of messages or data

  • Assuring that users cannot read data for which access is unauthorized

  • Protection of data from unauthorized modification

  • Concerned with protecting the system against interruption

Explanation

Question 109 of 200

1

The module transfers the entire block of data to/from memory without going through the processor.

Select one of the following:

  • Interrupt-driven I/O

  • Programmed I/O

  • Manual memory access

  • Direct memory access (DMA)

Explanation

Question 110 of 200

1

The available vector defines

Select one of the following:

  • total amount of each resource NOT allocated to any process

  • total amount of each resource allocated to all processes

  • total amount of each resource in the system

  • total amount of resources required for all processes

Explanation

Question 111 of 200

1

Any program, no matter how small, will occupy an entire partition results in?

Select one of the following:

  • internal fragmentation

  • segmentation

  • paging

  • external fragmentation

Explanation

Question 112 of 200

1

In operating system security and protection, data integrity is:

Select one of the following:

  • Concerned with the proper verification of the identity of users and the validity of messages or data

  • Assuring that users cannot read data for which access is unauthorized

  • Protection of data from unauthorized modification

  • Concerned with protecting the system against interruption

Explanation

Question 113 of 200

1

The main disadvantage of this technique: there is a competition for bus usage

Select one of the following:

  • Interrupt-driven I/O

  • Programmed I/O

  • Manual memory access

  • Direct memory access (DMA)

Explanation

Question 114 of 200

1

A binary semaphore is a semaphore with integer values:

Select one or more of the following:

  • 1

  • 0,5

  • 0

  • -1

Explanation

Question 115 of 200

1

The resource vector define

Select one of the following:

  • total amount of each resource in the system

  • total amount of resources required for all processes

  • total amount of each resource allocated to all processes

  • total amount of each resource NOT allocated to any process

Explanation

Question 116 of 200

1

A hardcopy sign-up sheet was used to reserve computer time with

Select one of the following:

  • Time slicing

  • Time sliding

  • Time scheduling

  • Time allocating

Explanation

Question 117 of 200

1

Short-term scheduler, or dispatcher, picks a process. Each process in the queue is given some time in turn. This strategy is called:

Select one of the following:

  • Round-robin technique

  • Prioritizing

  • Carousel technique

  • Merry-go-round technique

Explanation

Question 118 of 200

1

This matrix defines the current allocation to process i of the resource j

Select one of the following:

  • Allocation matrix

  • Resource matrix

  • Request matrix

  • Claim matrix

Explanation

Question 119 of 200

1

A system clock generates interrupts at a rate of approximately one every 0.2 seconds. At each clock interrupt, the OS regained control and could assign the processor to another user. This technique is known as

Select one of the following:

  • Time scheduling

  • Time sliding

  • Time slicing

  • Time allocating

Explanation

Question 120 of 200

1

The base register

Select one of the following:

  • Defines the size of the region of (in bytes or words)

  • Contains the index into the process list of the process currently controlling the processor

  • Points to the next instruction in that process to be executed

  • Contains the staring address of the region of memory occupied by the process

Explanation

Question 121 of 200

1

The two atomic operations permissible on semaphores are:

Select one of the following:

  • hold

  • stop

  • signal

  • wait

Explanation

Question 122 of 200

1

This matrix defines the amount of resources of type j requested by process i

Select one of the following:

  • Request matrix

  • Allocation matrix

  • Resource matrix

  • Claim matrix

Explanation

Question 123 of 200

1

How to solve problem of equal-size partitions?
swapping (?) ----- page 318 book

Select one of the following:

  • swapping (?) ----- page 318 book
    unequal-size partitions

  • segmentation

  • compaction

  • virtual memory segmentation

Explanation

Question 124 of 200

1

The limit register

Select one of the following:

  • Defines the size of the region of (in bytes or words)

  • Contains the index into the process list of the process currently controlling the processor

  • Points to the next instruction in that process to be executed

  • Contains the staring address of the region of memory occupied by the process

Explanation

Question 125 of 200

1

Batch operating systems were used (years)

Select one of the following:

  • From the late 1940s to the mid-1950s

  • From the mid-1950 to early 1960s

  • In early 1960s

Explanation

Question 126 of 200

1

This matrix defines requirements of processes i for the resources j

Select one of the following:

  • Claim matrix

  • Allocation matrix

  • Resource matrix

  • Request matrix

Explanation

Question 127 of 200

1

How to solve problem of "external" fragmentation?

Select one of the following:

  • compaction

  • larger memory space

  • smaller memory space

  • none of these

Explanation

Question 128 of 200

1

The principal tool available to system programmers in developing the early multiprogramming and multiuser interactive systems

Select one of the following:

  • Interrupt

  • Job control language

  • Monitor

  • Add hec method

Explanation

Question 129 of 200

1

The banker's algorithm is referred to as

Select one of the following:

  • resource allocation denial

  • denial of service

  • loan allocation denial

  • resource allocation refusal

Explanation

Question 130 of 200

1

A page fault?

Select one of the following:

  • occurs when a program accesses a page of memory

  • is a reference to a page belonging to another program

  • is an access to a page not currently in memory

  • is an error is a specific page

Explanation

Question 131 of 200

1

Job control language was used

Select one or more of the following:

  • used to provide instructions to the monitor,In early 1960s

  • From late 1940s to the mid-1950s

  • From the mid-1950s to early 1960s

  • Execute instructions

  • Control the sequence of events as the resident monitor

  • Translate the user’s program into object code

  • Provide instructions to the monitor to improve job setup time

Explanation

Question 132 of 200

1

The process index register

Select one of the following:

  • Contains the index into a process list of the process currently controlling the processor

  • Define the region in memory occupied by the process

  • Points to the next instruction in that process to be executed

  • Contains the starting address of the region of memory occupied by the process

Explanation

Question 133 of 200

1

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

Select one of the following:

  • mutual exclusion

  • a process may hold allocated resources while awaiting assignment of other resources

  • no resource can be forcibly removed from a process holding it

  • all of the above

Explanation

Question 134 of 200

1

'Hold and wait' condition for deadlock is defined as

Select one of the following:

  • Process holds a resource while awaiting for other resource

  • Each process holds resource needed by next process in chain

  • No resource can be forcibly removed from process holding it

  • Only one process may use a resource at a time

Explanation

Question 135 of 200

1

Serial processing was used

Select one of the following:

  • In early 1960s

  • From late 1940s to the mid-1950s

  • From the mid-1950s to early 1960s

Explanation

Question 136 of 200

1

This term was first used by the designers of Multics in the 1960s

Select one of the following:

  • Monitor

  • Process

  • Multiprogramming

  • Time sharing

Explanation

Question 137 of 200

1

Which of the following statements is false?

Select one of the following:

  • I\O transfers are more efficient with large pages

  • a large page size causes instructions and data that will not be referenced brought into primary storage

  • a small page size causes large page tables

  • internal fragmentation is increased with small pages

Explanation

Question 138 of 200

1

Banker’s algorithm for resource allocation deals with:

Select one of the following:

  • deadlock recovery

  • deadlock prevention

  • mutual exclusion

  • deadlock avoidance

Explanation

Question 139 of 200

1

'Circular wait' condition for deadlock is defined as

Select one of the following:

  • Each process holds resource needed by next process in chain

  • Process holds a resource while awaiting for other resource

  • No resource can be forcibly removed from process holding it

  • Only one process may use a resource at a time

Explanation

Question 140 of 200

1

'Ease of evolution of an OS' corresponds to the following objective:

Select one of the following:

  • Efficiency

  • Convenience

  • Ability to evolve

Explanation

Question 141 of 200

1

Swapping

Select one of the following:

  • allows many programs to use memory simultaneously

  • allows each program in turn to use the memory

  • does not work with overlaying

  • none of the above

Explanation

Question 142 of 200

1

'No preemption' condition for deadlock is defined as

Select one of the following:

  • No resource can be forcibly removed from process holding it

  • Only one process may use a resource at a time

  • Process holds a resource while awaiting for other resource

  • Each process holds resource needed by next process in chain

Explanation

Question 143 of 200

1

A system is in the safe state if:

Select one of the following:

  • b)there exist a safe sequence

  • none of the above

  • both a and b

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

Explanation

Question 144 of 200

1

Virtual address is a

Select one of the following:

  • Virtual address is a page number and an offset within the page

  • Другого варианта нет)

Explanation

Question 145 of 200

1

Which of the following is not true about the memory management?

Select one of the following:

  • virtual memory is used only in multi-user systems

  • segmentation suffers from external fragmentation

  • paging suffers from internal fragmentation

  • segmented memory can be paged

  • None of the above

Explanation

Question 146 of 200

1

True or false: segmentation suffers from external fragmentation?

Select one of the following:

  • True
  • False

Explanation

Question 147 of 200

1

'Mutual exclusion' condition for deadlock is defined as

Select one of the following:

  • Only one process may use a resource at a time

  • No resource can be forcibly removed from process holding it

  • Process holds a resource while awaiting for other resource

  • Each process holds resource needed by next process in chain

Explanation

Question 148 of 200

1

True or false: paging suffers from external fragmentation?

Select one of the following:

  • True
  • False

Explanation

Question 149 of 200

1

What is NOT an example of consumable resource?

Select one of the following:

  • Main memory

  • Information in I\O buffers

  • Signals

  • Messages

Explanation

Question 150 of 200

1

What is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided into equal portions or blocks?

Select one of the following:

  • virtual memory

  • segmentation

  • paging

  • partition

Explanation

Question 151 of 200

1

What is NOT an example of reusable resource?

Select one of the following:

  • interrupt

  • semaphores

  • processors

  • i/o channels

Explanation

Question 152 of 200

1

In memory systems, boundary registers?

Select one of the following:

  • track the beginning and ending of programs

  • track page boundaries

  • are only necessary with fixed partitions

  • are used for temporary program variable storage

Explanation

Question 153 of 200

1

Fill the blank spaces to complete the text.

On all instruction cycles, the processor accesses memory at least once, to:
, and often one or more additional times, and/or .

Explanation

Question 154 of 200

1

Operating System maintains the page table for:

Select one of the following:

  • each process

  • each thread

  • each instruction

  • each address

Explanation

Question 155 of 200

1

A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as?

Select one of the following:

  • Multitasking

  • Semaphore

  • Mutual exclusion

  • multiprogramming

Explanation

Question 156 of 200

1

In contiguous memory allocation:

Select one of the following:

  • each process is contained in a single contiguous section of memory

  • none of the above

  • the memory space is contiguous

  • all processes is contained in a single contiguous section of memory

Explanation

Question 157 of 200

1

CPU fetches the instruction from memory according to the value of?

Select one of the following:

  • status register

  • program counter

  • instruction register

  • program status word

Explanation

Question 158 of 200

1

When memory is divided into several fixed sized partitions, each partition may contain ________.

Select one of the following:

  • exactly one process

  • none of the above

  • at least one process

  • multiple processes at once

Explanation

Question 159 of 200

1

The number of resources requested by a process:

Select one of the following:

  • must always be less than the total number of resources available in the system

  • must always be equal to the total number of resources available in the system

  • must not exceed the total number of resources available in the system

  • must exceed the total number of resources available in the system

Explanation

Question 160 of 200

1

A memory used to provide a high speed is called?

Select one of the following:

  • cache

  • main memory

  • disk buffer

  • stack pointer

Explanation

Question 161 of 200

1

In fixed sized partition, the degree of multiprogramming is bounded by ___________.

Select one of the following:

  • the memory size

  • all of the above

  • the number of partitions

  • the CPU utilization

Explanation

Question 162 of 200

1

Which one of the following is the address generated by CPU?

Select one of the following:

  • logical address

  • physical address

  • absolute address

  • none of the above

Explanation

Question 163 of 200

1

A deadlock avoidance algorithm dynamically examines the _____ to ensure that a circular wait condition can never exist

Select one of the following:

  • resource allocation state

  • operating system

  • resources

  • system storage state

Explanation

Question 164 of 200

1

The first fit, best fit and worst fit are strategies to select a ______.

Select one of the following:

  • process from a queue to put in memory

  • all of the above

  • free hole from a set of available holes

  • processor to run the next process

Explanation

Question 165 of 200

1

Runtime mapping from virtual to physical address is done by?

Select one of the following:

  • CPU

  • none of the above

  • memory management unit

  • PCI

Explanation

Question 166 of 200

1

In internal fragmentation, memory is internal to a partition and:

Select one of the following:

  • is not being used

  • none of the above

  • is always used

  • is being used

Explanation

Question 167 of 200

1

Which of the following is not one of the principles of dealing with deadlock?

Select one of the following:

  • Initialization

  • Avoidance

  • Detection

  • Prevention

Explanation

Question 168 of 200

1

The address of a page table in memory is pointed by:

Select one of the following:

  • page table base register

  • stack pointer

  • page register

  • program counter

Explanation

Question 169 of 200

1

A solution to the problem of external fragmentation is:

Select one of the following:

  • compaction

  • larger memory size

  • unequal size parts

  • smaller memory space

Explanation

Question 170 of 200

1

The Process Control Block is:

Select one of the following:

  • a secondary storage section

  • Process type variable

  • Data Structure

  • Block in memory

Explanation

Question 171 of 200

1

Program always deals with:

Select one of the following:

  • logical address

  • physical address

  • relative address

  • absolute address

Explanation

Question 172 of 200

1

__________ is generally faster than _________ .

Select one of the following:

  • worst fit, best fit

  • best fit, first fit

  • first fit, best fit

  • none of the above

Explanation

Question 173 of 200

1

Which one of the following is a synchronization tool?

Select one of the following:

  • socket

  • thread

  • pipe

  • semaphore

Explanation

Question 174 of 200

1

External fragmentation exists when:

Select one of the following:

  • none of the above

  • the total memory is insufficient to satisfy a request

  • enough total memory exists to satisfy a request but it is not contiguous

  • a request cannot be satisfied even when the total memory is free

Explanation

Question 175 of 200

1

What is compaction?

Select one of the following:

  • a paging technique

  • a technique for overcoming fatal error

  • a technique for overcoming internal fragmentation

  • a technique for overcoming external fragmentation

Explanation

Question 176 of 200

1

What controls the process in a single-threaded process model?(не точно) из книги

Select one of the following:

  • Process control block

  • User address space control block

  • User stack control block

  • Kernel stack control block

Explanation

Question 177 of 200

1

External fragmentation will not occur when:

Select one of the following:

  • no matter which algorithm is used, it will always occur

  • first fit is used

  • best fit is used

  • next fit is used

Explanation

Question 178 of 200

1

When the memory allocated to a process is slightly larger than the process, then:

Select one of the following:

  • both will occur

  • external fragmentation occurs

  • internal fragmentation occurs

  • none of the above

Explanation

Question 179 of 200

1

In the non-blocking send:

Select one of the following:

  • the sending process sends the message and resumes operation

  • the sending process keeps sending unit it receives a message

  • the sending process keeps sending until the message is received

  • none of the above

Explanation

Question 180 of 200

1

Main memory is broken into fixed-sized blocks called ________.:

Select one of the following:

  • none of the above

  • pages

  • frames

  • segments

Explanation

Question 181 of 200

1

Fixed-length block of data in secondary memory is called ________.:

Select one of the following:

  • none of the above

  • frames

  • segments

  • pages

Explanation

Question 182 of 200

1

Variable-length block of data that resides in secondary memory is called ________.

Select one of the following:

  • none of the above

  • frames

  • segments

  • pages

Explanation

Question 183 of 200

1

The degree of multi-programming is:

Select one of the following:

  • the number of processes in memory

  • the number of processes executed per unit time

  • the number of processes in the ready queue

  • the number of processes in the I/O queue

Explanation

Question 184 of 200

1

Every address generated by the CPU is divided into two parts:

Select one of the following:

  • page number + page offset

  • Другого варианта нет

Explanation

Question 185 of 200

1

The __________ is used as an index into the page table.

Select one of the following:

  • page number

  • page offset

  • frame bit

  • frame offset

Explanation

Question 186 of 200

1

Trace of the process is: (из книги)

Select one of the following:

  • List of files that are opened

  • List of interactions of the process with other process

  • List of threads of the process

  • List of instructions that are executed

Explanation

Question 187 of 200

1

The _____ table contains the base address of each page in physical memory.

Select one of the following:

  • process

  • memory

  • page

  • frame

Explanation

Question 188 of 200

1

With paging there is no ________ fragmentation.

Select one of the following:

  • either type of

  • none of the above

  • external

  • internal

Explanation

Question 189 of 200

1

A set of processes is deadlock if:

Select one of the following:

  • none of the above

  • each process is blocked and will remain so forever

  • all processes are trying to kill each other

  • each process is terminated

Explanation

Question 190 of 200

1

The operating system maintains a ______ table that keeps track of how many frames have been allocated, how many are there, and how many are available.

Select one of the following:

  • memory

  • page

  • frame

  • segment

Explanation

Question 191 of 200

1

To find a free partition this algorithm starts searching from where it left off, not from the beginning (из книги)

Select one of the following:

  • Worst fit

  • Next fit

  • Best fit

  • First fit

Explanation

Question 192 of 200

1

For every process there is a __________.

Select one of the following:

  • pointer to page table

  • copy of page table

  • frame table

  • page table

Explanation

Question 193 of 200

1

If a page number is not found in the TLB, then it is known as a:

Select one of the following:

  • TLB miss

  • buffer miss

  • TLB ht

  • page fault

Explanation

Question 194 of 200

1

Mutual exclusion can be provided by the:

Select one of the following:

  • binary semaphores

  • none of the above

  • both

  • mutex locks

Explanation

Question 195 of 200

1

If a page table entry is present in the TLB, then it is known as a:

Select one of the following:

  • buffer miss

  • TLB miss

  • page fault

  • TLB hit

Explanation

Question 196 of 200

1

If a page table entry is not in main memory, then it is known as a:

Select one of the following:

  • page fault

  • buffer miss

  • TLB hit

  • TLB miss

Explanation

Question 197 of 200

1

What is a medium-term scheduler?

Select one of the following:

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

  • It selects which process has to be brought into the ready queue

  • None of the above

  • It selects which process to remove from memory by swapping

Explanation

Question 198 of 200

1

In segmentation, each address is specified by (choose two):

Select one or more of the following:

  • a segment number

  • an offset

  • a value

  • a key

Explanation

Question 199 of 200

1

Which is the ready state of a process?

Select one of the following:

  • when process is using the CPU

  • when process is scheduled to run after some execution

  • when process is unable to run until some task has been completed

  • none of the above

Explanation

Question 200 of 200

1

Which one of the following is the deadlock avoidance algorithm?

Select one of the following:

  • round-robin algorithm

  • elevator algorithm

  • banker’s algorithm

  • dinning philosophers problem

Explanation