COMP 3500 FINAL EXAM

अब Quizwiz के साथ अपने होमवर्क और परीक्षाओं को एस करें!

Select the best answer. Consider these page references (time is progressing left to right): 2 4 7 2 4 X 7 6 4 5 2 5 2 The objective is to select the page to replace using Last-In First-Out. Assume that when Reference X is made, the main memory for this process contains these pages: 4 7 2 Select the page to replace. 5 None of these answers 2 7 4

Select all that apply. The operating system manage the sharing of these resources. A. I/O system B. memory system C. bus system D. DMA E. central processing unit (CPU)

A B E

The operating system manage the sharing of these resources a. memory system b. central processing unit (CPU) c.bus system d. DMA e. I/O system

A. memory system b. central processing unit e. I/O system

(M1-Q3-A1-#2)Select the best answer. The kernel is a subset of the ___________________.

A. none of these anwser b. every user program C.operating system D.DMA E.Brootstrap program C

Check all that apply. Check all the features that the user desires in terms of memory from the operating system. An infinite memory A sophisticated memory Know exactly where his/her program and data are physically stored An inexpensive memory A fast memory

An inexpensive memory A fast memory An infinite memory

m7-review-a2-q25 Select the best answer from each dropdown menu. Belady's anomaly ______ that ______ allocated to a process will yield a _______ rate.

Answer 1: demonstrates Answer 2: more pages Answer 3: higher page fault

Check all that apply. These components of the computer hardware actively and concurrently access the shared memory through a shared bus. A. USB Controller B. Graphics Adapter C. Disk Controller D. None of these answers E. Central Processing Unit F. Direct Memory Access Device

E F

Select the best answer from each dropdown menu. The ________ loads at start up the ___________ .

Bootstrap program Operating system kernel

M1 - review -Q15 Select the best answer. Timesharing requires ____________ scheduling. A. job B. memory C. CPU D. None of these answers E. multitasking

Select the best answer. Timesharing requires ____________ scheduling. A. multiitasking B. memory C. job D. CPU E. None of the above

CPU

Select all that apply. The operating system is needed because ______________________. None of these answers the OS can efficiently perform the I/O-memory transfers using the CPU. I/O operations are so rare. CPU cannot be kept busy all time by ANY application I/O operations are frequent and slow

CPU cannot be kept busy all time by ANY application I/O operations are frequent and slow

Select all that apply. The operating system is needed because ______________________. I/O operations are frequent and slow None of these answers I/O operations are so rare. the OS can efficiently perform the I/O-memory transfers using the CPU. CPU cannot be kept busy all time by ANY application

CPU cannot be kept busy all time by ANY application I/O operations are frequent and slow

Matching. Match each computer system component to the most relevant role/definition. Computer Hardware Applications operating system Users

Computer Hardware: CPU, Memory,I/O Applications: Solve Users computation Operating System: Optimizes the use of the computer system Users: People or Machine

On modern general purpose computer systems, software may directly trigger an interrupt onto the CPU.

False

True or False? On modern general purpose computer systems, software may directly trigger an interrupt onto the CPU.

False

m7-q5-a1-q1 Select the best answer. This page replacement policy (Demand Paging) does the opposite of the Least Recently Used: i.e, it will select the page least likely to be selected by Least Recently Used. Least Recently Used First-In First-Out Last-In First Out Optimal None of these answers

First-In First-Out

m7-review-a1-quiestion23 Check all that apply. Check all page replacement policies that may suffer from the Belady's anomaly. Optimal stack algorithm(s) Last-In First-Out Least Recently Used First-In First-Out

First-In First-Out

Fill in the blank. The operating system could be seen as a _______________ program.

Control

(M1-Q3-A2-#6)Select the best answer. The kernel is a subset of the ___________________. A. DMA B. bootstrap program C. None of these answers D. operating system E. every user program

Select the best answer. When a CPU attempts to fetch an instruction or a data operand, the memory system will look first in the ___________. A. main memory B. network storage (clouds) C. hard drive D. cache E. None of these answers

Select all that apply. The operating system is needed because __________________ A. DMA is not efficient for I/O- Memory data transfers B. CPU is more efficient for I/O-Memory transfers C. None of these answers D. users and/or applications must share the computer hardware resources E. I/O operations are frequent and slow

D E

Memory - I/O data transfers are efficiently performed by the ____________ a. data bus B. CPU C. None of these anwser D. DMA E. address bus

D. DMA

Select the best answer. Memory-I/O data transfers are efficiently performed by the ______________. DMA None of these answers CPU data bus

DMA

Check all that apply. A driver is trying to park in a downtown parking with walled spots. We assume that the driver has a compact car. Furthermore, he is sober and takes care of his car. Check all that apply. He will use contiguous placement He may experience external fragmentation He may experience internal fragmentation He will be using variable partition allocation He will be using equal size fixed partitions allocation If there is enough available, but scattered space he may use a technique similar to memory compaction.

He will use contiguous placement He may experience internal fragmentation He will be using equal size fixed partitions allocation

one modern computer systems, the memory system is organized as an _______, rather than a flat system

Hierarchy

Select all that apply. The operating system manage the sharing of these resources. I/O system memory system bus system DMA central processing unit (CPU)

I/O System Memory System CPU

Select all that apply. OS duties include these: I/O management Internet browsing Bus subsystem Process Management Memory Management None of these answers

I/O management Process Management Memory Management

Select the best answer. Memory-I/O data transfers are efficiently performed by the ______________. DMA None of these answers CPU data bus address bus

DMA

Select the best answer. Memory-I/O data transfers are efficiently performed by the ______________. address bus CPU DMA data bus None of these answers

DMA

Select all that apply. Check all statements that apply to the DMA. DMA is a hardware device DMA and CPU can access simultaneously their shared memory None of these answers DMA stands for Direct Memory Authority DMA is faster than the CPU to perform data transfers

DMA is a hardware device DMA is faster than the CPU to perform data transfers

Select the best answer. A system call is made by ____________ . A. a kernel (system) program B. an interrupt C. a timer D. None of these answers E. a user program

Select the best answer. When a CPU attempts to fetch an instruction or a data operand, the memory system will look first in the ___________ level. A. largest B. non volatile C. least expensive D. None of these answers E. fastest

Check all that apply. Memory compaction is expensive because It must use the CPU to select the right processes to move It eventually moves a lot of data from memory to memory It must be often used It eventually moves a lot of data from memory to O/I PARTIAL

It must use the CPU to select the right processes to move It eventually moves a lot of data from memory to memory

Check all that apply. These policies take advantage directly from high temporal locality. First-In First-Out Least Recently Used Optimal Last-In First-Out

Least Recently Used

Check all that apply. These policies take advantage directly from high temporal locality. Least Recently Used Last-In First-Out Optimal First-In First-Out

Least Recently Used

m7-q2-a2-q8 Select the best answer. With extremely poor spatial locality and excellent temporal locality, the page size would be about _____________. One byte None of these answers More than 8192 bytes 512 to 8192 bytes A few bytes

More than 8192 bytes

Select the best answer. ______________ is not a responsibility or a duty of an operating system. A. Memory Management B. I/O management C. Process Management D. Protection and Security E. None of these answers

Select all that apply. OS duties include these: Process Management Bus subsystem None of these answers Internet browsing Memory Management I/O management

Process Management Memory Management I/O management

m7-classquiz-#12 Check all that apply. Pay attention to similar questions. Check all that apply about demand paging. The virtual memory of a process P consists of n pages. Process P is assigned m frames such that m < n. We assume that Process P does not waste memory. Process P will trigger at least m page faults Process P will trigger at most n page faults Process P will trigger at least n page faults Process P will trigger at most m page faults

Process P will trigger at least m page faults

m1-q5-a1-#3 Select all that apply. For mass storage management, the OS activities are: Backup files onto stable (non-volatile) storage media Storage allocation Free-space management None of these answers Disk scheduling

Storage allocation Free-space management Disk scheduling

Select all that apply. For mass storage management, the OS activities are: Storage allocation Disk scheduling Backup files onto stable (non-volatile) storage media None of these answers Free-space management

Storage allocation Disk scheduling Free-space management

Fill in the blank. Software may trigger an interrupt by executing a special operation called a _______________.

System call monitor call

True or False. In general, the logical space is larger than the physical space. True False

Check all that apply. Caching blocks/pages would not work if ________________________. Faster memory does not cost more The cache must be smaller than the lower memory level There is no spatial locality There is no temporal locality

The cache must be smaller than the lower memory level There is no spatial locality

m7-q1-a1-q13 Check all that apply. Caching blocks/pages would not work if ________________________. The cache must be smaller than the lower memory level There is no spatial locality Faster memory does not cost more There is no temporal locality

The cache must be smaller than the lower memory level There is no spatial locality There is no temporal locality

Check all that apply. Caching blocks/pages would not work if ________________________. There is no spatial locality There is no temporal locality The cache must be smaller than the lower memory level Faster memory does not cost more

There is no spatial locality There is no temporal locality

Check all that apply. Caching blocks/pages would not work if ________________________. There is no temporal locality The cache must be smaller than the lower memory level There is no spatial locality Faster memory does not cost more

There is no temporal locality There is no spatial locality

Select all that apply. The operating system is __________________ A. a control program B. a piece of software C. None of these answers D. a hardware device E. a resource allocator

a b e

Select all that apply. The operating system is __________________ a control program None of these answers a hardware device a resource allocator a piece of software

a control program a resource allocator a piece of software

Check all that apply. In terms of memory, the user/programmer sees a flat logical space starting at address 0 a flat physical space where the physical space is located inside the logical space where his/her logical space is located inside the physical space

a flat logical space starting at address 0

Select the best answer. In a simple page table, each entry contains at least ______________. None of these answers a page number a logical address a frame number a physical adddress

a frame number

Select all that apply. The operating system is __________________ a hardware device a piece of software a resource allocator a control program None of these answers

a piece of software a resource allocator a control program

Select the best answer from each dropdown menu. The operating system is a _____________ that makes the use of a computer system _______________ , _____________ , and _______________ .

a software program convenient efficient secure

Select the best answer. A system call is made by ____________ . None of these answers a timer a user program an interrupt a kernel (system) program

a user program

Select the best answer. A system call is made by ____________ . a user program a kernel (system) program None of these answers an interrupt a timer

a user program

Select the best answer. A system call is made by ____________ . an interrupt None of these answers a timer a user program a kernel (system) program

a user program

Data transfers between main memory and hard drive are managed by a. user b. compiler c. operating system d. progammer e. hardware

a. User c. operating system

Select the best answer. Memory-I/O data transfers are efficiently performed by the ______________.

a. address bus b. None of these answers c. data bus d. CPU e. DMA E

Data transfers between main memory and hard drive are managed by a. operating system b. programmer c. user d. hardware e. compliler

a. operating system c. user

(M1 review #1)Select the best answer from each dropdown menu. On a computer system, ____________________ is/are an intermediary component serving directly ____________________ while receiving service directly from _______________________

application users operating system

On a computer system, ________ is/are an intermediary component serving directly __________ while receiving service directly from ________

applications users operating system

On modern computer systems, the CPU must have at least ____________ such the CPU can run with different sets of privileges or capabilities. This will allow the CPU to run the operating system with the highest set of privileges or capabilities.

dual mode a dual mode two modes

Check all that apply. Modern operating system use demand paging with ________________. dynamic allocation static equal partition static proportional allocation dynamic proportional allocation None of these answers

dynamic allocation

Check all that apply. Modern operating system use demand paging with ________________. static proportional allocation dynamic allocation None of these answers dynamic proportional allocation static equal partition

dynamic allocation

(m1 -q4 - a2 - #4)When a CPU attempts to fetch an instruction or a data operand, the memory system will look first in the ___________. a.cache b. network storage cloud c. main memory d. hard drive e. none of these

e. none of these

Check all that apply. From the user view, these features of an operating system are paramount. elegance of the code ease of use resource utilisation None of these answers CPU utilization

ease of use

Check all that apply. From the user view, these features of an operating system are paramount. resource utilization CPU utilization elegance of the code ease of use None of these answers

ease of use

m7-q1-a2-q10 Select all that apply. Variables referenced in the body of theses constructs will surely exhibit high spatial locality. if-then-else while loops None of these answers sequential code with no loops for loops nested loops

if then else

Fill in the blank. On modern computer systems, the CPU must have at least ____________ such the CPU can run with different sets of privileges or capabilities. This will allow the CPU to run the operating system with the highest set of privileges or capabilities.

two modes

Select all that apply. Memory management aims to: minimize response time maximize response time maximize CPU utilization minimize CPU utilization

maximize CPU utilization maximize CPU utilization

Fill in the blank. The operating system is in charge of: 1) Process Management 2) I/O subsystem 3) Protection and security 4) __________ Management

memory

Fill in the blank. Software may trigger an interrupt by executing a special operation called a _______________.

monitor call

caching consists of copying information into a _____________ storage system; _____________ can be viewed as a cache for the network clouds

more expensive hard drive

Fill in the blank. In order to eliminate external fragmentation, the operating system divides the process in equal sized pieces that it can scatter in the physical space. The equal sized pieces in the logical space are called _________.

page

Select the best answer. A simple page table is indexed by the ___________. frame numbers process IDs physical address page numbers logical address

page numbers

Select the best answer from each dropdown. Physically, the virtual memory is a ________ , while logically it is viewed as a a ________ .

pyramid a flat array

Check all that apply. The CPU can directly access _______________. the secondary storage in general the main memory the CPU registers the hard drive

the CPU registers main memory

Fill in the blank. "Another form of multiprogramming that improve interactivity is ____________.

timesharing

True or False? Assuming a modern OS implementation without bugs (this is not Windows, obviously), a user program cannot run in kernel mode on a computer system that uses a CPU with dual mode.

true

True or False? On any CPU, the operating system can be designed to maintain full control of the computer system, i.e., to be the boss in charge.

true

m7-review-a2-q11 Numerical answer. Pay attention to questions looking similar. The virtual memory (space) of a process P contains 10 pages. The system, using Demand Paging, allocates ten frames to Process P. We assume that Process P does not waste memory. Process P generated 1000 page memory references. What is the page fault rate? (Answer 1.0 if it cannot be determined with the information provided)

0.001

m7-classsquz-#18 Numerical answer. Pay attention to questions looking similar. The virtual memory (space) of a process P contains 10 pages. The system, using Demand Paging, allocates ten frames to Process P. We assume that Process P does not waste memory. Process P generated 1000 page memory references. What is the page fault rate? (Answer 1.0 if it cannot be determined with the information provided)

0.100

Select the best answer. 4 processes are running on a system. There (is) are ______ independent physical space(s). 2 4 3 None of these answers 1

Select the best answer. Consider these page references (time is progressing left to right): 1 3 6 1 3 X 6 3 1 The objective is to select the page to replace using First-In First-Out. Assume that when Reference X is made, the main memory for this process contains these pages: 3 6 1 Select the page to replace. 1 3 6 None of these answers

Select the best answer. Consider these page references (time is progressing left to right): 1 3 6 1 3 X 6 3 1 The objective is to select the page to replace using Optimal. Assume that when Reference X is made, the main memory for this process contains these pages: 3 6 1 Select the page to replace. 1 3 None of these answers 6

Select the best answer. Pay attention, this question looks identical to another question you may encounter. CNN and Fox News just announced the invention of a revolutionary fast non volatile static RAM that cost much less than dynamic RAM. Computer designers will from now on have only ____________ levels of memory (without counting registers as a level). 4 2 1 3 None of these answers

m7-review-quiestion14 Numerical answer. Pay attention to questions looking similar. The virtual memory (space) of a process P contains 10 pages. The system, using Demand Paging, allocates ten frames to Process P. We assume that Process P does not waste memory. Process P generated 1000 page memory references. What is the page fault rate? (Answer 1.0 if it cannot be determined with the information provided)

Matching. We want to sort the different memory levels from the lowest to the highest access time. The level with the lowest access time is assigned the number 1. Registers Cache Main memory Hard drive Network storage

1. Registers 2. Cache 3. Main memory 4. Hard drive 5. Network storage

m7-review-a2-q20 Matching. We want to rank the page replacement policies as follows: assign a smaller number to a policy A if it ALWAYS outperforms or matches the other policy. Optimal Least Recently Used First-In First-Out Last-In First-Out

1.Optimal 1.Least Recently Used 2.First-In First-Out 2.Last-In First-Out

m7-q5-a1-q2 Matching. We want to rank the page replacement policies as follows: assign a smaller number to a policy A if it ALWAYS outperforms or matches the other policy. Optimal Least Recently Used First-In First-Out Last-In First-Out

1.Optimal 1.Least Recently Used 2First-In First-Out 2.Last-In First-Out

m7-review-a2-q15 Matching. Pay attention to questions looking similar. Assuming high temporal locality, sort best to worst (on average) page replacement policies for demand paging. 1 is best. Assign the same number if the policies' performance is similar. Optimal Least Recently Used (LRU) First in First Out (FIFO) Last In First Out (LIFO)

1.Optimal 2.Least Recently Used (LRU) 2.First in First Out (FIFO) 2Last In First Out (LIFO)

m7-review-a1-quiestion22 Matching. The objective is to rank these "implementations" of Least Recently Used (LRU) for page replacement (Demand Paging). The implementation that exactly (or most closely) implements LRU will get Rank 1. Implementations similarly close to LRU will get the same number. Select "victim" based on "Time-of-use" filed in page table Use a stack of referenced pages' numbers Second-chance algorithm Clock algorithm Second-chance algorithm with two reference bits.

1.Select "victim" based on "Time-of-use" filed in page table 1.Use a stack of referenced pages' numbers 1.Second-chance algorithm 1.Clock algorithm 1.Second-chance algorithm with two reference bits.

Matching. Consider a process that has extremely poor temporal locality. We want to predict which LRU approximation will yield the smallest page fault rate. The best LRU approximation will be assigned 1. If two implementations perform similarly, assign them the same number. Strict LRU with time-of-use in the page table Strict LRU implemented using stack Second-chance algorithm Clock algorithm Enhanced second chance algorithm

1.Strict LRU with time-of-use in the page table 1.Strict LRU implemented using stack 1.Second-chance algorithm 1.Clock algorithm 1.Enhanced second chance algorithm

Fill in the blank. The total number of available frames in the physical space is 128. The virtual space of a process P is 256 pages large. Process P will get _____ frames allocated at most.

128

m7-q7-a2-q9 Matching. We want to rank the page replacement policies as follows: assign a smaller number to a policy A if it ALWAYS outperforms or matches the other policy. Optimal Least Recently Used First-In First-Out Last-In First-Out

1Optimal 1Least Recently Used 2First-In First-Out 2Last-In First-Out

m7-q5-a1-q8 Matching. Pay attention to questions looking similar. Assuming extremely poor temporal locality, sort best to worst (on average) page replacement policies for demand paging. 1 is best. Assign the same number if the policies' performance is similar. Optimal Least Recently Used (LRU) First In First Out (FIFO) Last In First Out (LIFO)

1Optimal 1Least Recently Used (LRU) 2First In First Out (FIFO) 2Last In First Out (LIFO)

m7-review-a2-q13 Matching. Pay attention to questions looking similar. Assuming extremely poor temporal locality, sort best to worst (on average) page replacement policies for demand paging. 1 is best. Assign the same number if the policies' performance is similar. Optimal Least Recently Used (LRU) First In First Out (FIFO) Last In First Out (LIFO)

1Optimal 1Least Recently Used (LRU) 2First In First Out (FIFO) 2Last In First Out (LIFO)

Matching. We want to sort the different memory levels from the smallest to the largest storage capacity. The level with the smallest storage capacity is assigned the number 1. Registers Cache Main memory Hard drive Network storage

1Registers 2Cache 3Main memory 4Hard drive 5Network storage

m7-q1-a1-q2 Matching. We want to sort the different memory levels from the cheapest to the most expensive cost to store a bit. The level with the cheapest cost is assigned the number 1. Registers Cache Main memory Hard drive Network storage

1Registers 2Cache 3Main memory 4Hard drive 5Network storage

Select the best answer. Consider these page references (time is progressing left to right): 2 4 7 2 4 X 7 6 4 5 2 5 2 The objective is to select the page to replace using First-In First-Out. Assume that when Reference X is made, the main memory for this process contains these pages: 4 7 2 Select the page to replace. 2 4 7 None of these answers 5

Select the best answer. Pay attention, this question looks identical to another question you may encounter. CNN and Fox News just announced the invention of a revolutionary fast volatile static RAM that cost much less than dynamic RAM. Computer designers will from now on have only ____________ levels of memory (without counting registers as a level). 2 4 3 None of these answers 1

Select the best answer. Pay attention, this question looks identical to another question you may encounter. CNN and Fox News just announced the invention of a revolutionary fast volatile static RAM that cost much less than dynamic RAM. Computer designers will from now on have only ____________ levels of memory (without counting registers as a level). None of these answers 1 2 4 3

m7-q2-a2-q4 Select the best answer. Pay attention, this question looks identical to another question you may encounter. CNN and Fox News just announced the invention of a revolutionary fast non volatile static RAM that cost much less than dynamic RAM. Computer designers will from now on have only ____________ levels of memory (without counting registers as a level). None of these answers 1 2 4 3

m7-q7-a2-q13 Select the best answer. Consider these page references (time is progressing left to right): 2 4 7 2 4 X 7 6 4 5 2 5 2 The objective is to select the page to replace using Last-In First-Out. Assume that when Reference X is made, the main memory for this process contains these pages: 4 7 2 Select the page to replace. 2 4 7 None of these answers 5

m7-review-quiestion18 Matching. Pay attention to questions looking similar. Assuming extremely poor temporal locality, sort best to worst (on average) page replacement policies for demand paging. 1 is best. Assign the same number if the policies' performance is similar. optimal least recently used (LRU) First in first out last in first out

2.optimal 2. least recently used (LRU) 1.First in first out 1.last in first out

m7-q4-a2-q8 Matching. Pay attention to questions looking similar. Assuming high temporal locality, sort best to worst (on average) page replacement policies for demand paging. 1 is best. Assign the same number if the policies' performance is similar. Optimal Least Recently Used (LRU) First in First Out (FIFO) Last In First Out (LIFO)

2Optimal 1Least Recently Used (LRU) 2First in First Out (FIFO) 2Last In First Out (LIFO)

m7-q2-a1-q3 Select the best answer. Pay attention, this question looks identical to another question you may encounter. CNN and Fox News just announced the invention of a revolutionary fast non volatile static RAM that cost much less than dynamic RAM. Computer designers will from now on have only ____________ levels of memory (without counting registers as a level). 2 1 4 None of these answers 3

m7-q2-a1-q4 Select the best answer. Pay attention, this question looks identical to another question you may encounter. CNN and Fox News just announced the invention of a revolutionary fast non volatile static RAM that cost much less than hard drives. Computer designers will from now on have only ____________ levels of memory (without counting registers as a level). 4 3 None of these answers 2 1

m7-q2-a1-q5 Select the best answer. Pay attention, this question looks identical to another question you may encounter. CNN and Fox News just announced the invention of a revolutionary fast volatile static RAM that cost much less than hard drives. Computer designers will from now on have only ____________ levels of memory (without counting registers as a level). 2 3 4 None of these answers 1

m7-q2-a1-q6 Select the best answer. With extremely poor temporal locality and excellent spatial locality, the memory hierarchy would have ________ levels. We assume current technology and we do not count registers or the Internet as levels. at most 2 None of these answers 3 4 1

m7-q4-a1-q1 Select the best answer. Consider these page references (time is progressing left to right): 1 3 6 1 3 X 6 3 1 The objective is to select the page to replace using Last-In First-Out. Assume that when Reference X is made, the main memory for this process contains these pages: 3 6 1 Select the page to replace. None of these answers 6 3 1

m7-q5-a1-q13 Select the best answer. Consider these page references (time is progressing left to right): 1 3 6 1 3 X 6 3 1 The objective is to select the page to replace using Last-In First-Out. Assume that when Reference X is made, the main memory for this process contains these pages: 3 6 1 Select the page to replace. 6 1 None of these answers 3

m7-q1-a1-q14 Select the best answer. Pay attention, this question looks identical to another question you may encounter. CNN and Fox News just announced the invention of a revolutionary fast volatile static RAM that cost much less than dynamic RAM. Computer designers will from now on have only ____________ levels of memory (without counting registers as a level). 4 3 1 None of these answers 2

m7-q1-a1-q15 Select the best answer. Pay attention, this question looks identical to another question you may encounter. CNN and Fox News just announced the invention of a revolutionary fast non volatile static RAM that cost much less than dynamic RAM. Computer designers will from now on have only ____________ levels of memory (without counting registers as a level). 4 1 3 2 None of these answers

m7-q4-a2-q7 Select the best answer. Consider these page references (time is progressing left to right): 2 4 7 2 4 X 7 6 4 5 2 5 2 The objective is to select the page to replace using Last-In First-Out. Assume that when Reference X is made, the main memory for this process contains these pages: 4 7 2 Select the page to replace. 5 7 None of these answers 4 2

m7-q5-a1-q12 Select the best answer. Consider these page references (time is progressing left to right): 2 4 7 2 4 X 7 6 4 5 2 5 2 The objective is to select the page to replace using Optimal. Assume that when Reference X is made, the main memory for this process contains these pages: 4 7 2 Select the page to replace. 2 4 5 7 None of these answers

m7-q6-a1-q13 Select the best answer. Pay attention to questions looking similar. The virtual memory (space) of a process P contains five pages. The system, using Demand Paging, allocates four frames to Process P. We assume that Process P does not waste memory. When Process P executes, it will experience at most ________ page faults. 3 None of these answers 4 6 5

m7-q6-a1-q15 Select the best answer. Consider these page references (time is progressing left to right): 2 4 7 2 4 X 7 6 4 5 2 5 2 The objective is to select the page to replace using Optimal. Assume that when Reference X is made, the main memory for this process contains these pages: 4 7 2 Select the page to replace. 2 7 5 None of these answers 4

m7-review-a2-q3 Select the best answer. Pay attention, this question looks identical to another question you may encounter. CNN and Fox News just announced the invention of a revolutionary fast non volatile static RAM that cost much less than hard drives. Computer designers will from now on have only ____________ levels of memory (without counting registers as a level). 3 2 4 1 None of these answers

m7-review-quiestion17 Select the best answer. Pay attention to questions looking similar. The virtual memory (space) of a process P contains five pages. The system, using Demand Paging, allocates four frames to Process P. We assume that Process P does not waste memory. When Process P executes, it will experience at least ________ page faults. 4 3 None of these answers 6 5

Matching. The objective is to rank page replacement policies from the easiest to the hardest to implement. 1 is the easiest Optimal Least Recently Used First in First Out Last In First Out

4.Optimal 3.Least Recently Used 2.First in First Out 1.Last In First Out

Matching. The objective is to rank page replacement policies from the easiest to the hardest to implement. 1 is the easiest Optimal Least Recently Used First in First Out Last In First Out

4.Optimal 3Least Recently Used 2First in First Out 1Last In First Out

Matching. The objective is to rank page replacement policies from the easiest to the hardest to implement. 1 is the easiest Optimal Least Recently Used First in First Out Last In First Out

4.optimal 3.Least Recently Used 2.First in First Out 1.Last In First Out

Select the best answer. A CPU has a 32 bit address bus and page size = 1024. If paging is used, the page table will have about _______ entries. 2M None of these answers 512K 4M 1 M

Select the best answer. Pay attention to questions looking similar. The virtual memory (space) of a process P contains five pages. The system, using Demand Paging, allocates five frames to Process P. We assume that Process P does not waste memory. When Process P executes, it will experience at least ________ page faults. 4 3 5 6 None of these answers

Select the best answer. Pay attention to questions looking similar. The virtual memory (space) of a process P contains five pages. The system, using Demand Paging, allocates five frames to Process P. We assume that Process P does not waste memory. When Process P executes, it will experience at most ________ page faults. 5 6 4 None of these answers 3

Select the best answer. Pay attention to questions looking similar. The virtual memory (space) of a process P contains five pages. The system, using Demand Paging, allocates four frames to Process P. We assume that Process P does not waste memory. When Process P executes, it will experience at least ________ page faults. 3 None of these answers 4 6 5

Select the best answer. Pay attention to questions looking similar. The virtual memory (space) of a process P contains five pages. The system, using Demand Paging, allocates four frames to Process P. We assume that Process P does not waste memory. When Process P executes, it will experience at most ________ page faults. 4 3 6 None of these answers 5

Select the best answer. With extremely poor temporal locality and excellent spatial locality, the page size would be about _____________. 512 to 16384 bytes None of these answers One byte One item (data or instruction) More than 1 MB

512 to 16384 bytes

Select the best answer. With extremely poor temporal locality and excellent spatial locality, the page size would be about _____________. 512 to 16384 bytes One item (data or instruction) One byte More than 1 MB None of these answers

512 to 16384 bytes

Select the best answer. With extremely poor temporal locality and excellent spatial locality, the page size would be about _____________. None of these answers More than 1 MB One byte 512 to 16384 bytes One item (data or instruction)

512 to 16384 bytes

Select the best answer. With extremely poor temporal locality and excellent spatial locality, the page size would be about _____________. One item (data or instruction) 512 to 16384 bytes More than 1 MB One byte None of these answers

512 to 16384 bytes

m7-q2-a1-q8 Select the best answer. With extremely poor spatial locality and excellent temporal locality, the page size would be about _____________. More than 8192 bytes 512 to 8192 bytes None of these answers A few bytes One byte

512 to 8192 bytes

m7-q3-a2-q4 Matching. When a page fault occurs, some events/actions happens. The objective of this question is to find the chronological order of these events/actions. The number 1 is the earliest event/action. Match each event to its number. Update page table Suspend the offending process CPU generates a memory reference Check page table to determine if the page is in the main memory Put the process in the ready queue

5Update page table 3Suspend the offending process 1CPU generates a memory reference 2Check page table to determine if the page is in the main memory 4Put the process in the ready queue

m7-review-a2-q7 Matching. When a page fault occurs, some events/actions happens. The objective of this question is to find the chronological order of these events/actions. The number 1 is the earliest event/action. Match each event to its number. Update page table Suspend the offending process CPU generates a memory reference Check page table to determine if the page is in the main memory Put the process in the ready queue

5Update page table 3Suspend the offending process 1CPU generates a memory reference 2Check page table to determine if the page is in the main memory 4Put the process in the ready queue

m7-q3-a1-q2 Matching. When a page fault occurs, some events/actions happens. The objective of this question is to find the chronological order of these events/actions. The number 1 is the earliest event/action. Match each event to its number. Update page table Suspend the offending process CPU generates a memory reference Check page table to determine if the page is in the main memory Put the process in the ready queue

5Update page table 4Suspend the offending process 1CPU generates a memory reference 2Check page table to determine if the page is in the main memory 3Put the process in the ready queue

Select the best answer. Consider these page references (time is progressing left to right): 1 3 6 1 3 X 6 3 1 The objective is to select the page to replace using Last-In First-Out. Assume that when Reference X is made, the main memory for this process contains these pages: 3 6 1 Select the page to replace. 1 3 6 None of these answers

Select the best answer. Consider these page references (time is progressing left to right): 1 3 6 1 3 X 6 3 1 The objective is to select the page to replace using Least Recently Used. Assume that when Reference X is made, the main memory for this process contains these pages: 3 6 1 Select the page to replace. 6 3 1 None of these answers

m7-q4-a2-q4 Select the best answer. Pay attention to questions looking similar. The virtual memory (space) of a process P contains five pages. The system, using Demand Paging, allocates five frames to Process P. We assume that Process P does not waste memory. When Process P executes, it will experience at most ________ page faults. 6 3 5 None of these answers 4

m7-q5-a1-q7 Select the best answer. Consider these page references (time is progressing left to right): 1 3 6 1 3 X 6 3 1 The objective is to select the page to replace using Optimal. Assume that when Reference X is made, the main memory for this process contains these pages: 3 6 1 Select the page to replace. None of these answers 6 1 3

Fill in the blank. The total number of available frames in the physical space is 128. The virtual space of a process P is 64 pages large. Process P will get _____ frames allocated at most.

m7-q7-a2-q8 Fill in the blank. The total number of available frames in the physical space is 128. The virtual space of a process P is 64 pages large. The CPU on the system has instructions that can have up to two memory operands. To executed correctly, Process P should get _____ frames allocated at least.

Select the best answer. Consider these page references (time is progressing left to right): 2 4 7 2 4 X 7 6 4 5 2 5 2 The objective is to select the page to replace using Least Recently Used. Assume that when Reference X is made, the main memory for this process contains these pages: 4 7 2 Select the page to replace. 2 4 5 None of these answers 7

Select the best answer. A system uses contiguous allocation with variable partitions and Worst-fit policy. As seen on the picture, Process 11 arrives and needs memory. Scanning bottom to up, the operating system will assign to it the slot _________. ContiguousAllocationExercise.png B None of these answers A Process 10's slot C

Select all that apply. The operating system is needed because __________________ A. I/O operations are frequent and slow B. users and/or applications must share the computer hardware resources C. DMA is not efficient for I/O- Memory data transfers D. None of these answers E. CPU is more efficient for I/O-Memory transfers

A B

Select all that apply. Multiprogramming is needed because . A. it improves CPU utilization B. one process cannot keep CPU and I/O devices busy all times. C. this increases the likelihood that some process is ready to use the CPU D. time-sharing is not as efficient E. it improves interactivity for the user

A B C

Select all that apply. The operating system is needed because __________________ A. I/O operations are frequent and slow B. DMA is not efficient for I/O- Memory data transfers C. users and/or applications must share the computer hardware resources D. None of these answers E. CPU is more efficient for I/O-Memory transfers

A C

Select all that apply. The operating system manage the sharing of these resources. A. memory system B. bus system C. I/O system D. DMA E. central processing unit (CPU)

A C E

Select all that apply. Multiprogramming is needed because . A. memory system B. central processing unit (CPU) C. bus system D. I/O system E. DMA

A B C

Select the best answer. The virtual memory (space) of a process P contains five pages. The system, using Demand Paging, allocates five frames to Process P. We assume that Process P does not waste memory. Which strategy will yield the minimal page fault rate? Any page replacement policy Least Recently Used (LRU) First-In First-Out Last-In First Out None of these answers

Any page replacement policy

Select the best answer. The virtual memory (space) of a process P contains five pages. The system, using Demand Paging, allocates five frames to Process P. We assume that Process P does not waste memory. Which strategy will yield the minimal page fault rate? Last-In First Out Least Recently Used (LRU) First-In First-Out Any page replacement policy None of these answers

Any page replacement policy

Select the best answer. _______________ is an intruder as a component of a computer system. computer hardware None of these answers applications Users Apple Inc

Apple Inc

Select the best answer. ______________ is not a responsibility or a duty of an operating system. A. Memory Management B. None of these answers C. I/O management D. Process Management E. Protection and Security

(M1-Q3-A1-#7)Select all that apply. Timesharing is needed because . A. one process can keep CPU and I/O devices busy all times. B. response time is decreased C. it improves interactivity for the users D. interactivity requires switching the CPU between users frequently. E. your average user can keep CPU and I/O devices busy all times

B C D

Select all that apply. The operating system is __________________ A. a hardware device B. a piece of software C. a resource allocator D. a control program E. none of the above

B C D

Select all that apply. Process management include: A. None of these answers B Process Synchronization C. Process Abstraction D. Process Communication E. Deadlock Handling F. Process Hiding

B D E

Fill in the blank. The program that loads the operating system kernel and starts execution is the ___________________ program.

Bootstrap

Select all that apply. Check all statements that apply to the DMA. A. DMA and CPU can access simultaneously their shared memory B. DMA is faster than the CPU to perform data transfers C. DMA stands for Direct Memory Authority D. None of these answers E. DMA is a hardware device

B E

The kernel is a subset of the __________ a. bootstrap program b. operating system c. DMA d. none of these e. every user program

B. operating system

Select all that apply. For filesystem management, the OS activities are: Back up files in the main memory disk scheduling Back up files on non volatile storage creating, opening, or deleting files or directories None of these answers

Back up files on non volatile storage creating, opening, or deleting files or directories

Check all that apply. Assuming that the size of the main memory is set, the hardware designer can work on these parameters to greatly minimize the effective access time on a demand paging system. Secondary storage access time CPU speed page fault rate main memory chip access time

CPU speed page fault rate

m7-review-a2-q8 Check all that apply. Assuming that the size of the main memory is set, the software operating system designer can work on these parameters to greatly minimize the effective access time on a demand paging system. CPU speed main memory chip access time Secondary storage access time page fault rate

CPU speed page fault rate

Select the best answer. Trashing is occurring when __________________. CPU utilization decreases as the degree of multiprogramming decreases. CPU utilization increases as the degree of multiprogramming increases. CPU utilization plateaus as the degree of multiprogramming increases. CPU utilization decreases as the degree of multiprogramming increases. None of these answers

CPU utilization decreases as the degree of multiprogramming increases.

Select the best answer. Trashing is occurring when __________________. CPU utilization decreases as the degree of multiprogramming increases. CPU utilization decreases as the degree of multiprogramming decreases. CPU utilization increases as the degree of multiprogramming increases. CPU utilization plateaus as the degree of multiprogramming increases. None of these answers

CPU utilization decreases as the degree of multiprogramming increases.

Select the best answer. Trashing is occurring when __________________. None of these answers CPU utilization increases as the degree of multiprogramming increases. CPU utilization decreases as the degree of multiprogramming increases. CPU utilization plateaus as the degree of multiprogramming increases. CPU utilization decreases as the degree of multiprogramming decreases.

CPU utilization decreases as the degree of multiprogramming increases.

Check all that apply. These components of the computer hardware actively and concurrently access the shared memory through a shared bus. USB Controller Central Processing Unit Graphics Adapter None of these answers Direct Memory Access Device Disk Controller

Central Processing Unit Direct Memory Access Device

Check all statements that apply to the DMA. None of these answers DMA and CPU can access simultaneously their shared memory DMA is faster than the CPU to perform data transfers DMA is a hardware device DMA stands for Direct Memory Authority

DMA is faster than the CPU to perform data transfers DMA is a hardware device

Check all that apply. These components of the computer hardware actively and simultaneously access the shared memory through a shared bus. A. Graphics Adapter B. Disk Controller C. Direct Memory Access Device D. Central Processing Unit E. None of these answers F. USB Controller

True or False. The physical space is infinite. True False

True or False? For efficiency reasons, the operating system (OS) is kept on the disk to run. Keeping the OS on disk while running frees the main memory for the user programs.

m7 class quiz #7 Check all that apply. Check all that apply to Demand Paging. The determination of whether a page fault occurs is made by hardware The hardware fully handles a page fault Whenever a page is brought in the physical space, it stays in until the process is terminated On average, access time with simple paging is lower than demand paging In general, the virtual space of all process is larger than the main memory (physical space)

In general, the virtual space of all process is larger than the main memory (physical space)

Select the best answer. The CPU ______________ the data transfers from/to main memory to/from local buffers. None of these answers performs completes initiates blocks

Initiates

Fill in the blank. "The one program running at all times on the computer" is the ____________.

Kernel

The one program running at all times on the computer is the _________

Kernel

Select the best answer. This page replacement policy (Demand Paging) does the opposite of the Least Recently Used: i.e, it will select the page least likely to be selected by Least Recently Used. None of these answers First-In First-Out Last-In First Out Least Recently Used Optimal

Last-In First Out

m7-review-a2-q24 Select the best answer. A demand paging system assigns one frame to each process. If there is high temporal locality, this policy will always outperform every other page replacement algorithm. First-In First-Out Least Recently Used (LRU) second-chance algorithm Last-In First-Out None of these answers

Last-In First-Out

m7-q4-a2-q5 Select the best answer. This page replacement policy (Demand Paging) does the opposite of the Optimal policy: i.e, it will select the page least likely to be selected by Optimal policy. None of these answers Optimal Last-In First Out Least Recently Used First-In First-Out

Least Recently Used

m7-q6-a1-q2 Select the best answer. A demand paging system assigns one frame to each process. If there is high temporal locality, this policy will always outperform every other page replacement algorithm. None of these answers second-chance algorithm Least Recently Used (LRU) Last-In First-Out First-In First-Out

Least Recently Used (LRU)

m7-q3-a1-q3 Check all that apply. The effective access time for demand paging (virtual memory) depends greatly on these parameters. Disk (secondary storage) access time Main memory access time Page fault rate CPU clock (speed) Cache access time

Main memory access time Page fault rate

m7-q3-a1-q4 Check all that apply. Check all that apply to Demand Paging. Most of the time, only a few pages of a program are in the main memory Most of the time, only a few pages of a program are in the virtual memory After a page is brought in the main memory, this same page will never trigger a page fault. A page fault occurs if the validity bit in the page table is 0

Most of the time, only a few pages of a program are in the main memory

Check all that apply. Check all that apply to Demand Paging. Most of the time, only a few pages of a program are in the virtual memory Most of the time, only a few pages of a program are in the main memory After a page is brought in the main memory, this same page will never trigger a page fault. A page fault occurs if the validity bit in the page table is 0

Most of the time, only a few pages of a program are in the main memory After a page is brought in the main memory, this same page will never trigger a page fault. A page fault occurs if the validity bit in the page table is 0

Check all that apply. These components of the computer hardware actively and simultaneously access the shared memory through a shared bus. Disk Controller Graphics Adapter None of these answers USB Controller Central Processing Unit Direct Memory Access Device

None

Select the best answer. A system uses contiguous allocation with variable partitions and first-fit policy. As seen on the picture, Process 11 arrives and needs memory. Scanning bottom to up, the operating system will assign to it the slot _________.

None

Select the best answer. ______________ is not a responsibility or a duty of an operating system. None of these answers I/O management Process Management Protection and Security Memory Management

None of these answers

Check all that apply. These components of the computer hardware actively and simultaneously access the shared memory through a shared bus. A. Direct Memory Access Device B. Central Processing Unit C. None of these answers D. Disk Controller E. USB Controller F. Graphics Adapter

None of these anwser

m7-q3-a2-q1 Check all that apply. These policies/techniques/components will greatly influence the page fault rate. translation look-aside buffers (TLB) Page replacement Number of available frames per process Page table size

Number of available frames per process Page table size

m7-classreview-#8 Check all that apply. These policies/techniques/components will greatly influence the page fault rate. Page replacement Number of available frames per process translation look-aside buffers (TLB) Page table size

Number of available frames per process Page table size

On a computer system, the __________ is/are an intermediary component serving directly the ___________ while receiving service directly from the ____________

Operating system, applications, computer hardware

Select the best answer. A system uses contiguous allocation with equal fixed partitions. As seen on the picture, the operating system can assign fixed partitions B, D, F. When Process 11 arrives, the operating system will certainly assign _______________. ContiguousAllocationExercise4.png Partition D None of these answers Partitions B and D Partitions A and B Partition B

Partition B

m7-q5-a1-q6 Check all that apply. Pay attention to similar questions. Check all that apply about demand paging. The virtual memory of a process P consists of n pages. Process P is assigned m frames such that m > n. We assume that Process P does not waste memory. Process P will trigger at least m page faults Process P will trigger at least n page faults Process P will trigger at most n page faults Process P will trigger at most m page faults

Process P will trigger at least m page faults Process P will trigger at most m page faults

Check all that apply. Pay attention to similar questions. Check all that apply about demand paging. The virtual memory of a process P consists of n pages. Process P is assigned m frames such that m > n. We assume that Process P does not waste memory. Process P will trigger at least m page faults Process P will trigger at least n page faults Process P will trigger at most m page faults Process P will trigger at most n page faults

Process P will trigger at least n page faults Process P will trigger at most m page faults Process P will trigger at most n page faults

m7-review-quiestion16 Check all that apply. Pay attention to similar questions. Check all that apply about demand paging. The virtual memory of a process P consists of n pages. Process P is assigned m frames such that m < n. We assume that Process P does not waste memory. Process P will trigger at least m page faults Process P will trigger at most m page faults Process P will trigger at least n page faults Process P will trigger at most n page faults

Process P will trigger at least n page faults Process P will trigger at most n page faults

Check all that apply. Pay attention to similar questions. Check all that apply about demand paging. The virtual memory of a process P consists of n pages. Process P is assigned m frames such that m = n. We assume that Process P does not waste memory. Process P will trigger at most m page faults Process P will trigger at least m page faults Process P will trigger at least n page faults Process P will trigger at most n page faults

Process P will trigger at most m page faults Process P will trigger at least m page faults Process P will trigger at least n page faults Process P will trigger at most n page faults

m7-q6-a1-q11 Check all that apply. Pay attention to similar questions. Check all that apply about demand paging. The virtual memory of a process P consists of n pages. Process P is assigned m frames such that m > n. We assume that Process P does not waste memory. Process P will trigger at least n page faults Process P will trigger at least m page faults Process P will trigger at most n page faults Process P will trigger at most m page faults

Process P will trigger at most n page faults

m7-q7-a2-q12 Check all that apply. Pay attention to similar questions. Check all that apply about demand paging. The virtual memory of a process P consists of n pages. Process P is assigned m frames such that m > n. We assume that Process P does not waste memory. Process P will trigger at least n page faults Process P will trigger at least m page faults Process P will trigger at most n page faults Process P will trigger at most m page faults

Process P will trigger at most n page faults

m7-q5-a1-q9 Check all that apply. Pay attention to similar questions. Check all that apply about demand paging. The virtual memory of a process P consists of n pages. Process P is assigned m frames such that m = n. We assume that Process P does not waste memory. Process P will trigger at most n page faults Process P will trigger at most m page faults Process P will trigger at least n page faults Process P will trigger at least m page faults

Process P will trigger at most n page faults Process P will trigger at most m page faults

Check all that apply. Assuming that the size of the main memory is set, the hardware designer can work on these parameters to greatly minimize the effective access time on a demand paging system. page fault rate Secondary storage access time CPU speed main memory chip access time

Secondary storage access time main memory chip access time

Check all that apply. Assuming that the size of the main memory is set, the hardware designer can work on these parameters to greatly minimize the effective access time on a demand paging system. CPU speed Secondary storage access time main memory chip access time page fault rate

Secondary storage access time main memory chip access time

Check all that apply. Assuming that the size of the main memory is set, the software operating system designer can work on these parameters to greatly minimize the effective access time on a demand paging system. Secondary storage access time main memory chip access time CPU speed page fault rate

Secondary storage access time main memory chip access time

elect the best answer from each dropdown menu. The operating system is a a ___________ that makes the use of a computer system _________, __________ , and__________ .

Software, convenient, efficient, secure

m7-review-a1-quiestion21 Check all that apply. Check all that applies to Least Recently Used page replacement algorithm for demand paging. None of these answers The higher the spatial locality the higher the page fault rate The higher the temporal locality the higher the page fault rate The higher the temporal locality the smaller the page fault rate The higher the spatial locality the smaller the page fault rate

The higher the temporal locality the higher the page fault rate

Check all that apply. Check all that applies to Least Recently Used page replacement algorithm for demand paging. The higher the temporal locality the smaller the page fault rate The higher the spatial locality the higher the page fault rate The higher the temporal locality the higher the page fault rate None of these answers The higher the spatial locality the smaller the page fault rate

The higher the temporal locality the smaller the page fault rate

m7 class quiz #7 When a page fault occurs, some events/actions happens. The objective of this question is to find the chronological order of these events/actions. The number 1 is the earliest event/action. Match each event to its number. Update page table Suspend the offending process CPU generates a memory reference Check page table to determine if the page is in the main memory Put the process in the ready queue

Update page table 5 Suspend the offending process 3 CPU generates a memory reference 1 Check page table to determine if the page is in the main memory 2 Put the process in the ready queue 4

Select the best answer. With extremely poor temporal locality and excellent spatial locality, the memory hierarchy would have ________ levels. We assume current technology and we do not count registers or the Internet as levels. at most 2 3 1 None of these answers 4

at most 2

Select the best answer. A system uses contiguous allocation with variable partitions with Best-fit policy. As seen on the picture, Process 11 arrives and needs memory. Scanning bottom to up, the operating system will assign to it the slot _________. ContiguousAllocationExercise.png A None of these answers C Process 10's slot B

Select all that apply. These algorithms will exhibit a good spatial locality. a. matrices multiplication b. matrices addition c. None of these answers d. displaying sequentially items in a large array e. binary search in an array f. displaying randomly items in a large array

b c

(M1 - Q4 - A1- #2)the memory system is organized on an hierarchy because of: a. technological storage limits b. cost per byte store c. access time d. volatility e. theoretical storage limits

b c d

Select all that apply. For mass storage management, the OS activities are: a. None of these answers b. Storage allocation c. Disk scheduling d. Free-space management e. Backup files onto stable (non-volatile) storage media

b c d

OS duties includes these: a. internet browsing b.memory management c. I/O management d. Bus subsystem e. none of these f. process management

b c f

these algorithms wil exhibit a good spatial locality. a. matrices multiplication b.displaying sequentially items in a large array c.none of these d. binary search in an array e. matrices addition f. displaying randomly items in a large array

b e

data transfer between register and cache are manage by a. operating system b. programmer c. user d. hardware e. compiler

b programmer e. compiler

(m1 - q4 - a1 - #9) these algorithms will exhibit a good spatial locality. a. displating randomly items in a large way b. displaying sequentially items in a large array c.binary search in an array d. matrices addition e. matrices multiplication

b. displaying sequentially item in a large array d matrices addition

after not finding a datum in the cache, the system will look next into the ______. a. hard drive b. main memory c.none of these d. registers e. cache

b. main memory

Check all that apply. Trashing can be prevented by __________________. allowing frames borrowing between processes. allow a process to keep frames as long as it needs them barring a process from getting frames from other processes increasing the degree of multiprogramming only as long as the CPU utilization increases

barring a process from getting frames from other processes

Fill in the blank. The program that loads the operating system kernel and starts execution is the ___________________ program.

bootstrap

Select the best answer from each dropdown menu. The __________ loads at start up the ____________.

bootstrap program operating system

Select the best answer from each dropdown menu. The ______ is small and loaded at start up or reboot. It is NOT initially stored in the _______ .

bootstrap program, RAM

When a CPU attempts to fetch an instruction or a data operand, the memory system will look first in the ___________ level. a. least expensive b. largest c. fastest d. non volatile e. none of these

c. fastest

a system call is made by ______ a. an interrupt b. a kernel program c. user program d. none of these e. a timer

c. user program

Select the best answer. When a CPU attempts to fetch an instruction or a data operand, the memory system will look first in the ___________. hard drive None of these answers network storage (clouds) main memory cache

cache

Select the best answer. When a CPU attempts to fetch an instruction or a data operand, the memory system will look first in the ___________. main memory hard drive network storage (clouds) None of these answers cache

cache

(m1 - q4- a1 - #7)Use the best combination to build a true statement out of this one: After not finding a datum in the ______ , the ______ will try to load it from _______ .

cache hardware main memory

(M1 - Review - #3)Select the best answer. For a computer system, _______________ is an intruder. None of these answers computer hardware applications operating system User

computer hardware

Select the best answer. This is an intruder among the components or sub-components of a computer system. applications BIOS computer hardware operating system None of these answers

computer hardware

Select the best answer. This is an intruder among the components or sub-components of a computer system. operating system None of these answers You Answered BIOS applications computer hardware

computer hardware

Select the best answer from each dropdown menu. DMA are a mechanism provided by the _______ to help ________ carry its mission efficiently.

computer hardware operating system

Select the best answer from each dropdown menu. DMA are a mechanism provided by the ________ to help _______ carry its mission efficiently.

computer hardware operating system

Select the best answer from each dropdown menu. Interrupts are a mechanism provided by the ________________- to help ___________________ carry its mission efficiently.

computer hardware operating system

Select the best answer. On a computer hardware with multiple CPUs and a shared memory and bus system, I/O devices and the CPUs execute ______________. concurrently simultaneously None of these answers alternatively exclusively

concurrently

Select the best answer. On a computer hardware with multiple CPUs and a shared memory and bus system, I/O devices and the CPUs execute ______________. simultaneously None of these answers exclusively alternatively concurrently

concurrently

m7-review-a1-quiestion24 Select the best answer from each dropdown menu. Belady's anomaly _____ that _______ allocated to a process will yield a ______ rate.

confirm more frames higher page fault

Fill in the blank. The operating system could be seen as a _______________ program.

control

m7-q1-a2-q11 Select all that apply. The memory system is organized in an hierarchy because of: cost per byte stored technological storage limits theoretical storage limits access time volatility

cost per byte stored technological storage limits access time volatility

Select all that apply. For filesystem management, the OS activities are: creating, opening, or deleting files or directories Back up files on non volatile storage None of these answers Back up files in the main memory disk scheduling

creating, opening, or deleting files or directories Back up files on non volatile storage

Spatial locality refers to this property exhibited by most algorithms. a. local variables are preferable to global variables. b.variables close (in the memory) to recently referenced variables will not be referenced soon c. none d.variables close (in the memory) to recently referenced variables will be referenced soon. e. variables far (in the memory) from recently referenced variables will be referenced soon.

d. variables close (in the memory) to recently referenced variables will be referenced soon.

M1 - class quiz - #1 Select the best answer. _______________ is an intruder as a component of hardware. Memory None of these answers Central Processing Unit (CPU) Devices drivers Input/Output (I/O) devices

device drivers

everything 1

True or False? For efficiency reasons, the operating system (OS) is kept on the disk to run. Keeping the OS on disk while running frees the main memory for the user programs.

false

True or False? On any CPU, the operating system can be designed to maintain full control of the computer system, i.e., to be the boss in charge.

false

Caching consists of copying information into a ______ storage system; ________ can be viewed as a cache for the hard drive.

faster main memory

Select the best answer from each dropdown menu. Caching consists of copying information into a __________ storage system; ____________ can be viewed as a cache for the hard drive.

faster main memory

Select the best answer from each dropdown menu. Caching consists of copying information into a _______ storage system; ______ can be viewed as a cache for the hard drive.

faster main memory

Select all that apply. Variables referenced in the body of theses constructs will surely exhibit high temporal locality for loops sequential code with no loops while loops None of these answers nested loops if-then-else

for loops while loops nested loops

Select all that apply. Data transfers between main memory and cache are managed by compiler operating system hardware programmer user

hardware

Select all that apply. Data transfers between main memory and cache are managed by programmer compiler operating system hardware user

hardware

data transfer between main memory and cache are managed by a. programmer b. hardware c. compiler d. operating system e. user

hardware

Select the best answer from each dropdown menu. _______ may trigger an interrupt at any time by sending a signal to the _________

hardware, CPU

Check all that apply. Check all that apply to logical address translation. The physical address is always different from the logical address The memory management unit may be inside the CPU The address translation consists always of an addition Different CPU may have different translation schemes Address translation is implemented in software

he memory management unit may be inside the CPU Different CPU may have different translation schemes

Check all that apply. Trashing can be prevented by __________________. allow a process to keep frames as long as it needs them barring a process from getting frames from other processes allowing frames borrowing between processes. increasing the degree of multiprogramming only as long as the CPU utilization increases

increasing the degree of multiprogramming only as long as the CPU utilization increases barring a process from getting frames from other processes

Check all that apply. Trashing can be prevented by __________________. increasing the degree of multiprogramming only as long as the CPU utilization increases barring a process from getting frames from other processes allowing frames borrowing between processes. allow a process to keep frames as long as it needs them

increasing the degree of multiprogramming only as long as the CPU utilization increases barring a process from getting frames from other processes

Check all that apply. The CPU accesses the main memory to fetch busses addresses instructions data

instructions data

Select all that apply. Multiprogramming is needed because . it improves CPU utilization one process cannot keep CPU and I/O devices busy all this increases the likelihood that some process is ready to use the CPU time-sharing is not as efficient it improves interactivity for the user

it improves CPU utilization one process cannot keep CPU and I/O devices busy all times. this increases the likelihood that some process is ready to use the CPU

Check all that apply. Demand paging is using dynamic allocation when it ___________________. it varies the number of allocated frames based on the process's needs uses equal allocation algorithm uses the proportional allocation algorithm uses least recently used algorithm

it varies the number of allocated frames based on the process's needs

Fill in the blank. "The one program running at all times on the computer" is the ____________.

kernel

Fill in the blank. Amore common definition, and the one that [the textbook author] usually follows, is that the operating system is the one program running at all times on the computer—usually called the ____________.

kernel

A CPU with dual mode will run the OS under the ______ while a user program will run under the _____ mode.

kernel user

Select the best answer from each dropdown menu. A CPU with dual mode will run the OS under the ______ mode while a user program will run under the _____ mode.

kernel user

Select the best answer from each dropdown menu. A CPU with dual mode will run the OS under the _________ while a user program will run under the ___________.

kernel mode user mode

m7-classquiz-#23 Select the best answer. A demand paging system assigns one frame to each process. If there is high temporal locality, this policy will always outperform every other page replacement algorithm. Least Recently Used (LRU) None of these answers First-In First-Out second-chance algorithm Last

last in first out

m7-q5-a1-q10 Select the best answer. This page replacement policy (Demand Paging) does the opposite of the Optimal policy: i.e, it will select the page least likely to be selected by Optimal policy. First-In First-Out Last-In First Out Optimal Least Recently Used None of these answers

last in first out

Check all that apply. These policies take advantage directly from high temporal locality. Least Recently Used First-In First-Out Last-In First-Out Optima1

least recently used

Check all that apply. These policies take advantage directly from high temporal locality. Optimal Least Recently Used First-In First-Out Last-In First-Out

least recently used

Select the best answer. After not finding a datum in the cache, the system will look next into the _____________. registers cache hard drive None of these answers main memory

main memory

Select the best answer. After not finding a datum in the cache, the system will look next into the _____________. registers None of these answers cache hard drive main memory

main memory

Select the best answer. Virtual memory uses __________________________ as a cache. hard drive registers None of these answers hard drive main memory

main memory

m7-q3-a1-q1 Check all that apply. Assuming that the size of the main memory is set, the software operating system designer can work on these parameters to greatly minimize the effective access time on a demand paging system. CPU speed page fault rate main memory chip access time Secondary storage access time

main memory chip access time

m1-q4-a2-#8 Select all that apply. These algorithms will exhibit a good spatial locality. displaying randomly items in a large array matrices multiplication matrices addition displaying sequentially items in a large array None of these answers binary search in an array

matrices addition displaying sequentially items in a large array

Select all that apply. These algorithms will exhibit a good spatial locality. matrices multiplication displaying randomly items in a large array None of these answers binary search in an array matrices addition displaying sequentially items in a large array

matrices addition displaying sequentially items in a large array

Select all that apply. Memory management aims to: maximize CPU utilization minimize response time minimize CPU utilization maximize response time

maximize CPU utilization minimize response time

Select all that apply. Variables referenced in the body of theses constructs will surely exhibit high temporal locality nested loops while loops None of these answers sequential code with no loops for loops if-then-else

nested loops while loops for loops

m7-q1-a2-q13 Check all that apply. Virtual memory would not be necessary if______________. the logical space of a process is larger than its physical space. non volatile secondary storage became as fast as the CPU cache the physical space of a process is larger than its logical space. non volatile secondary storage became as fast as the main memory the main memory can be expanded further

non volatile secondary storage became as fast as the main memory

Select the best answer. This page replacement policy (Demand Paging) does the opposite of the Optimal policy: i.e, it will select the page least likely to be selected by Optimal policy. First-In First-Out None of these answers Least Recently Used Last-In First Out Optimal

none

Check all that apply. These components of the computer hardware actively and simultaneously access the shared memory through a shared bus. Direct Memory Access Device Central Processing Unit Disk Controller USB Controller None of these answers Graphics Adapter

none of these

m1 class quiz #24 Select all that apply. Variables referenced in the body of theses constructs will surely exhibit high spatial locality. while loops sequential code with no loops if-then-else None of these answers for loops nested loops

none of these

Select the best answer. The kernel is a subset of the ___________________. DMA bootstrap program None of these answers operating system every user program

operating system

Select the best answer. The kernel is a subset of the ___________________. None of these answers every user program operating system DMA bootstrap program

operating system

Select the best answer. The kernel is a subset of the ___________________. operating system every user program bootstrap program DMA None of these answers

operating system

(M1 - Review - #5)Select the best answer from each dropdown menu. On a computer system, the ____________ is/are an intermediary component serving directly the __________ while receiving service directly from the _____________.

operating system application computer hardware

Select the best answer. Temporal locality refers to this property exhibited by most algorithms. None of these answers recently referenced variables will referenced again soon recently referenced variables will not be referenced soon recently referenced variables were referenced in temporary storage (e.g., cache) recently referenced variables will never be referenced again

recently referenced variables will referenced again soon

Select the best answer. Temporal locality refers to this property exhibited by most algorithms. recently referenced variables were referenced in temporary storage (e.g., cache) recently referenced variables will never be referenced again None of these answers recently referenced variables will referenced again soon recently referenced variables will not be referenced soon

recently referenced variables will referenced again soon

m7-q1-a1-q3 Select the best answer from each dropdown menu. Use the best combination to build a true statement out of this one: After not finding a datum in the __ , the __ will try to load it from __ .

Select all that apply. Timesharing is needed because . response time is decreased it improves interactivity for the users one process can keep CPU and I/O devices busy all times. interactivity requires switching the CPU between users frequently. your average user can keep CPU and I/O devices busy all times.

response time is decreased it improves interactivity for the users interactivity requires switching the CPU between users frequently.

Select all that apply. Timesharing is needed because . one process can keep CPU and I/O devices busy all times. response time is decreased it improves interactivity for the users interactivity requires switching the CPU between users frequently. your average user can keep CPU and I/O devices busy all times.

response time is decreased it improves interactivity for the users interactivity requires switching the CPU between users frequently.

Check all that apply. On modern systems, address binding is performed at ______________. linking time load time compile time running time execution time

running time execution time

Select the best answer. Virtual memory is implemented by _______________________. hardware only None of these answers software only operating system software only software with hardware support

software with hardware support

Select the best answer. Virtual memory is implemented by _______________________. software only operating system software only None of these answers hardware only software with hardware support

software with hardware support

m7-q7-a1-q8 Check all that apply. Check all page replacement policies that may suffer from the Belady's anomaly. First-In First-Out Last-In First-Out Least Recently Used Optimal stack algorithm(s)

stack algorithm(s)

m7-q7-a2-q4 Select the best answer. In demand paging, the working set model is used by the _________ algorithm. dynamic allocation static equal allocation proportional allocation window allocation

static equal allocation

Select the best answer. In order to totally eliminate external fragmentation, _______________________. the OS could allow variable partitions the OS could perform memory compaction once a day the OS could fragment the processes and place them in slots not necessarily contiguous the OS could use fixed size partitions with the option to merge adjacent partitions

the OS could fragment the processes and place them in slots not necessarily contiguous

Select the best answer. For storage management, the logical unit is ________. the file a sector on a hard drive the track on a hard drive a data block None of these answers

the file

m7-review-#3 Check all that apply. Virtual memory would not be necessary if______________. the physical space of a process is larger than its logical space. the main memory can be expanded further non volatile secondary storage became as fast as the main memory non volatile secondary storage became as fast as the CPU cache the logical space of a process is larger than its physical space.

the main memory can be expanded further non volatile secondary storage became as fast as the main memory

Select the best answer. The degree of multiprogramming is _______________________. the number of processes allowed to concurrently run in a system the number of processes allowed to simultaneously run in a system the maximal number of threads that each process can have the number of processes admitted to concurrently run in a system None of these answers

the number of processes allowed to concurrently run in a system

m7-q1-a1-q16 Check all that apply. Virtual memory would not be necessary if______________. the physical space of a process is larger than its logical space. the logical space of a process is larger than its physical space. non volatile secondary storage became as fast as the main memory the main memory can be expanded further non volatile secondary storage became as fast as the CPU cache

the physical space of a process is larger than its logical space.

Select the best answer. For demand paging, the working set is a set of pages____________________. the process used in the recent past (during some preset period D). the process requires to start working. the process will likely use in the near future the process uses throughout its lifetime

the process used in the recent past (during some preset period D).

Select the best answer. For demand paging, the working set is a set of pages____________________. the process used in the recent past (during some preset period D). the process uses throughout its lifetime the process will likely use in the near future the process requires to start working.

the process used in the recent past (during some preset period D).

m7-q6-a1-q3 Select the best answer. In demand paging, the minimal number of frames to allocate to any process is set by the _________. operating system computer architecture user/programmer the size of the memory cache. the size of the program

the size of the memory cache.

m7-review-a2-q23 Select the best answer. In demand paging, the minimal number of frames to allocate to any process is set by the _________. the size of the memory cache. the size of the program operating system user/programmer computer architecture

the size of the memory cache.

elect all that apply. Multiprogramming is needed because . this increases the likelihood that some process is ready to use the CPU it improves CPU utilization one process cannot keep CPU and I/O devices busy all times. it improves interactivity for the user time-sharing is not as efficient

this increases the likelihood that some process is ready to use the CPU it improves CPU utilization one process cannot keep CPU and I/O devices busy all times.

Select all that apply. Multiprogramming is needed because . one process cannot keep CPU and I/O devices busy all times. it improves CPU utilization time-sharing is not as efficient it improves interactivity for the user this increases the likelihood that some process is ready to use the CPU

this increases the likelihood that some process is ready to use the CPU one process cannot keep CPU and I/O devices busy all times. it improves CPU utilization

Select all that apply. Data transfers between main memory and hard drive are managed by user hardware programmer compiler operating system

user operating system

Check all that apply. Transfers main memory-secondary storages are managed by the ______________. user/programmer operating system hardware only the memory management unit compiler

user/programmer operating system

m7-classquiz-#24 Select the best answer. In demand paging, the minimal number of frames to allocate to any process is set by the _________. the size of the program user/programmer operating system the size of the memory cache. computer architecture

user/programmer operating system

Select all that apply. The operating system is needed because __________________ I/O operations are frequent and slow CPU is more efficient for I/O-Memory transfers users and/or applications must share the computer hardware resources DMA is not efficient for I/O- Memory data transfers None of these answers

users and/or applications must share the computer hardware resources I/O operations are frequent and slow

Select the best answer. Spatial locality refers to this property exhibited by most algorithms. None of these answers variables close (in the memory) to recently referenced variables will be referenced soon. variables far (in the memory) from recently referenced variables will be referenced soon. local variables are preferable to global variables. variables close (in the memory) to recently referenced variables will not be referenced soon.

variables close (in the memory) to recently referenced variables will be referenced soon.

Select the best answer. Spatial locality refers to this property exhibited by most algorithms....... local variables are preferable to global variables. variables far (in the memory) from recently referenced variables will be referenced soon. variables close (in the memory) to recently referenced variables will not be referenced soon. variables close (in the memory) to recently referenced variables will be referenced soon. None of these answers

variables close (in the memory) to recently referenced variables will be referenced soon.

m7-q1-a1-q9 Select all that apply. The memory system is organized in an hierarchy because of: volatility technological storage limits cost per byte stored theoretical storage limits access time

volatility technological storage limits cost per byte stored access time

Select all that apply. Variables referenced in the body of theses constructs will surely exhibit high temporal locality if-then-else while loops nested loops for loops sequential code with no loops None of these answers

COMP 3500 FINAL EXAM

संबंधित स्टडी सेट्स

BA 1301 - Exam 4

DBI_PT2

Chapter 38: Agents to control Blood Glucose

Nutrition - Nursing Concepts

chapter 2

ATI-PQ 5

CH 35: MEN'S HEALTH DRUGS

Accounting quizzes

Review for Exam #1

The Wheels on the Bus

Chp 12 and 13

HW3: Physical Development and Biological Aging

Ap bio

Macro Exam 3

History of Graphic Design - ART3643: Chapter 11

SAFe Lesson 4: Building Solutions with Agile Product Delivery

Social Psychology Chapter 5

Chapter 14: Composing Your Speech

ECO 251 Exam 3

TEAS - A&P Quiz Questions