BIT2213 Operating System Overview

Questions and Answers

What does a process represent in an operating system?

A process represents a program in execution.

Which of these are key components of a process in memory? (Select all that apply)

Data section (correct)

Database

Text section (correct)

Heap (correct)

A ______ scheduler selects which processes should be brought into the ready queue.

long-term

A CPU-bound process spends more time doing I/O operations than computations.

False Signup and view all the answers

What is the term for the process of saving the state of the current process and selecting the next one to run?

Context switch Signup and view all the answers

Which statement accurately describes a deadlock?

A deadlock is when processes are blocked, each holding a resource and waiting for another. Signup and view all the answers

What is the function of the Process Control Block (PCB)?

The PCB contains all the data needed to manage and control a process. Signup and view all the answers

The two main communications models for interprocess communication are and .

message passing, shared memory Signup and view all the answers

Match the following types of schedulers with their descriptions:

Short-term scheduler = Selects which process should be executed next Long-term scheduler = Selects which processes should be brought into the ready queue Medium-term scheduler = Handles the swapping of processes in and out of memory Job queue = Set of all processes in the system Signup and view all the answers

Named pipes allow processes to communicate without any parent-child relationship.

True Signup and view all the answers

Study Notes

Course Overview

Course Name: Operating System
Course Code: BIT2213
Faculty: Business and Technology
Instructor: Mr. Yudi K. Budi

Process Management

Covers essential aspects of process management including concepts, synchronization, and scheduling.
Emphasizes deadlock detection, recovery, and the importance of concurrent process management.

Process Concepts

A process is a program in execution and forms the basis of computation.
Key features of processes include scheduling, creation, termination, and communication.
Program and process are closely related; a program becomes a process when loaded into memory.

Process Memory Structure

Components of a process include:
- Text section (program code)
- Data section (global variables)
- Stack (temporary data such as function parameters and local variables)
- Heap (dynamically allocated memory)

Process States

Key process states:
- New: Process is being created.
- Ready: Waiting for CPU allocation.
- Running: Instructions are actively executed.
- Waiting: Requires an event to proceed.
- Terminated: Execution is complete.

Process Control Block (PCB)

A PCB contains information associated with each process for effective management.
Key components of PCB include process state, program counter, CPU registers, memory management info, accounting info, and I/O status info.

Context Switching

Refers to the process where the CPU saves the state of the current process, selects the next process, restores its state, and executes it.

Process Scheduling

Objectives include maximizing CPU usage and managing process execution efficiently.
Types of scheduling queues:
- Job Queue: All processes in the system.
- Ready Queue: Processes in memory, ready to execute.
- Device Queues: Processes waiting for I/O devices.

Types of Schedulers

Short-term scheduler: Selects which process to execute next; operates frequently.
Long-term scheduler: Determines which processes enter the ready queue; operates less frequently.
Medium-term scheduler: Helps manage multiprogramming by swapping processes in and out of memory.

Process Creation and Termination

A parent process can create child processes forming a tree structure.
Processes are identified by a process identifier (pid).
Resources can be shared among processes, and execution options determine if parent waits for child termination.

Interprocess Communication (IPC)

IPC allows processes to cooperate by sharing information and synchronizing actions.
Two IPC models are shared memory and message passing.
Shared memory involves user-controlled synchronization, while message passing uses send and receive operations.

Deadlock

A deadlock occurs when a set of processes are each waiting for a resource held by another in the set.
Strategies for handling deadlocks include prevention, avoidance, and ignorance of the issue.

Scheduling Algorithms

Four key scheduling algorithms include:
- First-Come, First-Served (FCFS)
- Shortest-Job-Next (SJN)
- Priority Scheduling
- Round Robin (RR)
Preemptive scheduling allocates the CPU for limited times, whereas non-preemptive scheduling allows processes to run till completion or waiting state.

Summary

The operating system course encompasses a broad understanding of process management, IPC, deadlocks, and scheduling methodologies crucial for efficient computing systems.

Description

This quiz provides an overview of the BIT2213 Operating System course, focusing on essential aspects of process management, including concepts, concurrent processes, and synchronization methods. It is designed to guide students through understanding these key components of operating systems.