CSS NEXUS
All Lecturer past papers

Lecturer 2017PPSCSolved Paper

Lecturer 2017 Computer Science Paper

The official Lecturer tests 2017 Computer Science solved paper (ppsc). Every MCQ is typed out below with its correct answer marked.

Lecturer 2017 Computer Science paper — full text

Every MCQ from the paper, with the correct answer marked in green. Want to test yourself first? Attempt it as a timed quiz.

Operating systems and memory management (Q1–13)

  1. 1The FIFO page-replacement algorithm records for each page the:

    • A)Pages before and after it
    • B)Size of the page in memory
    • C)Time it was brought into memory
    • D)Number of times it was used

    Explanation: The oldest page is replaced first.

  2. 2The optimal page-replacement algorithm replaces the page that:

    • A)Has not been used for the longest time
    • B)Has been used for the longest time
    • C)Will not be used for the longest time
    • D)Was loaded most recently

    Explanation: Belady's optimal (OPT) algorithm.

  3. 3The optimal page-replacement algorithm is hard to implement because it:

    • A)Needs knowledge of future page references
    • B)Needs a lot of stored information
    • C)Is too complex to write in code
    • D)Needs very expensive special hardware

    Explanation: It is used as a benchmark.

  4. 4The LRU page-replacement algorithm records for each page the:

    • A)Time it was brought into memory
    • B)Number of times it was used
    • C)Pages before and after it
    • D)Time of its last use

    Explanation: Least Recently Used.

  5. 5With 3 frames and the reference string 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1, how many page faults does LRU produce?

    • A)10
    • B)12
    • C)11
    • D)15

    Explanation: The standard textbook example: LRU gives 12, FIFO 15 and OPT 9.

  6. 6The CPU fetches the next instruction from memory according to the:

    • A)Program status word
    • B)Status register
    • C)Instruction register
    • D)Program counter

    Explanation: The PC holds the next instruction's address.

  7. 7A memory buffer used to handle a speed difference is called a:

    • A)Stack pointer
    • B)Cache
    • C)Accumulator
    • D)Disk buffer

    Explanation: Cache sits between the fast CPU and slower main memory.

  8. 8The address generated by the CPU is called the:

    • A)Logical address
    • B)Absolute address
    • C)Physical address
    • D)Real address

    Explanation: Also called the virtual address.

  9. 9Run-time mapping from virtual to physical addresses is done by the:

    • A)Arithmetic logic unit
    • B)Memory management unit
    • C)PCI bus controller
    • D)Cache controller

    Explanation: The MMU.

  10. 10The memory-management scheme in which the system stores and retrieves data from secondary storage for use in main memory is:

    • A)Fragmentation
    • B)Mapping
    • C)Paging
    • D)Segmentation

    Explanation: Fixed-size pages are moved between disk and RAM.

  11. 11The interrupt-request line is part of the:

    • A)Data lines
    • B)Address lines
    • C)Control lines
    • D)Power lines

    Explanation: Control bus.

  12. 12The return address of an interrupt-service routine is stored on the:

    • A)System heap
    • B)Processor stack
    • C)Processor register
    • D)Disk

    Explanation: Pushed on the stack before the ISR runs.

  13. 13The signal sent by the processor to a device after receiving its interrupt is the:

    • A)Return signal
    • B)Interrupt acknowledge
    • C)Service signal
    • D)Permission signal

    Explanation: INTA.

Databases (Q14–25)

  1. 14A relational database consists of a collection of:

    • A)Keys
    • B)Fields
    • C)Records
    • D)Tables

    Explanation: Relations.

  2. 15A ______ in a table represents a relationship among a set of values.

    • A)Column
    • B)Key
    • C)Entry
    • D)Row

    Explanation: Each row (tuple) relates values.

  3. 16The term ______ is used for a row.

    • A)Attribute
    • B)Instance
    • C)Field
    • D)Tuple

    Explanation: Tuple.

  4. 17The term attribute refers to a ______ of a table.

    • A)Record
    • B)Tuple
    • C)Column
    • D)Key

    Explanation: Column.

  5. 18The set of permitted values for an attribute is called its:

    • A)Set
    • B)Relation
    • C)Domain
    • D)Schema

    Explanation: Domain.

  6. 19The main task of ______ is to move repeating groups into separate tables.

    • A)Fourth Normal Form
    • B)Second Normal Form
    • C)Third Normal Form
    • D)First Normal Form

    Explanation: 1NF requires atomic values.

  7. 20Which normal form is based on multivalued dependencies?

    • A)First
    • B)Second
    • C)Fourth
    • D)Third

    Explanation: 4NF.

  8. 21Each related entity set has its own schema and there is an extra schema for the relationship set in a:

    • A)One-to-one relationship set
    • B)Multivalued attribute
    • C)One-to-many relationship set
    • D)Many-to-many relationship set

    Explanation: The relationship gets its own table.

  9. 22A separate schema made of the attribute and the entity set's primary key is created for a:

    • A)Many-to-many relationship set
    • B)Weak entity
    • C)One-to-many relationship set
    • D)Multivalued attribute

    Explanation: E.g. a phone-numbers table.

  10. 23In 2NF:

    • A)No partial dependencies exist
    • B)No multivalued dependencies exist
    • C)No functional dependencies exist
    • D)No partial MVDs exist

    Explanation: Every non-key attribute depends on the whole key.

  11. 24______ can help us detect poor E-R design.

    • A)The database design process
    • B)The E-R design process
    • C)Functional dependencies
    • D)The relational schema

    Explanation: Normalisation theory exposes redundancy.

  12. 25Designers use ______ to tune a system's performance for time-critical operations.

    • A)Realisation
    • B)Redundant optimisation
    • C)Optimisation
    • D)Denormalisation

    Explanation: Adding controlled redundancy to avoid joins.

Software engineering (Q26–26)

  1. 26RAD stands for:

    • A)Relative Application Development
    • B)Rapid Application Document
    • C)Rapid Application Development
    • D)Rational Application Document

    Explanation: A fast, prototype-based process model.

Tags

  • #Lecturer 2017
  • #Lecturer Computer Science past papers
  • #Lecturer 2017 Computer Science paper
  • #Computer Science
  • #Lecturer PPSC
  • #Lecturer
  • #Computer Science lecturer past papers
  • #PPSC lecturer computer science 2017
  • #Lecturer computer science MCQs
  • #Computer science MCQs with answers
  • #Lecturer test preparation
  • #PPSC lecturer past papers
  • #Lecturer past papers
  • #Lecturer test 2026
  • #lecturerquestionpapers
  • #lecturerquestionpapers2017
  • #Lecturer Computer Science Question Paper 2017
  • #CSS Nexus