Scribd
Upload
83 views4 pages

Bank IT Officer Quizzes: Operating System Question Answer

This document contains 37 multiple choice questions about computer memory, operating systems, and scheduling policies. It covers topics such as RAM, ROM, virtual memory, paging, deadlocks, processes, states, and scheduling algorithms. Sample questions include defining RAM, identifying examples of real-time systems, explaining what critical regions are, and stating what dirty bits are used for.

Uploaded by

Sameer Sahu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
83 views4 pages

Bank IT Officer Quizzes: Operating System Question Answer

This document contains 37 multiple choice questions about computer memory, operating systems, and scheduling policies. It covers topics such as RAM, ROM, virtual memory, paging, deadlocks, processes, states, and scheduling algorithms. Sample questions include defining RAM, identifying examples of real-time systems, explaining what critical regions are, and stating what dirty bits are used for.

Uploaded by

Sameer Sahu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Bank IT officer Quizzes

1. Which is C omputer Memory that does not forget ?


Ans: ROM

2. The computer memory holds data and ?


Ans: program

3. What is means by term RAM ?


Ans: Memory which can be both read and written to

4. Which computer memory is esentially empty ?


Ans: RAM

5. The bubbles in a bubble memory pack are created with the help of ?
Ans: magnetic field

6. Virtual memory is Ans: an illusion of an extremely large memory

7. Special locality refers to the problem that once a location is referenced


Ans: a nearby location will be referenced soon

8. An example of a SPOOLED device


Ans: A line printer used to print the output of a number of jobs

9. Page faults occurs when


Ans: one tries to divide a number by 0

10. Overlay is
Ans: a single contiguous memory that was used in the olden days for running large programs by
swapping

Operating System Question Answer

11. C oncurrent processes are processes that Ans: Overlap in time

12. The page replacement policy that sometimes leads to more page faults when the size of the
memory is increased is Ans: FIFO

13. The only state transition tha t is initiated by the user process itself is Ans: Block

14. Fragmentation is Ans: fragments of memory words unused in a page

15. Give Example of real time systems


Ans: Aircraft control system, A process control system

PSU Papers for Computer Science

16. Dijkstras banking algorithm in an operating system solves the problem of Ans: Deadlock Avoidance

17. In a paged memory system, if the page size is increased, then the internal fragmentation
generally Ans: Becomes more

18. An operating system contains 3 user processes each requiring 2 units of resources R. The
minimum number of units of R such that no deadlock will ever occur is Ans: 4

19. C ritical region is Ans: A set of instructions tha t access common shared resources which exclude one another in
time

20. Kernel is Ans: The set of primitive functions upon which the rest of operating system func tions are built
up

21. Necessary conditions for deadlock are Ans: Non-preemption and circular wait, Mutual exclusion and partial allocation

22. In a time sharing operating system, when the time slot given to a process is completed, the
process goes from the RUNNING state to the Ans: READY state

23. Supervisor call Ans: Are privileged calls that are used to perform resource management functions, which are
controlled by the operating system

24. Semaphores are used to solve the problem of Ans: Mutual exclusion, Process synchronization

25. If the property of locality of reference is well pronounced in a programAns: The number of page faults will be less

Operating System Question Answer for Competitive Exams

26. Pre-emptive scheduling, is the strategy of temporarily suspending a running processAns: before the CPU time slice expires

27. Mutual exclusion problem occurs Ans: among processes that share resources

27. Sector interleaving in disks is done by Ans: the operating system

28. Disk scheduling involves decidingAns: the order in which disk access requests must be serviced

29. Dirty bit is used to show the Ans: page that is modified after being loaded into cache memory

30. Fence register is used forAns: memory protection.

31. The first-fit, best-fit and worst-fit algorithm can be used forAns: contiguous allocation of memory

32. Give example of single-user operating systemsAns: MS-DOS, XENIX

33. In Round Robin C PU Scheduling, as the time quantum is increased, the average turn around
timeAns: varies irregulary

34. In a multiprogramming environmentAns: more than one process resides in the memory

35. The size of the virtual memory depends on the size of the Ans: Address Bus

36. Give example of Scheduling Policies in which context switching never take placeAns: Shortest Job First, First-cum-f irst-served

37. Suppose that a process is in BLOC KED state waiting for some I/O service. When the service
is completed, it goes to theAns: READY State

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy