Teach Exam - Exam Start | This test is helpful for the Computer Science (PGT) Exam. It covers STET 2025, BPSC TRE 4.0, Army School (AWES) PGT, Kendriya Vidyalaya Sangathan (KVS), Navodaya Vidyalaya Samiti (NVS), HPSC PGT computer science and many other exams.

This test is helpful for the Computer Science (PGT) Exam. It covers STET 2025, BPSC TRE 4.0, Army School (AWES) PGT, Kendriya Vidyalaya Sangathan (KVS), Navodaya Vidyalaya Samiti (NVS), HPSC PGT computer science and many other exams.

Total Questions : 20

Timer : sec

Question : A central computer surrounded by one or more satellite computers is called a

Bus network

Ring network

Star network

All of the above

none of these

Question : Access control is achieved at the________________layer.

physical

presentation

session

data link

none of these

Question : The Network layer is responsible for ____________ delivery of a packet.

source to destination

end to end

point to point

error free

none of these

Question : The function of presentation layer is to __________________

Encrypt data

Validate and establish connection

close the session

flow control

none of these

Question : CPU scheduling :

It is the basis of multi-programming operating system.

By switching the CPU among processes,the operating system can make the computer more productive

CPU scheduling depends on CPU execution and I/O wait

all of the above

none of these

Question : The......... of two sets A and B is the set of all those pairs whose first coordinate is an element of A and the second coordinate is an element of B. The set is denoted by AxB.

Graph

Cartesian product

Product

Super set

none of these

Question : The values for an attribute or a column are drawn from a set of values known as a :

Tuples

Attributes

Domain

All of these

None of these

Question : Which one is true for FCFS scheduling :

It is simplest CPU scheduling

Average waiting time under the FCFS policy, however is often quite long

FCFS scheduling algorithm is non-preemptive

All of above

None of these

Question : Round Robin scheduling algorithm falls under the category of-

Preemptive scheduling

Non-preemptive scheduling

Sometime preemptive sometimes non-preemptive

All of the above

None of these

Question : Which of the following is not a Routing Algorithm?

Broadcast

Link state

Traffic shaping

Distance vector

None of these

Question : Error detection at data link layer is achieved by

Bit stuffing

Humming Codes

Cyclic redundancy codes

Equalization

None of these

Question : Banker's algorithm for resource allocation deals with

Dead lock prevention

Dead lock avoidance

Mutual exclusion

Dead lock recovery

None of these

Question : ACID properties of transaction is

Atomocity

Consistency

Isolation

All of the above

None of these

Question : A compiler which runs on one machine and generates a code for another machine-

Bootstrap

Cross-compiler

Lexical analyzer

All of the above

None of these

Question : Primary key

Denote a candidate key that is chosen by the database designer as the principal means of identifying entities within an entity set

Attributes names of all primary key are unique

Primary key specification is optional and good idea to specify primary key for each relation

All of the above

None of these

Question : The relational database environment has all of the following components except

users

Separate file

Database

Database administrator

none of these

Question : The process of converting analog signals into digital signals so they can be processed by a receiving computer is referred to as:

modulation

demodulation

synchronizing

digitizing

None of these

Question : Thrashing

Always occur on large computers

Is a natural consequence of virtual memory systems

Can always be avoided by swapping

Can be caused by poor paging algorithm

None of these

Question : When the result of a computation depends on the sequence or timing the processes involved there is said to be :

Cycle stealing

Race condition

A time lock

A deadlock

None of these

Question : Graphs can be implemented using : (a) Arrays (b) Linked list (c) Stack (d) Queue

a and d

a and b

none of these

BPSC TRE Computer science Test-1