Scribd
Upload
3K views

CS604 Quizzes Solved

This document contains the questions and answers from several quizzes on the topic of operating systems. The quizzes cover concepts like deadlock avoidance algorithms, memory management techniques, process allocation and resource graphs. For each quiz, multiple choice questions are presented along with the corresponding answers selected by the user.

Uploaded by

Power Girls
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
3K views

CS604 Quizzes Solved

This document contains the questions and answers from several quizzes on the topic of operating systems. The quizzes cover concepts like deadlock avoidance algorithms, memory management techniques, process allocation and resource graphs. For each quiz, multiple choice questions are presented along with the corresponding answers selected by the user.

Uploaded by

Power Girls
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

CS604_ Operating Systems_ Quizzes _Solved

~*~Power Girls~*~

Answer:-1-= (2)Resource Allocation graph (RAG )


Answer:-2= (4) Overlays

Answer:-3= (2)programmers

Answer:-4= (1) safe


Answer:-5=(1) Input queue
Answer:-6=Banker’s

Answer:-7= permanent and non volatile


Answer:-8=(1) addressing
Answer:-9= (1) amount of memory swapped
Answer:-10= (1) Claim edge

QUIZ _2
Question # 1 of 10 ( Start time: 07:12:30 PM ) Total Marks: 1
_________ algorithm is used in Deadlock avoidance.
Select correct option:
Bakery
Banker’s
Mutual exclusion
Safe Sequence

Question # 2 of 10 ( Start time: 07:12:40 PM ) Total Marks: 1


When the address used in a program gets converted to an actual physical RAM
address, it is called ------------
Select correct option:
Execution
Loading
Address Binding
Compiling

Question # 3 of 10 ( Start time: 07:14:27 PM ) Total Marks: 1


Overlays are implemented by the _________________
Select correct option:
Operating system
Programmer
Kernel
Shell

Question # 4 of 10 ( Start time: 07:14:41 PM ) Total Marks: 1


----------holds the smallest legal physical memory address for a process
Select correct option:
Base register
Limit register
Index register
Stack pointers register

Question # 5 of 10 ( Start time: 07:15:05 PM ) Total Marks: 1


In Swapping technique of Memory Management, the total amount transfer time
is directly proportional to the _______________.
Select correct option:
amount of memory swapped
amount of space on backing store
space on main memory
all the given options are correct

Question # 6 of 10 ( Start time: 07:15:36 PM ) Total Marks: 1


Object files and libraries are combined by a ----------- program to produce the
executable binary
Select correct option:
Compiler
Linker
Text editor
Loader

Question # 7 of 10 ( Start time: 07:16:44 PM ) Total Marks: 1


Main Memory is _____________ memory.
Select correct option:
Volatile
Non-volatile
Permanent
Virtual

Question # 8 of 10 ( Start time: 07:17:04 PM ) Total Marks: 1


In___________, the library files are linked at load time.
Select correct option:
Static Linking
Dynamic Linking

Question # 9 of 10 ( Start time: 07:18:18 PM ) Total Marks: 1


---------------keep in memory only those instructions and data that are needed at
any given time.
Select correct option:
Fragmentation
Paging
Swapping
Overlays

Question # 10 of 10 ( Start time: 07:18:50 PM ) Total Marks: 1


If the system can allocate resources to each process in some order and still avoid
a deadlock then it is said to be in _________ state.
Select correct option:
Safe
Un-Safe
Mutual
Starvation

QUIZ_3

Question # 1 of 10 ( Start time: 08:46:31 PM ) Total Marks: 1


---------------keep in memory only those instructions and data that are needed at
any given time.
Select correct option:
Fragmentation
Paging
Swapping
Overlays
Question # 2 of 10 ( Start time: 08:47:05 PM ) Total Marks: 1
---------- register contains the size of the process
Select correct option:
Base register
Index register
Limit register
Stack pointers register

Question # 3 of 10 ( Start time: 08:48:09 PM ) Total Marks: 1


A program can not execute unless whole or necessary part of it resides in the
main memory.
Select correct option:
True
False

Question # 4 of 10 ( Start time: 08:48:46 PM ) Total Marks: 1


If the system can allocate resources to each process in some order and still avoid
a deadlock then it is said to be in _________ state.
Select correct option:
Safe
Un-Safe
Mutual
Starvation

Question # 5 of 10 ( Start time: 08:49:00 PM ) Total Marks: 1


In Resource Allocation Graph, a _________Pi --->Rj indicates that process Pi may
request resource Rj at some time in the future.
Select correct option:
Claim edge
Request edge
Assignment edge
Allocation edge
Question # 6 of 10 ( Start time: 08:50:12 PM ) Total Marks: 1
What do we name to an address that is loaded into the memory-address register
of the memory?
Select correct option:
Logical address
Physical address
Binary addresses
None of the given options

Question # 7 of 10 ( Start time: 08:50:53 PM ) Total Marks: 1


The ----- is a single program that produces an object file
Select correct option:
Linker
Compiler
Loader
Text editor

Question # 8 of 10 ( Start time: 08:51:59 PM ) Total Marks: 1


Cache is non-volatile memory.
Select correct option:
True
False

Question # 9 of 10 ( Start time: 08:52:21 PM ) Total Marks: 1


Banker’s algorithm is used for ________________

Select correct option:


Deadlock avoidance
Deadlock detection
Deadlock prevention
Deadlock removal

Question # 10 of 10 ( Start time: 08:52:41 PM ) Total Marks: 1


When the address used in a program gets converted to an actual physical RAM
address, it is called ------------
Select correct option:
Execution
Loading
Address Binding
Compiling

Quiz_4

ANSWER:1=VOLTILE

ANSWER:2=True
ANSWER:3=Logical Address

ANSWER:4= LIMIT Register ( Contains the size of the process.)


ANSWER:5= All of the given

ANSWER:6= False
ANSWER:7= True

ANSWER:8= False
ANSWER:9= Circular wait

ANSWER:10= Resource allocation Graph

You might also like