Copiar y Editar

OS | Quizzes #3 and #4

Descripción

Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Test sobre OS | Quizzes #3 and #4, creado por Good Guy Beket el 28/03/2019.
Good Guy Beket
Test por Good Guy Beket, actualizado hace más de 1 año
Good Guy Beket
Creado por Good Guy Beket hace más de 5 años
501
8
0

Resumen del Recurso

Pregunta 1

Pregunta
Utilities are:
Respuesta
  • Processor registers
  • Application programs
  • Opcodes
  • System programs

Pregunta 2

Pregunta
The process index register
Respuesta
  • Contains the index into the process list of process currently controlling the processor.
  • Contains the staring address of the region of memory occupied by the process.
  • Define the region in memory occupied by the process
  • Points to the next isntruction in that process to be executed

Pregunta 3

Pregunta
The end user views a computer system in terms of:
Respuesta
  • A set of machine instructions
  • A set of applications
  • A set of system programs
  • Utilities

Pregunta 4

Pregunta
Choose the storage management responsibility for «The OS can achieve efficiency by assigning memory to jobs only as needed:
Respuesta
  • Process isolation
  • Protection and access control
  • Automatic allocation and management
  • Long-term storage
  • Support of modular programming

Pregunta 5

Pregunta
"The OS as a User/Computer Interface" corresponds to the following objective:
Respuesta
  • Efficiency
  • Convenience
  • Ability to evolve

Pregunta 6

Pregunta
_____ is generally faster than _____
Respuesta
  • first fit, best fit
  • none of the above
  • best fit, first fit
  • worst fit, best fit

Pregunta 7

Pregunta
Memory partitioning algorithm that uses binary tree as a data structure is called:
Respuesta
  • First-fit algorithm
  • Buddy system
  • Next-fit algorithm
  • Best-fit algorithm

Pregunta 8

Pregunta
The address of a page table in memory is pointed by:
Respuesta
  • stack pointer
  • page table base register
  • program counter
  • page register

Pregunta 9

Pregunta
Which of the following is not true about the memory management?
Respuesta
  • segmented memory can be paged
  • virtual memory is used only in multi-user systems
  • segmentation suffers from external fragmentation
  • paging suffers from internal fragmentation

Pregunta 10

Pregunta
Main memory is broken into fixed-size blocks called
Respuesta
  • None of the above
  • Segments
  • Frames
  • Pages

Pregunta 11

Pregunta
In operating system each process has its own:
Respuesta
  • address space and global variables
  • set of data
  • program code
  • all of mentioned

Pregunta 12

Pregunta
Mutual exclusion can be provided by the:
Respuesta
  • both
  • mutex locks
  • binary semaphores
  • none of the above

Pregunta 13

Pregunta
What is a medium-term scheduler?
Respuesta
  • It selects which process has to be executed next and allocates CPU
  • It selects which process has to be brought into the ready queue
  • It selects which process to remove from memory by swapping
  • None of the above

Pregunta 14

Pregunta
The state of a process is defined by:
Respuesta
  • The activity to next to be executed by the process
  • The activity just executed by the process
  • The current activity of the process
  • The final activity of the process

Pregunta 15

Pregunta
What is a ready state of a process?
Respuesta
  • when process is using the CPU
  • when process is scheduled to run after some execution
  • when process is unable to run unitl some task has been completed
  • none of the above

Pregunta 16

Pregunta
Which one of the following is the deadlock avoidance algorithm?
Respuesta
  • round-robin algorithm
  • elevator algorithm
  • banker's algorithm
  • dinning philosophers problem

Pregunta 17

Pregunta
A state is safe if:
Respuesta
  • the system can allocate resources to each process in some order and still avoid a deadlock
  • all of the above
  • the state keeps the system protected and safe
  • the system does not crash due to deadlock occurrence

Pregunta 18

Pregunta
The initial value of the semaphore, that allows only one of the many processes to enter their critical sections, is:
Respuesta
  • 2
  • 1
  • 0
  • 10

Pregunta 19

Pregunta
The segment of code in which the process may change common variables, update tables, write into files is known as:
Respuesta
  • critical section
  • mutual exclusion
  • non-critical section
  • program

Pregunta 20

Pregunta
A problem encountered in multitasking when a process is perpetually denied necessary resources is called
Respuesta
  • starvation
  • aging
  • inversion
  • deadlock

Pregunta 21

Pregunta
A system is in the safe state if:
Respuesta
  • none of the above
  • there exist a safe sequence
  • both A and B
  • the system can allocate resources to each process in some order and still avoid a deadlock

Pregunta 22

Pregunta
What is the reusable resource?
Respuesta
  • that can be used by one process at a time and is not depleted by that use
  • that can be used by more than one process at a time
  • that can be shared between various threads
  • none of the above

Pregunta 23

Pregunta
This illustrates the progress of two processes competing for two resources
Respuesta
  • joint progress diagram
  • joint ingres diagram.
  • joint regress diagram.
  • joint process diagram.

Pregunta 24

Pregunta
Current allocation of resources to processes where there is at least one sequence that does not result in deadlock is called
Respuesta
  • Safe state
  • Ambiguous state
  • Unsafe state
  • Alternative state

Pregunta 25

Pregunta
The resource vector defines:
Respuesta
  • total amount of each resource in the system
  • total amount of each resource NOT allocated to any process
  • total amount of resources required for all processes
  • total amount of each resource allocated to all processes

Pregunta 26

Pregunta
"No preemption" condition for deadlock is defined as
Respuesta
  • No resource can be forcibly removed from process holding it.
  • Process holds a resources while awaiting for other resource
  • Only one process may use a resource at a time
  • Each process holds resource needed by next process in chain

Pregunta 27

Pregunta
This matrix defines the current allocation to process i of resource j:
Respuesta
  • Claim matrix
  • Allocation matrix
  • Resource matrix
  • Request matrix

Pregunta 28

Pregunta
Which of the following cannot be interrupted?
Respuesta
  • Process
  • Thread
  • Atomic operation
  • Module

Pregunta 29

Pregunta
A minimum of ____ variables is/are required to be shared between processes to solve critical section problem.
Respuesta
  • three
  • two
  • one
  • four

Pregunta 30

Pregunta
For non-sharable resources like a printer, mutual exclusion:
Respuesta
  • must exist
  • may exist
  • must not exist
  • none of the above

Pregunta 31

Pregunta
A monitor is type of:
Respuesta
  • high-level synchronization construct
  • deadlock
  • low-level synchronization construct
  • none of the above

Pregunta 32

Pregunta
An un-interruptible unit is known as:
Respuesta
  • atomic.
  • single
  • static
  • none of the above

Pregunta 33

Pregunta
Part of program, where the shared memory is accessed and which should be executed invisibly, is called:
Respuesta
  • critical section
  • semaphores
  • directory
  • mutual exclusion

Pregunta 34

Pregunta
Current allocation of resources to processes where there is no sequence that does not result in deadlock is called:
Respuesta
  • Safe state
  • Unsafe state
  • Alternative state
  • Ambiguous state

Pregunta 35

Pregunta
Which of the following is not one of the principles of dealing with deadlock?
Respuesta
  • Initialization
  • Detection
  • Prevention
  • Avoidance

Pregunta 36

Pregunta
Deadlock inevitable region can be referred to as a:
Respuesta
  • fatal region
  • false region
  • final region
  • fun region

Pregunta 37

Pregunta
When each process in the set is blocked awaiting for resource seized by another blocked process:
Respuesta
  • it is deadlock
  • it is deadend
  • it is a softlock
  • It is a mortallock

Pregunta 38

Pregunta
What is NOT an example of reusable resource?
Respuesta
  • I/O channels
  • Semaphores
  • Processors
  • Interrupt

Pregunta 39

Pregunta
In the non-blocking send, blocking receive:
Respuesta
  • the sending process sends the message and resumes operation
  • the sending process keeps sending until it receives a message
  • sender continues on, receiver is blocked until the requested message arrives
  • none of the above

Pregunta 40

Pregunta
The degree of multi-programming is:
Respuesta
  • the number of process in memory
  • the number of processes executed per unit time
  • the number of process in the ready queue
  • the number of process in the I/O queue

Pregunta 41

Pregunta
What controls the process in a single-threaded process model?
Respuesta
  • Process control block
  • Kernel stack control block
  • User address space control block
  • User stack control block

Pregunta 42

Pregunta
The context of a process in the PCB of a process DOESN'T contain:
Respuesta
  • memory-management information
  • context switch time
  • the process state
  • the value of CPU registers

Pregunta 43

Pregunta
Job control language was used to:
Respuesta
  • provide instructions to the monitor to improve job setup time.
  • control the sequence of events as the resident monitor
  • translate the user's program into object code
  • execute instructions

Pregunta 44

Pregunta
The hardware and software used in providing applications to a user can be viewed in a:
Respuesta
  • sandwich fashion
  • classified fashion
  • layered fashion
  • leveled fashion

Pregunta 45

Pregunta
Semaphore is a/an _____ to solve critical section problem.
Respuesta
  • integer variable
  • special program for a system
  • complex structure
  • hardware for a system

Pregunta 46

Pregunta
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
Respuesta
  • data consistency
  • aging
  • race condition
  • starvation

Pregunta 47

Pregunta
«The OS as a resource manager» corresponds to the following objective:
Respuesta
  • Efficiency
  • Convenience
  • Ability to evolve

Pregunta 48

Pregunta
Choose the storage management responsibility for «Programmers should be able to define program modules and to create, destroy and after the size of modules dynamically»:
Respuesta
  • long-term storage
  • automatic allocation and management
  • support of modular programming
  • process isolation

Pregunta 49

Pregunta
The first fit, best fit and worst fit are strategies to select a:
Respuesta
  • free hole from a set of available holes.
  • processor to run the next process
  • process from a queue to put in memory
  • all of the above

Pregunta 50

Pregunta
For every process there is a:
Respuesta
  • page table.
  • copy of page table
  • frame table
  • pointer to page table

Pregunta 51

Pregunta
The memory allocation scheme subject to "internal" fragmentation is
Respuesta
  • fixed partitioning.
  • virtual memory segmentation
  • pure demand paging
  • segmentation

Pregunta 52

Pregunta
In memory systems, boundary registers
Respuesta
  • are used for temporary program variable storage
  • are only necessary with fixed partitions
  • are only necessary with unequal-length partitions
  • track the beginning and ending of programs

Pregunta 53

Pregunta
Any program, no matter how small, will occupy an entire partition results in
Respuesta
  • paging
  • internal fragmentation
  • segmentation
  • external fragmentation

Pregunta 54

Pregunta
The Process Control Block is:
Respuesta
  • a secondary storage section
  • process type variable
  • data structure
  • a block in memory

Pregunta 55

Pregunta
Which one of the following is synchronization tool?
Respuesta
  • socket
  • thread
  • pipe
  • semaphore

Pregunta 56

Pregunta
The link between two processes P and Q to send and receive messages is called:
Respuesta
  • communication link
  • message-passing link
  • synchronization tool
  • all of the above

Pregunta 57

Pregunta
This system handles multiple interactive jobs:
Respuesta
  • Serial procesing
  • Simple batch system
  • Time-sharing system
  • Multiprogrammed batch system

Pregunta 58

Pregunta
"Two or more programs hung up waiting for each other". This error is caused by
Respuesta
  • Improper synchronization
  • Nondeterminate program operation
  • Deadlocks
  • Failed mutual exclusion

Pregunta 59

Pregunta
"Lost signals, duplicate signals received". This error is caused by:
Respuesta
  • improper synchronization
  • nondeterminate program operation
  • failed mutual exclusion
  • deadlocks

Pregunta 60

Pregunta
The principal tool available to system programmers in developing the early multiprogramming and multiuser interactive systems
Respuesta
  • Interrupt
  • Job Control Language
  • Ad hoc Method
  • Monitor

Pregunta 61

Pregunta
Fixed-length block of data in secondary memory is called:
Respuesta
  • frames
  • segments
  • pages
  • none of the above

Pregunta 62

Pregunta
When the free memory is split into many unconnected pieces we call it:
Respuesta
  • Compaction
  • External fragmentation
  • Memory distribution
  • Internal fragmentation

Pregunta 63

Pregunta
If a page number is not found in the TLB, then it is known as a:
Respuesta
  • TLB miss
  • page fault
  • buffer miss
  • TLB hit

Pregunta 64

Pregunta
With paging there is no ______ fragmentation.
Respuesta
  • either type of
  • internal
  • external
  • none of the above

Pregunta 65

Pregunta
If a page table entry is not in a main memory, then it is known as a:
Respuesta
  • TLB hit
  • TLB miss
  • buffer miss
  • page fault

Pregunta 66

Pregunta
This matrix defines the amount of resources of type j requested by process i:
Respuesta
  • Request matrix
  • Resource matrix
  • Claim matrix
  • Allocation matrix

Pregunta 67

Pregunta
«Hold and wait» condition for deadlock is defined as:
Respuesta
  • 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
  • each process holds resource needed by next process in chain

Pregunta 68

Pregunta
«Circular wait» condition for deadlock is defined as:
Respuesta
  • each process holds a 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
  • process holds a resource while awaiting for other resource

Pregunta 69

Pregunta
Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and _____
Respuesta
  • hold and wait
  • deadlock avoidance
  • race around condition
  • buffer overflow
  • none of the above

Pregunta 70

Pregunta
This resource can safely be used by only one process at a time and is not depleted by that use:
Respuesta
  • refreshing resource
  • replenishing resource
  • refurbished resource
  • reusable resource

Pregunta 71

Pregunta
The available vector defines:
Respuesta
  • 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
  • total amount of each resource in the system

Pregunta 72

Pregunta
"No preemption" condition for deadlock is defined as:
Respuesta
  • 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

Pregunta 73

Pregunta
For sharable resources, mutual exclusion
Respuesta
  • is not required
  • is required
  • may be or may not be required
  • none of the mentioned

Pregunta 74

Pregunta
In the blocking send, blocking receive:
Respuesta
  • both sender and receiver are blocked until message is delivered
  • none of the above
  • the sending process sends the message and resumes operation
  • the sending process sends the message while receiver is blocked

Pregunta 75

Pregunta
In the non-blocking send, non-blocking receive:
Respuesta
  • sender continues on, receiver is blocked until the requested message arrives.
  • neither of processes are required to wait
  • the sending process keeps sending until the message is received
  • the sending process sends the message and resumes operation

Pregunta 76

Pregunta
"More than one attempts to make use of a shared resource at the same time". This error is caused by:
Respuesta
  • failed mutual exclusion
  • improper synchronization
  • deadlocks
  • nondeterminate program operation

Pregunta 77

Pregunta
Which of the following state transitions is not possible?
Respuesta
  • Blocked to running
  • Blocked to ready
  • Running to blocked
  • Ready to running

Pregunta 78

Pregunta
What is a short-term scheduler?
Respuesta
  • It selects which process has to be executed next and allocates CPU
  • It selects which process has to be brought into the ready queue
  • It selects which process to remove from memory by swapping
  • None of these

Pregunta 79

Pregunta
What is a long-term scheduler?
Respuesta
  • It selects which process has to be brought into the ready queue
  • It selects which process has to be executed next and allocates CPU
  • It selects which process to remove from memory by swapping
  • None of these

Pregunta 80

Pregunta
What is inter-process communication?
Respuesta
  • Communication between two threads of same process.
  • Communication between two process
  • Communication within the process
  • None of the mentioned

Pregunta 81

Pregunta
There were no OS with
Respuesta
  • Serial processing
  • Simple batch systems
  • Time sharing systems
  • Multiprogrammed batch systems

Pregunta 82

Pregunta
Inter-process communication
Respuesta
  • allows processes to communicate and synchronize their actions without using the same address space
  • none of the above
  • allows the processes to only synchronize their actions without communication
  • allows processes to communicate and synchronize their actions when using the same address space

Pregunta 83

Pregunta
A sequence of instructions in a computer language to get the desired result is known as:
Respuesta
  • algorithm
  • process
  • instruction
  • program

Pregunta 84

Pregunta
In contiguous memory allocation
Respuesta
  • 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

Pregunta 85

Pregunta
A system clock generates an interrupts at a rate of approximately every 0.2 seconds. At each clock interrupt regained control and could assign processor to another user. Technique is known as:
Respuesta
  • Time scheduling
  • Time slicing
  • Time sliding
  • Time allocating

Pregunta 86

Pregunta
In internal fragmentation, memory is internal to a partition and
Respuesta
  • is not being used
  • none of the above
  • is always used
  • is being used

Pregunta 87

Pregunta
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
Respuesta
  • memory
  • page
  • frame
  • segment

Pregunta 88

Pregunta
The algorithm is slow and may even tend to fill up memory with useless holes
Respuesta
  • Best fit
  • Worst fit
  • First fit
  • None of the above

Pregunta 89

Pregunta
24. Which of the following statements is false?
Respuesta
  • 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

Pregunta 90

Pregunta
Short-term scheduler, or dispatcher, picks a process. Each process in the queue is given some time in turn. The strategy is called
Respuesta
  • Round-robin technique
  • Prioritizing
  • Carousel technique
  • Merry-go-round technique

Pregunta 91

Pregunta
The limit register:
Respuesta
  • 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

Pregunta 92

Pregunta
Dispatcher is:
Respuesta
  • Small program which switches the processor from one process to another
  • Trace scheduler
  • Interrupt handler
  • User account manager

Pregunta 93

Pregunta
Process spawning is:
Respuesta
  • Creation of parent process
  • Creation of child process
  • Termination of parent process
  • Termination of child process

Pregunta 94

Pregunta
The code that changes the value of the semaphore is:
Respuesta
  • remainder section code
  • non – critical section code
  • critical section code
  • none of the mentioned

Pregunta 95

Pregunta
This resource can be created and destroyed
Respuesta
  • consumable resource
  • finite resource
  • restartable resource
  • resumable resource

Pregunta 96

Pregunta
What is NOT an example of consumable resource?
Respuesta
  • Information in I/O buffers.
  • Signals
  • Main memory
  • Messages

Pregunta 97

Pregunta
A binary semaphore is a semaphore with integer values (multiple choices):
Respuesta
  • 1
  • —1
  • 0
  • 0.5

Pregunta 98

Pregunta
If more than one user or program attempts to make use of a shared resource at the same time, it may cause the error of
Respuesta
  • Deadlocks
  • Failed mutual exclusion
  • Nondeterminate program operation
  • Improper synchronization

Pregunta 99

Pregunta
Mutual exclusion means that
Respuesta
  • if a process is executing in its critical section, then no other process must be executing in their critical sections
  • if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes exclusion
  • if a process is executing in its critical section, then other processes must be executing in their critical section
  • none of the above

Pregunta 100

Pregunta
The two kinds of semaphores are:
Respuesta
  • mutex
  • counting
  • binary
  • decimal

Pregunta 101

Pregunta
The objective of multi-programming is to:
Respuesta
  • have multiple programs waiting in a queue ready to run
  • to maximize CPU utilization
  • to minimize CPU utilization

Pregunta 102

Pregunta
A relationship between processes such that each has some part (critical section) which must not be executed while the critical section or another
Respuesta
  • Mutual exclusion
  • Multiprogramming
  • Semaphore
  • Multitasking

Pregunta 103

Pregunta
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? It is a method of allocating processor time?
Respuesta
  • Paging
  • Virtual memory
  • Partition
  • Segmentation
Mostrar resumen completo Ocultar resumen completo

¿Quieres crear tus propios Tests gratis con GoConqr? Más información.

Similar

Components of An Operating System - Jason Madappattu
Jason EM
Operating Systems (OS)
rwc.carlton
Operating System
Kai Stovell Unkn
Operating Systems
David Lee
OS
Koda M
Tyrannosaure rex
daom
Software and Utilities
Adam Meese
Opre
varadi richard
Operating systems
Joshua Wilkins U
LinuxOS-History
kostavro
LinuxOS-General
kostavro
Explorar la Librería