OS

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

1/49

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 2:37 PM on 9/26/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

50 Terms

1
New cards

OS

an intermediary interface between user(s), software and

computer hardware.

2
New cards

1940s–1950s

No OS, programs loaded manually with punch cards

3
New cards

1960s

IBM OS/360 introduced batch processing

4
New cards

1970s–1980s

Multiprogramming & Time-Sharing introduced

5
New cards

1980s–1990s

Graphical User Interfaces (GUIs)

6
New cards

IBM OS 360

First family purpose computer & designed to be general purpose

7
New cards

Batch Operating System

Users submit jobs to an operator, who groups similar jobs and runs them together. Users do not interact directly with the computer.

8
New cards

Batch Operating System (—)

➢ Time Consuming

➢ Jobs are collected, grouped, and run sequentially (used in IBM OS/360)

➢ Priority/less priority categorization can’t be done

9
New cards

Multiprogramming Operating System

multiple programs run

in memory at the same time. The CPU switches between

programs, and reduces CPU response time.

10
New cards

Time-Sharing (Multitasking) Operating System

Multiple jobs are executed by the CPU by switching between them, but the

switches occur so frequently. Thus, the user can receive an immediate

response. Time quantum(TQ) introduced.

Example: Linux, MacOS, Windows

11
New cards

Multiprocessing Operating System (DOS)

In Multiprocessing OS, multiple CPU is used to execute multiple jobs.

12
New cards

RTOS

The Real-time Operating System (RTOS) is a type of operating system

that is designed to meet strict time constraints, with a guaranteed response

time for critical tasks.

13
New cards

RTOS are divided into 2 categories:

Soft RTOS:

It is mostly used when execution time(ET) is not so important

Example: Computer games, multimedia devices.


Hard RTOS:

When execution time is strict, and can’t be delayed.

Example: Air traffic, surgery, etc.

14
New cards

Distributed Operating System (DOS)

in this system multiple computers work together and share resources as if they were a single computer.

15
New cards

Network Operating System (NOS)

Network Operating System (NOS) is

a specialized operating system designed to

manage network resources, data, users,

groups, and applications across multiple

computers.

Example: Microsoft Windows Server

16
New cards

NOS and DOS difference

NOS connects separate computers, while DOS makes separate computers appear to be one unified computer system.

17
New cards

CLI

Command-line Interface/console

18
New cards

GUI

Graphical User Interface (Windows, MacOS)

19
New cards

Functions of Operating Systems

  • Process, Memory, Device, File System Management

  • Security and Access Control

  • User Interface (CLI / GUI)

  • Networking and Communication


20
New cards

32-bit and 64-bit Operating Systems

These types of processors tell us how much memory a processor can access from a CPU register.

For instance,

➢ A 32-bit system can access 2**32 different memory addresses. Ex: 4 GB of RAM or physical memory. Ideally, it can access more than 4 GB of RAM also.

➢ A 64-bit system can access 264 different memory addresses. Ex: 16 million TB (4 billion times more than 32-bit) of RAM. In short, any amount of memory greater than 4 GB can be easily handled by it

21
New cards

Kernel

is a core/heart of any Operating System. (It is the first program that’s loaded by

the bootloader when computer is turned on.)

22
New cards

Monolithic Kernel

OS services run in kernel space as a single large process.

Examples: Unix, Linux

23
New cards

Monolithic Kernel (+ and —)

Advantage: Execution time (ET) & CPU response time are very fast.

Disadvntage: Less reliable (a failure of one task can crash the entire system)

24
New cards

Micro kernel

Micro kernel consists of kernel level and user level tasks.

Note: Micro kernel is not fast as Monolithic kernel, but it is more reliable and

stable.

25
New cards

Hybrid Kernel

Hybrid kernel = Monolithic (speed) + Micro kernel (stable)

Hybrid kernel is both fast like monolithic and stable like Micro kernel.

26
New cards

Exo Kernel

The main idea behind Exo kernel is to let applications directly access to hardware resources Like CPU, I/O devices and memory management, etc.

(+) — fast

(—) — Harder to develop, security can be more difficult

27
New cards

Nano Kernel

➢ minimal kernel with only essential functions

➢ Used in systems requiring extremely small and fast kernel layers

28
New cards

ASCII stands for

“American Standard Code for Information Interchange”.

ASCII is a 7-bit character encoding standard that represents 128 characters using numbers from 0 to 127.

29
New cards

UTF-8

a variable-length character encoding that represents Unicode characters using 1–4 bytes. It is backward-compatible with ASCII.

30
New cards

System call

System call is a mechanism that allows a program to request a service from the operating system (OS). It translates commands into OS-level instructions.

31
New cards

Shell

Shell is a program that provides an interface between user and operating system.

32
New cards

CLI (Command Line) Shells

A CLI shell is a program that allows users to interact with an operating system by typing text commands instead of using a graphical interface.

Examples: Cmd.exe, Powershell, Bash, Sh, Zsh.

33
New cards

GUI (Graphical) Shells

GUI (Graphical) Shells are software interfaces that allow user interact with an operating system using buttons, icons, menus, etc.

Examples: Windows Explorer (File Explorer), macOS Finder, etc.

34
New cards

CPU scheduling

CPU scheduling is a process in which OS will decide which task / process is going to utilize CPU at a particular time.

35
New cards

Non-preemptive

process will leave the CPU with its own will, cannot be interrupted

36
New cards

Preemptive

Preemptive means that a process can be interrupted during execution

37
New cards

Arrival Time

point of time at which process enters Ready state or queue

38
New cards

Burst Time

duration of process inside the CPU

39
New cards

Turn Around Time

CT - AT
Amount of time spent by the process from its arrival till its completion time.

40
New cards

Waiting Time

TAT - BT

41
New cards

Process Lifecycle

  • Ready → Run


  • Run → Terminated


  • Run → Waiting


  • Waiting → Ready


<ul><li><p><strong>Ready</strong> <span style="line-height: 1.15;">→ </span><strong>Run</strong></p><p></p></li><li><p><strong>Run</strong> <span style="line-height: 1.15;">→</span> <strong>Terminated</strong></p><p></p></li><li><p><strong>Run</strong> → <strong>Waiting</strong></p><p></p></li><li><p><strong>Waiting</strong> <span style="line-height: 1.15;">→</span> <strong>Ready</strong></p></li></ul><p></p>
42
New cards

response ratio

(WT+BT)/BT

43
New cards

diagram of a boot process

Power ON → BIOS/UEFI → POST → GRUB → Operating System

<p>Power ON → BIOS/UEFI → POST → GRUB → Operating System</p>
44
New cards

post in boot process

POST in the boot process stands for Power-On Self-Test.

It is the initial hardware check performed by the computer's firmware (BIOS/UEFI) immediately after you turn it on.

45
New cards

BIOS/UEFI

starts the computer and prepares the hardware before the operating system loads.

46
New cards

GRUB

is a bootloader that starts the operating system after BIOS/UEFI has finished its job.

47
New cards

Deadlock

Deadlock is a phenomenon in OS when 2 or more processes are

waiting each other forever (stuck/no progress) and none of them

can be completed

It happens when each process

is holding a resource that needs each other.

48
New cards

4 necessary conditions for Deadlock

1. Mutual Exclusion (only 1 process can use a resource at a time)

2. Hold and Wait (process is holding one resource and waiting for

another)

3. No Preemption (processes can’t be interrupted; must be

released voluntarily)

4. Circular Wait (a circular chain of 2+processes should exist)

Mutual Exclusion + Hold and Wait + No Preemption + Circular Wait = Deadlock

49
New cards

How to handle Deadlocks

1. Break Coffman Condition (avoid at least 1 of the 4 conditions)

2. Deadlock Avoidance (if a process needs 2 resources, it must

request both resources together, aka Banker’s algorithm. Example,

banks giving a loan to good creditors).

3. Eliminate “No Preemption” (OS can take away (preempt) the held

resources and give them to another process)


Example: If Process P1 holds the printer and now requests the scanner

(which is busy),

→ OS takes back the printer from P1 and gives it to someone else.

P1 will retry later.

50
New cards

Resource Allocation Graphs (RAG)

RAG

<p>RAG</p>