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 For Some Page Replacement Algorithms The Page Fault Rate May Increase As The Number Of Allocated Frames __________ Constant Decreased Increased All Of The Given C
CS604 Hardware Provide Basic Computing Resource True False Na Na A
CS604 ------------Has A Hierarchical File System Structure Dos Windows Unix None Of The Given Options C
CS604 ---------Holds The Smallest Legal Physical Memory Address For A Process Base Register Limit Register Index Register Stack Pointers Register A
CS604 I Mb Or 1 Megabyte Is Equivalent To__________ 1024 Bytes 1024^2 Bytes 1024^3 Bytes 1000000 Bytes B
CS604 I/O Instructions Are Privileged Instructions True False Na Na A
CS604 Identify The Odd Thing In The Services Of Operating System Accounting Protection Error Detection And Correction Dead Lock Handling C
CS604 If A Process Continues To Fault Replacing Pages For Which It Then Faults And Brings Back In Right Away. This High Paging Activity Is Called __________ Paging Thrashing Page Fault Cpu Utilization C
CS604 If A System Is Not In A Safe State There Can Be No Deadlocks True False Na Na B
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 If The Fork System Call Fails It Returns -1 0 1 2 A
CS604 If The System Can Allocate Resources To Each Process In Some Order And Still Avoid A Deadlock Then It Said To Be In State Safe Unsafe Mutual Starvation A
CS604 If Validation Bit Is 0 It Indicates A/An --------- State Of Segment Protected Shared Legal Illegal D
CS604 If Your Processor Does Not Have Two Slots Empty In Per Process File Descriptor Table Then Your ___________ System Call Will Fail Pipe Read Write Open A
CS604 In ------------- Technique Memory Is Divided Into Several Fixed-Size Partitions Swapping Overlays Multiprogramming With Fixed Tasks (Mft) Multiprogramming With Variable Tasks (Mvt) C
CS604 In __________ Communication The Process Which Wants To Communicate With The Other Process Must Explicitly Name The Recipient And The Sender Direct Indirect Automatic Self A
CS604 In __________ Page Replace Algorithm We Will Replace The Page That Has Not Been Used For The Longest Period Of Time Counter Based Least Frequently Used Fifo Lru D
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 In A Symmetric Multiprocessor Threads Can Always Be Run On Any Processor True False Na Na F
CS604 In A Unix System __________ System Call Can Be Used To Request The Operating System To Memory Map An Opened File Mmap( ) Fork ( ) Exec( ) Read( ) A