Operating System (Quiz 3)

In multi processor scheduling; A: Gang scheduling, B: Dynamic scheduling, C: Dedicated processor management.; 1- The number of threads in a process can be altered during the course of execution. 2- This provides implicit scheduling defined by the assignment of threads to processors, 3- It is applied to the simultaneous scheduling of threads that make up a single process.

In real time computing

In soft real time tasks

In real time scheduling: A: Static table driven approach, B: Static priority driven preemptive approach, C: Dynamic planning based approach; 1- A static analysis of feasible scheduler of dispatching is done and implemented. 2- A static analysis of feasible schedules of dispatching is done and assigns priorities to tasks. 3- Feasibility is determined at run time.

Match the following I/O devices : A- Keyboard, 1- Human readable, B- Disk and tape drives, 2- Communication, C- Modems, 3-Machine readable

Arrange the following I/O device in increasing data rate Hard disk, Floppy disk, Key board

In I/O management when buffering is allowed then : Statement A: Input transfer is performed before request is made. Statement B: Output transfer is performed after request is made. 

Resident set of process is

Main memory is referred as

Memory that is located on the disk either Hard or floppy is referred as

The principle of locality states

In memory management : A- Fetch Policy B- Cleaning Policy C- Placement Policy: 1- It determines when a modified page should be written out to secondary memory. 2- It determines when a page should be bought into main memory. 3- It determines where in real memory a process piece is to be reside.

In memory management when demand cleaning policy is applied

In two level scheme for page table, if one assume byte-level addressing and 4-kbyte (2¹² pages) then the 4-Gbyte (2³²) virtual address space is composed of

When pre cleaning policy is applied in memory management

In virtual memory management, when local control policy is applied

In two level scheme if each page is mapped by 4-byte (2²) page table entry then to create a page table composed of 2²⁰ page table entry one requires

In defining page table structure in virtual memory, A page number portion of a virtual address is mapped into a hash table using simple hash function, where hash table contains a pointer to the inverted page table, which contains page table entries, this approach is referred as

A fetch policy for virtual memory determines

The demand paging and pre paging of virtual memory management are

When process is swapped out of main memory and put in a suspended state

Statement A: The placement policy determines where in real memory a process piece is to reside. Statement

B: The fetch policy determines when a page should be bought into main memory.

When a frame in main memory is locked

Statement A : In memory management, the replacement policy deals with the selection of pages in memory to be replaced by arrived new page.

Statement B: In  memory management, the policy the fetch policy determines when a page should be bought into main memory.

The Least Recently Used (LRU) policy

In memory management where replacement is allowed in First-in-First-out (FIFO) fashion

By principle of locality, in least recently used policy, in memory management

In First-In-First-out (FIFO) replacement policy used in memory management, the page frames to allocated to a process as circular buffer and

The memory management, y one clock policy is applied then the page first loaded into a frame in memory its use bit is set to

In memory management Free page list is:

A- A list of page frames available for reading in pages.

B- A list where replaced page is assigned without modification.

C-A list where replaced page is assigned with modification.

A policy in memory management referred as clock policy because one can visualize the page frames as laid out in

In memory management :A-Fixed allocation policy, B-Variable allocation policy: 1-It gives a process a fixed number of frames in main memory within which to execute. 2-It allows the number of page frames allocated to a process to be varied over the life time of the process. 3-In it a number of allocated frames are decided at initial load time.

In uni-processor scheduling :A : Turnaround time, B : Response time, 1: A time interval between the submission of a process and its completion. 2: For interactive process, it is a time from the submission of a request until the response begins to received. 3: It includes actual execution time plus time spent waiting for resources.

In uni-processor management processor through put

In uni-processor scheduling, a priorities enforcement is

In uni-processor scheduling, if non- preemptive policy is applied then

In aperiodic (real time) tasks

The time table of railway, and airline which defines arrival and departure can be considered as

When preemptive policy is applied to uni- processor scheduling then

The normalized turnaround time is