001.

In FIFO page replacement algorithm, when a page must be replaced A

A oldest page is chosen B newest page is chosen
C random page is chosen D not in use
002. Which algorithm chooses the page that has not been used for the longest period of C
time whenever the page required to be replaced?
A first in first out algorithm B additional reference bit algorithm
C least recently used algorithm D counting based page replacement
algorithm
003. Effective access time is directly proportional to A
A page-fault rate B hit ratio
C memory access time D page replacement
004. Because of virtual memory, the memory can be shared among A
A Processes B thread
C instructions D users
005. is the concept in which a process is copied into the main memory from the B
secondary memory according to the requirement.
A Paging B Demand paging
C Segmentation D Swapping
006. Swap space exists in B
A primary memory B secondary memory
C Cpu D ROM
007. When a program tries to access a page that is mapped in address space but not C
loaded in physical memory, then
A segmentation fault occurs B fatal error occurs
C page fault occurs D no error occurs
008. Virtual memory is normally implemented by A
A demand paging B buses
C virtualization D compaction
009. The valid - invalid bit, in this case, when valid indicates? C
A the page is not legal B the page is illegal
C the page is in memory D the page is not in memory
010. In virtual memory the programmer of overlays. B
A has to take care B does not have to take care
C all of the mentioned D none of the mentioned
011. A process is thrashing if A
A it is spending more time paging than B it is spending less time paging than
executing executing
C page fault occurs D swapping can not take place
012. Working set model for page replacement is based on the assumption of B
A modularity B locality
C globalization D random access
013. Virtual memory allows A
A execution of a process that may not B a program to be smaller than the
be completely in memory physical memory
C a program to be larger than the D execution of a process without being
secondary storage in physical memory
014. The instruction being executed, must be in A
A physical memory B logical memory
C physical & logical memory D network
015. If no frames are free, page transfer(s) is/are required. B
A one B two
C three D four
016. When a page is selected for replacement, and its modify bit is set D
A the page is clean B the page has been modified since it
 was read in from the disk
C the page is dirty D the page has been modified since it
was read in from the disk & page is dirty

017. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, c

E. If the page replacement algorithm is FIFO, the number of page transfers with an
empty internal store of 3 frames is?
A 8 B 10
C 9 D 7
018. A page fault occurs when? B
A a page gives inconsistent data B a page cannot be accessed due to its
absence from memory
C a page is invisible D a page is deleted
019. When a page fault occurs, the state of the interrupted process is c
A disrupted B invalid
C saved D deleted
020. When the page fault rate is low c
A the turnaround time increases B the effective access time increases
C the effective access time decreases D turnaround time & effective access
time increases
021. Locality of reference implies that the page reference being made by a process B
A will always be to the page used in the B is likely to be one of the pages used
previous page reference in the last few page references
C will always be one of the pages D will always lead to page faults
existing in memory
022. The circular wait condition can be prevented by A
A defining a linear ordering of resource B using thread
types
C using pipes D using multiple processors
023. Which one of the following is the deadlock avoidance algorithm? A
A bankers algorithm B round-robin algorithm
C elevator algorithm D karns algorithm
024. What is a reusable resource? A
A that can be used by one process at a B that can be used by more than one
time and is not depleted by that use process at a time
C that can be shared between various D that can be shared between various
threads users
025. The aim of creating page replacement algorithms is to c
A replace pages faster B increase the page fault rate
C decrease the page fault rate D to allocate multiple pages to
processes
026. Optimal page replacement algorithm is difficult to implement, because B
A it requires a lot of information B it requires future knowledge of the
reference string
C it is too complex D it is extremely expensive
027. What are the two methods of the LRU page replacement policy that can be c
implemented in hardware?
A Counters B RAM & Registers
C Stack & Counters D Registers
028. The essential content(s) in each entry of a page table is/are B
A Virtual page number B Page frame number
C Both virtual page number and page D Access right information
frame number
029. For non sharable resources like a printer, mutual exclusion A
A must exist B must not exist
C may exist D depends on case
030. To ensure no preemption, if a process is holding some resources and requests another D
resource that cannot be immediately allocated to it
A then the process waits for the B the process keeps sending requests
resources be allocated to it until the resource is allocated to it
C the process resumes execution D then all resources currently being
without the resource being allocated held are preempted
to it
031. Deadlock prevention is a set of methods A
A to ensure that at least one of the B to ensure that all of the necessary
necessary conditions cannot hold conditions do not hold
C to decide if the requested resources D to recover from a deadlock
for a process have to be given or not
032. A problem encountered in multitasking when a process is perpetually denied necessary B
resources is called
A deadlock B starvation
C inversion D aging
033. To avoid deadlock A
A there must be a fixed number of B resource allocation must be done only
resources to allocate once
C all deadlocked processes must be D inversion technique can be used
aborted
034. The number of resources requested by a process c
A must always be less than the total B must always be equal to the total
number of resources available in the number of resources available in the
system system
C must not exceed the total number of D must exceed the total number of
resources available in the system resources available in the system
035. The request and release of resources are c
A command line statements B interrupts
C system calls D special programs
036. All unsafe states are B
A deadlocks B not deadlocks
C fatal D some are deadlocks
037. A system has 12 magnetic tape drives and 3 processes : PO, P1, and P2. Process PO
D
requires 1O tape drives, P1 requires 4 and P2 requires 9 tape drives. ProcessPOP1P2
Maximum needs (process-wise: PO through P2 top to bottom)1O49Currently allocated
(process-wise) 5 2 2 Which of the following sequence is a safe sequence?
A PO, P1, P2 B P1, P2, PO
C P2, PO, P1 D P1, PO, P2
038. A system is in a safe state only if there exists a c
A safe allocation B safe resource
C safe sequence D safe process
039. Each request requires that the system consider the to decide whether A
the current request can be satisfied or must wait to avoid a future possible deadlock.
A resources currently available B processes that have previously been
in the system
C resources currently allocated to each D future requests and releases of each
process process
040. Given a priori information about the number of resources of each type that c
maybe requested for each process, it is possible to construct an algorithm that ensures
that the system will never enter a deadlock state.
 A minimum B average
C maximum D approximate
041. A deadlock avoidance algorithm dynamically examines the to ensure that A
a circular wait condition can never exist.
A resource allocation state B system storage state
C operating system D resources
042. is a unique tag, usually a number identifies the file within the file system. A
A File identifier B File name
C File type D size of the file
043. Which file is a sequence of bytes organized into blocks understandable by the systems A
linker?
A object file B source file
C executable file D text file
044. A computer system has 6 tape drives, with n processes competing for them. Each A
process may need 3 tape drives. The maximum value of n for which the system is
guaranteed to be deadlock free is?
A 2 B 3
C 4 D 1
045. The content of the matrix Need is c
A Allocation - Available B Max - Available
C Max - Allocation D Allocation - Max
046. An edge from process Pi to Pj in a wait for graph indicates that c
A Pi is waiting for Pj to release a B Pj is waiting for Pi to release a
resource that Pi needs resource that Pj needs
C Pi is waiting for Pj to leave the system D Pj is waiting for Pi to leave the system
047. If the wait for graph contains a cycle B
A then a deadlock does not exist B then a deadlock exists
C then the system is in a safe state D either deadlock exists or system is in
a safe state
048. When will file system fragmentation occur? A
A unused space or single file are not B used space is not contiguous
contiguous
C unused space is non-contiguous D multiple files are non-contiguous
049. The data structure used for file directory is called B
A mount table B hash table
C file table D process table
050. Which one of the following explains the sequential file access method? B
A random access according to the given B read bytes one at a time, in order
byte number
C read/write sequentially by record D read/write randomly by record
051. What is the mounting of file system? c
A crating of a file system B deleting a file system
C attaching portion of the file system D removing the portion of the file
into a directory structure system into a directory structure
052. Mapping of file is managed by A
A file metadata B page table
C virtual memory D file system
053. Mapping of network file system protocol to local file system is done by A
A network file system B local file system
C volume manager D remote mirror
054. The time taken to move the disk arm to the desired cylinder is called the c

A positioning time B random access time

C seek time D rotational latency
055. The time taken for the desired sector to rotate to the disk head is called D
A positioning time B random access time
C seek time D rotational latency
056. The set of tracks that are at one arm position make up a D
A magnetic disks B electrical disks
C assemblies D cylinders
057. In which type of allocation method each file occupy a set of contiguous block on the A
disk?
A contiguous allocation B dynamic-storage allocation
C linked allocation D indexed allocation
058. Which of the following are the two parts of the file name? C
A name & identifier B identifier & type
C extension & name D type & extension
059. In information is recorded magnetically on platters. A
A magnetic disks B electrical disks
C assemblies D cylinders
060. In the algorithm, the disk arm starts at one end of the disk and moves toward B
the other end, servicing requests till the other end of the disk. At the other end, the
direction is reversed and servicing continues.
A LOOK B SCAN
C C-SCAN D C-LOOK
061. The process of dividing a disk into sectors that the disk controller can read and write, C
before a disk can store data is known as
A partitioning B swap space creation
C low-level formatting D none of the mentioned
062. SSTF algorithm, like SJF of some requests. A
A may cause starvation B will cause starvation
C does not cause starvation D causes aging
063. controller sends the command placed into it, via messages to the C
controller
A host, host B disk, disk
C host, disk D disk, host
064. Consider a disk queue with requests for I/O to blocks on cylinders. 98 183 37 122 14 D
124 65 67 Considering FCFS (first cum first served) scheduling, the total number of
head movements is, if the disk head is initially at 53 is?
A 600 B 620
C 630 D 640
065. Random access in magnetic tapes is compared to magnetic disks. D
A fast B very fast
C slow D very slow
066. RAID level 5 is also known as C
A bit-interleaved parity organization B block-interleaved parity organization
C block-interleaved distributed parity D memory-style ECC organization
067. RAID level spreads parity and data among all N+1 disks rather than storing data C
in N disks and parity in 1.
A 3 B 4
C 5 D 6
068. In RAID level 4, one block read, accesses A
A only one disk B all disks simultaneously
C all disks sequentially D only two disks
069. The header and trailer of a sector contain information used by the disk controller such B
as and
A main section & disk identifier B error correcting codes (ECC) & sector
number
 C sector number & main section D disk identifier & sector number
070. The two steps the operating system takes to use a disk to hold its files are A
and
A partitioning & logical formatting B swap space creation & caching
C caching & logical formatting D logical formatting & swap space
creation
071. RAID level is also known as block interleaved parity organisation and uses block D
level striping and keeps a parity block on a separate disk.
A 1 B 2
C 3 D 4
072. Which principle states that programs, users and even the systems be given just B
enough privileges to perform their task?
A principle of operating system B principle of least privilege
C principle of process scheduling D principle of application software
073. is an approach to restricting system access to authorized users. A
A Role-based access control B Process-based access control
C Job-based access control D platform-based access control
074. RAID level is also known as bit interleaved parity organisation. D
A 0 B 1
C 2 D 3
075. If a disk fails in RAID level rebuilding lost data is easiest. A
A 1 B 2
C 3 D 4
076. RAID stands for D
A Redundant Allocation of Inexpensive B Redundant Array of Important Disks
Disks
C Redundant Allocation of Independent D Redundant Array of Independent
Disks Disks
077. The technique of duplicating every disk is known as A
A mirroring B shadowing
C redundancy D striping
078. Global table implementation of the matrix table contains D
A domain B object
C right-set D domain, object and right-set
079. In domain structure what is Access-right equal to? A
A Access-right = object-name, rights-set B Access-right = read-name, write-set
C Access-right = read-name, execute- D Access-right = object-name, execute-
set set
080. Access matrix model for user authentication contains A
A a list of objects, a list of domains and B a list of objects only
a function which returns an objects
type
C a list of domains only D aa function which returns an objects
type only
081. For system protection, a process should access B
A all the resources B only those resources for which it has
authorization
C few resources but authorization is not D only hardware
required
082. The protection domain of a process contains c
A object name B rights-set
C both object name and rights-set D none of the mentioned
083. If the set of resources available to the process is fixed throughout the processs lifetime A
then its domain is
 A static B dynamic
C neither static nor dynamic D either static or dynamic
084. Which of the following is a good practice? c
A Give full permission for remote B Grant read only permission
transferring
C Grant limited permission to specified D Give both read and write permission
account but not execute
085. What is not a good practice for user administration? D
A Isolating a system after a compromise B Perform random auditing procedures
C Granting privileges on a per host D Using telnet and FTP for remote
basis access
086. From the following, which is not a common file permission? c
A Write B Execute
C Stop D Read
087. What does the access matrix represent? A
A Rows-Domains, Columns-Objects B Rows-Objects, Columns-Domains
C Rows-Access List, Columns-Domains D Rows-Domains, Columns-Access list
088. Who can add new rights and remove some rights? D
A copy B transfer
C limited copy D owner
089. What are the common security threats? B
A File Shredding B File sharing and permission
C File corrupting D File integrity
090. What forces the user to change password at first login? D
A Default behavior of OS B Part of AES encryption practice
C Devices being accessed forces the D Account administrator
user
091. What is not a best practice for password policy? D
A Deciding maximum age of password B Restriction on password reuse and
history
C Password encryption D Having change password every 2
years
092. What does Light Directory Access Protocol (LDAP) doesnt store? B
A Users B Address
C Passwords D Security Keys
093. Which of the following is the least secure method of authentication? D
A Key card B fingerprint
C retina pattern D Password
094. Which of the following is a strong password? c
A 19thAugust88 B Delhi88
C P@asswOrd D laugustdelhi
095. Why is one time password safe? c
A It is easy to generated B It cannot be shared
C It is different for every access D It is a complex encrypted password
096. What is trap door? B
A It is trap door in War Games B It is a hole in software left by designer
C It is a Trojan horse D It is a virus which traps and locks user
terminal
097. What is the preferred way of encryption? c
A pre shared secret key B using key distribution center (KDC)
C public key-encryption D symmetric key
098. What is Trojan horse? c
A It is a useful way to encrypt password B It is a user which steals valuable
information
 C It is a rogue program which tricks D Its a brute force attack algorithm
users
099. What is the breach of integrity? B
A This type of violation involves B This violation involves unauthorized
unauthorized reading of data modification of data
C This violation involves unauthorized D This violation involves unauthorized
destruction of data use of resources
100. What is breach of confidentiality? A
A This type of violation involves B This violation involves unauthorized
unauthorized reading of data modification of data
C This violation involves unauthorized D This violation involves unauthorized
destruction of data use of resources
101. What is theft of service? D
A This type of violation involves B This violation involves unauthorized
unauthorized reading of data modification of data
C This violation involves unauthorized D This violation involves unauthorized
destruction of data use of resources
102. MD5 produces bits hash data. A
A 128 B 150
C 160 D 112
103. Which two of the following are authentication algorithms? A
A MAC B AES
C DAS D Digital-signature
104. Which of the following is not a stream cipher? D
A Two fish B RC5
C RC4 D TBONE
105. What is not a role of encryption? D
A It is used to protect data from B It is used to ensure user
unauthorized access during authentication
transmission
C It is used to ensure data integrity D It is used to ensure data corruption
doesnt happens
106. What is cipher-block chaining? c
A Data is logically ANDed with previous B Data is logically ORed with previous
block block
C Data is logically XORed with previous D Data is logically XORed and ANDed
block with previous block
107. What is not an encryption standard? B
A AES B TES
C Triple DES D DES
108. A firewall protects which of the following attacks? c
A Phishing B Dumpster diving
C Denial of Service (DoS) D Shoulder surfing
109. Packet filtering firewalls are deployed on A
A routers B switches
C hubs D repeaters
110. Firewall examines each that are entering or leaving the internal D
network.
A emails users B updates
C connections D data packets
111. Firewalls can be of kinds. c
A 1 B 2
112. C 3 D 4 en the device and the A
is the kind of firewall is connected betwe
 network connecting to internet.
A Hardware Firewall B Software Firewall
C Stateful Inspection Firewall D Microsoft Firewall
113. Which of the following is not a software firewall? D
A Windows Firewall B Outpost Firewall Pro
C Endian Firewall D Linksys Firewall
114. is one of the most secured Linux OS that provides anonymity and an B
incognito option for securing its user data.
A Fedora B Tails
C Ubuntu D OpenSUSE
115. Which of the following OS does not comes under a secured Linux OS list? D
A Qubes OS B Tails
C Tin Hat D Ubuntu
116. One advantage of Packet Filtering firewall is c
A more efficient B less complex
C less costly D very fast
117. In the layer of OSI model, packet filtering firewalls are implemented. D
A Application layer B Session layer
C Presentation layer D Network layer
118. The defines the packet filtering firewall rules. A
A Access Control List B Protocols
C Policies D Ports
119. ACL stands for D
A Access Condition List B Anti-Control List
C Access Control Logs D Access Control List
120. The is a security app by Microsoft which is a built-in one into B
Windows OS that is designed to filter network data from your Windows system & block
harmful communications or the programs which are initiating them.
A Windows Security Essentials B Windows Firewall
C Windows app blocker D Windows 10
121. are essential because they frequently comprises of critical patches to D
security holes.
A System software B Utility Software
C Software executables D Software updates
122. As a backup for securing your device, it is necessary to create a D
A backup point B copy of files in separate drives
C copy of files in the same drives D restore point
123. is a Debian-Linux based OS that has 2 VMs (Virtual Machines) that c
help in preserving users data private
A Fedora B Ubuntu
C Whonix D Kubuntu
124. Which of the following comes under secured Linux based OS? D
A Ubuntu B Fedora
C Kubuntu D Tails
125. passwords are next level of security. A
A BIOS B CMOS
C SMOS D BOIS