Operating System (OS) Questions

 NEXT

This study material helps you to prepare for the Specialist Officer(IT) examination and for other bank examinations' computer sections.

QUESTIONS

1.In a time sharing OS when the time slot given to a process is completed, the process goes from the RUNNING state to the----.

READY state

2.Supervisor call ------

are privileged calls that are used to perform resource management functions, which are controlled by the OS

3.Mutual Exclusion is the problem occurs between

process that shares resources.

4.Dijkstra's banking algorithm in an OS solves the problem of----

deadlock

5.Pre-emptive scheduling is the strategy of temporarily suspending a running process----

before the CPU time slice expires.

6.In Round Robin CPU scheduling, as the time quantum increased, the average turn around time----

varies irregularly.

7.Dirty bit is used to show-----

the page that is modified after being loaded into cache memory.

8.Fence register is used for-----

memory protection

9.The first fit, best fit and the worst fit algorithm can be used for -----

contiguous allocation of memory.

10.In real time OS which of the following is the most suitable scheduling scheme?

                                                      1.Round Robin

                                                      2.First come first serve.

                                                      3.Preemptive

                                                      4.Random scheduling 

11.Fixed partitions are-----

very inefficient in memory utilization.

12.What is the storage capacity of a Hollerith card which is organized into nibbles?

240

13.Continuous line drawing are produced using----

plotters

14.Memory mapped  displays----

uses ordinary memory to store the display data in character form.

 15.Plotter accuracy is measured in terms of------

repeatability and resolution.

16.Two basic types of record access methods are-----

sequential and random.

 17.A serial card reader would be expected to be----

faster than parallel reader.

 18.Disk scheduling involves deciding

the order in which disk access request must be serviced.

  

19.Trojan-Horse programs are----

legitimate programs that allow unauthorized access.

20.Domain names are represented by Rows and Objects are represented by Columns.

21.In one time password

the password is different in each instance.

22.Worm was made up of ----

two programs.(Grappling hook program and Main program)

 Boot strap or vector is called grappling hook program 

23.Interrupts per second is-----

a good measure of the system I/O activity.

24.Link encryption is------

less secure than end-to-end encryption.

25.Wild-card specifiers

provides an easy way of finding groups of related files.

NEXT