Operating Systems Overview and Core Concepts

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/28

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering core operating system principles, components, memory management, scheduling algorithms, and architecture classifications.

29 Terms

1
New cards

Operating System (OS)

An interface between computer hardware and the user (programs or humans) that facilitates the execution of other programs and governs access to hardware and software resources.

2
New cards

Bootstrap Program

A small program held in ROM that executes when the computer is turned on to load the operating system from storage into RAM memory.

3
New cards

Batch Operating System

An early operating system developed in the 1950s to control mainframe computers by transferring resources from one job to the next without interactive user intervention.

4
New cards

Multiprogramming

A technique that holds several jobs in memory at the same time and executes them concurrently by allocating available resources.

5
New cards

Time-Sharing System

A system where computer resources are shared among multiple jobs by allocating each job a specific portion of time, providing users the illusion of exclusive access.

6
New cards

Parallel System

A computer system with multiple CPUs on the same machine designed to accomplish tasks in parallel by serving programs or parts of programs simultaneously.

7
New cards

Distributed System

A system in which jobs and resources are shared among multiple distinct computers connected via an internetwork.

8
New cards

Real-Time System

A system designed to execute tasks within specific time constraints, commonly used to monitor, respond to, or control external physical processes and environments.

9
New cards

User Interface (Shell)

A program in the operating system that accepts requests from users or processes and interprets them for the rest of the system.

10
New cards

Monoprogramming

A memory management scheme where only one program can run at a time, occupying the majority of memory while a small portion holds the operating system.

11
New cards

Partitioning

A memory allocation technique that divides main memory into multiple contiguous, variable-length address spaces to contain individual programs.

12
New cards

Paging

A memory management method that divides physical memory into fixed-size units called frames and programs into equal-sized units called pages to eliminate external fragmentation.

13
New cards

Demand Paging

A memory management scheme combining paging and swapping where pages remain in secondary storage and are swapped into memory only when needed by the executing process.

14
New cards

Demand Segmentation

A memory management technique that partitions memory into variable-length, logically related units called segments, managed using a segment table.

15
New cards

Virtual Memory

An architecture where a process's address space is divided into pages and mapped by the operating system from virtual addresses to physical memory addresses.

16
New cards

Program

A nonactive set of instructions stored on a secondary storage medium, such as a disk or tape.

17
New cards

Job

A program from the moment it is selected for execution by the operating system until it finishes running and returns to residing on the disk.

18
New cards

Process

A program in execution that has been loaded into memory and is either executing or waiting for CPU time.

19
New cards

Job Scheduler

The component of the process manager responsible for moving a job from the hold state to the ready state and from the running state to the terminated state.

20
New cards

Process Scheduler

The component of the process manager that moves processes among the ready, running, and waiting states based on CPU readiness, events, and time-slice expirations.

21
New cards

First-Come First-Served (FCFS)

A CPU scheduling algorithm where processes are assigned the CPU strictly in the order in which they arrive.

22
New cards

Shortest Job First (SJF)

A scheduling policy where the scheduler selects the process with the smallest service time among waiting processes of equal priority.

23
New cards

Round-Robin (RR) Scheduling

A preemptive scheduling algorithm that distributes CPU time equally by allocating each process a fixed time interval known as a time quantum or time-slice.

24
New cards

Deadlock

A condition occurring when two or more processes are permanently prevented from continuing because each is holding a resource required by another and waiting for a resource held by the other.

25
New cards

Starvation

A situation where a process is permanently blocked from obtaining required resources due to continuous prioritization of other processes.

26
New cards

Device Manager

The operating system component responsible for the efficient use of input/output devices, device monitoring, queue maintenance, and access policies.

27
New cards

File Manager

The operating system component that oversees file access control, naming conventions, storage allocation, creation, deletion, modification, and archiving.

28
New cards

32-Bit Operating System

An operating system built on CPU registers, address buses, or data buses of 32 bits, allowing a maximum addressable memory capacity of 232 bytes2^{32}\text{ bytes} (4 GB4\text{ GB}).

29
New cards

64-Bit Operating System

An operating system built on 64-bit architectures capable of addressing up to 264 bytes2^{64}\text{ bytes} (16 EB16\text{ EB}) of physical or virtual memory.