NEW
Font size
WorksheetsOperating System QUIZ-1
Total questions: 20
Worksheet time: 11mins
The layers in systems are in order:
OS, Applications, Organization, VLSI, Transistors
Applications, OS, Organization, VLSI, Transistors
VLSI, Organization, OS, Applications, Transistors
Organization, OS, Applications, VLSI, Transistors
Global or static data in in a program gets mapped to ______ of a process.
Stack
Heap
Data Segment
Text Segment
A user process gets access to kernel through:
Interface
System Calls
Kernel
IPC
The reason for OS usage is:
Hardware abstraction
Resource management
Both of these
None of these
Which of the following statement explains the nature of a multi-programming OS?
Execute applications sequentially in the order they are submitted to OS
Allocate time-slices to each application and switch to another application when time quanta expires
Allocate applications to different CPUs and manage them in such a manner that no two similar applications run on the same CPU
When CPU is idle, switch to another application
Race-Conditions can be overcome by:
System calls
Synchronization between applications
Interface
IPC
The need of isolation in OS is required because:
Multiple applications, from different users, run concurrently
Malfunctioning application may affect other applications
of both of these
of None of these
Which of the following is a component of OS?
System Call Interface
Device Drivers
Inter Process Communications
All of these
If one logs into the system as a guest user, the OS has to detect it and accordingly allow different resources to be accessed with permitted/limited privileges. This is called:
Security Assessment
Access Control
Security management
Synchronization
Fragmentation can be defined as:
Memory space is available but not adequate
Memory space is available but not relocatable
Memory space is available but not contiguous
Memory space is available but not ready as OS is busy
Given 5 memory partitions of 100kb, 500kb, 200kb, 300kb, 600kb (in order), how would the best fit algorithm place processes of size 212kb, 417kb, 112b, and 426kb (inorder)? The below show process->partition link mentioning allocation to that partition.
212kb -> 500kb
417kb -> 600kb
112kb ->288kb
426kb -> wait
212kb -> 600kb
417kb -> 500kb
112kb ->388kb
426kb -> wait
212kb -> 300kb
417kb -> 500kb
112kb ->200kb
426kb -> 600kb
212kb -> 300kb
417kb -> 500kb
112kb ->200kb
426kb -> 522kb
In virtual memory, RAM is split into fixed size partitions called:
Block
Page Frame
Segment
Page Table
Every time a memory location is accessed, the processor looks into the ____ to identify the corresponding _____
block table, block number
page table, block number
page frame number, page table
page table, page frame number
The process page table is sorted according to:
block number
page frame number
present bit
dirty bit
In virtual memory:
process frame size = block size
block size = process frame size
process frame size varies
Block size varies
A _____ bit in the page table indicates if the block is in RAM or not.
Dirty bit
Protection bit
Grey bit
Present bit
If a page is accessed that is not present in RAM, the processor issues a:
interrupt
page fault interrupt
page frame interrupt
block fault interrupt
Consider the reference string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5.
In a memory of size 3-page frames what is the number of page faults, if the pages are accessed in the order they appear in the reference string?
9
10
11
8
The replaced block in RAM need to be written back to swap space. This is called:
Swap in
Swap out
Demand paging
All of these
The locality of reference that stores current data or instruction that is being fetched into cache is known as:
Spatial locality of reference
Temporal locality of reference
Cache reference
cache hit
