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
CS703 __________ Integer Shows The Highest Priority Of A Process In Cpu Scheduling. Small Large Na Na A
CS703 __________ Is A Preemptive Scheduling Algorithm. First Come First Serve Shortest Job First Round Robin None Of These A
CS703 __________ Is A Solution To The Problem Of Indefinite Blockage Of Low-Priority Processes. Starvation Deadlock Aging None Of The These C
CS703 __________ 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
CS703 __________ Is Used In Real Time Operating Systems. Non-Preemptive Scheduling Preemptive Scheduling Dispatching Scheduling Fcfs Scheduling A
CS703 __________ Scheduler Selects The Process From The Job Pool And Put Them In Main Memory. Long Term Short Term Medium Term Swapper A
CS703 __________ Scheduling Algorithm Can Be Preemptive Or Non-Preemptive. First Come First Serve Shortest Job First Round Robin Priority B
CS703 __________ Scheduling Algorithm Is Sometimes Called Shortest Remaining Time First Scheduling Algorithm. Non-Preemptive Sjf Priority Scheduling Preemptive Shortest Job First Fcfs C
CS703 ___________ Command Gives A Snapshot Of The Current Processes. Ps Top Who Ls A
CS703 ___________ Command To Resume The Execution Of A Suspended Job In The Foreground Fg Bg Jobs Kill A
CS703 ___________ Is Also Called Swapper. Swap Space Medium Term Scheduler Short Term Scheduler Long Term Scheduler B
CS703 ___________ Scheduling Allows A Process To Move Between Queues. Round Robin First Come First Serve Multilevel Feedback Queue Shortest Remaining Time First C
CS703 ___________Buffer Places No Practical Limit On The Size Of The Buffer Bounded Unbounded Both Unbounded & Bounded None Of The Given Options B
CS703 ___________Displays Information About The Top Processes. Ls Cs Top Cd C
CS703 __________Has A Hierarchical File System Structure. Dos Windows Unix None Of The Given Options C
CS703 “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.” That Requirement Known As Progress Bounded Waiting Mutual Exclusion Critical Region B
CS703 1 Mb Or 1 Megabyte Is Equivalent To___________. 1024 Bytes 10242 Bytes (May Be This) 10243 Bytes 1000000 Bytes D
CS703 A ___________ Is An Abstract Key For Accessing A File. File Descriptor Input Redirection Output Redirection Fifo A
CS703 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
CS703 A Major Problem With Priority Scheduling Algorithms Is __________. Deadlock Aging Starvation None Of These C