Copy and Edit

OS Part 1

Description

Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Quiz on OS Part 1, created by Good Guy Beket on 18/12/2017.
Good Guy Beket
Quiz by Good Guy Beket, updated more than 1 year ago More Less
Created by a deleted user almost 7 years ago
Good Guy Beket
Copied by Good Guy Beket almost 7 years ago
1035
17
0

Resource summary

Question 1

Question
In the blocking send, blocking receive
Answer
  • 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

Question 2

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

Question 3

Question
A state is safe, if:
Answer
  • 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

Question 4

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

Question 5

Question
_____ is generally faster than _____
Answer
  • worst fit, best fit
  • best fit, first fit
  • first fit, best fit
  • none of the above

Question 6

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

Question 7

Question
Program:
Answer
  • 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

Question 8

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

Question 9

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

Question 10

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

Question 11

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

Question 12

Question
Which one is a synchronization tool?
Answer
  • socket
  • thread
  • pipe
  • semaphore

Question 13

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

Question 14

Question
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.
Answer
  • Multiprocessing, multiprogramming
  • Uniprogramming, Multiprocessing
  • Multiprogramming, Uniprocessing
  • Multiprogramming, Multiprocessing

Question 15

Question
Memory:
Answer
  • 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

Question 16

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

Question 17

Question
Which of the following condition is required for the deadlock to be possible?
Answer
  • 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

Question 18

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

Question 19

Question
A page fault:
Answer
  • 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

Question 20

Question
A state of a process is defined by:
Answer
  • 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

Question 21

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

Question 22

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

Question 23

Question
Message passing system allows processes to:
Answer
  • 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

Question 24

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

Question 25

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

Question 26

Question
Remote Procedure Calls (RPC) are used:
Answer
  • 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

Question 27

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

Question 28

Question
This resource can be created and destroyed
Answer
  • resumable resource
  • restartable resource
  • consumable resource
  • finite resource

Question 29

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

Question 30

Question
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?
Answer
  • Multitasking
  • Semaphore
  • Mutual exclusion
  • multiprogramming

Question 31

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

Question 32

Question
Segmentation suffers from external fragmentation?
Answer
  • True
  • False

Question 33

Question
For each process OS creates and manages:
Answer
  • Process control block
  • Program code
  • Program
  • Thread control block

Question 34

Question
What is a trap/exception?
Answer
  • 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

Question 35

Question
What is the reusable resource:
Answer
  • 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

Question 36

Question
Interprocess communication:
Answer
  • 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

Question 37

Question
Which of the following transitions is not possible?
Answer
  • blocked to running
  • running to blocked
  • blocked to ready
  • ready to running

Question 38

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

Question 39

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

Question 40

Question
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) _____
Answer
  • Entry section
  • race section
  • shared memory segments
  • process synchronization

Question 41

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

Question 42

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

Question 43

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

Question 44

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

Question 45

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

Question 46

Question
In a multiprogramming environment:
Answer
  • 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

Question 47

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

Question 48

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

Question 49

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

Question 50

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

Question 51

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

Question 52

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

Question 53

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

Question 54

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

Question 55

Question
What is compaction?
Answer
  • a paging technique
  • a technique for overcoming fatal error
  • a technique for overcoming internal fragmentation
  • a technique for overcoming external fragmentation

Question 56

Question
Process is:
Answer
  • 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

Question 57

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

Question 58

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

Question 59

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

Question 60

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

Question 61

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

Question 62

Question
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?
Answer
  • virtual memory
  • segmentation
  • paging
  • partition

Question 63

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

Question 64

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

Question 65

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

Question 66

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

Question 67

Question
Program always deals with:
Answer
  • logical address
  • physical address
  • relative address
  • absolute address

Question 68

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

Question 69

Question
Swapping:
Answer
  • 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

Question 70

Question
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:
Answer
  • dynamic condition
  • race condition
  • critical condition
  • essential condition

Question 71

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

Question 72

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

Question 73

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

Question 74

Question
What is a medium-term scheduler?
Answer
  • 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

Question 75

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

Question 76

Question
Processor:
Answer
  • 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

Question 77

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

Question 78

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

Question 79

Question
Mutual exclusion means that:
Answer
  • 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

Question 80

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

Question 81

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

Question 82

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

Question 83

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

Question 84

Question
Deadlock inevitable region can be referred as:
Answer
  • fun region
  • fatal region
  • final region
  • false region

Question 85

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

Question 86

Question
Paging?
Answer
  • 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

Question 87

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

Question 88

Question
A set of processes is deadlock if:
Answer
  • 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

Question 89

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

Question 90

Question
In indirect communication between processes P and Q:
Answer
  • 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

Question 91

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

Question 92

Question
Which of the following is not the state of a process?
Answer
  • new
  • running
  • old
  • ready

Question 93

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

Question 94

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

Question 95

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

Question 96

Question
In the non-blocking send, blocking receive:
Answer
  • 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

Question 97

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

Question 98

Question
A system is in the safe state if:
Answer
  • 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

Question 99

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

Question 100

Question
In the non-blocking send, non-blocking receive:
Answer
  • 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

Question 101

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

Question 102

Question
What is a short-term scheduler?
Answer
  • 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

Question 103

Question
In contiguous memory allocation:
Answer
  • 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

Question 104

Question
External fragmentation exists when:
Answer
  • 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

Question 105

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

Question 106

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

Question 107

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

Question 108

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

Question 109

Question
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
Answer
  • memory
  • page
  • frame
  • segment

Question 110

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

Question 111

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

Question 112

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

Question 113

Question
The available vector defines:
Answer
  • 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

Question 114

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

Question 115

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

Question 116

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

Question 117

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

Question 118

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

Question 119

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

Question 120

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

Question 121

Question
in the non-blocking send, non-blocking receive:
Answer
  • 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

Question 122

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

Question 123

Question
Virtual memory takes advantage of:
Answer
  • Large secondary memory
  • Modular programming
  • Fast CPU
  • Scheduling

Question 124

Question
Which of the replacement algorithms selects for the next reference is the longest?
Answer
  • Optimal
  • LRU
  • Clock
Show full summary Hide full summary

Want to create your own Quizzes for free with GoConqr? Learn more.

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
Browse Library