The solution type where in critical section we use “entry section and “exit section” is called kind of _______________.

• A) Assumption
• B) Operating System Solution
• C) Hardware Solution
• D) Software Solution

The size of a page is defined by ________.

• A) CPU
• B) Logical Memory
• C) Page Table
• D) Physical Memory

Critical section is a place where certain shared structure is updated. Its solution required certain precaution; one of them is the access to critical section by one process at a time only. What this condition is termed as?

• A) Bounded waiting
• B) Mutual exclusion
• C) Progress
• D) Entry section

In Overlay technique, we can overload any part of the program with the part of the program required needed recently.

• A) False
• B) True
• C)
• D)

In critical section problem __________requirement illustrates that, “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.”

• A) fast execution
• B) bounded waiting
• C) mutual exclusion
• D) progress

The main memory is usually divided into partitions, one for __________ and other for __________ .

• A) Base Register, Limit Register
• B) Operating System, User processes
• C) Operating system, CPU
• D) Processes, Virtual Memory

There are ________steps, which are necessary to create a file

• A) 5
• B) 3
• C) 2
• D) 4

Segmentation is a memory management scheme that supports __________?

• A) Hardware’s view of memory
• B) Programmer’s view of memory
• C) None of the given
• D) System’s view of memory

In a UNIX system,__________ system call can be used to request the operating system to memory map an opened file.

• A) mmap( )
• B) exec( )
• C) fork ( )
• D) read( )

------------------points to the page table

• A) Page-table base register (PTBR)
• B) Page-table length register (PRLR)
• C) Page offset
• D) Translation look-aside buffers

Intel is basically designed for following Operating Systems except __________.

• A) Linux
• B) MULTICS
• C) Windows
• D) OS/2

Optimal Page Replacement Algorithm provides a benchmark in assessing other page replacement algorithms.

• A) False
• B) True
• C)
• D)

LRU page replacement algorithm can be implemented by

• A) linked list
• B) all of the given options
• C) stack
• D) counter

In ______ allocation scheme number of frames allocated to a process is proportional to its size .

• A) Priority Allocation
• B) None of the given options
• C) Proportional Allocation
• D) Fixed Allocation

ST in logical addressing stands for ________ .

• A) None of the Given
• B) Smart Trap
• C) String Table
• D) Segment Table

In case of thrashing if CPU utilization is too low the operating system ______ the degree of multiprogramming.

• A) sometimes increases and sometimes decreases
• B) increases
• C) decreases
• D) None of the given options

The term pager is used in connection with ________________.

• A) Paged Segmentation
• B) Demand Paging
• C) Paging
• D) Segmentation

The frame that has been modified during execution of a process is usually called _________ frame.

• A) Overwritten
• B) Dirty
• C) Ideal
• D) Clean

Intel 80386 used paged segmentation with _________ level paging.

• A) Three
• B) Four
• C) One
• D) Two

Following schemes allow efficient implementations of page tables EXCEPT

• A) Inverted Page Table
• B) Hierarchical / Multilevel Paging
• C) Hashed Page Table
• D) Binary Page Table