Solved Past Papers MCQs of Lecturer Computer Science

superadmin

Solved Past Papers MCQs of Lecturer Computer Science

 

Solved Past Papers MCQs of Lecturer Computer Science for the preparation of NTS, PPSC, SPSC, BPSC, KPSC, FPSC, OTS, and other academic entry tests and jobs tests.

 

1. Which one of the following is the address generated by CPU

A) Physical address

B) Absolute address

C) Logical address

D) None of these

 

2. Run time mapping from virtual to physical address is done by

A) Memory management unit

B) CPU

C) PCI

D) None of these

 

3. Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called

A) Fragmentation

B) Paging

C) Mapping

D) None of these

 

4. The interrupt-request line is a part of the ……

A) Data line

B) Control line

C) Address line

D) None of these

 

5. The return address from the interrupt-service routine is stored on the ……

A) System heap

B) Processor Register

C) Processor stack

D) Memory

 

6. The signal sent to the device from the processor to the device after receiving an interrupt is

A) Interrupt-acknowledge

B) Return signal

C) Service signal

D) Permission signal

 

7. A rotational database consists of …….

A) Tables

B) Fields

C) Records

D) Keys

 

8. A …… in a table represents a relationship among a set of values

A) Column

B) Key

C) Row

D) Entry

 

9. The term …… is used to refer to a row

A) Attribute

B) Tuple

C) Field

D) Instance

 

10. The term attribute refers to a ……. of a table

A) Record

B) Column

C) Tuple

D) Key

 

 11. 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 these

 

12. The processes that are residing in main memory for execution are kept on a list called

A) Job queue

B) Ready queue

C) Execution queue

D) Process queue

 

13. 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) Throughput

 

14. 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 these

 

15. 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, cannot be scheduled

D) None of these

 

16. 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 process

 

17. 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

 

18. In multilevel feedback scheduling algorithm

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 mentioned

 

19. 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 mentioned

 

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

A) LRU

B) LFU

C) FIFO

D) None of these

 

21. Users are ……. that their processes are running on a paged system

A) Aware

B) Unaware

C) Informed

D) None of these

 

22. 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 processe

 

23. 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

 

24. 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

 

25. Optimal page – replacement algorithm 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

 

Next Post

Solved Past Papers MCQs of Lecturer Political Science

Solved Past Papers MCQs of Lecturer Political Science   Solved Past Papers MCQs of Lecturer Political Science for the preparation of NTS, PPSC, SPSC, BPSC, KPSC, FPSC, OTS, and other academic entry tests and jobs tests.   1. Which doctrine held that the function of government should be to secure […]
Solved Past Papers MCQs of Lecturer Political Science (www.mcqsquiz.com)
error: Content is protected !!