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 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 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 If The Disk Head Is Located Initially At 32 Find The Number Of Disk Moves Required With Fcfs If The Disk Queue Of I/O Blocks Requests Are 98 37 14 124 65 67 310 324 315 321 C
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 Is Also Called Swapper Swap Space Medium Term Scheduler Short Term Scheduler Long Term Scheduler B
CS604 When A Link Is Created A Directory Entry For The Existing File Is Created Soft Hard Soft Or Hard Soft Or Hard None Of The Given Options A
CS604 Multiprogramming Systems __________ Are Easier To Develop Than Single Programming Systems Execute Each Job Faster Execute More Jobs In The Same Time Are Used Only On Large Main Frame Computers C
CS604 Which Is Not The State Of The Process ? Blocked Running Ready Privileged D
CS604 While A Process Is Blocked On A Semaphores Queue It Is Engaged In Busy Waiting True False Na Na F
CS604 The Page Replacement Policy That Sometimes Leads To More Page Faults When The Size Of The Memory Is Increased Is Fifo Lru No Such Policy Exists None Of The Above A
CS604 The Resident Set Of A Process Can Be Changed In Response To Actions By Other Processes True False Na Na T
CS604 The Run-Time Mapping From Virtual To Physical Addresses Is Done By A Piece Of Hardware In The Cpu Called The ------------------ Cpu Scheduler Memory Management Unit (Mmu) Registers None Of The Given Options B
CS604 On-Chip Cache Has Lower Access Time Than Ram Larger Capacity Than Off Chip Cache Its Own Data Bus Become Obsolete A
CS604 If The Fork System Call Fails It Returns -1 0 1 2 A
CS604 The Major Advantage Of Multi-Programming System Is More Than One Jobs Can Be Processed At A Given Time Cpu Utilization Can Be Increased Jobs Can Be Completed Quickly All Of The Options Are Correct B
CS604 Circular Waiting Is A Necessary Condition For Deadlock But Not A Sufficient Condition True False Na Na T
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 It Is Not Possible To Run A Program Whose Size Is Greater Than The Size Of The Main Memory True False Na Na B
CS604 A Process Is Said To Be In Critical Section If It Executes Code That Manipulates Shared Data True False Na Na A
CS604 Assume A Logical Address Space Of 16 Pages Of 1024 Words Each Mapped Into A Physical Memory Of 32 Frames. Each Word Consists Of 2 Bytes. What Will Be The Total Number Of Bits Required For P (Page Number)? 4 Bits 8 Bits 16 Bits 32 Bits A