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 In__________ The Library Files Are Linked At Load Time Dynamic Linking Static Linking Both A And B None Of These A
CS604 Posix Is A Standard Developed By __________ Ansi Ieee Iso Acm B
CS604 The Allocated Portions Of Memory Using A Buddy System Are All The Same Size True False Na Na F
CS604 In Indirect Inter Process Communication A Sender __________ Mention The Name Of The Recipient Does Does Not May May Not B
CS604 Secondary Storage Memory Devices Have __________ Memory Volatile Permanent And Non-Volatile Temporary None Of The Options Is Correct B
CS604 A Binary Semaphore Takes On Numerical Values 0 And 1 Only True False Na Na T
CS604 Is A Way To Establish A Connection Between The File To Be Shared And The Directory Entries Of The Users Who Want To Have Aces To This File Link Directory Common Group Access Permission A
CS604 In Shortest Job First Algorithm Cpu Schedule Process According To The Priority Wise Cpu Burst Distribute Cpu Resources Equally Among All Processes All Of These B
CS604 In__________Addressing; The Recipient Is Not Required To Name The Sender Symmetric Asymmetric Both Symmetric And Asymmetric None Of The Given Options B
CS604 ___________Systems Involving Queues And Servers Little’S Formula Deterministic Modeling Queuing Theory Queuing Analysis A
CS604 What Is Spooling? Ability Of An Os To Protect Jobs From Writing Into The Wrong Memory Location Ability Of An Os To Do Long Term Job Scheduling Ability Of An Os To Read Jobs From Cards Onto The Disk And Load A New Job From The Disk To Empty Memory Partition Ability Of An Os To Give Priority To Each Job For Execution C
CS604 You Can Use The ------------- Command To Display The Status Of Suspended And Background Processes Fg Bg Jobs Kill C
CS604 The Integer Value Of ___________ Semaphores Can Not Be Greater Than 1 Counting Binary Mutex Bounded Buffer B
CS604 The Process Id Returned To The Child Process After Successful Fork System Call Execution Is __________ 0 1 2 3 A
CS604 An Optimal Page-Replacement Algorithm Has The Lowest Page Fault Rate Of All Algorithms True False Na Na A
CS604 Object Files And Libraries Are Combined By A ------------- Program To Produce The Executable Binary Compiler Linker Text Editor Loader B
CS604 Main Memory Is __________ Memory Volatile Non-Volatile Permanent Virtual 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 Which Of The Following Is Not Advantage Of Multiprogramming? Increased Throughput Shorter Response Time Decreased Operating System Overhead Ability To Assign Priorities To Jobs C
CS604 Page Fault Occurs When The Page Is Corrupted By Application Software The Page Is In Memory The Page Is Not In Memory One Tries To Divide A Number By 0 C