We have been working very hard since 2009 to facilitate in learning Read More. We can't keep up without your support. Donate.

 

CS604 Operating Systems Quiz#2 Announcement

Quiz 2 will take place on Thursday, February 14, 2013. Quiz will remain open for two days i.e. from Thursday, February 14, 2013 to Friday, February 15, 2013

Note:

Quiz will be from Lectures 19 to 40 (Both inclusive) be prepared for it Good Luck

Views: 5128

Replies to This Discussion

Please Share your online Quizzes here to help each other.thanks

thanks fairyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy

Thanks  fairy.

CS604 QUIZ 2

Attachments:

thanks aysh

any one post more solved quiz.

thanks

quiz was so easy all is from book, I hv to many quizes and GDBS for the day, so Im not be able to upload

quiz cs604            no2 

CS604 Quiz #2 Fall 2012 Solved With Reference

 

1…………….. Is caused due to unavailability of resources

 

 

Ans: Starvation Lec#23 p#112

 

 

2 The type of semaphore, whose value can not be greater than 1, is……………

 

 

Ans: Binary Semaphore Lec#24 p#114

 

 

3…………. Separates logical memory from physical memory

 

 

Ans: Virtual Memory Lec#37 p# 185

 

 

4……………. Register is used to point the smallest memory address of a process and its size.

 

Ans: Limit Register Lec# 31 p#158

 

 

5 There is no dynamic address translation in case of …………………….

 

 

 

Ans: MFT (Multi-Programming with Fixed Tasks) Lec#31 p#159

 

 

 

6 If HR is hit ratio and MR is miss ratio then effective access time is given by…………..

 

 

Teffective = HR (TTLB+ Tmem) + MR (TTLB + 2Tmem) Lec#33 p#167

 

 

7 Variation of fork ( ) system call used by UNIX is………….

 

 

Ans: vfork ( ) Virtual fork Lec#38 p# 193

 

8 FIFO page replacements has lowest page fault rates

 

 

Ans: False     Correct Optimal Algorithm Lec#38 p#199

 

 

9 Correct about LRU is …………….

 

 

Ans: Replacement with least recently used page Lec#39 p#199

 

 

Physical memory is broken into fixed sized blocks called……………..

 

 

Ans: Frames Lec#32 p#162

 

 

 

 

A page table needed for keeping track of pages of the page table is calle

 

2-level paging

Page directory

Page size

Page table size

 

 

The condition where a set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set, is termed as ________.

 

Deadlock

Starvation

 

Following is not the classical problem of synchronization.

 

Bounded buffer problem

Reader writer problem

Dining philosophers problem

Counting Semaphore problem

 

__________is a variation of fork system call in several Unix operating system.

 

vfork ( )

wfork ( )

avfork ( )

bfork ( )

 

What do we name to an address that is generated by the CPU?

 

Logical address

Physical address

Binary addresses

None of the given options

 

Assume a logical address space of 16 pages, each of 1024 words, each mapped into a physical memory of 32 frames. Each word consists of 2 bytes. What will be the total number of bits required for f (frames)?

 

5

6

7

8

 

The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a --------address, and the address it gets translated to by the MMU is called a ---------address.

 

Virtual, physical

Hexadecimal, Binary

Valid, invalid

Physical, Virtual

 

The problem of Deadlocks can be solved by __________ method(s).

 

Deadlock prevention

Deadlock avoidance

Allowing deadlock to occur, then detect and recover

All of the given

 

The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.

 

Wait for graph

Resource allocation graph

Both Resource-allocation and wait-for graph

None of the given options

 

Wrong use of wait and signal operations (in context with semaphores) can cause _________ problem(s).

 

Mutual Exclusion

Deadlock

Bounded Waiting

All of the given options are correct

 

 

aik bhi question is file ma se nai aaya.. time wastage.

Wrong use of wait and signal operations (in context with semaphores) can cause _________ problem(s).

Mutual Exclusion

Deadlock

Bounded Waiting

All of the given options are correct


In _____________ page replacement algorithm we will replace the page that has not been used for the longest period of time.

Counter based

Least Frequently Used

FIFO

LRU

 

The collection of processes that is waiting on the disk to be brought into the memory for execution forms the --------

Input queue

Output queue

Both input and output queue

None of the given options

 

Banker’s algorithm is used for ________________

Deadlock avoidance

Deadlock detection

Deadlock prevention

Deadlock removal

 

 

The size of a page is defined by ________.

CPU

Page Table

Physical Memory

Logical Memory

 

The term pager is used in connection with ________________.

Demand Paging

Paging

Segmentation

Paged Segmentation

 

Preventing the condition of _____________ to happen, deadlocks can be prevented to happen.

Critical region

Circular wait

Monitors

Critical section

 

In_____________, the library files are linked at load time.

 

The ------- is a single program that produces an object file

Linker

Compiler

Loader

Text editor

 

The problem of Deadlocks can be solved by __________ method(s).

Deadlock prevention

Deadlock avoidance

Allowing deadlock to occur, then detect and recover

All of the given

 

----------holds the smallest legal physical memory address for a process

Base register

Limit register

Index register

Stack pointers register

 

Assume a logical address space of 16 pages, each of 1024 words, each mapped into a physical memory of 32 frames. Each word consists of 2 bytes. What will be the total number of bits required for f (frames)?

5

6

7

8

 

_____________is the separation of user logical memory from physical memory.

Select correct option:

ROM

Physical memory

Virtual Memory

None of the given options

 

Wrong use of wait and signal operations (in context with semaphores) can cause

_________ problem(s).

Mutual Exclusion

Deadlock

Bounded Waiting

All of the given options are correct

 

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

True

False

 

Cache is non-volatile memory.

True

False

 

 

The set of all physical addresses corresponding to the logical addresses is a ----------------- of the process

Logical address space

Process address space

Physical address space

None of the given options

 

Each page is a power of -------- bytes long in paging scheme.

2

3

4

5

 

Assume a logical address space of 16 pages, each of 1024 words, each mapped into a physical memory of 32 frames. Each word consists of 2 bytes. What will be the total number of bits required for f (frames)?

5

6

7

8

 

We want a page replacement algorithm with the _____________ page-fault rate.

Highest

Lowest

Normal

None of the given

 

 

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

Clean

Dirty

Overwritten

Ideal

 

In pages segmentation, the logical address is legal if d is _________segment length.

Less than

Greater than

Equal to

Greater than or equal to

Attachments:

RSS

© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service