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 --------------- Indicates Size Of The Page Table Translation Look-Aside Buffers Page-Table Base Register (Ptbr) Page-Table Length Register (Ptlr) Page Offset C
CS604 ------------- Spend More Time Doing Io Than Computations Short Cpu Bursts Cpu Bound Processes Io Bound Processes Both A And B None Of The Given B
CS604 /Opt Is Used For Storage Of Large Applications True False Na Na A
CS604 /Usr/X11R6 Is Used By The X Window System True False Na Na A
CS604 __________ Algorithm Is Used For Solving N-Process Critical Section Problem Bakery Bankers Babbles None Of The Given A
CS604 __________ Algorithm Is Used In Deadlock Avoidance Bakery Banker’S Mutual Exclusion Safe Sequence B
CS604 __________ Commands In Linux Is Used To Copy File Is Cp Mv Mkdir B
CS604 __________ Determines How To Do Something Mechanism Policy Mechanism And Policy None Of The Given A
CS604 __________ Determines What Will Be Done Mechanism Policy Mechanism And Policy None Of The Given B
CS604 __________ Directory Includes Essential System Boot Files Including The Kernel Image /Bin /Boot /Dev /Etc B
CS604 __________ Displays Information About The Top Processes Is Cs Top Cd C
CS604 __________ Integer Shows The Highest Priority Of A Process In Cpu Scheduling Small Large Both A And B None Of These A
CS604 __________ Is A Piece Of Code In A Cooperating Process In Which The Process May Updates Shared Data (Variable File Database Etc.) Critical Analysis Critical Section Critical Path Critical Code B
CS604 __________ Is A Preemptive Scheduling Algorithm First Come First Serve Shortest Job First Round Robin None Of These C
CS604 __________ Is A Solution To The Problem Of Indefinite Blockage Of Low-Priority Processes Starvation Deadlock Aging None Of The These C
CS604 __________ Is Also Called Swapper Long Term Short Term Medium Term Swap Space C
CS604 __________ Is An Integer Variable Accessible Through Wait And Signal Which Are Atomic Operations Semaphore Mutex Busy W Aiting Signal A
CS604 __________ Is Caused Due To Un-Used Space In Fixed Size Blocks/ Pages Internal Fragmentation External Fragmentation Paging Mvt A
CS604 __________ Is The Basis Of Queuing Theory Which Is Branch Of Mathematics Used To Analyze Systems Involving Queues And Servers Little’S Formula Deterministic Modeling Queuing Theory Queuing Analysis A
CS604 __________ Is Used In Real Time Operating Systems Non-Preemptive Scheduling Preemptive Scheduling Dispatching Scheduling Fcfs Scheduling A