On This Page

This set of Operating System (OS) Multiple Choice Questions & Answers (MCQs) focuses on Operating System Set 24

Q1 | A process can never be sure that a signal it has sent                            
  • has which identifier
  • has not been lost
  • has been sent
  • all of the mentioned
Q2 | In UNIX, the                              system call is used to send a signal.
  • sig
  • send
  • kill
  • sigsend
Q3 | Thread pools are useful when
  • when we need to limit the number of threads running in the application at the same time
  • when we need to limit the number of threads running in the application as a whole
  • when we need to arrange the ordering of threads
  • none of the mentioned
Q4 | Instead of starting a new thread for every task to execute concurrently, the task can be passed to a                        
  • process
  • thread pool
  • thread queue
  • none of the mentioned
Q5 | Each connection arriving at multi threaded servers via network is generally
  • is directly put into the blocking queue
  • is wrapped as a task and passed on to a thread pool
  • is kept in a normal queue and then sent to the blocking queue from where it is dequeued
  • none of the mentioned
Q6 | What is the idea behind thread pools?
  • a number of threads are created at process startup and placed in a pool where they sit and wait for work
  • when a process begins, a pool of threads is chosen from the many existing and each thread is allotted equal amount of work
  • all threads in a pool distribute the task equally among themselves
  • none of the mentioned
Q7 | If the thread pool contains no available thread                          
  • the server runs a new process
  • the server goes to another thread pool
  • the server demands for a new pool creation
  • the server waits until one becomes free
Q8 | Thread pools help in                          
  • servicing multiple requests using one thread
  • servicing a single request using multiple threads from the pool
  • faster servicing of requests with an existing thread rather than waiting to create a new thread
  • none of the mentioned
Q9 | The number of the threads in the pool can be decided on factors such as                          
  • number of cpus in the system
  • amount of physical memory
  • expected number of concurrent client requests
  • all of the mentioned
Q10 | The swaps processes in and out of the memory.
  • Memory Manager
  • CPU
  • CPU Manager
  • User
Q11 | The address generated by the CPU is referred to as
  • Physical Address
  • Logical Address
  • Neither Physical nor Logical
  • None of the mentioned
Q12 | Operating System maintains the page table for
  • each process
  • each thread
  • each instruction
  • each address
Q13 | What is operating system?
  • collection of programs that manages hardware
  • system service provider to the
  • link to interface the hardware and
  • all of the mentioned
Q14 | 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:
  • blocked state
  • ready state
  • suspended state
  • terminated state
Q15 | In virtual memory, which is not a page replacement algorithm ?
  • FIFO
  • BFS
  • LRU
  • Optimal
Q16 | Thrashing the CPU utilization.
  • increases
  • keep constant
  • decreases
  • None of the mentioned
Q17 | Mutual exclusion can be provided by the                      
  • mutex locks
  • binary semaphores
  • both mutex locks and binary
  • none of the mentioned
Q18 | A parent process calling system call will be suspended until children processes terminate.
  • wait
  • fork
  • exit
  • exec
Q19 | The child process completes execution, but the parent keeps executing, then the child process is known as
  • Orphan
  • Zombie
  • Body
  • Dead
Q20 | When the process issues an I/O request                      
  • It is placed in an I/O queue
  • It is placed in a waiting queue
  • It is placed in the ready queue
  • It is placed in the Job queue
Q21 | Which one of the following is the deadlock avoidance algorithm?
  • banker’s algorithm
  • elevator algorithm
  • karn’s algorithm
  • none of the mentioned
Q22 | File type can be represented by                          
  • file name
  • file extension
  • file identifier
  • none of the mentioned
Q23 | Which of the following are the two parts of the file name?
  • name & identifier
  • identifier & type
  • extension & name
  • type & extension
Q24 | Which of the following are forms of malicious attack?
  • Theft of information
  • Modification of data
  • Wiping of information
  • All of the mentioned
Q25 | From the following, which is not a common file permission?
  • Write
  • Execute
  • Stop
  • Read