cs604 operating system current paper objective and subjective fall 2010 on 21-02-2011

[Xpert]

[FONT=&quot]Explain how Page Fault Frequency Model is used to Control Thrashing[/FONT]
[FONT=&quot]Summarize the tradeoffs among simple arrays, trees, and hash tables as implementations of a page table.[/FONT]

[FONT=&quot]Consider a logical address space of eight pages of 1024 words each, mamapped ont a physical memory of 32 frames.[/FONT]
[FONT=&quot]a. How many bits are there in the logical address?[/FONT]
[FONT=&quot]b. How many bits are there in the physical address?[/FONT]

[FONT=&quot]How Starvation can be caused in Priority Scheduling algorithm? [/FONT]

Consider Round Robin scheduler. Do you think that Deadlock or Starvation can happen in Round Robin technique of scheduling?

[FONT=&quot]Write down the type of bits associated with each entry of segment table for protection?[/FONT]
What are the three major frame allocation schemes?
[FONT=&quot]What is the main idea behind Overlays memory management technique?[/FONT]
True or False (and explain): It is necessary to have a reference count
within a file descriptor in order to implement soft links.

Define Indexed Allocation as a Space Allocation Method.
[FONT=&quot]What are the possible ways to recover a system from deadlock?[/FONT]
[FONT=&quot]What are the problems that can occur while trying to violate the condition of Hold and wait for deadlock prevention?[/FONT]
[FONT=&quot]To resolve thrashing due to excessive paging, what can a user do?[/FONT]
[FONT=&quot]List the four events that cause the execution of a piece of code in kernel.[/FONT]
How can you achieve memory protection in paging?
Which command, displays permissions and some other attributes for prog1.c in your current directory?
ls –l prog1.c
ls –d prog1.c
ls file prog1.c
ls –l prog1.c /Directory
[FONT=&quot]______________ is/are a memory management scheme that supports programmer’s view of[/FONT]
[FONT=&quot]memory.[/FONT]
[FONT=&quot]Paging[/FONT]
[FONT=&quot]Segmentation[/FONT]

[FONT=&quot]All of the given options[/FONT]
[FONT=&quot]Demand Paging[/FONT]
Deadlocks can be described more precisely in terms of ...................................
Directed Graph
Critical path
Resource allocation graph
Mixed graph
A set of processes are said to be in -------------- condition if each process in the set is waiting for an event that only another process in the set can cause (including itself).
Mutual exclusion
Deadlock
Release
Lock
[FONT=&quot]_______________ wastes CPU cycles and hence a problem in real multiprogramming system.[/FONT]
[FONT=&quot]Busy waiting[/FONT]
[FONT=&quot]Semaphore[/FONT]
[FONT=&quot]Critical section[/FONT]
[FONT=&quot]Mutex[/FONT]
[FONT=&quot]A time sharing system is[/FONT]
[FONT=&quot]Multi process[/FONT]
[FONT=&quot]Interactive[/FONT]
[FONT=&quot]Multi user[/FONT]
[FONT=&quot]All of these[/FONT]
[FONT=&quot]………………………….that define the ways in which system resources are used to solve the computing problems of the users.[/FONT]

[FONT=&quot]Application programs[/FONT]
[FONT=&quot]Operating System[/FONT]
[FONT=&quot]Hardware[/FONT]
[FONT=&quot]Users[/FONT]
[FONT=&quot]The following requirement for solving critical section problem is known as ______________.[/FONT]
[FONT=&quot]“There exists a bound on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted.”[/FONT][FONT=&quot][/FONT]

[FONT=&quot]Progress[/FONT]
[FONT=&quot]Bounded Waiting[/FONT]
[FONT=&quot]Mutual Exclusion[/FONT]
[FONT=&quot]Critical Region[/FONT]
[FONT=&quot]When the process tries to access locations that are not in memory, the hardware[/FONT]
[FONT=&quot]traps the operating system. This is called as ___________.[/FONT]

[FONT=&quot]Page Fault[/FONT]
[FONT=&quot]Page replacement[/FONT]
[FONT=&quot]Segmentation[/FONT][FONT=&quot][/FONT]

[FONT=&quot]Paging[/FONT]
[FONT=&quot]In the Scan algorithm the disk _______ starts at one end of the disk, and moves toward the [/FONT]
[FONT=&quot]other end, servicing requests as it reaches each cylinder, until it gets to the other end of [/FONT]
[FONT=&quot]the disk.[/FONT]
Arm
Cylinder
Head
non of these
[FONT=&quot]The size of a page is defined by _________[/FONT]
[FONT=&quot]CPU[/FONT]
[FONT=&quot]Page Table[/FONT]
[FONT=&quot]Physical Memory[/FONT]
[FONT=&quot]Logical Memory[/FONT]

[FONT=&quot]Overlays are implemented by the _________________[/FONT]
[FONT=&quot]Operating system[/FONT]
[FONT=&quot]Programmer[/FONT]
[FONT=&quot]Kernel[/FONT]
[FONT=&quot]Shell[/FONT]
[FONT=&quot]Secondary Storage memory devices have _______________ memory[/FONT]
[FONT=&quot]Volatile[/FONT]
[FONT=&quot]Non-volatile[/FONT]
[FONT=&quot] [/FONT]
[FONT=&quot]Non-volatile[/FONT]
[FONT=&quot]Temporary[/FONT]
[FONT=&quot] [/FONT]
[FONT=&quot]Temporary[/FONT]
[FONT=&quot]None of the option is correct[/FONT]
[FONT=&quot]We want a page replacement algorithm with the _____________ page-fault rate.[/FONT]
Highest
Lowest
Normal
None of above
In _____________ page replacement algorithm oldest frame is replaced with another.
LIFO
FIFO
LRU
Optimal
If a process continues to fault, replacing pages, for which it then faults and brings back in right away. This high paging activity is called ___________.
Paging
Thrashing
page fault
CPU utilization
[FONT=&quot]The integer value of ______________ semaphores can range over an unrestricted integer domain.[/FONT]
[FONT=&quot]Counting[/FONT]
[FONT=&quot]Binary[/FONT]

[FONT=&quot]Mutex[/FONT]
[FONT=&quot]Bounded buffer[/FONT]
[FONT=&quot]Shared libraries and kernel modules are stored in _____________ directory[/FONT]
[FONT=&quot]/bin[/FONT]
[FONT=&quot]/dev[/FONT]
[FONT=&quot]/boot[/FONT]
[FONT=&quot]/lib[/FONT]
[FONT=&quot]In _______, each file is a linked list of disk blocks: blocks may be scattered anywhere on the disk.[/FONT]

[FONT=&quot]Indexed Allocation[/FONT]
[FONT=&quot]Contiguous Allocation[/FONT]
[FONT=&quot]Linked Allocation[/FONT]
[FONT=&quot]None of the given options[/FONT]
[FONT=&quot]_________[/FONT][FONT=&quot] contains the names of other files and/or directories.[/FONT]
[FONT=&quot]Block Special File[/FONT]
[FONT=&quot]Link File[/FONT]
[FONT=&quot]Ordinary File[/FONT]
[FONT=&quot]Directory[/FONT]
[FONT=&quot]The high paging activity is called _______[/FONT]
[FONT=&quot]Segmentation[/FONT]
[FONT=&quot]Page Fault[/FONT]
[FONT=&quot]Multiprogramming[/FONT]
[FONT=&quot]Thrashing[/FONT]
[FONT=&quot]-----------is the separation of user logical memory from physical memory[/FONT]
[FONT=&quot] [/FONT]
[FONT=&quot] [/FONT]
ROM
Virtual Memory
None of the given options
Physical memory
Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
Frames, pages
Frames, pages
Frames, holes
Holes, segments
[FONT=&quot]The set of all physical addresses corresponding to the logical addresses is a ----------------- of the process[/FONT]
Physical address space
Process address space
None of the given options
Logical address space
[FONT=&quot]A -----------is a region of code where shared resources are accessed.[/FONT]
[FONT=&quot]critical region[/FONT]
[FONT=&quot]deadlock[/FONT]
[FONT=&quot]process[/FONT]
[FONT=&quot]thread[/FONT]
The priorities of processes in the ----------Group remain fixed whereas the priorities of processes in the -----------Group are recalculated every second.
Kernel, Kernel
User, Kernel
User, User
Kernel, User
[FONT=&quot]Round-Robin Scheduling is a -------------- scheduling algorithm[/FONT][FONT=&quot][/FONT]
[FONT=&quot] [/FONT]
Preemptive
non-preemptive
Preemptive or non-preemptive.
None of the given options
[FONT=&quot]Under ------------scheduling once the CPU has been allocated to a process the process keeps the CPU until either it switches to the waiting state, finishes its CPU burst, or terminates.[/FONT]
non-preemptive
both preemptive and non- preemptive
none of the given options
preemptive
The creating process is called a--------------- process while the new processes are called the -------------- of that process
None of the given options
Parent, children
Zombie, single
[FONT=&quot]Children, parent [/FONT]
[FONT=&quot] [/FONT]
You can compile yours program in a UNIX/LINUX system by the ----------- command
[FONT=&quot]$rm[/FONT]
[FONT=&quot] [/FONT]
$cp
[FONT=&quot]$cp[/FONT]
[FONT=&quot]$mv[/FONT]
gcc[FONT=&quot][/FONT]

[Xpert]

You are welcome dear. Please share your paper.