Kopieren und bearbeiten

OS Part 1

Beschreibung

Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Quiz am OS Part 1, erstellt von Good Guy Beket am 18/12/2017.
Good Guy Beket
Quiz von Good Guy Beket, aktualisiert more than 1 year ago Mehr Weniger
Erstellt von Ein gelöschter Nutzer vor fast 7 Jahre
Good Guy Beket
Kopiert von Good Guy Beket vor fast 7 Jahre
1035
17
0

Zusammenfassung der Ressource

Frage 1

Frage
In the blocking send, blocking receive
Antworten
  • 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

Frage 2

Frage
The table _____ contains the base address of each page in physical memory
Antworten
  • process
  • memory
  • page
  • frame

Frage 3

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

Frage 4

Frage
In fixed sized partition, the degree of multiprogramming is bounded by ____
Antworten
  • the memory size
  • all of the above
  • the number of partitions
  • the CPU utilization

Frage 5

Frage
_____ is generally faster than _____
Antworten
  • worst fit, best fit
  • best fit, first fit
  • first fit, best fit
  • none of the above

Frage 6

Frage
The two atomic operations permissible on semaphores are: (several answer)
Antworten
  • wait
  • signal
  • hold
  • stop

Frage 7

Frage
Program:
Antworten
  • 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

Frage 8

Frage
"Mutual exclusion" condition for deadlock is defined as:
Antworten
  • 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

Frage 9

Frage
"Hold and wait" condition for a deadlock is defined as:
Antworten
  • 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

Frage 10

Frage
A monitor is a type of:
Antworten
  • none of the above
  • high level synchronization construct
  • low level synchronization construct
  • semaphore

Frage 11

Frage
What is NOT the example of consumable resources?
Antworten
  • Information in I\O buffers
  • Signals
  • Main memory
  • Messages

Frage 12

Frage
Which one is a synchronization tool?
Antworten
  • socket
  • thread
  • pipe
  • semaphore

Frage 13

Frage
A Process Control Block (PCB) does not contain which of the following?
Antworten
  • stack
  • data
  • process state
  • bootstrap program

Frage 14

Frage
With _____ only one process can execute at a time; meanwhile all other process are waiting for the processor. With _____ more than one process can be running simultaneously each on a different processor.
Antworten
  • Multiprocessing, multiprogramming
  • Uniprogramming, Multiprocessing
  • Multiprogramming, Uniprocessing
  • Multiprogramming, Multiprocessing

Frage 15

Frage
Memory:
Antworten
  • 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

Frage 16

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

Frage 17

Frage
Which of the following condition is required for the deadlock to be possible?
Antworten
  • mutual exclusion
  • all of the above
  • no resource can be forcibly removed from a process holding it
  • a process may hold allocated resources while awaiting assignment of other resources

Frage 18

Frage
The _____ is used as an index into the page table
Antworten
  • page number
  • page offset
  • frame bit
  • frame offset

Frage 19

Frage
A page fault:
Antworten
  • 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

Frage 20

Frage
A state of a process is defined by:
Antworten
  • the activity is just executed by the process
  • the final activity of the process
  • the activity to next be executed by the process
  • the current activity of the process

Frage 21

Frage
Suppose that a process is in “Blocked” state waiting for some I\O service. When a service is completed, it goes to the:
Antworten
  • Ready state
  • Running state
  • Terminated state
  • Suspended state

Frage 22

Frage
The link between two processes P and Q to send and receive a message is called:
Antworten
  • message-passing link
  • all of the above
  • communication link
  • synchronization link

Frage 23

Frage
Message passing system allows processes to:
Antworten
  • share data
  • communicate with one another without resorting to shared data
  • name the recipient or sender of the message
  • communicate with one another by resorting shared data

Frage 24

Frage
Which of the following statements is false?
Antworten
  • 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

Frage 25

Frage
The systems which allows only one process execution at a time, are called:
Antworten
  • unitasking systems
  • uniprocessing systems
  • uniprogramming systems
  • unicasting systems

Frage 26

Frage
Remote Procedure Calls (RPC) are used:
Antworten
  • none of the above
  • for communication between two processes on separate systems
  • for communication between two processes on the same systems
  • for communication between two processes remotely different from each other on the same system

Frage 27

Frage
A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem?
Antworten
  • two
  • three
  • one
  • four

Frage 28

Frage
This resource can be created and destroyed
Antworten
  • resumable resource
  • restartable resource
  • consumable resource
  • finite resource

Frage 29

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

Frage 30

Frage
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 executing, is known as?
Antworten
  • Multitasking
  • Semaphore
  • Mutual exclusion
  • multiprogramming

Frage 31

Frage
Every address generated by the CPU is divided into two parts:
Antworten
  • frame offset
  • page number
  • frame bit
  • page offset

Frage 32

Frage
Segmentation suffers from external fragmentation?
Antworten
  • True
  • False

Frage 33

Frage
For each process OS creates and manages:
Antworten
  • Process control block
  • Program code
  • Program
  • Thread control block

Frage 34

Frage
What is a trap/exception?
Antworten
  • user generated interrupt caused by an error
  • failure of the system
  • hardware generated interrupt caused by an error
  • software generated interrupt caused by an error

Frage 35

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

Frage 36

Frage
Interprocess communication:
Antworten
  • 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
  • allows processes to communicate and synchronize their actions without using the same address space

Frage 37

Frage
Which of the following transitions is not possible?
Antworten
  • blocked to running
  • running to blocked
  • blocked to ready
  • ready to running

Frage 38

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

Frage 39

Frage
This matrix defines requirements of processes i for the resources j
Antworten
  • Allocation matrix
  • Resource matrix
  • Request matrix
  • Claim matrix

Frage 40

Frage
Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a(n) _____
Antworten
  • Entry section
  • race section
  • shared memory segments
  • process synchronization

Frage 41

Frage
The context of a process in the PCB of a process DOES NOT contain:
Antworten
  • context switch time
  • the process state
  • memory-management information
  • the value of the CPU registers

Frage 42

Frage
External fragmentation will not occur when:
Antworten
  • no matter which algorithm is used, it will always occur
  • first fit is used
  • best fit is used
  • next fit is used

Frage 43

Frage
A deadlock avoidance algorithm dynamically examines the _____, to ensure that a circular wait condition can never exist
Antworten
  • resources
  • operating system
  • resource allocation state
  • system storage state

Frage 44

Frage
The process control block is:
Antworten
  • process type variable
  • data structure
  • block in memory
  • secondary storage section

Frage 45

Frage
This illustrates the progress of two processes competing for two resources:
Antworten
  • joint process diagram
  • joint ingres diagram
  • joint regress diagram
  • joint progress diagram

Frage 46

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

Frage 47

Frage
When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called:
Antworten
  • priority exchange
  • priority inversion
  • priority removal
  • priority modification

Frage 48

Frage
Main memory is broken into fixed-sized blocks called _____
Antworten
  • none of the above
  • pages
  • frames
  • segments

Frage 49

Frage
The first fit, best fit and worst fit are strategies to select a
Antworten
  • 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

Frage 50

Frage
The Banker’s algorithm is referred to as
Antworten
  • denial of service
  • resource allocation denial
  • loan allocation denial
  • resource allocation refusal

Frage 51

Frage
The code that changes the value of the semaphore is:
Antworten
  • non-critical section code
  • remainder section code
  • none of the above
  • critical section code

Frage 52

Frage
The two kinds of semaphores are: (Several answers)
Antworten
  • mutex
  • counting
  • binary
  • decimal

Frage 53

Frage
"Circular wait" condition for deadlock is defined as:
Antworten
  • 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

Frage 54

Frage
Banker’s algorithm for resource allocation deals with:
Antworten
  • deadlock prevention
  • mutual exclusion
  • deadlock recovery
  • deadlock avoidance

Frage 55

Frage
What is compaction?
Antworten
  • a paging technique
  • a technique for overcoming fatal error
  • a technique for overcoming internal fragmentation
  • a technique for overcoming external fragmentation

Frage 56

Frage
Process is:
Antworten
  • a job in secondary memory
  • a unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set
  • contents of main memory
  • program in high level language kept on disk

Frage 57

Frage
A single thread of control allows the process to perform:
Antworten
  • both
  • only one task at a time
  • multiple tasks at a time
  • none

Frage 58

Frage
When the memory allocated to a process is slightly larger than a process, then:
Antworten
  • both will occur
  • external fragmentation occurs
  • internal fragmentation occurs
  • none of the above

Frage 59

Frage
A problem encountered in multitasking when a process is perpetually denied necessary resources is called:
Antworten
  • starvation
  • deadlock
  • aging
  • inversion

Frage 60

Frage
The memory allocation scheme subject to "internal fragmentation" is:
Antworten
  • segmentation
  • virtual memory segmentation
  • fixed partitioning
  • pure demand paging

Frage 61

Frage
Which one is deadlock avoidance algorithm?
Antworten
  • dining philosophers problem
  • elevator algorithm
  • banker’s algorithm
  • round-robin algorithm

Frage 62

Frage
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?
Antworten
  • virtual memory
  • segmentation
  • paging
  • partition

Frage 63

Frage
Variable-length block of data that resides in secondary memory is called:
Antworten
  • none of the above
  • frames
  • segments
  • pages

Frage 64

Frage
The memory allocation scheme subject to "external fragmentation" is:
Antworten
  • segmentation
  • swapping
  • multiple contiguous fixed partitioning
  • pure demand paging

Frage 65

Frage
Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and
Antworten
  • race condition
  • deadlock avoidance
  • hold and wait
  • starvation

Frage 66

Frage
A binary semaphore is semaphore with integer values: (Several answers)
Antworten
  • 1
  • 0
  • -1
  • 0.5

Frage 67

Frage
Program always deals with:
Antworten
  • logical address
  • physical address
  • relative address
  • absolute address

Frage 68

Frage
The systems which allows only one process execution at a time, are called
Antworten
  • uniprogramming systems
  • unitasking systems
  • uniprocessing sysems
  • unicasting systems

Frage 69

Frage
Swapping:
Antworten
  • 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

Frage 70

Frage
When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access take place, is called:
Antworten
  • dynamic condition
  • race condition
  • critical condition
  • essential condition

Frage 71

Frage
If a page table entry is present in the TLB, then it is known as a:
Antworten
  • buffer miss
  • TLB miss
  • page fault
  • TLB hit

Frage 72

Frage
With paging there is no _____ fragmentation
Antworten
  • either type of
  • none of the above
  • external
  • internal

Frage 73

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

Frage 74

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

Frage 75

Frage
"No preemption" condition for a deadlock is defined as:
Antworten
  • 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

Frage 76

Frage
Processor:
Antworten
  • 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

Frage 77

Frage
Fixed-length block of main memory is called _____
Antworten
  • frames
  • segments
  • none of the above
  • pages

Frage 78

Frage
The initial value of the semaphore that allows only one of the many processes to enter their critical section, is?
Antworten
  • 1
  • 0
  • 2
  • 10

Frage 79

Frage
Mutual exclusion means that:
Antworten
  • if a process is executing in its critical section, then other processes must be executing in their critical section
  • 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 no other process must be executing in their critical sections
  • none of the above

Frage 80

Frage
For every process there is a _____.
Antworten
  • pointer to page table
  • copy of page table
  • frame table
  • page table

Frage 81

Frage
In operating system, each process has its own
Antworten
  • all of the mentioned
  • address space and global variables
  • set of data
  • program code

Frage 82

Frage
Listing the sequence of instructions that are executed is called:
Antworten
  • trace
  • program counter
  • instruction
  • control block

Frage 83

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

Frage 84

Frage
Deadlock inevitable region can be referred as:
Antworten
  • fun region
  • fatal region
  • final region
  • false region

Frage 85

Frage
How to solve a problem of equal-size partitions?
Antworten
  • unequal-size partitions
  • segmentation
  • compaction
  • virtual memory segmentation

Frage 86

Frage
Paging?
Antworten
  • allows multiple programs to reside in separate areas of core at the time
  • is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided equal portions or blocks
  • is a method of allocating processor time
  • consists of those addresses that may be generated by a processor during execution of a computation

Frage 87

Frage
In internal fragmentation, memory is internal to a partition and:
Antworten
  • is not being used
  • none of the above
  • is always used
  • is being used

Frage 88

Frage
A set of processes is deadlock if:
Antworten
  • each process is blocked and will remain so forever
  • none of the above
  • all processes are trying to kill each other
  • each process is terminated

Frage 89

Frage
A memory used to provide a high speed is called?
Antworten
  • cache
  • main memory
  • disk buffer
  • stack pointer

Frage 90

Frage
In indirect communication between processes P and Q:
Antworten
  • there is a mailbox to help communication between P and Q
  • none of the above
  • there is another machine between the two processes to help communication
  • there is another process R to handle and pass on the messages between P and Q

Frage 91

Frage
Semaphore is a/an _____ to solve the critical section problem?
Antworten
  • special program for a system
  • complex structure
  • integer variable
  • hardware for a system

Frage 92

Frage
Which of the following is not the state of a process?
Antworten
  • new
  • running
  • old
  • ready

Frage 93

Frage
The address of the next instruction to be executed by the current process is provided by the:
Antworten
  • pipe
  • program counter
  • CPU registers
  • process stack

Frage 94

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

Frage 95

Frage
The primary distinction between the short-term scheduler and long-term scheduler is:
Antworten
  • the length of their queues
  • none of the above
  • the type of processes the schedule
  • the frequency of their execution

Frage 96

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

Frage 97

Frage
The objective of multi-programming is to:
Antworten
  • have multiple programs waiting in a queue ready to run
  • to maximize CPU utilization
  • to minimize CPU utilization
  • all of the above

Frage 98

Frage
A system is in the safe state if:
Antworten
  • a. the system can allocate resources to each process in some order and stil avoid a deadlock
  • b. there exist a safe sequence
  • both a and b
  • none of the above

Frage 99

Frage
When memory is divided into a several fixed sized partitions, each partition may contain _____
Antworten
  • exactly one process
  • none of the above
  • at least one process
  • multiple processes at once

Frage 100

Frage
In the non-blocking send, non-blocking receive:
Antworten
  • the sending process keeps sending until it receives a message
  • 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

Frage 101

Frage
A process can be terminated due to:
Antworten
  • fatal error
  • normal exit
  • all of the mentioned
  • killed by another process

Frage 102

Frage
What is a short-term scheduler?
Antworten
  • it selects which process has to be executed next and allocates CPU
  • none of the above
  • it selects which process has to be brought into the ready queue
  • it selects which process has to remove from memory by swapping

Frage 103

Frage
In contiguous memory allocation:
Antworten
  • 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

Frage 104

Frage
External fragmentation exists when:
Antworten
  • 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

Frage 105

Frage
CPU fetches the instruction from memory according to the value of?
Antworten
  • status register
  • program counter
  • instruction register
  • program status word

Frage 106

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

Frage 107

Frage
Semaphores:
Antworten
  • are used for memory management
  • synchronize critical resources to prevent deadlock
  • are used to do I/O
  • synchronize critical resources to prevent contention

Frage 108

Frage
This matrix defines the current allocation to process i of the resource j
Antworten
  • Allocation matrix
  • Resource matrix
  • Request matrix
  • Claim matrix

Frage 109

Frage
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
Antworten
  • memory
  • page
  • frame
  • segment

Frage 110

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

Frage 111

Frage
If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
Antworten
  • critical exclusion
  • asynchronous exclusion
  • mutual exclusion
  • synchronous exclusion

Frage 112

Frage
Interprocess communication:
Antworten
  • allows process to synchronize activity
  • is never necessary
  • is usually done via disk drives
  • is required for all processes

Frage 113

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

Frage 114

Frage
A task in a blocked state
Antworten
  • is running
  • is executable
  • must still be placed in the run queues
  • is waiting for same temporarily unavailable resources

Frage 115

Frage
The systems which allows only one process execution at a time, are called:
Antworten
  • unitasking systems
  • uniprocessing systems
  • uniprogramming systems
  • none of the above

Frage 116

Frage
What is NOT an example of reusable resource
Antworten
  • semaphores
  • processors
  • interrupt
  • i/o channels

Frage 117

Frage
An un-interruptible unit is known as:
Antworten
  • single
  • none of the above
  • static
  • atomic

Frage 118

Frage
How to solve a problem of "external" fragmentation?
Antworten
  • unequal-size partitions
  • segmentation
  • compaction
  • virtual memory segmentation

Frage 119

Frage
Runtime mapping from virtual to physical address is done by?
Antworten
  • CPU
  • none of the above
  • memory management unit
  • PCI

Frage 120

Frage
A solution to the problem of external fragmentation is:
Antworten
  • compaction
  • larger memory size
  • unequal size parts
  • smaller memory space

Frage 121

Frage
in the non-blocking send, non-blocking receive:
Antworten
  • Neither of processes are required to wait
  • The sending process keeps sending until it receives a message
  • The sending process keeps sending until the message is received
  • The sending process sends the message and resumes operation

Frage 122

Frage
In segmentation, each address is specified by:
Antworten
  • A segment number and an offset
  • A page number and an offset
  • A frame number and an offset
  • A segment number and a key

Frage 123

Frage
Virtual memory takes advantage of:
Antworten
  • Large secondary memory
  • Modular programming
  • Fast CPU
  • Scheduling

Frage 124

Frage
Which of the replacement algorithms selects for the next reference is the longest?
Antworten
  • Optimal
  • LRU
  • Clock
Zusammenfassung anzeigen Zusammenfassung ausblenden

Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.

ähnlicher Inhalt

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
Bibliothek durchsuchen