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 The Size Of A Page Is Defined By __________ Cpu Page Table Physical Memory Logical Memory A
CS604 To A Computer Operating System A Thread Is Trace Of System Calls Made By A Process Identifiable Computation Unit With State Executing A Task Input/Output Stream Associated With A Process All Of The Given Choices B
CS604 Starvation Is A Situation In Which A Process Is Denied Access To A Resource Because Of The Competitive Activity Of Other Possibly Unrelated Processes. (Denied Access Indefinitely Possibly Infinitely) True False Na Na T
CS604 Deadlocks Can Be Described More Precisely In Terms Of A Directed Graph Called A System ---------- Directed Graph Critical Path Resource Allocation Graph Mixed Graph C
CS604 Which Of The Following Is Not A Hardware Resource Cpu Os I/O Devices Memory B
CS604 A Is An Integer Variable That Apart From Initialization Is Accessible Only Through Two Standard Atomic Operations: Wait And Signal Semaphore Monitor Critical Region Critical Section A
CS604 The Top-Down View Is That It Is A Program That Acts As An Intermediary Between A User Of A Computer And The Computer Hardware And Makes The Computer System Convenient To Use True False Na Na A
CS604 The Program Is Known As ___________ Which Interacts With The Inner Part Of Called Kernel Compiler Device Driver Protocol Shell D
CS604 The Critical Section Problem Can Be Solved By The Following Except Software Based Solution Firmware Based Solution Operating System Based Solution Hardware Based Solution B
CS604 A Set {P0 P1… Pn} Of Waiting Processes Must Exist Such That P0 Is Waiting For P1 P1 Is Waiting For P2 And So On Pn-1 Is Waiting For A Resource Held By Pn And Pn Is Waiting For A Resource Held By P0. This Condition Is Known As __________ Mutual Exclusion Hold And Wait No Preemption Circular Wait D
CS604 __________ Determines How To Do Something Mechanism Policy Mechanism And Policy None Of The Given A
CS604 In Linux Directory Structure There Is __________ Root Directory 1 2 3 4 A
CS604 The Manual Pages Can Be Read In Linux Using Command Man Wan Desc Help A
CS604 The Primary Job Of The Operating System Of A Computer Is To __________ Command Resources Manage Resources Provide Utilities Be User Friendly B
CS604 Which Of The Following Is Crucial Time While Accessing Data On The Disk? Seek Time Rotational Time Transmission Time Waiting Time A
CS604 Fifo Scheduling Is __________ Preemptive Scheduling Non Preemptive Scheduling Deadline Scheduling Fair Share Scheduling B
CS604 Sjf Can Be Implemented As A Priority Algorithm Where The Priority Is Determined By The Arrival Time Of The Job True False Na Na B
CS604 ___________ Command To Resume The Execution Of A Suspended Job In The Foreground Fg Bg Jobs Kill A
CS604 The Frame That Has Been Modified During Execution Of A Process Is Usually Called Frame Clean Dirty Overwritten Ideal B
CS604 Is A High Level Abstraction Over Semaphore Shared Memory Message Passing Monitor Mutual Exclusion C