Computer Science MCQs Subcategories

Computer Science	Operating System (OS) MCQs
Algorithms & Data Structures	DBMS MCQs
Programming MCQs	Software Development MCQs
Networking MCQs	Data Structure MCQs
Intro to IT	Web Development MCQs
Software Engineering Mcqs	Computer Science MCQs
Data Representation	Functions
Floating Point Accuracy	Databases
Data Management

In priority scheduling algorithm ……?

A) CPU is allocated to the process with the highest priority
B) CPU is allocated to the process with the lowest priority
C) Equal-priority processes, cannot be scheduled
D) None of these

In the 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 process

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 algorithm

In multilevel feedback scheduling algorithm?

A) Process can move to a different classified ready queue
B) Classification of the ready queue is permanent
C) Processes are not classified into groups
D) None of the mentioned

A process refers to 5 pages A, B, C, D, E in the order A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with Internal store of 3 frames is?

A) 8
B) 10
C) 9
D) 7

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed and then the page replacement algorithm used is?

A) LRU
B) LFU
C) FIFO
D) None of these

The aim of creating page replacement algorithms is to?

A) Replace pages faster
B) Increase the page fault rate
C) Decrease the pay, fault rate
D) To allocate multiple pages to processes

A FIFO replacement algorithm associates with each page the?

A) Time it was brought into memory
B) Size of the page in memory
C) Page after and before it
D) All of these

Optimal page …….. replacement algorithm?

A) Replace the page that has not been used for a long lime
B) Replace the page that has been used for a long time
C) Replace the page-that will not be used for a long time
D) None of these

The optimal page-replacement algorithm is difficult to implement, because?

A) It requires a lot of information
B) It requires future knowledge of the reference string
C) It is too complex
D) It is extremely expensive