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 Which Of The Following Page Replacement Algorithms Suffers From Belady’S Anomaly? Optimal Replacement Lru Fifo Both Optimal Replacement And Fifo C
CS604 Pages That Are Shared Between Two Or More Processes Can Never Be Swapped Out To The Disk True False Na Na F
CS604 What Is The Memory From 1K - 640K Called ? Extended Memory Normal Memory Low Memory Conventional Memory D
CS604 “There Exists A Bound On The Number Of Times That Other Processes Are Allowed To Enter Their Critical Sections After A Process Has Made A Request To Enter Its Critical Section And Before That Request Is Granted.” Requirement For Solving Critical Section Progress Bounded Waiting Mutual Exclusion Critical Region B
CS604 Super Computers Typically Employ Real Time Operating System Multiprocessors Os Desktop Os None Of The Above B
CS604 In __________ Communication The Process Which Wants To Communicate With The Other Process Must Explicitly Name The Recipient And The Sender Direct Indirect Automatic Self A
CS604 Preemptive ----------------Scheduling Is Sometimes Called Shortestremaining-Time-First Scheduling First-Come-First-Served (Fcfs) Round-Robin Sorted Job First (Sjf) Priority C
CS604 ------------------Points To The Page Table Translation Look-Aside Buffers Page-Table Base Register (Ptbr) Page-Table Length Register (Ptlr) Page Offset C
CS604 Linux Uses __________ Directory To Store System Configuration Files /Bin /Dev /Boot /Etc D
CS604 Command Display The Status Of A Process Ps Ls Gcc Cat A
CS604 N-Process Critical Section Problem Can Be Solved By Using Deterministing Modeling The Bakery Algorithm Analytic Evaluation None Of Above B
CS604 In Paging Systems External Fragmentation Cannot Occur True False Na Na A
CS604 Unix Operating System Is An __________ Time Sharing Operating System Multi-User Operating System Multi-Tasking Operating System All The Above D
CS604 With ----------You Use Condition Variables Semaphores Monitor Read/Write Locks Swaps B
CS604 Which Register Holds The Smallest Legal Physical Memory Address For A Process? Base Register Limit Register Status Register None Of The Given Options A
CS604 A Modification Of Free-List Approach In Free Space Management Is To Store The Addresses Of N Free Blocks In The First Free Block. Known As Counting Linked List Bit Vector Grouping D
CS604 A Process Consists Of __________ One Or More Threads Code Data All Of The Given D
CS604 Banker"S Algorithm Is Used For __________ Deadlock Avoidance Deadlock Detection Deadlock Prevention Deadlock Removal A
CS604 An Optimal Scheduling Algorithm In Terms Of Minimizing The Average Waiting Time Of A Given Set Of Processes Is __________ Fcfs Scheduling Algorithm Round Robin Scheduling Algorithm Shorest Job - First Scheduling Algorithm None Of The Above C
CS604 All Threads Within A Process Share The __________ Address Space Same Different Both A And B None Of The These B