We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More

CS604 ALL Current Final Term Papers Spring 2016 And Past Final Term Papers at One Place from 20 August 2016 to 2 September 2016

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

+ Click Here To Join also Our facebook study Group.

..How to Join Subject Study Groups & Get Helping Material?..


See Your Saved Posts Timeline

Views: 7182

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

Replies to This Discussion

Share Your Current Mid Term Papers (Questions/Pattern) 20 August 2016 to 02 September2016  to help each other. Thanks

CS604 - Operating Systems

Kindly give the answer of the following question (MCQ’s).

Which of the following is NOT a valid deadlock prevention scheme?

v  Release all resources before requesting a new resource.

v  Number the resources uniquely and never request a lower numbered resource than the last one requested.

v  Never request a resource after releasing any resource.

v  Request and all required resources be allocated before execution.

Where does the swap space reside?

v  RAM

v  Disk

v  ROM

v  On chip cache

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

v  Mutual Exclusion

v  Deadlock

v  Bounded Waiting

v  All of the given options

 

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).

v  Mutual Exclusion

v  Deadlock

v  Release

v  Lock

1 KB or 1 kilobyte is equivalent to ……….

v  1024 bytes

v  10 bytes

v  1000 bytes

v  10000 bytes

………automatically holds for printers and other non-sharables

v  Hold and wait

v  Circular wait

v  Mutual exclusion

v  No preemption

The integer value of _________ semaphores cannot be greater than 1.

v  Counting

v  Binary

v  Mutex

v  Bounded buffer

What is different in parent and child processes?

v  Process ID

v  Open file descriptor table

v  Root directory

v  Environment

Shell is the exclusive feature of………

v  Application Software

v  System Software

v  DOS

v  UNIX

Round robin is very good for …………..where response is an important issue.

v  Scope

v  Batch system

v  Time sharing system

v  None of the given

………….happens when a dynamic memory allocation algorithm allocates some memory and a small piece is left over that cannot be effectively used

v  Fragmentation

v  External Fragmentation

v  Segmentation

v  Internal Fragmentation

…………………..is the name of the technique that is designed to get rid of deadlocks by changing the specifications of the system.

v  Deadlock avoidance

v  Deadlock prevention

v  Deadlock

v  Deadlock free

Memory can be protected by using

v  Base register and program counter

v  Base register and memory address register

v  Base register and Limit register

v  Limit register and program counter

Semaphore can be used for solving __________.

v  Wait & signal

v  Deadlock

v  Synchronization

v  Priority

Which of the following statements is true for the Banker’s algorithm?

v  It cannot be used for a system with many resources; each of which is unique with no multiple copies.

v  It is used to detect deadlock.

v  An unsafe situation will always lead to a deadlock.

v  It is not applicable when many users share a resource simultaneously.

The next layer above the hardware layer in the layered approach of Operating System is …………………layer.

v  User interface

v  Kernel

v  Hardware

v  None of the given options

Priority of a process is……………..to the priority number of the process.

v  Directly proportional

v  Equal

v  Inversely proportional

v  Greater

only one process may use a resource at a time best describes which one of the following?

v  Hold and wait

v  Circular wait

v  Mutual Exclusion

v  No preemption

………………….occurs in a dynamic memory allocation system when many of the free blocks are too small to satisfy any request.

v  Segmentation

v  Virtual memory

v  Page fault

v  Fragmentation

Address Binding will be _______ in Multiprogramming with Variable Tasks (MVT)

v  Dynamic

v  Static

v  Variable

v  Fixed

…………..and………… registers in the memory protection by limiting access to a process only to its address space.

v  Counter, Add

v  Base, Limit

v  Program Counter and Accumulator

______is used to point to the size of a process.

v  Base register

v  Limit register

v  Stack pointer

v  None of the given

______________ is the process of mapping a name to an address.

v  Addressing

v  Binding

v  Routing

v  Memory

To eliminate external fragmentation in segmentation the scheme used is ___________.

Select correct option:

v  Fixed size partition scheme

v  Variable size partition scheme

v  Fixed size paging scheme

v  Variable size paging scheme

External Fragmentation takes place in ______________

v  Multiprogramming with Variable Tasks (MVT)

v  Multiprogramming with Fixed Tasks (MFT)

v  Multi-tasking

v  Paging

 

Note: (This is Featured Discussion)

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.

&

.•°How to Download past papers from study groups°•.

ALL Current Final Term Papers Spring 2016 And Past Final Term Papers at One Place from 20 August 2016 to 2 September 2016

 

Share Your Current Mid Term Papers (Questions/Pattern) 20 August 2016 to 02 September2016  to help each other. Thanks

 

Solved Mid Terms Papers By MOAAZ & Other Students

 

Click On the below link to download

 

Solved Final Term Papers

Sir,
these are midterm papers
please share here Final Term papers.

Plzzzzzzzzzzz subjective BH kijye
Guysssssssss.plzzzzzzz cs 604 ka apna apna papr share.kijyeeeee plzzzzzzzzzzzz

Mukhara tou dekhaooo

Plzzzxzz.koi papr shre krdo apna current plzzzzzzzz

plz share cs 604 paper

koi to paper share kro.kl mera paper ha. ager ksi ni bhi apna paper share nahe kea to main bhi paper share nahe kron gi

cs604   plzzz koi to paper share kr dy

RSS

Latest Activity

+ M.Tariq Malik liked Muhammad Naeem Khan's discussion Untitled
18 minutes ago
Fajar liked + "AS"'s discussion Log .
25 minutes ago
Fajar liked +++Student+++++'s discussion MEN
25 minutes ago
Fajar liked +¢αяєℓєѕѕ gιяℓ's discussion شرم سے میرا سر جھک گیا
25 minutes ago
Fajar liked +¢αяєℓєѕѕ gιяℓ's discussion Home remedies for hair fall and regrowth
25 minutes ago
+¢αяєℓєѕѕ gιяℓ posted discussions
33 minutes ago
Fajar liked + "AS"'s discussion Log .
1 hour ago
Awais updated their profile
1 hour ago

Today Top Members 

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

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