Computer and IT MCQS Past Paper 5

This Quiz include all the MCQS Related to Basic Information of Computer and IT from past papers of PPSC, FPSC, NTS, SPSC, KPSC, and BPSC. Every Quiz has 20 MCQS and Every MCQS have four options. Select the Correct Answer Right Answer Shows Green And Wrong Will Show as Red.

#1. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is :

#2. The aim of creating page replacement algorithms is to :

#3. 24) 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 an empty internal store of 3 frames is :

#4. Process are classified into different groups in

#5. Optimal page – replacement algorithm is :

#6. In multilevel feedback scheduling algorithm

#7. The interval from the time of submission of a process to the time of completion is termed as

#8. RAD stands for

#9. The processes that are residing in main memory and are ready and waiting to execute are kept on a list call

#10. In priority scheduling algorithm

#11. Optimal page – replacement algorithm is difficult to implement, because :

#12. Build & Fix Model is suitable for programming exercises of ___________ LOC (Line of code)

#13. LRU page – replacement algorithm associates with each page the ______

#14. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

#15. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of

#16. Time quantum is defined in

#17. Which one of the following can not be scheduled by the kernel?

#18. Users _______ that their processes are running on a paged system.

#19. A FIFO replacement algorithm associates with each page the _______

#20. For 3 page frames, the following is the reference string : 7 0 1 2 How many page faults does the LRU page replacement algorithm produce ?0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1



Leave a Comment