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 | A Process That Has Finished Working As Well As Its Parent Process Has Also Finished Its Execution. In This State The Process A Will Be Called As ___________ Process | Child | Thread | Zombie | Fork | A | |
CS604 | A Program Cannot Execute Unless Whole Or Necessary Part Of It Resides In The Main Memory | True | False | Na | Na | A | |
CS604 | A Program In Execution Is Called A __________ | Command | Process | Software | Compiler | B | |
CS604 | A Raid System Is Useful Because | It Increases Processor Speed | Increases Disk Storage Capacity | Increases Disk Storage Capacity And Availability | Increases Os Efficiency | C | |
CS604 | A Semaphore That Cause Busy-Waiting Is Termed As | Spinlock | Monitor | Critical Region | Critical Section | A | |
CS604 | A Semaphore That Cause Busy-Waiting Is Termed As __________ | Spinlock | Monitor | Critical Region | Critical Section | A | |
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 | A Solution To The Critical Section Problem Must Satisfy The Following Requirements | Progress | Mutual Exclusion | Bounded Waiting | All Of These | D | |
CS604 | A Solution To The Critical Section Problem Must Satisfy The Following Requirements Except | Mutual Exclusion | Progress | Bounded Waiting | Race Condition | D | |
CS604 | A System Call__________ | Is An Entry Point Into The Kernel Code | Allows A Program To Request A Kernel Service | Is A Technique To Protect I/O Devices And Other System Resources | All Of The These | A | |
CS604 | A Thread Is __________ | A Lightweight Process Where The Context Switching Is Low | A Lightweight Process Where The Context Swithching Is High | Is Used To Speed Up Paging | None Of The Above | A | |
CS604 | A Time Sharing System Is | Multi Tasking | Interactive | Multi User | All Of These | D | |
CS604 | A Tree Sturctured File Directory System | Allows Easy Storage And Retrieval Of File Names | Is A Much Debated Unecessary Feature | Is Not Essential When We Have Millions Of Files | None Of The Above | A | |
CS604 | Address Binding Will Be At In Multiprogramming With Fixed Tasks (Mft) | Run Time | Load Time | Dynamic Time | None Of The Given Options | B | |
CS604 | Addresses Generated Relative To Part Of Program Not To Start Of Physical Memory Are | Relocatable | Virtual | Symbolic | Physical | A | |
CS604 | All Threads Within A Process Share The __________ Address Space | Same | Different | Both A And B | None Of The These | B | |
CS604 | An Absolute Pathname Starts With The Root Directory (/) And A Relative Pathname Starts With Your Home Directory | True | False | Na | Na | A | |
CS604 | An Acyclic Graph Does Not Allow Directories To Have Shared Subdirectories And Files | True | False | Na | Na | B | |
CS604 | An Atomic Operation Is A Machine Instruction Or A Sequence Of Instructions That Must Be Executed To Completion Without Interruption | True | False | Na | Na | T | |
CS604 | An Operating System Is A Control Program That Manages The Execution Of User Programs To Prevent Errors And Improper Use Of A Computer | True | False | Na | Na | A |