past paper | - Part 17

Lecturer Computer Science Test 2 Online Preparation MCQs

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 Name	Lecturer Computer Science
Subject	Computer Science Test 2
Test Type	MCQs
Total Questions	25
Total Time	20 Minutes
Total Marks	100

You have 20 minutes to pass to the quiz.

Lecturer Computer Science Practice Test 2

1 / 25

Time during which a job is processed by the computer is:

Delay times

Execution time

Down time

Real time

2 / 25

Weak AI is:

the embodiment of human intellectual capabilities within a computer

a set of computer programs that produce output that would be considered to reflect intelligence if it were generated by humans

the study of mental faculties using mental models implemented on a computer.

All of the mentioned

3 / 25

The technology whereby part of the program is stored on disk and is brought into memory for execution as needed is called:

interrupts

prioritized memory

memory allocation

virtual storage

4 / 25

LRU page – replacement algorithm associates with each page the …………………………..

Time it was brought into memory

The time of that pages last use

All of these

Page after and before it

5 / 25

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

CPU

None of these

Memory management unit

PCI

6 / 25

The signal sent to the device from the processor to the device after receiving an interrupt is:

Service signal

Return signal

Permission signal

Interrupt acknowledge

7 / 25

Perforated paper used as input of output media is known as:

magnetic tape

punched papers tape

card punch

paper tapes

8 / 25

For each attribute of a relation, there is a set of permitted values, called the ________ of that attribute:

Set

Relation

Domain

Schema

9 / 25

The Interrupt request line is a part of the:

Control line

Data line

Address line

None of these

10 / 25

Programs designed to perform specific tasks is known as:

operating system

system software

utility programs

application software

11 / 25

If y ou will be displaying or printing y our document on another c omputer, y ou’ll want to make sure and select the _____________ option under the ‘Save’ tab.

Embed Fonts

Embed True Type Fonts

Save True Type Fonts

Save Fonts

12 / 25

Memory management techniques in which system stores and retrieves data from secondary storage for used in main memory is called:

None of these

Fragmentation

Mapping

Paging

13 / 25

Optimal page – replacement algorithm is:

Replace the page that will not be used for a long time.

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

None of these

Replace the page that has been used for a long time.

14 / 25

Optimal page – replacement algorithm is difficult to implement, because:

it is too complex

It requires future knowledge of the reference string

It is extremely expensive

It requires a lot of information.

15 / 25

Which one is a valid declaration of a boolean?

boolean b3 = false;

boolean b2 = ‘false’;

boolean b4 = ‘true’

boolean b1 = 1;

16 / 25

A ……………………..in a table represents a relationship among a set of values.

Key

Row

Entry

Column

17 / 25

A relational database consists of a collection of:

Fields

Records

Keys

Tables

18 / 25

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

Program status word

Instruction register

Program Counter

Status register

19 / 25

To locate a data item for storage is:

Database

Field

Feed

Fetch

20 / 25

The return address from the interrupt services routine is stored on the:

Memory

System heap

Processor slack

Processor register

21 / 25

A FIFO replacement algorithm associates with each page the ………………….

Page after and before it

Size of the page in memory

All of these

Time it was brought into memory

22 / 25

The aim of creating page replacement algorithm is to:

To allocate multiple page to process.

Decrease the page fault rate

Increase the page fault rate

Replace pages faster

23 / 25

A computer which CPU speed around 100 million instruction per second and with the word length of around 64 bits is known as:

Minicomputer

Macro computer

Super computer

Microcomputer

24 / 25

Which one of the following is the address generated by CPU?

Absolute address

None of these

Physical

Logical address

25 / 25

A memory buffer used to accommodate a spood differential is called:

Disk buffer

Cache

Slack pointer

Accumulator

Your score is

The average score is 43%

Lecturer Physics Practice Test No. 1

Lecturer Physics Practice Test No. 2

Lecturer Physics Practice Test No. 3

Lecturer Physics Practice Test No. 4

Lecturer Physics Practice Test No. 5

Lecturer Physics Practice Test No. 6

Lecturer Computer Science Test 2 Online Preparation MCQs Read More »