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 | Rm And [R]Mkdir Commands Are Used To __________ Directory | Create | Move | Remove | Modify | C | |
CS604 | Round Robin Algorithm Is Most Suitable For __________ | Time Sharing System | Real Time Systems And Batch Systems | Running Batch Programs | Expert System | A | |
CS604 | Round Robin Algorithm Is Similar To __________ Scheduling But Preemption Is Added To Switch Between Processes | Shortest Jab First | Shortest Remaining Time First | First Come First Serve | None Of Theses | C | |
CS604 | Round Robin Algorithm Is Similar To __________ Scheduling But Preemption Is Added To Switch Between Processes | Shortest Job First | Shortest Remaining Time First | First Come First Server | None Of These | C | |
CS604 | Round Robin Scheduling Is Essentially The Preemptive Version Of __________ | Fifo | Shortest Job First | Shortes Remaining | Longest Time First | A | |
CS604 | Routine Is Not Loaded Until It Is Called. All Routines Are Kept On Disk In A Relocatable Load Format. The Main Program Is Loaded Into Memory & Is Executed. This Type Of Loading Is Called ___________ | Static Loading | Dynamic Loading | Dynamic Linking | Overlays | C | |
CS604 | Routine Is Not Loaded Until It Is Called. All Routines Are Kept On Disk In A Relocatable Load Format. The Main Program Is Loaded Into Memory & Is Executed. This Type Of Loading Is Called ___________ | Static Loading | Dynamic Loading | Dynamic Linking | Overlays | C | |
CS604 | Scheduler Selects The Process From The Job Pool And Put Them In Main Memory | Long Term | Short Term | Medium Term | Swapper | A | |
CS604 | Secondary Storage Memory Devices Have __________ Memory | Volatile | Permanent And Non-Volatile | Temporary | None Of The Options Is Correct | B | |
CS604 | Segmentation Is A Memory Management Scheme That Supports __________? | Programmer’S View Of Memory | System"S View Of Memory | Hardware"S View Of Memory | None Of The Given | A | |
CS604 | Segmented Paging Incurs Less Internal Fragmentation Than Pure Process-Level Paging | True | False | Na | Na | B | |
CS604 | Semaphores Are Used To Solve The Problem Of | Race Condition | Process Synchronization | Both Of Above | None Of The Above | B | |
CS604 | Shared Libraries And Kernel Modules Are Stored In Directory | /Bin | /Dev | /Boot | /Lib | D | |
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 | Software Is A Program That Directs The Overall Operation Of The Computer Facilitates Its Use And Interacts With The User. What Are The Different Types Of This Software ? | Operating System | Language Compiler | Utilities | All Of The Above | D | |
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 | Starvation Is Infinite Blocking Caused Due To Unavailability Of Resources | True | False | Na | Na | A | |
CS604 | Super Computers Typically Employ | Real Time Operating System | Multiprocessors Os | Desktop Os | None Of The Above | B | |
CS604 | Suppose That A Process Is In ‘Bocked’ State Waiting For Some I/O Service. When The Service Is Completed It Goes To The | Running State | Ready State | Suspended State | Terminated State | B | |
CS604 | Swapper Is Also Termed As Short Term Scheduler | True | False | Na | Na | B |