PPSC Lecturer Computer Science Past Papers MCQs | PPSC Past Papers Solved MCQ’s

Print/Downlaod pdf

PPSC recently announced many lecturer computer science posts 2022. From this platform you will get all the PPSC lecturer computer science past papers mcqs which are solved as well. We are providing best preparation of PPSC Lecturer Computer Science for the aspirant of PPSC and Live couching from our experienced staff. To Learn or Read some past papers of PPSC Lecturer Computer Science is not a big deal but to learn and under stand the major concepts of the core subjects is a big deal which will leads you to success. Moreover to learn some mcqs or some PPSC Lecturer Computer Science Past Papers instead of understanding the Topic or subject is disastrous. If you learn or under stand the topic from a good teacher then you will able to attempt any conceptual as well as technical mcq in your exam and on the other side if you learn only some mcq’s of a topic then you will ultimately not be able to solve any new mcq given in the paper.

PPSC Lecturer Computer Science Past Paper 1PPSC Lecturer Computer Science Past Paper 2
PPSC Lecturer Computer Science Past Paper 3PPSC Lecturer Computer Science Past Paper 4
PPSC Lecturer Computer Science Past Paper 5PPSC Lecturer Computer Science Past Paper 6
PPSC Lecturer Computer Science Past Paper 7PPSC Lecturer Computer Science Past Paper 8
PPSC Lecturer Computer Science Past Paper 9PPSC Lecturer Computer Science Past Paper 10
PPSC Lecturer Computer Science Past Papers MCQs | PPSC Past Papers Solved MCQ’s

               Punjab public service commission

                   Lecturer Computer Science

                                     Mcqs

1.which module give control of the CPU to the process selected by the short term scheduler?

  1. Dispatcher
  2. Interrupt
  3. Scheduler
  4. None of these

2.The process that are residing  in the main memory for execution are kept on a list?

  1. Job queue
  2. Ready queue
  3. Execution queue
  4. Process queue

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

  1. Waiting time
  2. Turnaround time
  3. Response time
  4. Through put time

4.Which scheduling algorithem allocates the CPU first to the process that request the CPU first:

  1. First comes first serves schedulling
  2. Shortest job scheduling
  3. Priority scheduling
  4. None of these

5.In pariority scheduling algorithem:

  1. CPU is allocatedto the process with highest priority
  2. CPU is allocated to the process with the lowest priority
  3. Equal priority processes cannot be scheduled
  4. None of these

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

  1. All process
  2. Currently running
  3. Parent process
  4. Init process

7.time quantum is defined in:

  1. Shortest job scheduling algorithem
  2. Round robin scheduling algorithem
  3. Priority scheduling algorithem
  4. Multilevel queue scheduling algorithem

8.In multilevel feedback scheduling algorithem;

  1. A process can move  to the different classified  ready queue
  2. Classification of ready queue is permanent
  3. Processes are not classified into groups
  4. None of the mentioned

9.which one is not scheduled by the kernel?

  1. kernel level thread
  2. user level thread
  3. process
  4. none of these

10.A process refers to 5 pages A,B,C,D,E in the orders:A,B,C,D,A,B,E,A,B,C,D,E.if the page replacement algorithem in FIFO,the number of page transfer with an empty internel store of 3 frames is:

  1. 8
  2. 10
  3. 9
  4. 7

11.Amemory page containing a heavily used veriable that was initialized  very early and is in constant

Use is remove and then the page replacement algorithm used is:

  1. LRU
  2. LFU
  3. FIFO
  4. None of these

12.Users are ………..that their process are running on a paged system.

  1. Aware
  2. Unaware
  3. Informed
  4. None of these

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

  1. Replace pages faster
  2. Increase the page fault rate
  3. Decrease the page fault rate
  4. To allocate multiple pages to processes

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

15. Optimal page – replacement algorithms is difficult to implement, because:

(a) Replace the page that has been not used for a long time

(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

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

17. LRU page – replacement algorithm associates with each page the____:

(a) Time it was brought into memory

(b) Time of that page last use

(c) Page after and before it

(d) All of these

18. The cost price of 20 articles is the same as the selling price of x articles. If the profit is 25%, then the value of x is:

(a) 15

(b) 16

(c) 18

(d) 25

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

(a) Program counter

(b) Status register

(c) Instruction register

(d) Program status word

20. A memory buffer used to accommodate a speed differential is called:

(a) Slack pointer

(b) Cache

(c) Accumulator

(d) Disk buffer

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

(a) Physical address

(b) Absolute address

(c) Logical address

(d) None of these

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

(a) Memory management unit

(b) CPU

(c) PCI

(d) None of these

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

24. The Interrupt-request time is a part of the:

(a) Data line

(b) Control Line

(c) Address line

(d) None of these

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

(a) System Heap

(b) Processor register

(c) Processor slack

(d) Memory

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

27. A relational database consists of a collection of:

(a) Tables

(b) Fields

(c) Records

(d) Keys

28. A ____in a table represents a relationship among a set of values:

(a) Column

(b) Key

(c) Row

(d) Entry

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

(a) Attribute

(b) Tuple

(c) Field

(d) Instance

30. The term attribute refers to a____ of a table:

(a) Record

(b) Column

(c) Tuple

(d) Key

31. For each attribute of a relation, there is a set of permitted values, called the ____of hat attribute:

(a) Domain

(b) Relation

(c) Set

(d) Schema

32. Which of the following is a tuple-generating dependency:

(a) Functional dependency

(b) Equality-generating dependencies

(c) Multi-valued dependencies

(d) Non-functional dependency

33. The main task carried out in the____ is to remove repeating attributes to separate tables:

(a) First Normal Form

(b) Second Normal Form

(c) Third Normal Form

(d) Fourth Normal form

34. Which of the normal form is based on multi-valued-dependencies:

(a) First

(b) Second

(c) Third

(d) Fourth

35. Which form has a relation that possesses data about an individual entity:

(a) 2NF

(b) 3NF

(c) 4NF

(d) 5NF

36. Which of the wing has each related entity set has its own schema and there is an additional Schema for the relationship set:

(a) VA many-to-many relationship set

(b) A multi-valued attribute of an entity set

(c) A one-to-many relationship set

(d) Both A and B

37. In which of the following, a separate schema is created consisting of that attribute and the primary key of the entity set:

(a) A many-to-many relationship set

(b) A multi-valued attribute of an entity set

(c) A one-to-many relationship set

(d) Both (a) and (b)

38. In 2NF:

(a) No functional dependencies (FDs) exist

(b) No multi-valued dependencies (MVDs) exist

(c) No partial FDs exist

(d) No partial MVDs exist

39. ____can help us detect poor E-R design:

(a) Database Design Process

(b) E-R Design Process

(c) Relational scheme

(d) Functional dependencies

40. Build & Fix Model is suitable for programming exercises of____ LOC (Line of Code):

(a) 100-200

(b) 200-400

(c) 400-1000

(d) Above 1000

41. What is the best way to represent the attributes in a large database:

(a) Relational-and

(b) Concatenation

(c) Dot representation AD

(d) All of these

42. Designers use which of the following to tune performance of systems to support time critical operations:

(a) Demoralization

(b) Redundant optimization

(c) Optimization

(d) Realization

43. RAD stands for:

(a) Relative Application Development

(b) Rapid Application Development

(c) Rapid Application Document

(d) Rational Application Document

44. Which one of the following models is not suitable for accommodating any change:

(a) Build & Fix Model

(b) Prototyping Model

(c) RAD Model

(d) Waterfall Model

45. With one of the following is not a phase of Prototyping Model:

(a) Quick Design

(b) Coding

(C) Prototype Refinement

(d) Engineer Product

46. RAD Model has:

(a) 2 phases

(b) 3 phases

(c) 5 phases

(d) 6 phases

47. What is the major drawback of using RAD Model:

(a) Highly specialized and skilled developers / designers are required

(b) Increases re-usability of components

(c) Encourages customer/client feedback

(d) Both (a) and (c)

48. SDLC stands for:

(a) Software Development Life Cycle

(b) System Development Life Cycle

(c) Software Design Life Cycle

(d) System Design Life Cycle

49. Which model can be selected if user is involved in all the phases of SDLC:

(a) Waterfall Model

(b) Prototyping Model

(c) RAD Model

(d) Both (a) and (c)

50. Two devices are in network if:

(a) A process in one device is able to exchange information with a process in another device

(b) A process is running on both devices

(c) PIDs of the processes running of different devices are same

(d) None of these

Lecturer Computer Science Mcqs with Answers pdf Quizes for PPSC

Why PPSC Lecturer Computer Science Papers are Important ?

Moreover the Crux is you will get the idea that How the Questions are previously being asked by the Examiner and how to come over your week points .

Similarly the Examiner will play with your minds by asking some the most basic / simple questions form you people and by asking some most technical / conceptual questions from you people.

PPSC Lecturer Computer Science Past Papers are important because these PPSC lecturer Computer Science Past Papers provides you an idea about how Examiner ask a question . These Lecturer Computer Science Past Papers gives you the idea about the intensity of question that in which format and type the Examiner will ask question from aspirants.

So How to Win ?

The Simple and the most important thing to do is to build your concepts . You should have a proper knowledge about the concepts of topics from all of your core subjects Moreover when you people finish with your knowledge and concepts what you have to do is to test yourselves by attempting tests / quizzes of