250+ TOP MCQs on Security – Cryptography and Answers

Operating System Multiple Choice Questions on “Security – Cryptography”.

1. What is the preferred way of encryption?
a) pre shared secret key
b) using key distribution center (KDC)
c) public key-encryption
d) symmetric key

Answer: c
Clarification: Pre Shared key can be compromised and either party can be suspected. Likewise KDC or symmetric key can have breach which are undesirable. Public and private key encryption is a known industry standard.

2. What is not a role of encryption?
a) It is used to protect data from unauthorized access during transmission
b) It is used to ensure user authentication
c) It is used to ensure data integrity
d) It is used to ensure data corruption doesn’t happens

Answer: d
Clarification: Encryption doesn’t have error correction or detection facility thus cannot be used to safeguard from data corruption.

3. What is cipher-block chaining?
a) Data is logically ‘ANDed’ with previous block
b) Data is logically ‘ORed’ with previous block
c) Data is logically ‘XORed’ with previous block
d) None of the mentioned

Answer: c
Clarification: None.

4. What is not an encryption standard?
a) AES
b) TES
c) Triple DES
d) DES

Answer: b
Clarification: None.

5. Which of the following is not a stream cipher?
a) Two fish
b) RC5
c) RC4
d) TBONE

Answer: d
Clarification: None.

6. What is a Hash Function?
a) It creates a small flexible block of data
b) It creates a small,fixed block of data
c) It creates a encrypted block of data
d) None of the mentioned

Answer: b
Clarification: None.

7. MD5 produces __________ bits hash data.
a) 128
b) 150
c) 160
d) 112

Answer: a
Clarification: None.

8. SHA-1 produces __________ bit of hash.
a) 128
b) 160
c) 150
d) 112

Answer: b
Clarification: None.

9. Which two of the following are authentication algorithms?
a) MAC
b) AES
c) DAS
d) Digital-signature

Answer: a
Clarification: None.

10. What is the role of Key Distribution Center?
a) It is used to distribute keys to everyone in world
b) It intended to reduce the risks inherent in exchanging keys
c) All of the mentioned
d) None of the mentioned

Answer: b

250+ TOP MCQs on File System Concepts and Answers

Operating System Multiple Choice Questions on “File System Concepts”.

1. ______ is a unique tag, usually a number identifies the file within the file system.
a) File identifier
b) File name
c) File type
d) None of the mentioned

Answer: a

2. To create a file ____________
a) allocate the space in file system
b) make an entry for new file in directory
c) allocate the space in file system & make an entry for new file in directory
d) none of the mentioned

Answer: c

3. By using the specific system call, we can ____________
a) open the file
b) read the file
c) write into the file
d) all of the mentioned

Answer: d

4. File type can be represented by ____________
a) file name
b) file extension
c) file identifier
d) none of the mentioned

Answer: b

5. Which file is a sequence of bytes organized into blocks understandable by the system’s linker?
a) object file
b) source file
c) executable file
d) text file

Answer: a
Clarification: None.

6. What is the mounting of file system?
a) crating of a filesystem
b) deleting a filesystem
c) attaching portion of the file system into a directory structure
d) removing the portion of the file system into a directory structure

Answer: c
Clarification: None.

7. Mapping of file is managed by ____________
a) file metadata
b) page table
c) virtual memory
d) file system

Answer: a
Clarification: None.

8. Mapping of network file system protocol to local file system is done by ____________
a) network file system
b) local file system
c) volume manager
d) remote mirror

Answer: a
Clarification: None.

9. Which one of the following explains the sequential file access method?
a) random access according to the given byte number
b) read bytes one at a time, in order
c) read/write sequentially by record
d) read/write randomly by record

Answer: b
Clarification: None.

10. When will file system fragmentation occur?
a) unused space or single file are not contiguous
b) used space is not contiguous
c) unused space is non-contiguous
d) multiple files are non-contiguous

Answer: a

250+ TOP MCQs on Disk Scheduling and Answers

Operating System Multiple Choice Questions on “Disk Scheduling”.

1. In _______ information is recorded magnetically on platters.
a) magnetic disks
b) electrical disks
c) assemblies
d) cylinders

Answer: a
Clarification: None.

2. The heads of the magnetic disk are attached to a _____ that moves all the heads as a unit.
a) spindle
b) disk arm
c) track
d) none of the mentioned

Answer: b
Clarification: None.

3. The set of tracks that are at one arm position make up a ___________
a) magnetic disks
b) electrical disks
c) assemblies
d) cylinders

Answer: d
Clarification: None.

4. The time taken to move the disk arm to the desired cylinder is called the ____________
a) positioning time
b) random access time
c) seek time
d) rotational latency

Answer: c
Clarification: None.

5. The time taken for the desired sector to rotate to the disk head is called ____________
a) positioning time
b) random access time
c) seek time
d) rotational latency

Answer: d
Clarification: None.

6. When the head damages the magnetic surface, it is known as _________
a) disk crash
b) head crash
c) magnetic damage
d) all of the mentioned

Answer: b
Clarification: None.

7. A floppy disk is designed to rotate ___________ as compared to a hard disk drive.
a) faster
b) slower
c) at the same speed
d) none of the mentioned

Answer: b
Clarification: None.

8. What is the host controller?
a) controller built at the end of each disk
b) controller at the computer end of the bus
c) all of the mentioned
d) none of the mentioned

Answer: b
Clarification: None.

9. ______ controller sends the command placed into it, via messages to the _____ controller.
a) host, host
b) disk, disk
c) host, disk
d) disk, host

Answer: c
Clarification: None.

10. What is the disk bandwidth?
a) the total number of bytes transferred
b) total time between the first request for service and the completion on the last transfer
c) the total number of bytes transferred divided by the total time between the first request for service and the completion on the last transfer
d) none of the mentioned

Answer: c

250+ TOP MCQs on Distributed File System and Answers

Operating System Multiple Choice Questions on “Distributed File System”.

1. What are the different ways in which clients and servers are dispersed across machines?
a) Servers may not run on dedicated machines
b) Servers and clients can be on same machines
c) Distribution cannot be interposed between a OS and the file system
d) OS cannot be distributed with the file system a part of that distribution

Answer: b

2. What are not the characteristics of a DFS?
a) login transparency and access transparency
b) Files need not contain information about their physical location
c) No Multiplicity of users
d) No Multiplicity if files

Answer: c

3. What are characteristic of a DFS?
a) Fault tolerance
b) Scalability
c) Heterogeneity of the system
d) Upgradation

Answer: d

4. What are the different ways file accesses take place?
a) sequential access
b) direct access
c) indexed sequential access
d) all of the mentioned

Answer: d

5. Which is not a major component of a file system?
a) Directory service
b) Authorization service
c) Shadow service
d) System service

Answer: c
Clarification: None.

6. What are the different ways mounting of the file system?
a) boot mounting
b) auto mounting
c) explicit mounting
d) all of the mentioned

Answer: d
Clarification: None.

7. What is the advantage of caching in remote file access?
a) Reduced network traffic by retaining recently accessed disk blocks
b) Faster network access
c) Copies of data creates backup automatically
d) None of the mentioned

Answer: a
Clarification: None.

8. What is networked virtual memory?
a) Caching
b) Segmentation
c) RAM disk
d) None of the mentioned

Answer: a
Clarification: None.

9. What are the examples of state information?
a) opened files and their clients
b) file descriptors and file handles
c) current file position pointers
d) all of the mentioned

Answer: d
Clarification: None.

10. Which is not an example of state information?
a) Mounting information
b) Description of HDD space
c) Session keys
d) Lock status

Answer: b

250+ TOP MCQs on Process Scheduling Queues and Answers

Operating System Multiple Choice Questions on “Process Scheduling Queues”.

1. Which of the following do not belong to queues for processes?
a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue

Answer: b
Clarification: PCB queue does not belong to queues for processes. PCB is a process control block which contains information related to process. Each process is represented by PCB.

2. When the process issues an I/O request __________
a) It is placed in an I/O queue
b) It is placed in a waiting queue
c) It is placed in the ready queue
d) It is placed in the Job queue

Answer: a
Clarification: When the process issues an I/O request it is placed in an I/O queue. I/O is a resource and it should be used effectively and every process should get access to it. There might be multiple processes which requested for I/O. Depending on scheduling algorithm I/O is allocated to any particular process and after completing I/O operation, I/O access is returned to the OS.

3. What will happen when a process terminates?
a) It is removed from all queues
b) It is removed from all, but the job queue
c) Its process control block is de-allocated
d) Its process control block is never de-allocated

Answer: a
Clarification: When a process terminates, it removes from all queues. All allocated resources to that particular process are deallocated and all those resources are returned back to OS.

4. What is a long-term scheduler?
a) It selects processes which have to be brought into the ready queue
b) It selects processes which have to be executed next and allocates CPU
c) It selects processes which heave to remove from memory by swapping
d) None of the mentioned

Answer: a
Clarification: A long-term scheduler selects processes which have to be brought into the ready queue. When processes enter the system, they are put in the job queue. Long-term scheduler selects processes from the job queue and puts them in the ready queue. It is also known as Job Scheduler.

5. If all processes I/O bound, the ready queue will almost always be ______ and the Short term Scheduler will have a ______ to do.
a) full, little
b) full, lot
c) empty, little
d) empty, lot

Answer: c
Clarification: If all processes are I/O bound, the ready queue will almost empty and the short-term scheduler will have a little to do. I/O bound processes spend more time doing I/O than computation.

6. What is a medium-term scheduler?
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of the mentioned

Answer: c
Clarification: A medium-term scheduler selects which process to remove from memory by swapping. The medium-term scheduler swapped out the process and later swapped in. Swapping helps to free up memory.

7. What is a short-term scheduler?
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of the mentioned

Answer: b
Clarification: A short-term scheduler selects a process which has to be executed next and allocates CPU. Short-term scheduler selects a process from the ready queue. It selects processes frequently.

8. The primary distinction between the short term scheduler and the long term scheduler is __________
a) The length of their queues
b) The type of processes they schedule
c) The frequency of their execution
d) None of the mentioned

Answer: c
Clarification: The primary distinction between the short-term scheduler and the long-term scheduler is the frequency of their execution. The short-term scheduler executes frequently while the long-term scheduler executes much less frequently.

9. The only state transition that is initiated by the user process itself is __________
a) block
b) wakeup
c) dispatch
d) none of the mentioned

Answer: a
Clarification: The only state transition that is initiated by the user process itself is block. Whenever a user process initiates an I/O request it goes into block state unless and until the I/O request is not completed.

10. 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 __________
a) Blocked state
b) Ready state
c) Suspended state
d) Terminated state

Answer: b
Clarification: 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 Ready State. In a time-sharing operating system unit time is defined for sharing CPU, it is called a time quantum or time slice. If a process takes less than 1 time quantum, then the process itself releases the CPU.

11. In a multiprogramming environment __________
a) the processor executes more than one process at a time
b) the programs are developed by more than one person
c) more than one process resides in the memory
d) a single user can execute many programs at the same time

Answer: c
Clarification: In a multiprogramming environment more than one process resides in the memory. Whenever a CPU is available, one process amongst all present in memory gets the CPU for execution. Multiprogramming increases CPU utilization.

12. Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the __________
a) Running state
b) Ready state
c) Suspended state
d) Terminated state

Answer: b
Clarification: Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the ready state. Process never goes directly to the running state from the waiting state. Only processes which are in ready state go to the running state whenever CPU allocated by operating system.

13. The context of a process in the PCB of a process does not contain __________
a) the value of the CPU registers
b) the process state
c) memory-management information
d) context switch time

Answer: d
Clarification: The context of a process in the PCB of a process does not contain context switch time. When switching CPU from one process to another, the current context of the process needs to be saved. It includes values of the CPU registers, process states, memory-management information.

14. Which of the following need not necessarily be saved on a context switch between processes?
a) General purpose registers
b) Translation lookaside buffer
c) Program counter
d) All of the mentioned

Answer: b
Clarification: Translation Look-aside Buffer (TLB) need not necessarily be saved on a context switch between processes. A special, small, fast-lookup hardware cache is called Translation Look-aside Buffer. TLB used to reduce memory access time.

15. Which of the following does not interrupt a running process?
a) A device
b) Timer
c) Scheduler process
d) Power failure

Answer: c
Clarification: Scheduler process does not interrupt a running process. Scheduler process selects an available process from a pool of available processes and allocates CPU to it.

250+ TOP MCQs on Deadlock and Answers

Operating System Multiple Choice Questions on “Deadlock”.

1. What is a reusable resource?
a) that can be used by one process at a time and is not depleted by that use
b) that can be used by more than one process at a time
c) that can be shared between various threads
d) none of the mentioned

Answer: a
Clarification: None.

2. Which of the following condition is required for a deadlock to be possible?
a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other resources
c) no resource can be forcibly removed from a process holding it
d) all of the mentioned

Answer: d
Clarification: None.

3. A system is in the safe state if ____________
a) the system can allocate resources to each process in some order and still avoid a deadlock
b) there exist a safe sequence
c) all of the mentioned
d) none of the mentioned

Answer: a
Clarification: None.

4. The circular wait condition can be prevented by ____________
a) defining a linear ordering of resource types
b) using thread
c) using pipes
d) all of the mentioned

Answer: a
Clarification: None.

5. Which one of the following is the deadlock avoidance algorithm?
a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm

Answer: a
Clarification: None.

6. What is the drawback of banker’s algorithm?
a) in advance processes rarely know how much resource they will need
b) the number of processes changes as time progresses
c) resource once available can disappear
d) all of the mentioned

Answer: d
Clarification: None.

7. For an effective operating system, when to check for deadlock?
a) every time a resource request is made
b) at fixed time intervals
c) every time a resource request is made at fixed time intervals
d) none of the mentioned

Answer: c
Clarification: None.

8. A problem encountered in multitasking when a process is perpetually denied necessary resources is called ____________
a) deadlock
b) starvation
c) inversion
d) aging

Answer: b
Clarification: None.

9. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
a) resource allocation graph
b) starvation graph
c) inversion graph
d) none of the mentioned

Answer: a
Clarification: None.

10. To avoid deadlock ____________
a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once
c) all deadlocked processes must be aborted
d) inversion technique can be used

Answer: a