Toggle navigation
Home
KPSC Previous Question Papers
Article Category
kerala psc
upsc
General
Popular Pages
Multiple Choice Question in aptitude-area
Multiple Choice Question in non-verbal-reasoning-grouping-of-images
Multiple Choice Question in aptitude-compound-interest
Multiple Choice Question in engineering-mechanics-kinetics-of-a-particle-impulse-and-momentum
Multiple Choice Question in electronic-devices-bipolar-junction-transistors
Multiple Choice Question in 035/2016
Multiple Choice Question in database-database-redesign
Question Answer in malayalam-kerala-psc-questions
Multiple Choice Question in malayalam-kerala-psc-questions
Multiple Choice Question in current-affairs-2017-03-05
Question Answer in KERALA PSC
Multiple Choice Question in KERALA PSC
Question Answer Bank
Multiple Choice Question Bank
Question Answer Category
Multiple Choice Question Category
Home
->
Multiple Choice Questions
Question Set
computer science operating systems concepts
1. The FIFO algorithm
(A): execute first the job that has been in the queue the longest
(B): executes first the job that first entered the queue
(C): executes first the job that last entered the queue
(D): executes first the job with the least processor needs
(E): None of the above
Previous Question
Show Answer
Next Question
Add Tags
Report Error
Show Marks
Ask Your Doubts Here
Type in
(Press Ctrl+g to toggle between English and the chosen language)
Post reply
Comments
Show Similar Question And Answers
MCQ->The FIFO algorithm....
MCQ->Pick out thể one word for - a secret arrangement....
MCQ->Assertion (A): A good algorithm should be fast, require minimal computer memory and time.Reason (R): Many times an algorithm is prepared in the form of a flow chart.....
MCQ->Which algorithm design technique is used in merge sort algorithm?....
MCQ->Which of the following statements are correct about the Stack collection? It can be used for evaluation of expressions. All elements in the Stack collection can be accessed using an enumerator. It is used to maintain a FIFO list. All elements stored in a Stack collection must be of similar type. Top-most element of the Stack collection can be accessed using the Peek() method.....
×
×
Type The Issue
×
Your Marks
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use | Powered By:Omega Web Solutions
© 2002-2017 Omega Education PVT LTD...
Privacy
|
Terms And Conditions
Question ANSWER With Solution