PPSC FPSC KPPSC BPSC SPSC Lecturer Computer Science Test 52

Online Free Taleem is free online MCQ’s test related to Lecturer Computer Science. All the individuals who are going to appear in Lecturer Computer Science written test can attempt these tests in order to prepare for it in best possible way. Our tests of Lecturer of Computer Science include all the important questions and Past Paper of  Lecturer Computer Science, that have extremely high amount of chances for been included in the actual exam which make our test undoubtedly the best source of preparation.


There will be 25 multiple choice question in the test.
Answer of the questions will change randomly each time you start this test.
Practice this test at least 5 times if you want to secure High Marks.
At the End of the Test you can see your Test score and Rating.
If you found any incorrect answer in Quiz. Simply click on the quiz title and comment below on that MCQ. So that I can update the incorrect answer on time.

Please Click Below START  Button to Take this Computer Science Test Online.

Test Instructions:-
Test NameLecturer Computer Science 
SubjectComputer Science Test 52
Test TypeMCQs
Total Questions25
Total Time20 Minutes
Total Marks100

You have 20 minutes to pass to the quiz.

Lecturer Computer Science Online Test No. 52

1 / 25

I/O modules in computer:

2 / 25

The cluster is a case of:

3 / 25

The following:

4 / 25

In semaphore the process blocked by wait operation is unblocked if:

5 / 25

The wait operation:

6 / 25

The compaction is the technique in memory management that is used to over come:

7 / 25

In micro kernel architecture following is false:

8 / 25

A Semaphore is initialized to:

9 / 25

Operating System is:

10 / 25

The master/slave architecture is an example of:

11 / 25

Instruction processing consists of:

12 / 25

The resident set of process is:

13 / 25

The concept used to support multi programming environment on a computer is:

14 / 25

The frame:

15 / 25

Instruction register contains:

16 / 25

In the following processes: a = a + 1; b = 2 × b; b = b + 1; a = 2 × a;the output is.

17 / 25

The page table that is maintained by operating system:

18 / 25

In semaphore, the process executing the wait is blocked if:

19 / 25

Physical address (absolute address) in memory partitioning is:

20 / 25

In shared memory multi processor:

21 / 25

When operating system always run on a particular processor and that particular processor do all scheduling and process management then this is an example of:

22 / 25

In monolithic operating system:

23 / 25

The following is not true for master/slave architecture:

24 / 25

In semaphore when the order of processes that are waiting to be removed from the queue is first in first out (FIFO) then it is called:

25 / 25

The OS/2 is the operating system that support:

Your score is

The average score is 0%


Leave a Comment

Your email address will not be published. Required fields are marked *

error: Content is protected !!
Scroll to Top