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 Inter Process Communication Can Be Done Through __________ Mails Messages System Calls Traps B
CS604 The Correct Command For Compiling C Program Named Program.C In Linux Environment Is Gcc Program.C –O Firstprgram Gcc –O Firstprogram Program.C Gcc –Z Firstprogram Program.C Gcc Program.C –M Firstprgram A
CS604 Physical Memory Is Broken Down Into Fixed-Sized Blocks Called----------- And Logical Memory Is Divided Into Blocks Of The Same Size Called__________ Frames Pages Pages Frames Frames Holes Holes Segments A
CS604 The Returned Code To The Child Process After Successful Fork System Call Execution Is 0 1 2 3 A
CS604 Round Robin Scheduling Is Essentially The Preemptive Version Of __________ Fifo Shortest Job First Shortes Remaining Longest Time First A
CS604 Deadlock Detection And Recovery Technique Is Exactly Similar To Deadlock Avoidance Technique To Handle Deadlock In The System True False Na Na A
CS604 In Deadlock Detection And Recovery Algorithm A Deadlock Exists In The System If And Only If The Wait For Graph Contains A __________ Cycle Graph Edge Node A
CS604 In Paged Segmentation We Divide Every Segment In A Process Into Pages Fixed Size Variable Size Both A And B None Of These A
CS604 Cache Is Non-Volatile Memory True False Na Na B
CS604 Each Page Is A Power Of -------- Bytes Long In Paging Scheme 2 3 4 5 C
CS604 Which Part Of The Computer System Helps In Managing The File And Memory Management System? Operating System Device Drivers Application Software Hardware A
CS604 The Shortest-Job-First Scheduling Algorithm Can Be Preemptive Only Non-Preemptive Only Preemptive Or Non-Preemptive None Of The Given Options C
CS604 When A Process Opens Its First File Explicitly It Will Get Descriptor Number ___________ 1 2 3 4 C
CS604 In Overlay Technique We Can Overload Any Part Of The Program With The Part Of The Program Required Needed Recently True False Na Na B
CS604 The Logical Address Of Intel 80386 Is ___________ 36 Bits 48 Bits 64 Bits 128 Bits B
CS604 Lru Page Replacement Algorithm Can Be Implemented By Counter Stack Linked List All Of The Given Options D
CS604 ---------------Keep In Memory Only Those Instructions And Data That Are Needed At Any Given Time Fragmentation Paging Swapping Overlays D
CS604 A Process Is __________If It Is Spending More Time On Paging Thrashing Demand Paging Paging Fixed Allocation A
CS604 Memory Protection In Paging Is Achieved By Associating __________ With Each Page. This Bit Indicates Whether The Page Is In The Process Address Space Or Not Protection Bits Counting Bits Paging Table Segment Table A
CS604 In Swapping Technique Of Memory Management The Total Amount Transfer Time Is Directly Proportional To The ___________ Amount Of Memory Swapped Amount Of Space On Backing Store Space On Main Memory All The Given Options Are Correct A