PPSC Lecturer of Computer Science Past Paper
PPSC Lecturer of Computer Science Past Paper
Contact Us
Privacy Policy
Site Map
About Us
HOME
PPSC
PAST PAPERS
JOBS
ISSB TEST
FPSC
FIA
ARMY
O LEVEL
Papers
PPSC GENERAL
c) both (a) and (b)
KNOWLEDGE
12. PPSC Assistant BS-16 in
Special Education Past 23. PPSC PAST Papers General
d) none of the mentioned
Knowledge Questions
Paper
13. PPSC Junior Clerk 2019
Answer:c
Past Papers
About World
14. FPSC Appraising / 4. In virtual circuit network each packet contains
papers
59. PPSC Written Test of Sub
b) when a system terminates
Through PPSC
61. DEPUTY DISTRICT d) none of the mentioned
65. INSPECTOR
a) local area network
COOPERATIVE
SOCIETIES PAST PAPER
b) virtual private network
INSPECTOR PAST
PAPERS SOLVED Answer:b
SOLVED
75. PPSC IB PAST PAPER- Answer:a
2(2012)
76. PPSC ASI PAST PAPER-
1(2012)
15. The processes that are residing in main memory and are ready and
77. PPSC ASI PAST PAPER-2
waiting to execute are kept on a list called
Past Paper
97. PPSC Lecturer of
Geography Past Paper
98. FPSC Custom Inspector 18. In priority scheduling algorithm
1. Counting Mathematics
Questions d) multilevel queue scheduling algorithm
3. Average Mathematics
Questions
4. Percentage Mathematics
Questions 21. Process are classified into different groups in
5. Word Problems
Mathematics Questions a) shortest job scheduling algorithm
6. Age Questions
b) round robin scheduling algorithm
Mathematics Questions
7. Train Problems
c) priority scheduling algorithm
Mathematics Questions
8. Mixture Problems d) multilevel queue scheduling algorithm
Mathematics Questions
9. Logarithm Mathematics Answer:d
Questions
10. Men and Food Problems
Mathematics Questions
22. In multilevel feedback scheduling algorithm
Mathematics Questions
15. Fractions and Decimals
Answer:a
Mathematics Questions
16. Numbers Mathematics
Questions
17. Basic Algebra Mathematics 23. Which one of the following can not be scheduled by the kernel?
Questions
18. Probability Mathematics a) kernel level thread
Questions
b) user level thread
c) process
Answer:b
a) 8
b) 10
c) 9
d) 7
Answer: c
Explanation: None.
a) LRU
b) LFU
c) FIFO
d) None of these
Answer: c
Explanation: None.
26) Users _______ that their processes are running on a paged system.
a) are aware
b) are unaware
c) None of these
Answer: b
Explanation: None.
Answer: c
Explanation: None.
d) All of these
Answer: a
Explanation: None.
a) Replace the page that has not been 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
Answer: c
Explanation: None.
c) it is too complex
d) it is extremely expensive
Answer: b
Explanation: None.
31) LRU page – replacement algorithm associates with each page the
______
d) All of these
Answer: b
Explanation: None.
7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1
i) How many page faults does the LRU page replacement algorithm
produce ?
a) 10
b) 15
c) 11
d) 12
Answer: d
Explanation: None.
a) 100-200
b) 200-400
c) 400-1000
d) above 1000
Answer:a
Explanation: Build & Fix Model is suitable for small projects &
programming exercises of 100 or 200 lines.
Answer:b
Explanation: None.
35. Which one of the following models is not suitable for accommodating
any change?
b) Prototyping Model
c) RAD Model
d) Waterfall Model
Answer:d
Explanation: Real projects rarely follow the sequential flow that the
Waterfall Model proposes.
a) Quick Design
b) Coding
c) Prototype Refinement
d) Engineer Product
Answer:b
a) 2 phases
b) 3 phase
c) 5 phases
d) 6 phases
Answer:c
d) Both a & c.
Answer:d
Answer:a
Explanation: None.
40. 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 b & c
Answer:c
Explanation: None.
a) Tables
b) Fields
c) Records
d) Keys
Answer:a
a) Column
b) Key
c) Row
d) Entry
Answer:c
a) Attribute
b) Tuple
c) Field
d) Instance
Answer:b
a) Record
b) Column
c) Tuple
d) Key
Answer:b
a) Domain
b) Relation
c) Set
d) Schema
Answer:a
46. Which forms has a relation that possesses data about an individual
entity:
a) 2NF
b) 3NF
c) 4NF
d) 5NF
Answer:c
Explanation: A Table is in 4NF if and only if, for every one of its non-
trivial multivalued dependencies X \twoheadrightarrow Y, X is a
superkey—that is, X is either a candidate key or a superset thereof.
a) 1NF
b) 2NF
c) 3NF
d) 4NF
Answer:c
c) Relational scheme
d) Functional dependencies
Answer:d
49. Which of the following has each related entity set has its own schema
and there is an additional schema for the relationship set.
d) Both a and b
Answer:a
d) Both a and b
Answer:b
51. What is the best way to represent the attributes in a large database?
a) Relational-and
b) Concatenation
c) Dot representation
Answer:b
a) Denormalization
b) Redundant optimization
c) Optimization
d) Realization
Answer:a
Answer: a
a) Lexical Analysis
b) Syntax Analysis
c) Semantic Analysis
d) Code Generation
Answer: b
a) Source Program
b) Object Program
Past Questions
About Islam