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 Cooperating Processes Never Share Any Data Code Memory Or State True False Na Na B
CS604 Variable Names Are ----------- Addresses Physical Relocatable Relative Symbolic D
CS604 Which Technique Was Introduced Because A Single Job Could Not Keep Both The Cpu And The I/O Devices Busy? Time-Sharing Spooling Preemptive Scheduling Multiprogramming D
CS604 __________ Scheduling Algorithm Can Be Preemptive Or Non-Preemptive First Come First Serve Shortest Job First Round Robin Priority B
CS604 You Can Use The Mv File1 File2 Command To Move ___________ File1 To File2 File 2 To File 1 Both Option A And B Are Correct None Of The Option Is Correct. A
CS604 Once A Virtual Memory Page Is Locked Into Main Memory It Cannot Be Written To The Disk True False Na Na F
CS604 In Pages Segmentation The Logical Address Is Legal If D Is ___________Segment Length Less Than Greater Than Equal To Greater Than Or Equal To A
CS604 The Two-Phase Locking Protocol Guarantees That Concurrent Transactions Are Deadlock-Free True False Na Na B
CS604 The Process Related To Process Control File Management Device Management Information About System And Communication That Is Requested By Any Higher Level Language Can Be Performed By __________ Editors Compilers System Call Caching C
CS604 __________ Is Used In Real Time Operating Systems Non-Preemptive Scheduling Preemptive Scheduling Dispatching Scheduling Fcfs Scheduling A
CS604 Mkfifo() Is A Library Call Command Directory None Of Above A
CS604 In The C-Scan And C-Look Algorithms When The Disk Head Reverses Its Direction It Moves All The Way To The Other End Without Serving Any Requests And Then Reverses Again And Starts Serving Requests True False Na Na A
CS604 Which File System Does Dos Typically Use ? Fat16 Fat32 Ntfs Wnfs A
CS604 A __________ System Is Similar To A Paging System With Swapping Context Switching Demand Paging Page Fault None Of The Given Options B
CS604 The Number Of Processes Completed Per Unit Time Is Called __________ Turn Around Time Throughput Response Time Dispatch Latency B
CS604 The Mechanism That Bring A Page Into Memory Only When It Is Needed Is Called ___________ Segmentation Fragmentation Demand Paging Page Replacement C
CS604 First-Come First-Served (Fcfs) Is A --------------Scheduling Algorithm Preemptive Non-Preemptive Both Preemptive And Non- Preemptive None Of The Given Options B
CS604 The Purpose Of Operating System Is To Generate Executable Programs And To Them Regenetrate Execute Store Remove B
CS604 Os Helps Manages The Following Except Application Software Bus Speed Of The System Memory Virtual Memory B
CS604 The Bankers Algorithm Is Used To Prevent Deadlock In Operating Systems To Detect Deadlock In Operating Systems To Rectify A Deadlocked State None Of The Above A