Q#1: A process is:
(A) A program in execution
(B) Only a program stored on disk
(C) Only a thread
(D) Only memory allocation
Answer: (A) A program in execution
Q#2: A process contains:
(A) Program code, data, and execution context
(B) Only CPU instructions
(C) Only memory
(D) Only disk files
Answer: (A) Program code, data, and execution context
Q#3: Process state can be:
(A) New, Ready, Running, Waiting, Terminated
(B) Only Running
(C) Only Waiting
(D) Only New
Answer: (A) New, Ready, Running, Waiting, Terminated
Q#4: The PCB (Process Control Block) stores:
(A) Process information like state, PID, CPU registers, memory limits
(B) Only file paths
(C) Only CPU cycles
(D) Only memory addresses
Answer: (A) Process information like state, PID, CPU registers, memory limits
Q#5: The unique identifier of a process is:
(A) Process ID (PID)
(B) Memory address
(C) File name
(D) CPU number
Answer: (A) Process ID (PID)
Q#6: A context switch occurs when:
(A) CPU switches from one process to another
(B) Memory is allocated
(C) Disk is formatted
(D) Only files are opened
Answer: (A) CPU switches from one process to another
Q#7: Types of processes include:
(A) CPU-bound and I/O-bound
(B) Only threads
(C) Only kernel processes
(D) Only file processes
Answer: (A) CPU-bound and I/O-bound
Q#8: A CPU-bound process:
(A) Spends more time executing on CPU
(B) Spends more time waiting for I/O
(C) Only stores files
(D) Only runs threads
Answer: (A) Spends more time executing on CPU
Q#9: An I/O-bound process:
(A) Spends more time waiting for I/O than using CPU
(B) Uses CPU continuously
(C) Only runs in kernel
(D) Only manages files
Answer: (A) Spends more time waiting for I/O than using CPU
Q#10: Process scheduling is done by:
(A) CPU scheduler
(B) Memory manager
(C) File system
(D) User program
Answer: (A) CPU scheduler
Q#11: The Ready queue contains:
(A) Processes ready to execute
(B) Processes waiting for I/O
(C) Only terminated processes
(D) Only new processes
Answer: (A) Processes ready to execute
Q#12: The Waiting queue contains:
(A) Processes waiting for an event or I/O
(B) Ready processes
(C) Only terminated processes
(D) Only new processes
Answer: (A) Processes waiting for an event or I/O
Q#13: Preemptive scheduling allows:
(A) CPU can be taken from a process before it finishes
(B) Process runs until completion
(C) Only one process in system
(D) Only I/O operations
Answer: (A) CPU can be taken from a process before it finishes
Q#14: Non-preemptive scheduling allows:
(A) CPU is allocated until process completes or waits
(B) CPU can be taken anytime
(C) Only I/O
(D) Only threads
Answer: (A) CPU is allocated until process completes or waits
Q#15: First-Come, First-Served (FCFS) scheduling:
(A) Processes are executed in order of arrival
(B) Processes are executed by priority
(C) Processes with shortest job first
(D) Only real-time processes
Answer: (A) Processes are executed in order of arrival
Q#16: Shortest Job Next (SJN) scheduling executes:
(A) The process with the smallest execution time next
(B) Processes randomly
(C) Only I/O processes
(D) Only high-priority processes
Answer: (A) The process with the smallest execution time next
Q#17: Round-Robin scheduling:
(A) Assigns fixed time quantum to each process in cyclic order
(B) Executes only longest job
(C) Executes only I/O processes
(D) Executes one process until completion
Answer: (A) Assigns fixed time quantum to each process in cyclic order
Q#18: Priority scheduling:
(A) Executes process with highest priority first
(B) Executes shortest job first
(C) Executes only I/O-bound
(D) Executes randomly
Answer: (A) Executes process with highest priority first
Q#19: Starvation occurs when:
(A) Low-priority processes never get CPU
(B) High-priority processes terminate
(C) Memory is full
(D) CPU is idle
Answer: (A) Low-priority processes never get CPU
Q#20: Aging prevents starvation by:
(A) Gradually increasing priority of waiting processes
(B) Decreasing priority
(C) Halting CPU
(D) Only managing I/O
Answer: (A) Gradually increasing priority of waiting processes
Q#21: Threads are:
(A) Lightweight processes within a process
(B) Only files
(C) Only CPU registers
(D) Only disk data
Answer: (A) Lightweight processes within a process
Q#22: Multithreading allows:
(A) Concurrent execution of multiple threads of a process
(B) Only one thread per process
(C) Only file operations
(D) Only I/O
Answer: (A) Concurrent execution of multiple threads of a process
Q#23: Process creation can be done by:
(A) fork(), spawn() system calls
(B) Only copy command
(C) Only delete command
(D) Only shell scripts
Answer: (A) fork(), spawn() system calls
Q#24: Child process inherits:
(A) Code, data, and open files from parent process
(B) Only CPU
(C) Only disk
(D) Only kernel
Answer: (A) Code, data, and open files from parent process
Q#25: Process termination occurs via:
(A) Normal exit, abort, parent termination
(B) Only kill command
(C) Only I/O completion
(D) Only scheduling
Answer: (A) Normal exit, abort, parent termination
Q#26: Zombies are:
(A) Terminated processes whose PCB still exists until parent reads exit status
(B) Only waiting processes
(C) Only new processes
(D) Only threads
Answer: (A) Terminated processes whose PCB still exists until parent reads exit status
Q#27: Orphan processes occur when:
(A) Parent terminates before child
(B) Child terminates before parent
(C) CPU fails
(D) Memory overflows
Answer: (A) Parent terminates before child
Q#28: IPC (Inter-Process Communication) allows:
(A) Processes to communicate and synchronize
(B) Only memory sharing
(C) Only CPU access
(D) Only file storage
Answer: (A) Processes to communicate and synchronize
Q#29: IPC methods include:
(A) Shared memory, message passing
(B) Only memory allocation
(C) Only CPU scheduling
(D) Only I/O
Answer: (A) Shared memory, message passing
Q#30: Mutual exclusion ensures:
(A) Only one process accesses critical section at a time
(B) Multiple processes access simultaneously
(C) Only CPU-bound execution
(D) Only I/O-bound execution
Answer: (A) Only one process accesses critical section at a time
Q#31: Semaphores are used for:
(A) Process synchronization and mutual exclusion
(B) Only file handling
(C) Only CPU scheduling
(D) Only memory allocation
Answer: (A) Process synchronization and mutual exclusion
Q#32: Mutex locks are:
(A) Binary semaphores for mutual exclusion
(B) Only memory locks
(C) Only CPU locks
(D) Only disk locks
Answer: (A) Binary semaphores for mutual exclusion
Q#33: Critical section problem occurs when:
(A) Multiple processes access shared resources without synchronization
(B) CPU idle
(C) Memory full
(D) Disk error
Answer: (A) Multiple processes access shared resources without synchronization
Q#34: Process synchronization ensures:
(A) Correct execution order of interacting processes
(B) Only CPU speed
(C) Only memory allocation
(D) Only I/O
Answer: (A) Correct execution order of interacting processes
Q#35: Deadlock occurs when:
(A) Processes wait indefinitely for resources held by each other
(B) CPU idle
(C) Memory overflow
(D) Disk full
Answer: (A) Processes wait indefinitely for resources held by each other
Q#36: Necessary conditions for deadlock include:
(A) Mutual exclusion, hold and wait, no preemption, circular wait
(B) Only CPU idle
(C) Only memory full
(D) Only disk failure
Answer: (A) Mutual exclusion, hold and wait, no preemption, circular wait
Q#37: Process scheduling can be:
(A) Long-term, medium-term, short-term
(B) Only short-term
(C) Only long-term
(D) Only I/O-bound
Answer: (A) Long-term, medium-term, short-term
Q#38: Long-term scheduler controls:
(A) Admission of processes into the system
(B) CPU context switching
(C) Only file operations
(D) Only memory allocation
Answer: (A) Admission of processes into the system
Q#39: Medium-term scheduler may:
(A) Suspend and resume processes to improve performance
(B) Only terminate processes
(C) Only create processes
(D) Only execute I/O
Answer: (A) Suspend and resume processes to improve performance
Q#40: Short-term scheduler selects:
(A) Which ready process will run next on CPU
(B) Only memory allocation
(C) Only file access
(D) Only I/O handling
Answer: (A) Which ready process will run next on CPU
Q#41: Cooperative multitasking:
(A) Processes voluntarily yield CPU
(B) OS forcibly preempts CPU
(C) Only one process
(D) Only kernel threads
Answer: (A) Processes voluntarily yield CPU
Q#42: Preemptive multitasking:
(A) OS forcibly takes CPU from a process
(B) Processes voluntarily yield CPU
(C) Only one process
(D) Only kernel threads
Answer: (A) OS forcibly takes CPU from a process
Q#43: Threads share:
(A) Code, data, but have separate registers and stack
(B) Only code
(C) Only CPU
(D) Only memory
Answer: (A) Code, data, but have separate registers and stack
Q#44: Process hierarchy is maintained via:
(A) Parent-child relationships
(B) Only CPU scheduling
(C) Only memory management
(D) Only I/O queues
Answer: (A) Parent-child relationships
Q#45: Orphan process is handled by:
(A) init process adopting the child
(B) CPU termination
(C) File deletion
(D) Disk formatting
Answer: (A) init process adopting the child
Q#46: Process termination cleanup involves:
(A) Releasing memory, I/O resources, updating PCB
(B) Only CPU reset
(C) Only file deletion
(D) Only scheduling
Answer: (A) Releasing memory, I/O resources, updating PCB
Q#47: Zombie processes exist because:
(A) Parent has not yet read child exit status
(B) Child is still running
(C) Only CPU idle
(D) Only I/O pending
Answer: (A) Parent has not yet read child exit status
Q#48: Process switching time is called:
(A) Context switch time
(B) CPU cycle
(C) Memory access time
(D) I/O wait time
Answer: (A) Context switch time
Q#49: Advantages of multithreading include:
(A) Responsiveness, resource sharing, economy
(B) Only faster CPU
(C) Only disk usage
(D) Only memory allocation
Answer: (A) Responsiveness, resource sharing, economy
Q#50: Overall purpose of process management is to:
(A) Efficiently allocate CPU, memory, and I/O resources among processes
(B) Only manage files
(C) Only run user programs
(D) Only handle I/O
Answer: (A) Efficiently allocate CPU, memory, and I/O resources among processes