Copiar e Editar

OS | Quizzes #3 and #4

Descrição

Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Quiz sobre OS | Quizzes #3 and #4, criado por Good Guy Beket em 28-03-2019.
Good Guy Beket
Quiz por Good Guy Beket, atualizado more than 1 year ago
Good Guy Beket
Criado por Good Guy Beket mais de 5 anos atrás
501
8
0

Resumo de Recurso

Questão 1

Questão
Utilities are:
Responda
  • Processor registers
  • Application programs
  • Opcodes
  • System programs

Questão 2

Questão
The process index register
Responda
  • 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

Questão 3

Questão
The end user views a computer system in terms of:
Responda
  • A set of machine instructions
  • A set of applications
  • A set of system programs
  • Utilities

Questão 4

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

Questão 5

Questão
"The OS as a User/Computer Interface" corresponds to the following objective:
Responda
  • Efficiency
  • Convenience
  • Ability to evolve

Questão 6

Questão
_____ is generally faster than _____
Responda
  • first fit, best fit
  • none of the above
  • best fit, first fit
  • worst fit, best fit

Questão 7

Questão
Memory partitioning algorithm that uses binary tree as a data structure is called:
Responda
  • First-fit algorithm
  • Buddy system
  • Next-fit algorithm
  • Best-fit algorithm

Questão 8

Questão
The address of a page table in memory is pointed by:
Responda
  • stack pointer
  • page table base register
  • program counter
  • page register

Questão 9

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

Questão 10

Questão
Main memory is broken into fixed-size blocks called
Responda
  • None of the above
  • Segments
  • Frames
  • Pages

Questão 11

Questão
In operating system each process has its own:
Responda
  • address space and global variables
  • set of data
  • program code
  • all of mentioned

Questão 12

Questão
Mutual exclusion can be provided by the:
Responda
  • both
  • mutex locks
  • binary semaphores
  • none of the above

Questão 13

Questão
What is a medium-term scheduler?
Responda
  • 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

Questão 14

Questão
The state of a process is defined by:
Responda
  • 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

Questão 15

Questão
What is a ready state of a process?
Responda
  • 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

Questão 16

Questão
Which one of the following is the deadlock avoidance algorithm?
Responda
  • round-robin algorithm
  • elevator algorithm
  • banker's algorithm
  • dinning philosophers problem

Questão 17

Questão
A state is safe if:
Responda
  • 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

Questão 18

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

Questão 19

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

Questão 20

Questão
A problem encountered in multitasking when a process is perpetually denied necessary resources is called
Responda
  • starvation
  • aging
  • inversion
  • deadlock

Questão 21

Questão
A system is in the safe state if:
Responda
  • 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

Questão 22

Questão
What is the reusable resource?
Responda
  • 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

Questão 23

Questão
This illustrates the progress of two processes competing for two resources
Responda
  • joint progress diagram
  • joint ingres diagram.
  • joint regress diagram.
  • joint process diagram.

Questão 24

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

Questão 25

Questão
The resource vector defines:
Responda
  • 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

Questão 26

Questão
"No preemption" condition for deadlock is defined as
Responda
  • 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

Questão 27

Questão
This matrix defines the current allocation to process i of resource j:
Responda
  • Claim matrix
  • Allocation matrix
  • Resource matrix
  • Request matrix

Questão 28

Questão
Which of the following cannot be interrupted?
Responda
  • Process
  • Thread
  • Atomic operation
  • Module

Questão 29

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

Questão 30

Questão
For non-sharable resources like a printer, mutual exclusion:
Responda
  • must exist
  • may exist
  • must not exist
  • none of the above

Questão 31

Questão
A monitor is type of:
Responda
  • high-level synchronization construct
  • deadlock
  • low-level synchronization construct
  • none of the above

Questão 32

Questão
An un-interruptible unit is known as:
Responda
  • atomic.
  • single
  • static
  • none of the above

Questão 33

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

Questão 34

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

Questão 35

Questão
Which of the following is not one of the principles of dealing with deadlock?
Responda
  • Initialization
  • Detection
  • Prevention
  • Avoidance

Questão 36

Questão
Deadlock inevitable region can be referred to as a:
Responda
  • fatal region
  • false region
  • final region
  • fun region

Questão 37

Questão
When each process in the set is blocked awaiting for resource seized by another blocked process:
Responda
  • it is deadlock
  • it is deadend
  • it is a softlock
  • It is a mortallock

Questão 38

Questão
What is NOT an example of reusable resource?
Responda
  • I/O channels
  • Semaphores
  • Processors
  • Interrupt

Questão 39

Questão
In the non-blocking send, blocking receive:
Responda
  • 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

Questão 40

Questão
The degree of multi-programming is:
Responda
  • 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

Questão 41

Questão
What controls the process in a single-threaded process model?
Responda
  • Process control block
  • Kernel stack control block
  • User address space control block
  • User stack control block

Questão 42

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

Questão 43

Questão
Job control language was used to:
Responda
  • 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

Questão 44

Questão
The hardware and software used in providing applications to a user can be viewed in a:
Responda
  • sandwich fashion
  • classified fashion
  • layered fashion
  • leveled fashion

Questão 45

Questão
Semaphore is a/an _____ to solve critical section problem.
Responda
  • integer variable
  • special program for a system
  • complex structure
  • hardware for a system

Questão 46

Questão
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
Responda
  • data consistency
  • aging
  • race condition
  • starvation

Questão 47

Questão
«The OS as a resource manager» corresponds to the following objective:
Responda
  • Efficiency
  • Convenience
  • Ability to evolve

Questão 48

Questão
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»:
Responda
  • long-term storage
  • automatic allocation and management
  • support of modular programming
  • process isolation

Questão 49

Questão
The first fit, best fit and worst fit are strategies to select a:
Responda
  • 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

Questão 50

Questão
For every process there is a:
Responda
  • page table.
  • copy of page table
  • frame table
  • pointer to page table

Questão 51

Questão
The memory allocation scheme subject to "internal" fragmentation is
Responda
  • fixed partitioning.
  • virtual memory segmentation
  • pure demand paging
  • segmentation

Questão 52

Questão
In memory systems, boundary registers
Responda
  • 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

Questão 53

Questão
Any program, no matter how small, will occupy an entire partition results in
Responda
  • paging
  • internal fragmentation
  • segmentation
  • external fragmentation

Questão 54

Questão
The Process Control Block is:
Responda
  • a secondary storage section
  • process type variable
  • data structure
  • a block in memory

Questão 55

Questão
Which one of the following is synchronization tool?
Responda
  • socket
  • thread
  • pipe
  • semaphore

Questão 56

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

Questão 57

Questão
This system handles multiple interactive jobs:
Responda
  • Serial procesing
  • Simple batch system
  • Time-sharing system
  • Multiprogrammed batch system

Questão 58

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

Questão 59

Questão
"Lost signals, duplicate signals received". This error is caused by:
Responda
  • improper synchronization
  • nondeterminate program operation
  • failed mutual exclusion
  • deadlocks

Questão 60

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

Questão 61

Questão
Fixed-length block of data in secondary memory is called:
Responda
  • frames
  • segments
  • pages
  • none of the above

Questão 62

Questão
When the free memory is split into many unconnected pieces we call it:
Responda
  • Compaction
  • External fragmentation
  • Memory distribution
  • Internal fragmentation

Questão 63

Questão
If a page number is not found in the TLB, then it is known as a:
Responda
  • TLB miss
  • page fault
  • buffer miss
  • TLB hit

Questão 64

Questão
With paging there is no ______ fragmentation.
Responda
  • either type of
  • internal
  • external
  • none of the above

Questão 65

Questão
If a page table entry is not in a main memory, then it is known as a:
Responda
  • TLB hit
  • TLB miss
  • buffer miss
  • page fault

Questão 66

Questão
This matrix defines the amount of resources of type j requested by process i:
Responda
  • Request matrix
  • Resource matrix
  • Claim matrix
  • Allocation matrix

Questão 67

Questão
«Hold and wait» condition for deadlock is defined as:
Responda
  • 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

Questão 68

Questão
«Circular wait» condition for deadlock is defined as:
Responda
  • 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

Questão 69

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

Questão 70

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

Questão 71

Questão
The available vector defines:
Responda
  • 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

Questão 72

Questão
"No preemption" condition for deadlock is defined as:
Responda
  • 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

Questão 73

Questão
For sharable resources, mutual exclusion
Responda
  • is not required
  • is required
  • may be or may not be required
  • none of the mentioned

Questão 74

Questão
In the blocking send, blocking receive:
Responda
  • 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

Questão 75

Questão
In the non-blocking send, non-blocking receive:
Responda
  • 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

Questão 76

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

Questão 77

Questão
Which of the following state transitions is not possible?
Responda
  • Blocked to running
  • Blocked to ready
  • Running to blocked
  • Ready to running

Questão 78

Questão
What is a short-term scheduler?
Responda
  • 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

Questão 79

Questão
What is a long-term scheduler?
Responda
  • 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

Questão 80

Questão
What is inter-process communication?
Responda
  • Communication between two threads of same process.
  • Communication between two process
  • Communication within the process
  • None of the mentioned

Questão 81

Questão
There were no OS with
Responda
  • Serial processing
  • Simple batch systems
  • Time sharing systems
  • Multiprogrammed batch systems

Questão 82

Questão
Inter-process communication
Responda
  • 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

Questão 83

Questão
A sequence of instructions in a computer language to get the desired result is known as:
Responda
  • algorithm
  • process
  • instruction
  • program

Questão 84

Questão
In contiguous memory allocation
Responda
  • 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

Questão 85

Questão
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:
Responda
  • Time scheduling
  • Time slicing
  • Time sliding
  • Time allocating

Questão 86

Questão
In internal fragmentation, memory is internal to a partition and
Responda
  • is not being used
  • none of the above
  • is always used
  • is being used

Questão 87

Questão
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
Responda
  • memory
  • page
  • frame
  • segment

Questão 88

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

Questão 89

Questão
24. Which of the following statements is false?
Responda
  • 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

Questão 90

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

Questão 91

Questão
The limit register:
Responda
  • 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

Questão 92

Questão
Dispatcher is:
Responda
  • Small program which switches the processor from one process to another
  • Trace scheduler
  • Interrupt handler
  • User account manager

Questão 93

Questão
Process spawning is:
Responda
  • Creation of parent process
  • Creation of child process
  • Termination of parent process
  • Termination of child process

Questão 94

Questão
The code that changes the value of the semaphore is:
Responda
  • remainder section code
  • non – critical section code
  • critical section code
  • none of the mentioned

Questão 95

Questão
This resource can be created and destroyed
Responda
  • consumable resource
  • finite resource
  • restartable resource
  • resumable resource

Questão 96

Questão
What is NOT an example of consumable resource?
Responda
  • Information in I/O buffers.
  • Signals
  • Main memory
  • Messages

Questão 97

Questão
A binary semaphore is a semaphore with integer values (multiple choices):
Responda
  • 1
  • —1
  • 0
  • 0.5

Questão 98

Questão
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
Responda
  • Deadlocks
  • Failed mutual exclusion
  • Nondeterminate program operation
  • Improper synchronization

Questão 99

Questão
Mutual exclusion means that
Responda
  • 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

Questão 100

Questão
The two kinds of semaphores are:
Responda
  • mutex
  • counting
  • binary
  • decimal

Questão 101

Questão
The objective of multi-programming is to:
Responda
  • have multiple programs waiting in a queue ready to run
  • to maximize CPU utilization
  • to minimize CPU utilization

Questão 102

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

Questão 103

Questão
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?
Responda
  • Paging
  • Virtual memory
  • Partition
  • Segmentation

Quer criar seus próprios Quizzes gratuitos com a GoConqr? Saiba mais.

Semelhante

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
Explore a Biblioteca