CS101 532 CS201 225 CS301 232 CS302 174 CS304 192 CS401 224 CS402 258 CS403 228 CS408 113 CS411 121 CS502 249 CS504 268 CS601 679 CS604 381 CS605 261 CS607 184 CS609 230 CS610 300 CS614 100 CS703 65
Code Question Option A Option B Option C Option D Answer
CS604 Let S And Q Be Two Semaphores Initialized To 1 Where P0 And P1 Processes The Following Statements Wait(S);Wait(Q); ---; Signal(S);Signal(Q) And Wait(Q); Wait(S);---;Signal(Q);Signal(S); Respectively. The Above Situation Depicts A ___________ Semaphore Deadlock Signal Interrupt B
CS604 Linux Is A Version Of Operating System Os/2 Windows Unix None Of The Above C
CS604 Linux Os Can Support Multiple Users At A Time True False Na Na A
CS604 Linux Treats Devices As Files True False Na Na A
CS604 Linux Uses __________ Directory To Store System Configuration Files /Bin /Dev /Boot /Etc D
CS604 Logical Address Is Generated By Cpu Compiler Hard Disk None Of The These A
CS604 Lru Page Replacement Algorithm Can Be Implemented By Counter Stack Linked List All Of The Given Options D
CS604 Mach Macos X Server Qnx Os/2 And Windows Nt Are Examples Of Os Based On Layered Micro Kernal Virtual Machine None Of The Given B
CS604 Main Memory Is __________ Memory Volatile Non-Volatile Permanent Virtual A
CS604 Managing Secondary Storage Involves All Of The Following Except Allocating Storage Space Deallocating Storage Prevent Overwritting Insure Integrity Of Shared Data C
CS604 Memory Protection In Paging Is Achieved By Associating __________ With Each Page. This Bit Indicates Whether The Page Is In The Process Address Space Or Not Protection Bits Counting Bits Paging Table Segment Table A
CS604 Mkfifo() Is A Library Call Command Directory None Of Above A
CS604 Multiprocessing Is Same As Multitasking Same As Multiprogramming Multiuser Involves Using More Than One Processor At The Same Time D
CS604 Multiprogramming Refers To Having Several Programs In Ram At The Same Time Multitasking Writing Programs In Multiple Languages None Of The Previous A
CS604 Multiprogramming Systems __________ Are Easier To Develop Than Single Programming Systems Execute Each Job Faster Execute More Jobs In The Same Time Are Used Only On Large Main Frame Computers C
CS604 Mutual Exclusion Can Be Enforced With A General Semaphore Whose Initial Value Is Greater Than 1 True False Na Na F
CS604 Necessary Conditions For Deadlock Are Non Pre-Emption And Circular Wait Mutual Exclusion Ad Partial Allocation Both A And B None Of The Above C
CS604 N-Process Critical Section Problem Can Be Solved By Using Deterministing Modeling The Bakery Algorithm Analytic Evaluation None Of Above B
CS604 Object Files And Libraries Are Combined By A ------------- Program To Produce The Executable Binary Compiler Linker Text Editor Loader B
CS604 Once A Virtual Memory Page Is Locked Into Main Memory It Cannot Be Written To The Disk True False Na Na F