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 Which Of The Following Is Not An Operating System Linux Unix Windows Xp Datebase D
CS604 Which Of The Following Is Well Suited For Batch Processing Process Control Video Game Control Preparing Pay Bills Of Employees None Of The Above C
CS604 Which Of The Following Memory Allocation Scheme Suffers From External Fragmentation? Segmentation Pure Demand Paging Swapping Paging A
CS604 Which Of The Following Page Replacement Algorithms Suffers From Belady’S Anomaly? Optimal Replacement Lru Fifo Both Optimal Replacement And Fifo C
CS604 Which Of The Following Will Determine Your Choice Of Systems Software For Your Computer ? Is The Applications Software You Want To Use Compatible With It ? Is It Expensive ? Is It Compatible With Your Hardware ? Both 1 And 3 D
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 Which Register Holds The Smallest Legal Physical Memory Address For A Process? Base Register Limit Register Status Register None Of The Given Options A
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 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 While A Process Is Blocked On A Semaphores Queue It Is Engaged In Busy Waiting True False Na Na F
CS604 With The Round Robin Cpu Scheduling In A Time-Shared System __________ Using Very Large Time Slice Degenerates In To First Come First Served Algorithm Using Extremely Small Time Slices Improve Performance Using Extremely Small Time Slices Degenerate In To Last In First Out Algorithm Using Medium Sized Time Slices Leads To Shortest Request Time First Algorithm A
CS604 With ----------You Use Condition Variables Semaphores Monitor Read/Write Locks Swaps B
CS604 Wrong Use Of Wait And Signal Operations (In Context With Semaphores) Can Cause Problem(S) Mutual Exclusion Deadlock Bounded Waiting All Of The Given Options D
CS604 You Can Create A Threads By Using The Pthread_Create() Call True False Na Na A
CS604 You Can Display All Of The Signals Supported By Your System Along With Their Numbers By Using The -----------Command <Ctrl-A> Fg Jobs Kill -L D
CS604 You Can Display The Contents (Names Of Files And Directories) Of A Directory In Unix/Linux Directory Structure With The --------------- Command Ll S Ls None Of The Given Options C
CS604 You Can Terminate A Foreground Process By Pressing -------------- <Ctrl-A> <Ctrl-C> <Ctrl-Z> None Of The Given Options B
CS604 You Can Use The ------------- Command To Display The Status Of Suspended And Background Processes Fg Bg Jobs Kill C
CS604 You Can Use The ---------Command In Unix To Create A Directory Rmdir Mkdir Cp Gcc 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