InterviewSolution
Saved Bookmarks
InterviewSolution
This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following scheduling algorithms gives minimum average waiting time?(a) FCFS(b) SJF(c) Round – robin(d) PriorityThe question was asked in a job interview.The question is from CPU Scheduling Algorithms-2 in portion CPU Scheduling of Operating System |
|
Answer» RIGHT OPTION is (B) SJF For EXPLANATION: NONE. |
|
| 2. |
A solution to the problem of indefinite blockage of low – priority processes is ____________(a) Starvation(b) Wait queue(c) Ready queue(d) AgingThe question was asked in class test.My query is from CPU Scheduling Algorithms-2 in portion CPU Scheduling of Operating System |
|
Answer» CORRECT OPTION is (d) Aging The BEST I can EXPLAIN: NONE. |
|
| 3. |
What is ‘Aging’?(a) keeping track of cache contents(b) keeping track of what pages are currently residing in memory(c) keeping track of how many times a given page is referenced(d) increasing the priority of jobs to ensure termination in a finite timeI got this question during an interview.The question is from CPU Scheduling Algorithms-2 topic in portion CPU Scheduling of Operating System |
|
Answer» Right ANSWER is (d) INCREASING the priority of jobs to ENSURE termination in a finite time |
|
| 4. |
Choose one of the disadvantages of the priority scheduling algorithm?(a) it schedules in a very complex manner(b) its scheduling takes up a lot of time(c) it can lead to some low priority process waiting indefinitely for the CPU(d) none of the mentionedThis question was posed to me in an international level competition.Origin of the question is CPU Scheduling Algorithms-2 topic in division CPU Scheduling of Operating System |
|
Answer» RIGHT answer is (c) it can lead to some LOW priority process waiting INDEFINITELY for the CPU For explanation: None. |
|
| 5. |
An SJF algorithm is simply a priority algorithm where the priority is ____________(a) the predicted next CPU burst(b) the inverse of the predicted next CPU burst(c) the current CPU burst(d) anything the user wantsThis question was addressed to me during an internship interview.I'm obligated to ask this question of CPU Scheduling Algorithms-2 in portion CPU Scheduling of Operating System |
|
Answer» CORRECT ANSWER is (a) the predicted NEXT CPU burst Explanation: The LARGER the CPU burst, the lower the PRIORITY. |
|
| 6. |
Preemptive Shortest Job First scheduling is sometimes called ____________(a) Fast SJF scheduling(b) EDF scheduling – Earliest Deadline First(c) HRRN scheduling – Highest Response Ratio Next(d) SRTN scheduling – Shortest Remaining Time NextThe question was asked in an interview.My doubt stems from CPU Scheduling Algorithms-2 in portion CPU Scheduling of Operating System |
|
Answer» RIGHT ANSWER is (d) SRTN scheduling – Shortest REMAINING Time Next Best EXPLANATION: NONE. |
|
| 7. |
The FCFS algorithm is particularly troublesome for ____________(a) time sharing systems(b) multiprogramming systems(c) multiprocessor systems(d) operating systemsI have been asked this question in unit test.This intriguing question originated from CPU Scheduling Algorithms-2 in section CPU Scheduling of Operating System |
|
Answer» The correct option is (B) MULTIPROGRAMMING systems |
|
| 8. |
The real difficulty with SJF in short term scheduling is ____________(a) it is too good an algorithm(b) knowing the length of the next CPU request(c) it is too complex to understand(d) none of the mentionedI had been asked this question during an internship interview.I'd like to ask this question from CPU Scheduling Algorithms-2 topic in division CPU Scheduling of Operating System |
|
Answer» The CORRECT choice is (B) KNOWING the length of the next CPU request |
|
| 9. |
Which is the most optimal scheduling algorithm?(a) FCFS – First come First served(b) SJF – Shortest Job First(c) RR – Round Robin(d) None of the mentionedI have been asked this question by my school principal while I was bunking the class.The question is from CPU Scheduling Algorithms-2 topic in section CPU Scheduling of Operating System |
|
Answer» The correct OPTION is (b) SJF – SHORTEST Job First |
|
| 10. |
Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________(a) Lengthened; Shortened(b) Shortened; Lengthened(c) Shortened; Shortened(d) Shortened; UnchangedThe question was asked in class test.I want to ask this question from CPU Scheduling Algorithms-1 in chapter CPU Scheduling of Operating System |
|
Answer» Correct answer is (b) Shortened; Lengthened |
|
| 11. |
Which of the following algorithms tends to minimize the process flow time?(a) First come First served(b) Shortest Job First(c) Earliest Deadline First(d) Longest Job FirstThe question was asked in exam.This intriguing question originated from CPU Scheduling Algorithms-1 topic in section CPU Scheduling of Operating System |
|
Answer» RIGHT choice is (b) Shortest JOB First Explanation: NONE. |
|
| 12. |
Orders are processed in the sequence they arrive if _______ rule sequences the jobs.(a) earliest due date(b) slack time remaining(c) first come, first served(d) critical ratioThis question was posed to me in semester exam.I'm obligated to ask this question of CPU Scheduling Algorithms-1 topic in portion CPU Scheduling of Operating System |
|
Answer» RIGHT answer is (c) FIRST COME, first served Explanation: NONE. |
|
| 13. |
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?(a) tQ = 15ms(b) tQ = 40ms(c) tQ = 45ms(d) tQ = 50msThe question was posed to me during an internship interview.I need to ask this question from CPU Scheduling Algorithms-1 topic in chapter CPU Scheduling of Operating System |
|
Answer» The CORRECT CHOICE is (a) TQ = 15ms |
|
| 14. |
What is Scheduling?(a) allowing a job to use the processor(b) making proper use of processor(c) all of the mentioned(d) none of the mentionedI had been asked this question in class test.My enquiry is from CPU Scheduling Algorithms-1 in portion CPU Scheduling of Operating System |
|
Answer» Correct CHOICE is (a) ALLOWING a JOB to USE the processor |
|
| 15. |
The strategy of making processes that are logically runnable to be temporarily suspended is called ____________(a) Non preemptive scheduling(b) Preemptive scheduling(c) Shortest job first(d) First come First servedThis question was posed to me in examination.I'm obligated to ask this question of CPU Scheduling Algorithms-1 topic in section CPU Scheduling of Operating System |
|
Answer» The correct option is (B) PREEMPTIVE scheduling |
|
| 16. |
What is FIFO algorithm?(a) first executes the job that came in last in the queue(b) first executes the job that came in first in the queue(c) first executes the job that needs minimal processor(d) first executes the job that has maximum processor needsThe question was posed to me at a job interview.Origin of the question is CPU Scheduling Algorithms-1 in division CPU Scheduling of Operating System |
|
Answer» The CORRECT OPTION is (B) first executes the JOB that came in first in the queue |
|
| 17. |
Complex scheduling algorithms ____________(a) are very appropriate for very large computers(b) use minimal resources(c) use many resources(d) all of the mentionedI got this question in an interview for internship.My doubt stems from CPU Scheduling Algorithms-1 in division CPU Scheduling of Operating System |
|
Answer» Right choice is (a) are very appropriate for very LARGE COMPUTERS |
|
| 18. |
The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________(a) assigning ready processes to CPU(b) assigning ready processes to waiting queue(c) assigning running processes to blocked queue(d) all of the mentionedThe question was posed to me in a job interview.I would like to ask this question from CPU Scheduling Algorithms-1 in section CPU Scheduling of Operating System |
|
Answer» The CORRECT option is (a) ASSIGNING ready PROCESSES to CPU |
|
| 19. |
With round robin scheduling algorithm in a time shared system ____________(a) using very large time slices converts it into First come First served scheduling algorithm(b) using very small time slices converts it into First come First served scheduling algorithm(c) using extremely small time slices increases performance(d) using very small time slices converts it into Shortest Job First algorithmThe question was posed to me in quiz.This key question is from CPU Scheduling Algorithms-1 topic in section CPU Scheduling of Operating System |
|
Answer» The correct option is (a) USING very LARGE TIME slices converts it into First come First SERVED scheduling algorithm |
|
| 20. |
Round robin scheduling falls under the category of ____________(a) Non-preemptive scheduling(b) Preemptive scheduling(c) All of the mentioned(d) None of the mentionedThe question was posed to me at a job interview.I would like to ask this question from CPU Scheduling Algorithms-1 topic in portion CPU Scheduling of Operating System |
|
Answer» RIGHT choice is (b) Preemptive scheduling For EXPLANATION: None. |
|
| 21. |
What is Response time?(a) the total time taken from the submission time till the completion time(b) the total time taken from the submission time till the first response is produced(c) the total time taken from submission time till the response is output(d) none of the mentionedThis question was posed to me during an interview.My question is taken from CPU Scheduling Benefits topic in division CPU Scheduling of Operating System |
|
Answer» Correct option is (b) the TOTAL TIME taken from the submission time till the FIRST RESPONSE is produced |
|
| 22. |
Scheduling is done so as to ____________(a) increase the waiting time(b) keep the waiting time the same(c) decrease the waiting time(d) none of the mentionedThis question was addressed to me in an online interview.My question is taken from CPU Scheduling Benefits in division CPU Scheduling of Operating System |
|
Answer» The CORRECT OPTION is (C) decrease the WAITING time |
|
| 23. |
What is Waiting time?(a) the total time in the blocked and waiting queues(b) the total time spent in the ready queue(c) the total time spent in the running queue(d) the total time from the completion till the submission of a processI got this question in an interview for job.The doubt is from CPU Scheduling Benefits in chapter CPU Scheduling of Operating System |
|
Answer» Correct choice is (B) the TOTAL TIME spent in the ready queue |
|
| 24. |
Scheduling is done so as to ____________(a) increase the turnaround time(b) decrease the turnaround time(c) keep the turnaround time same(d) there is no relation between scheduling and turnaround timeThe question was posed to me during an interview.Question is taken from CPU Scheduling Benefits in division CPU Scheduling of Operating System |
|
Answer» CORRECT answer is (b) DECREASE the turnaround time The EXPLANATION: NONE. |
|
| 25. |
What is Turnaround time?(a) the total waiting time for a process to finish execution(b) the total time spent in the ready queue(c) the total time spent in the running queue(d) the total time from the completion till the submission of a processThe question was posed to me at a job interview.My question is from CPU Scheduling Benefits in section CPU Scheduling of Operating System |
|
Answer» CORRECT CHOICE is (d) the total TIME from the COMPLETION till the submission of a process Explanation: NONE. |
|
| 26. |
Scheduling is done so as to ____________(a) increase the throughput(b) decrease the throughput(c) increase the duration of a specific amount of work(d) none of the mentionedI had been asked this question during an internship interview.The above asked question is from CPU Scheduling Benefits in chapter CPU Scheduling of Operating System |
|
Answer» CORRECT choice is (a) INCREASE the throughput The best EXPLANATION: NONE. |
|
| 27. |
Scheduling is done so as to ____________(a) increase CPU utilization(b) decrease CPU utilization(c) keep the CPU more idle(d) none of the mentionedThe question was asked in an interview for job.My question is from CPU Scheduling Benefits topic in chapter CPU Scheduling of Operating System |
|
Answer» The CORRECT ANSWER is (a) INCREASE CPU utilization |
|
| 28. |
What is Dispatch latency?(a) the speed of dispatching a process from running to the ready state(b) the time of dispatching a process from running to ready state and keeping the CPU idle(c) the time to stop one process and start running another one(d) none of the mentionedThe question was posed to me in quiz.Asked question is from CPU Scheduling Benefits in chapter CPU Scheduling of Operating System |
|
Answer» Right answer is (c) the TIME to stop ONE process and start RUNNING another one |
|
| 29. |
The switching of the CPU from one process or thread to another is called ____________(a) process switch(b) task switch(c) context switch(d) all of the mentionedThis question was posed to me by my school principal while I was bunking the class.Query is from CPU Scheduling Benefits in chapter CPU Scheduling of Operating System |
|
Answer» The CORRECT CHOICE is (d) all of the mentioned |
|
| 30. |
In the following cases non – preemptive scheduling occurs?(a) When a process switches from the running state to the ready state(b) When a process goes from the running state to the waiting state(c) When a process switches from the waiting state to the ready state(d) All of the mentionedThe question was asked in an online quiz.My doubt is from CPU Scheduling Benefits topic in portion CPU Scheduling of Operating System |
|
Answer» Right choice is (b) When a PROCESS GOES from the RUNNING STATE to the waiting state |
|
| 31. |
A process is selected from the ______ queue by the ________ scheduler, to be executed.(a) blocked, short term(b) wait, long term(c) ready, short term(d) ready, long termThe question was posed to me in examination.My question is from CPU Scheduling Benefits in section CPU Scheduling of Operating System |
|
Answer» The CORRECT choice is (c) READY, SHORT term |
|
| 32. |
An I/O bound program will typically have ____________(a) a few very short CPU bursts(b) many very short I/O bursts(c) many very short CPU bursts(d) a few very short I/O burstsI got this question during an interview for a job.This is a very interesting question from CPU Scheduling Benefits topic in division CPU Scheduling of Operating System |
|
Answer» The correct OPTION is (C) MANY very short CPU bursts |
|
| 33. |
What are the two steps of a process execution?(a) I/O & OS Burst(b) CPU & I/O Burst(c) Memory & I/O Burst(d) OS & Memory BurstThe question was asked in an interview for internship.I want to ask this question from CPU Scheduling Benefits in division CPU Scheduling of Operating System |
|
Answer» The CORRECT CHOICE is (B) CPU & I/O Burst |
|
| 34. |
With multiprogramming ______ is used productively.(a) time(b) space(c) money(d) all of the mentionedThe question was posed to me in final exam.I'd like to ask this question from CPU Scheduling Benefits topic in section CPU Scheduling of Operating System |
|
Answer» Right choice is (a) time |
|
| 35. |
CPU scheduling is the basis of ___________(a) multiprocessor systems(b) multiprogramming operating systems(c) larger memory sized systems(d) none of the mentionedI got this question during an internship interview.This key question is from CPU Scheduling Benefits topic in chapter CPU Scheduling of Operating System |
|
Answer» RIGHT answer is (b) multiprogramming OPERATING systems For explanation: NONE. |
|
| 36. |
Which one of the following can not be scheduled by the kernel?(a) kernel level thread(b) user level thread(c) process(d) none of the mentionedI have been asked this question by my school principal while I was bunking the class.I'd like to ask this question from CPU Scheduling in portion CPU Scheduling of Operating System |
|
Answer» Correct choice is (B) user level THREAD |
|
| 37. |
In multilevel feedback scheduling algorithm ____________(a) a process can move to a different classified ready queue(b) classification of ready queue is permanent(c) processes are not classified into groups(d) none of the mentionedThe question was posed to me in class test.The origin of the question is CPU Scheduling in portion CPU Scheduling of Operating System |
|
Answer» Right choice is (a) a process can move to a different CLASSIFIED READY queue |
|
| 38. |
Process are classified into different groups in ____________(a) shortest job scheduling algorithm(b) round robin scheduling algorithm(c) priority scheduling algorithm(d) multilevel queue scheduling algorithmI have been asked this question during an interview.Question is from CPU Scheduling in portion CPU Scheduling of Operating System |
|
Answer» RIGHT CHOICE is (d) MULTILEVEL QUEUE scheduling algorithm For explanation: NONE. |
|
| 39. |
Which algorithm is defined in Time quantum?(a) shortest job scheduling algorithm(b) round robin scheduling algorithm(c) priority scheduling algorithm(d) multilevel queue scheduling algorithmThis question was addressed to me in exam.My question comes from CPU Scheduling topic in division CPU Scheduling of Operating System |
|
Answer» RIGHT option is (b) round ROBIN SCHEDULING algorithm Explanation: NONE. |
|
| 40. |
In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________(a) all process(b) currently running process(c) parent process(d) init processI got this question in examination.My enquiry is from CPU Scheduling in chapter CPU Scheduling of Operating System |
|
Answer» RIGHT answer is (b) currently RUNNING process Easy EXPLANATION - None. |
|
| 41. |
In priority scheduling algorithm ____________(a) CPU is allocated to the process with highest priority(b) CPU is allocated to the process with lowest priority(c) Equal priority processes can not be scheduled(d) None of the mentionedI have been asked this question in an interview for internship.I'm obligated to ask this question of CPU Scheduling in section CPU Scheduling of Operating System |
|
Answer» Right OPTION is (a) CPU is allocated to the process with HIGHEST priority |
|
| 42. |
Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?(a) first-come, first-served scheduling(b) shortest job scheduling(c) priority scheduling(d) none of the mentionedI got this question in examination.I want to ask this question from CPU Scheduling in division CPU Scheduling of Operating System |
|
Answer» The CORRECT ANSWER is (a) first-come, first-served scheduling |
|
| 43. |
The interval from the time of submission of a process to the time of completion is termed as ____________(a) waiting time(b) turnaround time(c) response time(d) throughputI had been asked this question in quiz.The question is from CPU Scheduling topic in division CPU Scheduling of Operating System |
|
Answer» The CORRECT CHOICE is (B) TURNAROUND time |
|
| 44. |
The processes that are residing in main memory and are ready and waiting to execute are kept on a list called _____________(a) job queue(b) ready queue(c) execution queue(d) process queueI have been asked this question in homework.My doubt stems from CPU Scheduling in chapter CPU Scheduling of Operating System |
| Answer» | |
| 45. |
Which module gives control of the CPU to the process selected by the short-term scheduler?(a) dispatcher(b) interrupt(c) scheduler(d) none of the mentionedThe question was asked during an online interview.My question is from CPU Scheduling in chapter CPU Scheduling of Operating System |
|
Answer» RIGHT OPTION is (a) dispatcher For EXPLANATION: NONE. |
|