Operating System » Processes
Operating System Subcategories
Memory Management Swapping 1Process Scheduling Queue
Virtual Memory Page Replacement Algorithms 1Linux
Cpu SchedulingMemory Management
Computer FundamentalsCpu Scheduling Benefits
Threads Signal HandlingThreads Ult Klt
Distributed Operating SystemBasics
Operating SystemProcesses
Cpu Scheduling Algorithms 1Cpu Scheduling Algorithms 2
DeadlockDeadlock Avoidance
Memory Management Swapping 2Memory Allocation 1
Secondary StorageMemory Management Paging 1
Memory Management Paging 2Rtos
Multimedia System Cpu Disk SchedulingSecurity Intrusion Detection
Virtual Memory ThrashingFile System Interface Access Methods 1
File System Interface Directory Structure 1File System Interface Directory Structure 2
File System Interface Mounting SharingFile System Allocation Methods 1
Disk Scheduling 2Disk Management
Classic Sync ProblemsSemaphores 1
Process CreationMultimedia System Network Management
Semaphores 2Cpu Scheduling 2
Application Io Interface 1Inter Process Communication
Process SynchronizationMultimedia System Compression 1
Network File System 1Disk Scheduling 1
Mass Storage Raid 1File System 1
Communication Systems Bandwidth Transmission MediumSecurity Cryptography
Two Port NetworkProcess Rpc
Virtual Memory Page Replacement Algorithms 2Virtual Memory Frame Allocation
Network File System 2File System Allocation Methods 2
File System Allocation Methods 3Process Control Block
Process StructuresCritical Section Problem
Process Sync MonitorsAtomic Transactions
Deadlock RecoveryMemory Allocation 2
Memory Management SegmentationApplication Io Interface 2
Kernel Io SubsystemsMultimedia System Compression 2
Multimedia System Compression 3Security User Authentication
Security Program System ThreatsSecurity System Facility
Threads Fork ExecThreads Cancellation
Threads PoolsMulti Threading Models
Virtual Memory Demand PagingVirtual Memory
File System ConceptsFile System Implementation
File System Interface Access Methods 2File System Recovery
Io SubsystemSwap Space Management
Mass Storage Raid 2Mass Storage Tertiary Storage
Protection ConceptsProtection Access Matrix
SecurityProtection Memory Protection
Protection Revocation Access RightsNetwork Structure Topology
RobustnessDistributed File System
Distributed SynchronizationDeadlock Prevention
Deadlock DetectionThreads
File System Interface ProtectionFile System Free Space Performance
In operating system, each process has its own __________

A. Address space and global variables
B. Open files
C. Pending alarms, signals and signal handlers
D. All of the mentioned

Explanation: In Operating Systems, each process has its own address space which contains code, data, stack and heap segments or sections. Each process also has a list of files which is opened by the process as well as all pending alarms, signals and various signal handlers.

In Unix, which system call creates the new process?

A. Fork
B. Create
C. New
D. None of the mentioned

Explanation: In UNIX, a new process is created by fork() system call. fork() system call returns a process ID which is generally the process id of the child process created.

The systems which allow only one process execution at a time, are called __________

A. Uniprogramming systems
B. Uniprocessing systems
C. Unitasking systems
D. None of the mentioned

Explanation: Those systems which allow more than one process execution at a time, are called multiprocessing systems. Uniprocessing means only one processor.

A process can be terminated due to __________

A. Normal exit
B. Fatal error
C. Killed by another process
D. All of the mentioned

Explanation: A process can be terminated normally by completing its task or because of fatal error or killed by another process or forcefully killed by a user. When the process completes its task without any error then it exits normally. The process may exit abnormally because of the occurrence of fatal error while it is running. The process can be killed or terminated forcefully by another process.

What is the ready state of a process?

A. When process is scheduled to run after some execution
B. When process is unable to run until some task has been completed
C. When process is using the cpu
D. None of the mentioned

Explanation: Ready state of the process means process has all necessary resources which are required for execution of that process when CPU is allocated. Process is ready for execution but waiting for the CPU to be allocated.

A set of processes is deadlock if __________

A. Each process is blocked and will remain so forever
B. Each process is terminated
C. All processes are trying to kill each other
D. None of the mentioned

Explanation: Deadlock is a situation which occurs because process A is waiting for one resource and holds another resource (blocking resource). At the same time another process B demands blocking a resource as it is already held by a process A, process B is waiting state unless and until process A releases occupied resource.

A process stack does not contain __________

A. Function parameters
B. Local variables
C. Return addresses
D. Pid of child process

Explanation: Process stack contains Function parameters, Local variables and Return address. It does not contain the PID of child process.

Which system call can be used by a parent process to determine the termination of child process?

A. Wait
B. Exit
C. Fork
D. Get

Explanation: wait() system call is used by the parent process to determine termination of child process. The parent process uses wait() system call and gets the exit status of the child process as well as the pid of the child process which is terminated.

The address of the next instruction to be executed by the current process is provided by the __________

A. Cpu registers
B. Program counter
C. Process stack
D. Pipe

Explanation: The address of the next instruction to be executed by the current process is provided by the Program Counter. After every instruction is executed, the Program Counter is incremented by 1 i.e. address of the next instruction to be executed. CPU fetches instruction from the address denoted by Program Counter and execute it.