PAST PAPER PPSC LECTURER COMPUTER SCIENCE 2017

PAST PAPER PPSC LECTURER COMPUTER SCIENCE 2017

If, you are looking for PPSC Past Paper Lecturer Computer Science 2017 (BPS-17), then wait is over.

Here, PAST PAPERS PPSC will provide you All Past Paper PPSC Lecturer Computer Science 2017 (BPS-17) with fully Computer Solved Answers.

If the answer to any of the MCQs is wrong, be sure to mention it in the comments below the post. So PAST PAPERS PPSC answer to that MCQs can be corrected.

Past Paper PPSC Lecturer Computer Science 2017 (BPS-17)

PAST PAPER PPSC LECTURER COMPUTER SCIENCE 2017

1. Which module gives control of the CPU to the process selected by the short-term scheduler?

Dipatcher
Interrupt
Scheduler
None of these

... Answer is A)
Dipatcher

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

Job queue
Ready queue
Execution queue
Process queue

... Answer is B)
Ready queue

3. The interval from the time of submission of a process to the time of completion is termed as:

Walting time
Tumaround time
Response time
Throughput

... Answer is B)
Tumaround time

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

First-come first-served scheduling
Shortest job scheduling
Priority scheduling
None of these

... Answer is A)
First-come first-served scheduling

5. In priority scheduling algorithm:

CPU is allocated to the process with highest priority
CPU is allocated to the process with lowest priority
Equal priority processes cannot be scheduled
None of these

... Answer is A)
CPU is allocated to the process with highest priority

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

All process
Currently running process
Parent process
Init process

... Answer is B)
Currently running process

7. Time quantum is defined in:

Shortest job scheduling algorithm
Round robin scheduling algorithm
Priority scheduling algorithm
Multilevel queue scheduling algorithm

... Answer is B)
Round robin scheduling algorithm

8. In multilevel feedback scheduling algorithm;

A process can move to a different classified ready queue
Classification of ready queue is permanent
Processes are not classified into groups
None of the mentioned

... Answer is A)
A process can move to a different classified ready queue

9. Which one of the following cannot be scheduling by the kernel?

Kernel level thread
User level thread
Process
None of these

... Answer is B)
User level thread

10. 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:

8
10
9
7

... Answer is B)
10

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

LRU
LFU
FIFO
None of these

... Answer is C)
FIFO

12. Users are _____ that their processes are running on a paged system.

Aware
Unaware
Informed
None of these

... Answer is B)
Unaware

13. The aim of creating page replacement algorithms is to:

Replace pages faster
Increase the page fault rate
Decrease the page fault rate
To allocate multiple pages to processes

... Answer is C)
Decrease the page fault rate

14. A FIFO replacement algorithm associates with each page the ___.

Time it was brought into memory
Size of the page in memory
Page after and before it
All of these

... Answer is A)
Time it was brought into memory

15. Optimal page - replacement algorithm is:

Replace the page that has not been used for a long time
Replace the page that has been used for a long time
Replace the page that will not be used for a long time
None of these

... Answer is C)
Replace the page that will not be used for a long time

16. Optimal page - replacement algorithm is difficult to implement, becuase:

It requires a lot of information
It requires future knowledge of the reference string
It is too complex
It is extremely expensive

... Answer is B)
It requires future knowledge of the reference string

17. LRU page - replacement algorithm associates with each page the ______.

Time it was brought into memory
The time of that page & last use
Page after and before it
All of these

... Answer is B)
The time of that page & last use

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

10
15
11
12

... Answer is B)
15

19. CPU fetches the instruction from memory according to the value of:

Program counter
Status register
Instruction register
Program status word

... Answer is A)
Program counter

20. A memory buffer used to accomodate a spood differential is called:

Slack pointer
Cache
Accumulator
Disk buffer

... Answer is B)
Cache

21. Which one of the following is the address generated by CPU?

Physical address
Absolute address
Logical address
None of these

... Answer is C)
Logical Address

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

Memory management unit
CPU
PCI
None of these

... Answer is A)
Memory Management Unit

23. Memory management unit technique in which system stores and retrieves data from secondary storae for use in main memory is called:

Fragmentation
Paging
Mapping
None of these

... Answer is B)
Paging

24. The interrupt-reuqest line is a part of the:

Data line
Control line
Address line
None of these

... Answer is B)
Control Line

25. The return address from the interrupt-service routine is stored on the:

System heap
Processor register
Processor slack
Memory

... Answer is C)
Processor slack

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

Interrupt-acknowledge
Return signal
Service signal
Permission signal

... Answer is A)
Interrupt-acknowledge

27. A relational database consists of a collection of:

Tables
Fields
Records
Keys

... Answer is A)
Tables

28. A ___ in a table represents a relationship among a set of values.

Column
Key
Row
Entry

... Answer is A)
Column

29. The term ___ is used to refer to a row.

Attribute
Tuple
Fisid
Instance

... Answer is C)
Fisid

30. The term ____ is used to refer to a row.

Record
Coloumn
Tuple
Key

... Answer is B)
Column

Related Searches:-

ItMcqs, Mcqs, IT Past Papers, Computer Mcqs, Ppsc Past Papers, Mcq Questions With Answers, , Mcq Question And Answer, Mcq Exam, PPSC Test Preparation, PPSC Exam Preparation, Computer Science Syllabus, Lecturer Jobs PPSC, Test MCQS, PPSC Test. Computer Science Test, Computer Science PPSC past papers, PPSC lecturer computer science past papers pdf.