OSG202
Assume jobs A-D arrive in quick succession in the READY queue. Using round robin scheduling (quantum=4), the average turnaround time for each job is ________. ; Arrival time: 0 1 2 3 Job: A B C D ; CPU cycle: 8 4 9 5Page Loaded Last ref. R M ; ------------------------------------------------------------ 0 226 280 0 0 ; 1 160 265 0 1 2 110 270 1 0 ; 3 120 285 1 1 Which page will NRU replace?
toicankey 0
A memory free in 3 frames. Which values do the last page frame contain after running as the following page 7, 0 , 1, 2 , 0, 3, 0 , 4, 2 , 3 , 0 using LRU
toicankey 0, 2, 3
A ssume that four jobs A-D require the CPU cycles listed below. Using the Shortest Job First algorithm, the ____ job is run first. ; Arrival time: 4 1 0 2 Job: A B C D ; CPU cycle: 5 2 6 4 Arrival time: 4 1 0 2 ; Job: A B C D CPU cycle: 5 2 6 4
toicankey 10.5
A memory free in 3 frames. How many page fault occur after running as the following page 7, 0 , 1, 2 , 0, 3, 0 , 4, 2 , 3 , 0 , 3 , 2 , 1, 2, 0, 1, 0 , 7 using LRU
toicankey 12
Consider a swapping system in which memory consists of the following hole sizes in memory order: 10 KB, 4 KB, 20 KB, 18KB, 7 KB, 9KB, 12 KB, and 15 KB. Which hole is take for successive segment requests of 12 KB, 10KB, 9KB for best fit?
toicankey 12KB, 10 KB, 9KB
A memory free in 3 frames. How many page fault occur after running as the following page 7, 0 , 1, 2 , 0, 3, 0 , 4, 2 , 3 , 0 , 3 , 2 , 1, 2, 0, 1, 0 , 7 using FIFO
toicankey 13
Assume jobs A-D arrive in quick succession in the READY queue. Using round robin scheduling with time slice equaling 4, the turnaround time for job D is ____. ; Arrival time: 0 1 2 3Job: A B C D ; CPU cycle: 8 4 9 5Arrival time: 0 1 2 3 ; Job: A B C DCPU cycle: 8 4 9 5
toicankey 14.25
Put the steps in making a system call in order ; 1. System calls may vary from one OS to another2. System calls are like procedures: take parameters, calling routine waits for response (a call to an OS service) ; 3. Once a system call occurs control passes to a specific routing in system mode. If the parameters are correct and legal the request will be executed (a trap into the OS code)Arrival time: 0 1 2 3 ; Job: A B C D CPU cycle: 6 3 1 4
toicankey 2.75
Consider a swapping system in which memory consists of the following hole sizes in memory order: 10 KB, 4 KB, 20 KB, 18KB, 7 KB, 9KB, 12 KB, and 15 KB. Which hole is take for successive segment requests of 12 KB, 10KB, 9KB for first fit?
toicankey 20 KB, 10KB, 18KB
Consider a swapping system in which memory consists of the following hole sizes in memory order: 10 KB, 4 KB, 20 KB, 18KB, 7 KB, 9KB, 12 KB, and 15 KB. Which hole is take for successive segment requests of 12 KB, 10KB, 9KB for next fit?
toicankey 20KB, 18KB, 9KB
Which address range (byte) is corresponding to 32 bit virtual address 0x00403004 (4.206.596 in decimal)? (Using Multilevel Page Table)
toicankey 4.206.592 to 4.210.687
Assume that four jobs A-D require the CPU cycles listed below. Using the Shortest Job First algorithm, the average waiting time is ____. ; Job: A B C D CPU cycle: 5 2 6 4
toicankey 4.75
A memory free in 4 frames. How many page faults do occur after running as the following page 2 3 2 0 1 5 2 4 5 3 2 5 2 using LRU
toicankey 7
A memory free in 3 frames. Which values do the last page frame contain after running as the following page 7, 0 , 1, 2 , 0, 3, 0 , 4, 2 , 3 , 0 , 3 , 2 , 1, 2, 0, 1, 0 , 7 using FIFO
toicankey 7, 1, 2
Assume that jobs A-D arrive in the ready queue in quick succession and have the CPU cycle requirements listed below. Using the Shortest Remaining Time Next algorithm, the Turnaround time of job D is ____. ; Arrival time: 0 1 2 3 Job: A B C D ; CPU cycle: 6 3 1 4 Arrival time: 0 1 2 3 ; Job: A B C D CPU cycle: 6 3 1 4
toicankey 8
_____ are used to model devices that consist of a collection of randomly addressable blocks such as disks
toicankey A block special file
A time-sharing system is
toicankey A multi-user, multi-process, interactive system
____ is a sort of pseudofile that can be used to connect to processes
toicankey A pipe
1. It is a list of memory locations (set of addresses) from 0 to some maximum, which the process can read and write ; 2. It make the different programs think they have the hardware on their ownWhat's is it?
toicankey Address space
Process includes ______
toicankey All of others
The following requirement must be met by any facility or capability that is to provide support for mutual exclusion:
toicankey All of the others
What is Software proposal in the solution of Mutual exclusion with Busy waiting
toicankey All of the others
Which is the difference between personal computers and mainframe computers?
toicankey All of the others
Which of these statements about Layered System are not true?
toicankey Bottom layer is the user interface ; toicankey The highest layer is hardware
Which of these statements about Batch service in Mainframe OS are true?
toicankey CPU is often idle, all jobs are kept on a disk ; toicankey The OS always residents in memory and transfer control automatically from one job to the next in the sequence requested jobs
The virtual machine
toicankey Can run any OS that will run directly on the bare hardware ; toicankey Is identical to the true hardware
A ssume that four jobs A-D require the CPU cycles listed below. Using the Round-Robin algorithm with time slide equaling 4, the waiting time of all process is ______ . ; Arrival time: 4 1 0 2 Job: A B C D ; CPU cycle: 5 2 6 4 1. Switching the CPU to another process requires saving the state of the old process and loading the save state for the new process ; 2. It can create a performance bottle neck"What's is it?
toicankey Context switch
The copy-on-write strategy solution is known as
toicankey Deep copy ; toicankey Sharing modified page ; toicankey Sharing data
Which of these statements about address space definition are true?
toicankey Do not have to be numeric ; toicankey Is decoupled from the physical memory
Which of these statements about virtual memory are true?
toicankey Gives the ability to run programs larger than the machine's physical memory by moving pieces back and forth between RAM and disk ; toicankey Enabled the ability to have a program dynamically link on a library at run time instead of having it compiled in
With given page table and 16 bit virtual address, that is split 4 bit page numbers and 12 bit offset. If user references the address 28500, which physical address is in memory ?
toicankey If the page fault occurred, the page frame is evicted as 7, the physical address is 32596
The developer divides the program to many pieces. When a program started, ; span>- -->First, the piece manager (piece 0) is loaded into the memory ; - Then, the piece 0 is informed to load the little piece (piece 1) into memory either above piece 0 in memory (if there was space for it) or on top piece 0 (if there was no space)- When the piece 1 finished, the piece 0 is informed to load the piece 2 into memory either above piece 1 in memory (if there was space for it) or on top piece 0 (if there was no space), and so on ; What is the mechanism?Given the relation of the virtual addresses and physical memory. Applying the Multilevel page table strategy, Which of these statement are true when the user reference the address 12599303?
toicankey Index of table level 1 is 3, Index of table level 2 is 4, offset is 7, the physical address is 16391
Preemption is essential in which of the following systems?
toicankey Interactive system ; toicankey Real time system
Should the page replacement algorithms try to find LRU page consider only the page currently allocated to particular process, or should it consider all the pages in memory? Which policy does this question reference?
toicankey Local allocation ; toicankey Global Allocation
1. Map a disk block to a page (s) in memory and page used the file on disk as the backing store ; 2. Allowing a part of the virtual address space to be logically associated with the fileWhat's is the strategy?
toicankey Memory-mapped file
MS-DOS is a example of ....
toicankey Monolithic system
_______ is the rapid switching of the CPU between multiple processes in memory
toicankey Multi-programming
Let n represents as process, p represents as page. Which the strategy does the paging apply?
toicankey Multilevel page table
Which of these statements about No Memory Abstraction are true?
toicankey No swapping ; toicankey No paging
Which of these statements about virtual memory are not true?
toicankey None of others
Which is a wrong statement about the quantum used in Round Robin algorithm?
toicankey None of the others
Which of the following statements is incorrect about user mode and kernel mode?
toicankey None of the others
Which of these statements about Microkernel are not true?
toicankey None of the others
One of the way of memory organization is ____ at the bottom of memory in the simplest model of the No Memory Abstraction
toicankey Operating System
Each page can be labeled with the number of instructions that will be executed before that page is first reference. Choose the page that will be the latest one accessed in the future between all the pages actually in memory
toicankey Optimal
When a virtual memory system manages memory in fixed length units, which of the following terms correctly represents its unit?
toicankey Page
System calls
toicankey Permit application programs to access protected resources ; toicankey The interface between user programs and the OS
Which of the following information bits in the entry of page table is used to indicate Page Fault?
toicankey Present/absent bit
OS manage the system security such as authentication, protecting the system from unwanted intruders
toicankey Protection
What is not a main function of an operating system?
toicankey Provide user interfaces
What is the main characteristic of embedded operating system?
toicankey Restriction of memory size, speed of CPU, screen size, powers
Kernel mode is defined that _______
toicankey The mode has complete access to all the hardware ; toicankey The mode can execute any instruction the machine is capable of executing
Which of these statements about Microkernel are true?
toicankey The modules run user mode `\rightarrow` protection against bugs
In the OS concept, the software can be divided into 2 important modes
toicankey User mode ; toicankey Supervisor mode
The first-come, first-served (FCFS) algorithm is fine for most ____ systems.
toicankey batch
Which of the following process state transitions are illegal?
toicankey blocked -> running
If the system passes control to a user program, the ____ mode switches to the ____ mode
toicankey kernel/user ; toicankey supervisor/user
Base register holds the ________ where the program begins in a memory abstraction.
toicankey physical address
1. The mechanism allows a child process to inherit a communication channel from its parent; data written to one end of it can be read at the other hardware on their own ; 2. A mechanism for passing data among processesWhat's is the mechanism?
toicankey pipe ; toicankey Pseudo file
The UNIX command interpreter, or GUI
toicankey shell
The OS figures out what the calling process wants by inspecting the parameter, then it carries out the _______ and returns the control to the instruction following the _____
toicankey system call/ system call ; toicankey kernel mode/ user mode
Limit register specifies ______ in A memory Abstraction
toicankey the length of program
First-come, first-served (FCFS) is a very simple algorithm to implement because it ____.
toicankey uses a FIFO queue
Assume jobs A-D arrive in quick succession in the READY queue. Using shortest remaining time next scheduling, the average waiting time for each process is ____. ; Arrival time: 0 1 2 3Job: A B C D ; CPU cycle: 8 4 9 52. This thread is identical to all the others, but it do not have any history (registers, stack, ...) that must be restored ; Which type is thread?Job: A B C D ; CPU cycle: 5 2 6 4 Arrival time: 0 1 2 3 ; Job: A B C DCPU cycle: 4 5 5 4
toicankey16
Five batch jobs A through E, arrive at a computer center at almost the same time. They have estimated running times of 8, 6, 2, 10, and 4 minutes. Their (externally determined) priorities are 3, 5, 2, 1, and 4, respectively, with 5 being the highest priority. Determine the mean process average turnaround time for priority scheduling. Ignore process switching overhead .
toicankey16.8 minutes
A process is a program on the disk (A) ; A process is not a program on the disk (B)Arrival time: 0 1 2 3 ; Job: A B C D CPU cycle: 8 4 9 5
toicankey18.25
A memory free in 4 frames. Which state of the memory after the page 4 is accessed when the requested page as 2 3 2 0 1 5 2 4 5 3 2 5 2 using LRU
toicankey2 5 4 1
Suppose a virtual address space of `2^24` words and the page size is `2^10` words. If the virtual address is 91A000 in Hexadecimal, what would be the page number in Hexadecimal?
toicankey2468
Given the relation of the virtual addresses and physical memory. Applying the paging strategy, Which of these statement are true when the user reference the address 45156 ?
toicankey28772
When the page fault occurs, the page replacement algorithm is applied. How many page faults can occur at least if the memory has 5 page frames and the program splitting 4 pages ?
toicankey4
Assume jobs A-D arrive in quick succession in the READY queue. Using shortest job first scheduling, the average turnaround time for each process is ___________ . ; Arrival time: 0 1 2 3Job: A B C D ; CPU cycle: 4 5 5 4Arrival time: 0 1 2 3 ; Job: A B C DCPU cycle: 4 5 5 4
toicankey4.75
A memory free in 5 frames. How many page hit do occur after running as the following page 2 3 2 0 1 5 2 4 5 3 2 5 2 using FIFO
toicankey5
What is the below contents described? ; 1. Making the different programs think they have the hardware on their own2. The abstraction that is referenced to the set of addresses a process ; 3. Is decoupled from the physical memory (larger or smaller)2. The abstraction that is referenced to the set of addresses a process ; 3. Is decoupled from the physical memory (larger or smaller)What is the above contents described ?
toicankeyAddress space ; toicankeyThe collection of user's or developer's address is used to write or develop the program ; toicankeyThe thing associates with each process
Which of these statements about the Inverted Page Table are true?
toicankeyAn entry contains the pair (process, virtual page) mapped into the corresponding page frame
This program can occur the following problems as
toicankeyDeadlocks ; toicankeyStarvation ; toicankeyRace condition
This program can occur the following problems as
toicankeyDeadlocks, Starvation, and Race condition
With given page table and 16 bit virtual address, that is split 4 bit page numbers and 12 bit offset. If user references the address 28500, which physical address is in memory ?
toicankeyIf the page fault occurred, the page frame is evicted as 7, the physical address is 32596 ; toicankeyThe Page fault is occurred
Given the relation of the virtual addresses and physical memory. Applying the Multilevel page table strategy, Which of these statement are true when the user reference the address 16822855 ?
toicankeyIndex of table level 1 is 4, Index of table level 2 is 11, offset is 583, the physical address is 29255
What is the table's name ? ; 1. Each one entry in table represents page frame in real memory2. An entry contains the pair (n, p). Let n represents as process, p represents as page ; 3. The hardware search entire the table for the entry (n, p)4. If so, the entry position is the page frame. Otherwise, the page fault occurs
toicankeyInverted page
The process references only a relatively small fraction of its pages in execution. What does the sentence reference ?
toicankeyLocality reference
1. Put the argument of called function on the stack ; 2. The interrupt occurs to switch from user mode to kernel mode3. The system functions are located and executed ; 4. After finished, the interrupt occurs again to switch to user mode5. The control is returned to the called function ; Which is above five statements described ?Which OS structure is described ?
toicankeyMS-DOS
Which of the following is correct about Shortest Job First scheduling algorithm?
toicankeyMinimize average waiting time
Assume that process A-D make up the set of runnable processes on memory as ; B1 B2 B3 A1 A2 A5 A7 D3 D4 D6 C1 C6 C5. Suppose D gets a page fault. ; Which page is replaced using the local policy? Assume that the replaced page is always a last page.Page Number Page Frame Number
toicankeyNone of the others
Which strategy is a simplest design for speeding up Paging?
toicankeyPage table is loaded into registers
Different of the TLS Instruction and Disable interrupts are __________
toicankeyPerforming a read on a memory word followed by a write does not prevent a second processor on the bus from accessing the word between the read and the write ; toicankeyBoth reading the content of the memory word lock into register and storing a nonzero value at the memory address lock are made indivisible
What is the purpose of CPU scheduling algorithms?
toicankeyPick one of the ready processes to run next
Loading pages before letting processes run or before resuming the process
toicankeyPrepaging
The OS is written as a collection of procedures, linked together into a single large executable binary program. ; Which OS structure is described ?1. The mechanism ensures that all access to system resources is controlled ; 2. The mechanism detects latent errors at the interface between component subsystems3. The mechanism protects the system from unwanted intruders
toicankeyProtection
Which problem is described two following statements? ; 1. No reader will be kept waiting unless a writer has already obtained permission to use the shared object. Or, readers have higher priorities 2. Once a writer is ready, the writer performs its write as soon as possible
toicankeyReaders-Writers
Which of the following is a preemptive scheduling algorithm
toicankeyRound Robin
The scheduling strategy where each process in the queue is given a certain amount of time, After this time has elapsed, the process is preempted and added to the end of the ready queue is referred to as:
toicankeyRound-Robin
Which of the following is not able to solve the race condition?
toicankeyShared memory
Which of the following cannot be shared among different threads of a process?
toicankeyStack
Which of the following is a hardware solution to the critical region problem?
toicankeyTSL
Which effect is describes in the below scheduling algorithm? ; 1. All the other processes wait for the one big process to get of the CPU2. Result of this generates the CPU and device utilization lower
toicankeyThe convey effect
1. Put the arguments in registers or on the stack ; 2. When the system call handler has completed its work, the interrupt is issued to witch form kernel to user mode3. The procedure returns to the user program in the usual way procedure calls return ; 4. Issue trap instructions to switch form user mode to kernel mode at the fixed address where the procedure located5. The kernel mode dispatches to the correct system call handler ; Arrange the above sentences in order that describe the "system call" progress.1. Put the argument of called function on the stack ; 2. The interrupt occurs to switch from user mode to kernel mode3. The system functions are located and executed ; 4. After finished, the interrupt occurs again to switch to user mode5. The control is returned to the called function
toicankeyThe interface between user programs and the OS is used to call the special procedure in kernel
How many way can the developer manually split the program using overlays technique ? ; 1. The program is partition such as assembler into part 1 code (50KB), part 2 code (100KB), and the symbol table (30KB) and common routines (40KB) used by both pass 1 and pass 2 2. The memory has 200 KB. ; 3. Assume that the management overlay has its size as 20KB2. The memory has 200 KB. ; 3. Assume that the management overlay has its size as 20KBHow many way can the developer manually split the program using overlays technique ?
toicankeyThe overlay 1 with part 1 code, the symbol table, and the common routines; the overlay 2 with part 2 code, the symbol table, and the common routines ; toicankeyThe overlay 1 with the symbol table, and the common routines; the overlay 2 with part 1 code; and the overlay 3 with part 2 code ; toicankeyThe overlay 1 with the symbol table, the overlay 2 with the common routines, the overlay 3 with part 1 code, and the overlay 4 with part 2 code
In "No Memory Abstraction", the static relocation technique is __________
toicankeyWhen the program is loaded at address n, the constant n was added to every program address
The set of pages that a process is currently using
toicankeyWorking set
Different of the TLS Instruction and Disable interrupts are __________
toicankeyperforming a read on a memory word followed by a write does not prevent a second processor on the bus from accessing the word between the read and the write