vu cs604 Final Term - Quiz No.19
vu cs604 Operating Systems Quiz
This quiz belongs to book/course code vu cs604 Operating Systems of vu organization. We have 37 quizzes available related to the book/course Operating Systems. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Final Term. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: The interval from the time of submission to the time of completion is the __________
Turnaround time
Waiting time
Response time
None of all these
Question 2: __________ is also called Swapper.
Swap space
Medium term scheduler
Short term scheduler
Long term scheduler
Question 3: The problem of fragmentation arises in __________.
Static storage allocation
Stack allocation storage
Stack allocation with dynamic binding
Heap allocation
Question 5: 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
Question 6: In __________ technique, memory is divided into several fixed-size partitions.
Swapping
Overlays
Multi programming with fixed tasks (MFT)
Multi programming with fixed tasks (MFT)
Question 8: Which of the following is correct definition for wait operation?
wait(S) { while(S<=0) ;// no op S--; }
wait(S) { S++; }
wait(S) { while(S>=0) ;// no op S--; }
wait(S) { S--; }
Question 10: In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of, Starvation? Low priority processes may never execute is resolved by __________.
Terminating the process
Aging
Mutual Exclusion
Semaphore
