CS-150 Operating Systems – Vocabulary Flashcards

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/76

flashcard set

Earn XP

Description and Tags

A comprehensive set of vocabulary flashcards covering operating-system fundamentals discussed in the CS-150 lecture, including OS roles, process and memory management, CPU scheduling, paging, file systems, and directory structures.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

77 Terms

1
New cards

Application Software

Programs written to solve specific real-world problems for a user.

2
New cards

System Software

Software that manages a computer system at a fundamental level.

3
New cards

Operating System (OS)

The central piece of system software that manages hardware resources, provides user and program interfaces, and coordinates all other software.

4
New cards

Process

A program that is currently being executed by the computer.

5
New cards

Process Management

The OS activity that tracks, schedules, and controls all active processes.

6
New cards

CPU Scheduling

Selecting which ready process should be moved to the running state and given the CPU.

7
New cards

Single-tasking Operating System

An OS that can execute only one program at a time.

8
New cards

Multi-tasking Operating System

An OS that allows several programs to run concurrently.

9
New cards

Single-user Operating System

An OS that supports one user at a time even if multiple programs run.

10
New cards

Multi-user Operating System

An OS that supports multiple users, associating processes and resources with specific user accounts.

11
New cards

Distributed Operating System

An OS that makes several networked computers appear as one unified system.

12
New cards

Embedded Operating System

A small, specialized OS designed for devices with limited resources.

13
New cards

Real-time Operating System

An OS that guarantees responses within hard time bounds for control or monitoring tasks.

14
New cards

Batch Processing

Executing a group of jobs sequentially without further user interaction.

15
New cards

Time-sharing

Allocating short CPU time slices to many users to give the illusion of dedicated machines.

16
New cards

Multi-processor Environment

Distributing processes across two or more CPU cores or processors.

17
New cards

Process State

The current condition of a process (ready, running, blocked, etc.) during its lifecycle.

18
New cards

Process Creation

The act of starting a new process, either by the OS or by another running process.

19
New cards

Child Process

A new process created by another (parent) process.

20
New cards

Process Termination

The ending of a process due to completion, error, logout, or system shutdown.

21
New cards

Process Suspension

Temporarily halting a process, often to free resources or await an event.

22
New cards

Process Control Block (PCB)

OS data structure that stores all information needed to manage a particular process.

23
New cards

Context Switch

The saving of a running process’s state and loading of another’s so the CPU can switch processes.

24
New cards

Thread

A lightweight unit of execution within a process that has its own context but shares memory.

25
New cards

Non-pre-emptive Scheduling

A policy where the running process keeps the CPU until it voluntarily releases it.

26
New cards

Pre-emptive Scheduling

A policy where the OS may forcibly move the CPU from one process to another.

27
New cards

First-Come, First-Served (FCFS)

A scheduling algorithm that runs processes in the order they arrive.

28
New cards

Shortest Job Next (SJN)

A scheduling algorithm that selects the ready process with the shortest estimated runtime.

29
New cards

Round Robin Scheduling

A pre-emptive algorithm that cycles through processes, giving each a fixed time slice.

30
New cards

Turnaround Time

Total time from a process’s arrival in the ready state to its completion.

31
New cards

Percent Delay

(Turnaround – Service Time) ÷ Service Time × 100; measures scheduling overhead.

32
New cards

Processor Utilization

Percentage of time the CPU performs useful work rather than idling.

33
New cards

Memory Management

OS techniques that track and allocate main memory to processes safely and efficiently.

34
New cards

Logical Address

An address used in program code, expressed relative to the process’s own space.

35
New cards

Physical Address

The actual location in main memory where data or instructions reside.

36
New cards

Process Isolation

Keeping each process’s memory separate so they cannot interfere with each other.

37
New cards

Single Contiguous Memory Management

A scheme with only the OS and one application in memory at once.

38
New cards

Address Binding

Translating logical addresses to physical addresses during program execution.

39
New cards

Base Register

CPU register holding the starting physical address of the current partition or program.

40
New cards

Bounds (Limit) Register

Register holding the size of the current partition; used for address validity checks.

41
New cards

Partition Memory Management

Dividing memory into regions (partitions) to hold multiple processes simultaneously.

42
New cards

Fixed Partition Scheme

Memory is split into a predetermined set of partitions of fixed sizes.

43
New cards

Dynamic Partition Scheme

Partitions are created on the fly to fit program sizes exactly.

44
New cards

Best-Fit Allocation

Choosing the smallest free partition large enough for a program.

45
New cards

First-Fit Allocation

Choosing the first free partition encountered that is large enough.

46
New cards

Next-Fit Allocation

Continuing the search for a free partition from the last allocation point forward.

47
New cards

Worst-Fit Allocation

Choosing the largest available partition for a program (mainly for dynamic partitions).

48
New cards

Fragmentation

Unusable memory created when free space is broken into small pieces.

49
New cards

Internal Fragmentation

Wasted space inside an allocated partition because it is larger than requested.

50
New cards

External Fragmentation

Total free memory is adequate but split into many small non-contiguous blocks.

51
New cards

Paged Memory Management

Dividing processes into equal-size pages loaded into equally sized frames in memory.

52
New cards

Page

A fixed-size block of a process under paged memory management.

53
New cards

Frame

A fixed-size block of main memory that can hold one page.

54
New cards

Page Management Table (PMT)

Per-process table mapping each page to its frame location.

55
New cards

Demand Paging

Loading pages into memory only when they are actually referenced.

56
New cards

Page Swap

Bringing a page into memory and (usually) writing another page back to disk.

57
New cards

Virtual Memory

The illusion of a large address space because an entire process need not reside in RAM.

58
New cards

Thrashing

Severe performance loss caused by excessive page swapping.

59
New cards

File

A named collection of related data stored on secondary memory.

60
New cards

File System

The OS’s logical organization and management of files and directories.

61
New cards

Directory

A named group (folder) that contains files or other directories.

62
New cards

Text File

File containing human-readable characters (ASCII or Unicode).

63
New cards

Binary File

File storing data in non-textual form, requiring specific programs to read it.

64
New cards

File Type

The kind of information a file stores, such as image or audio.

65
New cards

File Format

The internal structure defining how data is stored in a file.

66
New cards

File Extension

The part of a filename after the last dot indicating its type/format (e.g., .txt, .jpg).

67
New cards

Sequential Access

Retrieving file content strictly in order from beginning to end.

68
New cards

Direct Access

Retrieving data from arbitrary locations within a file using an address or offset.

69
New cards

File Protection

Mechanisms that control which users can access a file and how.

70
New cards

Directory Tree

A hierarchical structure showing nested directories and files.

71
New cards

Root Directory

The top-level directory in a directory tree.

72
New cards

Parent Directory

The directory that directly contains another directory or file.

73
New cards

Subdirectory

A directory contained within another directory.

74
New cards

Working Directory

The directory in which a user or process is currently operating.

75
New cards

Path

A textual description of a file or directory’s location in the tree.

76
New cards

Absolute Path

A path that starts at the root directory.

77
New cards

Relative Path

A path that starts from the current working directory.