Code Question Option A Option B Option C Option D Answer
CS703 1 Mb Or 1 Megabyte Is Equivalent To___________. 1024 Bytes 10242 Bytes (May Be This) 10243 Bytes 1000000 Bytes D
CS703 The Scheduling Of __________ Are Done By The Operating System. Kernel Threads User Level Threads Both Kernel And User Level Thread Both Kernel And User Level Thread A
CS703 A Major Problem With Priority Scheduling Algorithms Is __________. Deadlock Aging Starvation None Of These C
CS703 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 B
CS703 A ___________ Is An Abstract Key For Accessing A File. File Descriptor Input Redirection Output Redirection Fifo A
CS703 __________ Is A Preemptive Scheduling Algorithm. First Come First Serve Shortest Job First Round Robin None Of These A
CS703 Round Robin Algorithm Is Similar To __________ Scheduling But Preemption Is Added To Switch Between Processes. Shortest Job First Shortest Remaining Time First First Come First Serve None Of These C
CS703 __________ Is Used In Real Time Operating Systems. Non-Preemptive Scheduling Preemptive Scheduling Dispatching Scheduling Fcfs Scheduling A
CS703 In Unix/ Linux By Default The Standard Output File Is Attached To The __________ File Screen Printer Scanner B
CS703 The Scheduling Of __________ Are Done By The Operating System. Kernel Threads User Level Threads Both Kernel And User Level Thread None Of The Give Option A
CS703 Kernel Threads Are Supported Directly By The Operating System. The Kernel Performs The Scheduling Creation And Management In —— Command Displays The Status Of A Process. Ls Ps Gcc Cat D
CS703 You Can Terminate A Foreground Process By Pressing ___________. <Ctrl-A> <Ctrl-C> <Ctrl-Z> None Of The Given Options B
CS703 You Can Use The ___________ Command In Unix To Create A Directory. Rmdir Mkdir Cp Gcc B
CS703 The Priorities Of Processes In The __________ Group Remain Fixed. Kernel User Na Na A
CS703 ___________ Scheduling Allows A Process To Move Between Queues. Round Robin First Come First Serve Multilevel Feedback Queue Shortest Remaining Time First C
CS703 The Creating Process Is Called A __________ Process While The New Processes Are Called The __________ Of That Process None Of The Given Options Children Parent Parent Children Zombie Single C
CS703 The Bottom Layer In The Layered Approach Of Operating System Is __________ . User Interface Hardware Kernel None Of The Given Options C
CS703 __________ Scheduling Algorithm Is Sometimes Called Shortest Remaining Time First Scheduling Algorithm. Non-Preemptive Sjf Priority Scheduling Preemptive Shortest Job First Fcfs C
CS703 ___________ Is Also Called Swapper. Swap Space Medium Term Scheduler Short Term Scheduler Long Term Scheduler B
CS703 The Critical Section Problem Can Be Solved By The Following Except Software Based Solution Firmware Based Solution Operating System Based Solution Hardware Based Solution B