PPSC FPSC KPPSC BPSC SPSC Lecturer Computer Science Test 53

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.

Note:-

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 53
Test TypeMCQs
Total Questions25
Total Time20 Minutes
Total Marks100
0%

You have 20 minutes to pass to the quiz.

You have 20 minutes to pass to the quiz.


Lecturer Computer Science Online Test No. 53

1 / 25

In memory management : A- Fetch Policy BCleaning Policy C- Placement Policy: 1- It determines when a modified page should be written out to secondary memory. 2- It determines when a page should be bought into main memory. 3- It determines where in real memory a process piece is to be reside.

2 / 25

In real time computing:

3 / 25

A Absolute loading B Re-locatable loading C Dynamic Run-Time loading; 1. For loader, load module, either is an absolute main memory address or specific address reference. 2. For loader, load modules have no absolute address. 3. For loader, load modules have all memory reference in relative form.

4 / 25

In multi processor scheduling; A: Gang scheduling, B: Dynamic scheduling, C: Dedicated processor management.; 1- The number of threads in a process can be altered during the course of execution. 2- This provides implicit scheduling defined by the assignment of threads to processors, 3- It is applied to the simultaneous scheduling of threads that make up a single process.

5 / 25

In real time scheduling: A: Static table driven approach, B: Static priority driven preemptive approach, C: Dynamic planning based approach; 1- A static analysis of feasible scheduler of dispatching is done and implemented. 2- A static analysis of feasible schedules of dispatching is done and assigns priorities to tasks. 3- Feasibility is determined at run time.

6 / 25

In soft real time tasks:

7 / 25

Arrange the following I/O device in increasing data rate Hard disk, Floppy disk, Key board:

8 / 25

In Responsive real time operating system:

9 / 25

In memory management when demand cleaning policy is applied:

10 / 25

In thread scheduling, load sharing is referred to:

11 / 25

Main memory is referred as:

12 / 25

In virtual memory management, when local control policy is applied:

13 / 25

In two level scheme if each page is mapped by 4-byte (22) page table entry then to create a page table composed of 220 page table entry one requires:
(A) 222 bytes

(B) 212 bytes

(C) 216 bytes

(D) None of these.

14 / 25

Hard real-time tasks are:

15 / 25

The deterministic operating system:

16 / 25

The real time task:

17 / 25

Relative address in memory management is:

18 / 25

The principle of locality states:

19 / 25

Resident set of process is:

20 / 25

Match the following I/O devices : A- Keyboard, 1- Human readable, B- Disk and tape drives, 2- Communication, C- Modems, 3-Machine readable:

21 / 25

Memory that is located on the disk either Hard or floppy is referred as:

22 / 25

For Load-time dynamic linking:

23 / 25

In two level scheme for page table, if one assume byte-level addressing and 4-kbyte (212 pages) then the 4-Gbyte (232) virtual address space is composed of:
(A) 210 pages

(B) 220 pages

(C) 230 pages

(D) 240 pages

24 / 25

Physical address in memory management is:

25 / 25

When pre cleaning policy is applied inmemory management:

Your score is

The average score is 0%

0%

Leave a comment

Your email address will not be published.