(1ST TERM) COMSCI 2100 - Operating System

5.0(1)
studied byStudied by 6 people
5.0(1)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/96

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

97 Terms

1
New cards
Operating System
The **most important software** that runs on a computer which **manages computer system** hardware and software, memory, and processes of the software.

\
It is a group of programs that **allow a user to control and communicate with a computer.**
2
New cards
Software

Hardware
Two parts of a Computer System
3
New cards
Software
The **intangible** part of the computer system (e.g., programs, application).
4
New cards
Hardware
The **tangible** part of the computer system (e.g., physical machine and electronic).
5
New cards
True
**True or False**. Operating system is a ***software*** part of the computer system.
6
New cards
Microsoft Windows

macOS

Linux

Android

iOS
Commonly used operating systems
7
New cards
Memory Manager

Processor Manager

Device Manager

File Manager

Network Manager
5 Essential Managers of Operating System
8
New cards
Manager
It **monitors its resources continuously**. It enforces the policies that determine who gets what, when and how much. It allocates and deallocates the resource when appropriate.
9
New cards
Mainframe

Minicomputer

Supercomputer

Microcomputer

Server
5 History of Machine Hardware
10
New cards
Mainframe
It is a large machine – in size and in internal memory capacity.
11
New cards
IBM 360 (1964)
a classic example of an early mainframe
12
New cards
IBM 360 model 30
It requires an air-conditioned room about 18 feet square. Its CPU was 5 feet high and 6 feet wide. Its internal memory has 64K.
13
New cards
$200 000
How much did IBM 360 model 30 cost?
14
New cards
Minicomputer
It was developed to **meet the needs of smaller institutions.** It is smaller in size and memory capacity. It is cheaper.
15
New cards
Midrange Computers
Minicomputer is also iknown as _____.
16
New cards
Digital Equipment Corp. (early 1970)
example of minicomputer that only costs less than $18000
17
New cards
Supercomputer
It is a **massive machine**. It was developed primarily for government applications. It is for ***military operations*** and ***weather forecasting***. Its uses include: scientific research and customer support or product development.
18
New cards
Cray supercomputer
example of supercomputer that has 6 to 1000 processors
19
New cards
microcomputer
It is developed for **single users** in the laet 1970s. Its physical size was smaller than the minicomputers.
20
New cards
Microcomputers by Tandy Corporation and Apple Computer, Inc.
example of microcomputer
21
New cards
\- Single-user status
Microcomputer’s distinguishing characteristic
22
New cards
Workstations
It is the **most poweful microcomputers**. It is developed for commercial, educational, and government enterprises. It is networked together.

\
It supports engineering and technical users.
23
New cards
Servers
These are **powerful computers that provide specialized services** to other computers on client/server networks.
24
New cards
Print servers

Internet servers

Mail servers
examples of servers
25
New cards
Batch System

Interactive

Real-time

Hybrid

Embedded
Five types/categories of Operating System
26
New cards
Batch systems
It dates from the earliest computers, when they relied on s**tacks of punched cards** or reels of magnetic tape for input.

\
Jobs were entered by assembling the cards into a deck and running the entire deck of cards through a card reader as a group—a batch.
27
New cards
Throughput
the number of jobs completed in a given amount of time
28
New cards
Throughput
The efficiency of a batch system is measured in _________.
29
New cards
Interactive Systems
It gives a **faster turnaround than batch system**, but are slower than real-time systems. They were introduced to satisfy the demands of users who needed fast turnaround when debugging their programs.

\
It required the development of time-sharing software. It provides **immediate feedback to the user** and response time can be measured in fractions of a second.
30
New cards
turnaround
the time it took for the jobs/processes to do their tasks
31
New cards
millisecond
fractions of a second.
32
New cards
Real-time systems
It is used in **time-critical environments** where reliability is key and data must be processed within a strict time limit. They must meet the deadline or risk significant consequences.

\
They must be 100% responsive, 100% of the time.
33
New cards
Hard real-time systems

Soft real-time systems
Two Types of Real-Time Systems
34
New cards
Hard real-time systems
They risk **total system failure** if the predicted time deadline is missed.
35
New cards
Soft real-time systems
They **suffer performance degradation**, but not total system failure, as a consequence of a missed deadline.
36
New cards
Hybrid Systems
It is a **combination of batch and interactive**. Its users can access the system and get fast responses. It accepts and runs batch programs in the background when the interactive load is light.

\
It takes **advantage of the free time** between high-demand usage of the system and low-demand times
37
New cards
Embedded systems
Computers placed inside other products to add features and capabilities.

\
This permits the designers to **make the operating system more efficient** and **take advantage of the computer’s limited resources, such as memory**, to their maximum.
38
New cards
False
__**True or False**__. Each embedded system is designed to perform a set of specific programs, which are interchangeable among systems.
39
New cards
1940s: first generation
__**Year of OS Dev.**__ There is **no operating system**. Computers are based on **vacuum tube technology**. All instructions are performed manually. It has poor machine utilization. Computers are the size of the classrooms.
40
New cards
Dr. Grace Hopper
Who discovered a bug on Harvard’s Mark I in 1945?
41
New cards
Moth
What kind of bug is discovered on Harvard’s Mark I in 1945?
42
New cards
1950s: second generation
__**Year of OS Dev.**__ It focused on the **cost-effectiveness of the system**. It is developed **for government and business researchers.** Computers were expensive (IBM 360). There are **expensive time lags between CPU and I/O devices**.
43
New cards
Computer operators were hired to facilitate machine operation

Concept of job scheduling
Two widely adopted improvements in 1950s
44
New cards
Job Scheduling
It is the concept of **grouping together programs** with similar requirements. It introduced the need for **control cards.**
45
New cards
1960s: third generation
__**Year of OS Dev.**__ It has **faster CPUs.** Speeds caused problems when they interacted with slower I/O devices. The concept of **multiprogramming** was introduced.
46
New cards
multiprogramming
In 1960s, It introduced the concept of **loading many program**s at one time and sharing the attention of a single CPU.
47
New cards
interrupt
The most common mechanism for implementing multiprogramming was the introduction of the concept of the ___________.
48
New cards
Active multiprogramming

Passive multiprogramming
Two types of multiprogramming
49
New cards
Active multiprogramming
It occurs when the operating system i**nterrupts a job process**
50
New cards
Passive multiprogramming
The operating system **didn’t control the interrupt**s but **waited** for each job to end an execution sequence .
51
New cards
1970s
__**Year of OS Dev.**__ There are main memory physical capacity limitations (multiprogramming increased CPU usage), which was solved by **virtual memory**. The **database management software** was introduved. The **programs started using English-like words**, modular structures, and standard operations
52
New cards
Database management software
It organized data in an integrated manner, minimized redundancy, and simplified updating and access of data
53
New cards
1980s
__**Year of OS Dev.**__ **Cost/performance ratio** improvement of computer components. There are **more flexible hardware**, with logical functions built on easily replaceable circuit boards. **Firmware and Multiprocessing** were introduced.
54
New cards
Firmware
Introduced in 1970s, it indicates that a program is **permanently held in read-only memory (ROM)**
55
New cards
Multiprocessing
Introduced in 1970s, it means having more than one processor. More complex languages were designed to coordinate the activities of the **multiple processors servicing a single job.**
56
New cards
1990s
__**Year of OS Dev.**__ **Internet capability** sparked the proliferation of **networking capability.** The WWW made the Internet accessible. It introduced a **proliferation of multimedia applications** demanding additional power, flexibility, and device compatibility for most operating systems
57
New cards
Tim Berners-Lee
In 1990s, who made the WWW?
58
New cards
World Wide Web
Meaning of WWW
59
New cards
2000s
__**Year of OS Dev.**__ It supports: multimedia application, Internet and Web access, and Client/Server computing. It increased CPU speed, has high-speed network attachments, and increased number of storage devices. It introduces **virtualization.**
60
New cards
Object-oriented design
The way the components of the OS are programmed and organized, specifically the use of ________, and and the reorganization of the operating system’s nucleus.
61
New cards
kernel
It is the **operating system’s nucleus**. It is a part of the OS that **resides in memory at all times**, performs the **most essential** operating system **tasks**, and is protected by hardware from user tampering.
62
New cards
Early OS loaded its **entirety into main memory**. 

Object-oriented OS load only **critical elements into main mamory** and **call other objects as needed.**
Early OS loaded its **entirety into main memory**.

Object-oriented OS load only **critical elements into main mamory** and **call other objects as needed.**
Difference between Early OS and Object-Oriented OS
63
New cards
Memory Management
It refers to how computers **manage their main memory.**

\
It keeps the **resources** that the CPUs can **immediately access.**
64
New cards
Access Memory

Random Access Memory (RAM)

Core Memory

Primary Storage
4 Types of Memory Manager
65
New cards
Single-user contiguous scheme

Fixed partitions

Dynamic partitions

Relocatable dynamic partitions
4 Early Memory Allocation Schemes
66
New cards
Single-user Contiguous Scheme
This early moment allocation scheme requires a **minimal amount of work** done by the operating system's memory manager.

\
Program was loaded in its **entirety into memory** and allocated as much **contiguous space in memory** as needed.
67
New cards
False
__**True or False**__. Single-user contiguous scheme permits multiprogramming.
68
New cards
Sequentially
In ***single-user contiguous scheme***, jobs are processed _______ in a single-user system.
69
New cards
Static Partitions
***Fixed partition*** is also called as _______.
70
New cards
Fixed Partition
This early memory allocation scheme is where the main memory is **partitioned** (equal or unequal), with **one job in each partition**.
71
New cards
shut down, reconfigured, and restarted
In ***fixed partition***, its sizes remain static unless and until the computer system is _______.
72
New cards
Protection of the job’s memory space

Matching job size with partition size
The Two Requirements of Fixed partition
73
New cards
True
__**True or False**__. ***Fixed partition*** permits multiprogramming.
74
New cards
Dynamic Partition
This early memory allocation scheme has its memory divided into **variable-sized partitions** based on the **size of the process**
75
New cards
First-Fit Memory Allocation

Best-Fit Memory Allocation
Two job allocation methods of Dynamic Partition
76
New cards
First-Fit Memory Allocation
A job allocation method of dynamic partition where the **first** partition **fits** the requirements.
77
New cards
Best-Fit Memory Allocation
A job allocation methods of dynamic partition where the **smallest** partition fits the requirements.

\
**Internal fragmentation** is **reduced**, but not eliminated.
78
New cards
Speed
__**Space or Speed.**__ The major aspect of first-fit memory allocation.
79
New cards
Space
__**Space or Speed.**__ The major aspect of best-fit memory allocation.
80
New cards
Deallocation
It is the **process of freeing** an allocated memory space.
81
New cards
Resets the status of the memory block to “free”
Deallocation method for fixed-partition system
82
New cards
Case 1: Joining Two Free Blocks

Case 2: Joining Three Free Blocks

Case 3: Deallocating an Isolated Block
Deallocation method for dynamic partition system
83
New cards
Relocatable Dynamic Partitions
Memory Manager relocates **programs to gather together** **all of the empty blocks and compact them** to make one block of memory, large enough to accommodate some or all of the jobs waiting to get in
84
New cards
Garbage collection or Defragmentation
The **compaction of memory**, sometimes referred to as ___________, is performed by the operating system to reclaim fragmented sections of the memory space
85
New cards
Virtual Memory
A **storage method** that gives the user the impression that their **main memory is quite large**, this approach allows them to **load larger size programs than the primary memory** that is accessible.
86
New cards
Enhanced level of multiprogramming which will then increase CPU consumption
Effect of using virtual memory
87
New cards
Paging
It is a storage mechanism used to **retrieve processes.**
88
New cards
Pages
In paging, the main memory is divided into small blocks called ______.
89
New cards
Equal
It is very important to have pages and frames which are of _______ sizes which are very useful for mapping and complete utilization of memory.
90
New cards
Mapping

Complete utilization of memory
Pages and frames which are of equal sizes are very useful for _____ and ________.
91
New cards
Demand Paging
A condition occurred in the virtual memory where the pages of the processes are **stored in the secondary memory** and the page is brought to the **main memory when required**.

\
It is the process of calling the pages to main memory from secondary memory upon demand
92
New cards
Page Replacement Algorithms
In demand paging, the pages are brought to the main memory when required by the _______.
93
New cards
First In First Out (FIFO) Replacement Algorithm

Least Recently Used (LRU) Replacement Algorithm
2 Page Replacement Algorithms
94
New cards
Page Fault
It occurs when a program tries to access a memory page that is **not present** in the memory.
95
New cards
Page Hit
It occurs when a program tries to access a memory page that is **already present** in the memory.
96
New cards
First In First Out (FIFO) Algorithm
This is the **simplest** page replacement algorithm.

\
The policy is to **remove** the pages that have been in memory **the longest**.
97
New cards
Least Recently Used (LRU) Replacement Algorithm
In this algorithm, the page will be replaced which is **least recently used.**

\
Page replacement policy swaps out the pages that show the **least amount of recent activity,** figuring that these pages are the least likely to be used again in the immediate future.