Copy and Edit

OS_test_for_screens

Description

Operating Systems (OS) Quiz on OS_test_for_screens, created by Csse 1502 on 18/12/2017.
Csse 1502
Quiz by Csse 1502, updated more than 1 year ago
Csse 1502
Created by Csse 1502 over 6 years ago
46
1
0

Resource summary

Question 1

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

Question 2

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

Question 3

Question
What is the reusable resource:
Answer
  • 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
  • none of the above
  • that can be shared between various threads

Question 4

Question
A minimum_______ variables is/are required to be shared between processes to solve the critical section problem?
Answer
  • three
  • two
  • one
  • four

Question 5

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

Question 6

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

Question 7

Question
Memory partitioning algorithm that uses binary tree as a data structure is called: (не точно, примеры есть только с ним, если не правильно поменяйте)
Answer
  • First-fit algorithm
  • Buddy system
  • Next-fit algorithm
  • Best-fit algorithm

Question 8

Question
Current allocation of resources to processes where there is no sequence that does not result in deadlock is called: (не точно)
Answer
  • Alternative state
  • Unsafe state
  • Ambiguous state
  • Safe state

Question 9

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

Question 10

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

Question 11

Question
When free memory is split into many unconnected pieces we call it: (не точно)
Answer
  • compaction
  • external fragmentation
  • memory distribution
  • internal fragmentation

Question 12

Question
To avoid the race condition, the number of processes that may be simultaneously inside their critical section is:
Answer
  • 0
  • 1
  • 10
  • 2

Question 13

Question
What thread approach does Java runtime environment use?
Answer
  • Multiple processes, multiple threads per process
  • One process, one thread
  • One process, multiple threads
  • multiple processes, single thread per process

Question 14

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

Question 15

Question
Paging:
Answer
  • allows multiple programs to reside in separate areas of core at the time
  • consists of those addresses that may be generated by a processor execution of a computation
  • is a method of allocating process time
  • 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

Question 16

Question
Which of the replacement algorithms selects for replacement that page for which the time to the next reference is the longest?
Answer
  • optimal
  • Clock
  • LRU
  • FIFO

Question 17

Question
Which of the replacement algorithms treats the page frames allocated to a process as a circular buffer?
Answer
  • optimal
  • Clock
  • LRU
  • FIFO

Question 18

Question
Virtual memory takes advantage of: (не точно)
Answer
  • Fast CPU
  • Large secondary memory
  • Scheduling
  • Modular programming

Question 19

Question
The size of virtual storage is limited by…
Answer
  • the number of processors in a system
  • the actual number of main storage locations
  • the addressing scheme of the computer system and by the amount of secondary memory
  • the amount of main memory and secondary memory

Question 20

Question
What is trashing?
Answer
  • Guessing, based on recent history, which pieces are least likely to be used in the near future
  • Assumption that only a few pieces of a process will be needed over a short period of time
  • Condition when the system spends most of its time swapping pieces rather than executing instructions
  • Saving time by swapping unused pieces of process out of the memory

Question 21

Question
What is the real address?
Answer
  • physical address in cache memory
  • virtual address in main memory
  • virtual address in secondary memory
  • physical address in main memory
Show full summary Hide full summary

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

Similar

Creando un conjunto de fichas
PatrickNoonan
C1 - Formulae to learn
Tech Wilkinson
Hitler and the Nazi Party (1919-23)
Adam Collinge
History of Psychology
mia.rigby
Statistics Equations & Graphs
Andrea Leyden
GCSE AQA Chemistry - Unit 1
James Jolliffe
Input, output and storage devices
Mr A Esch
10 good study habits every student should have
Micheal Heffernan
Atomic numbers and mass numbers quiz
Sarah Egan
Část 3.
Gábi Krsková
Cuadro sinóptico de la función de la planeación
Elliot Anderson
Browse Library