CS110A Week 3 Day 1 lesson on 09/01/2026

Overview

Indika Walimuni uses a coffee-making example to explain abstraction and black-box diagrams, then reviews how storage, RAM, CPU cache, and computer categories fit into basic computer architecture. The lesson moves into number representation and conversion, covering place value, binary, octal, hexadecimal, repeated division, and four-bit binary-to-hex grouping.

Key takeaways

A black-box diagram represents a function through its inputs, named process, and outputs; for “Make coffee,” users care about the finished cup rather than the hidden recipe.
More RAM can improve performance by reducing repeated reads from slower storage, while swapping to disk when RAM fills can cause a noticeable slowdown.
CPU cache improves access to frequently reused data by keeping it closer to the processor than RAM, with L1, L2, and L3 as common cache levels.
Place-value notation expresses each digit as a coefficient multiplied by a base raised to its position, as shown by 1,234.12 = 1×10³ + 2×10² + 3×10¹ + 4×10⁰ + 1×10⁻¹ + 2×10⁻².
Repeated division converts a decimal integer to a target base: 13₁₀ becomes 15₈ by dividing by 8 and reading the remainders in reverse order.
Binary-to-hexadecimal conversion is efficient because each hexadecimal digit corresponds exactly to a four-bit group; pad an incomplete leading group with zeros.

Chapters

0:00 Coffee Making as a Black-Box Abstraction

The class models the action as a function named “Make coffee,” putting the verb first to match a software function.
Inputs include coffee beans or powder, hot water, a cup, and optional sugar and milk or cream; the output is a cup of coffee.
A black-box diagram shows inputs entering a process and an output leaving, while hiding the implementation from the user.
The recipe is the internal algorithm, but a customer at Starbucks mainly cares that the resulting coffee meets their needs.

13:00 Why Programs Load Data from Drives into RAM

Programs load data from a hard drive or solid-state drive into RAM before the CPU processes it.
The lesson contrasts the CPU’s speed with slower storage access, explaining why directly fetching each piece from a drive creates delays.
RAM is faster working storage, while a drive provides larger-capacity persistent storage.

16:30 More RAM Reduces Repeated Drive Access

An animation compares computers with the same CPU and drive but different amounts of memory.
The higher-memory machine can load a larger data chunk at once, reducing repeated slow reads from the drive.
When RAM fills, an operating system can use disk space as swap; because that space is still on a drive, performance can drop substantially.

25:00 CPU Cache Keeps Frequently Used Data Close

CPU cache is presented as a small, fast storage area near or inside the processor, with commonly named levels including L1, L2, and L3.
The CPU may keep repeatedly used data in cache to avoid fetching it from RAM again.
Browser caching provides a related example: keeping frequently needed page data locally can reduce repeated requests and improve loading speed.

32:30 Volatile RAM and Persistent Flash Storage

RAM is volatile: its contents are lost when the computer loses power.
Hard drives and USB flash drives are nonvolatile storage, retaining files without continuous power.
The discussion distinguishes temporary working memory from storage intended to preserve data between sessions.

38:00 Personal, Server, and Embedded Computers

Desktop PCs, laptops, tablets, and smartphones are identified as personal computers; modern phones can have substantial processing power.
Server computers are commonly installed in racks and can be expanded or replaced as modular units.
Embedded computers perform specialized tasks inside devices such as cars, refrigerators, washing machines, and robotic vacuums.
Internet of Things devices connect embedded systems to networks, allowing appliances to be controlled through apps.

43:30 Moore’s Law and Physical Limits on Chip Scaling

The class discusses Moore’s law as a trend in the growth of transistor counts on integrated circuits.
Parallel processing and 3D chip structures are presented as ways the industry has continued scaling computing capacity.
Smaller transistors bring challenges including leakage current and heat, increasing the cooling and power demands of processors and data centers.

50:00 Break, TA Introduction, and Course Access

Indika Walimuni introduces Cody as a CS110A teaching assistant who took the course in spring 2025.
Newly enrolled students may need to wait for Canvas access to update after registration.
The class is still working through conceptual material in Modules 2 and 3, before moving into programming topics.

58:30 Place Value in the Decimal Number 1,234.12

A recorded lesson from around 2020 expands 1,234.12 into 1,000 + 200 + 30 + 4 + 0.1 + 0.02.
Each place can be written as a digit multiplied by a power of ten, from 10³ for the thousands place to 10⁻² for the hundredths place.
The value of a digit depends on its position, with significance increasing from right to left in the integer portion.

1:03:00 Moore’s Law, Clock Speeds, and the Growth Curve

The class examines a transistor-count timeline and explains that plotting a logarithmic scale can make exponential growth appear approximately linear.
CPU clock-frequency growth is shown leveling off around the mid-2000s, unlike the earlier upward trend.
The discussion connects continued scaling to alternatives such as parallel processing and 3D chip design.

1:06:00 Quantum Computing’s Engineering and Algorithm Challenges

Quantum processors require extremely low temperatures to preserve their quantum states; the class discusses cooling near absolute zero with helium-based systems.
The specialized cooling equipment and expensive coolant are described as practical barriers to broad deployment.
The lesson also notes that implementing useful mathematical operations and algorithms on quantum hardware remains an active research challenge.

1:10:00 Binary Place Value and Converting Between Bases

Binary uses base 2, so each digit position represents a power of 2, just as decimal positions represent powers of 10.
The class reviews converting binary to decimal by adding the values represented by its occupied place positions.
For conversion between bases without a direct shortcut, the lesson proposes converting through decimal as an intermediate step.

1:12:00 Convert Binary to Octal Through Decimal

To convert a binary value to octal using the method taught, first find its decimal value and then convert that decimal value to base 8.
The worked example treats 1101₂ as 13₁₀, then uses repeated division by 8 to obtain 15₈.
The divisor in repeated division is the target base, and the remainders are read in reverse order.

1:15:45 Repeated Division for Decimal-to-Base Conversion

Repeated division converts a decimal integer to another base by dividing by the target base until the quotient reaches zero.
For 13₁₀ to base 8, division produces remainders 5 and 1, which are read upward as 15₈.
The same procedure works for converting decimal integers to binary, octal, or another specified base.

1:19:45 Class Practice Converting Decimal Values to Binary

Students begin a challenge activity converting decimal values into binary using the repeated-division technique.
The exercise reinforces that binary digits are limited to 0 and 1, with each successive position representing a higher power of 2.
The class uses the activity to practice the conversion procedure collaboratively.

1:21:15 Hexadecimal Digits and the Value of F

Hexadecimal is base 16 and uses the symbols 0 to 9 followed by A–F for values 10 to 15.
The example shows that decimal 15 is represented by F₁₆ and binary 1111₂.
Four binary digits represent one hexadecimal digit because a four-bit group ranges from 0000₂ through 1111₂.

1:27:00 Convert Binary to Hexadecimal in Four-Bit Groups

To convert binary to hexadecimal, group the bits from right to left in sets of four.
If the leftmost group has fewer than four bits, add leading zeros without changing the number’s value.
Each four-bit group maps to one hexadecimal digit using a binary-to-hex table; the example identifies C7₁₆ from its grouped bits.

1:29:20 Hexadecimal Conversion Practice and Color Codes

Students use the four-bit lookup table to convert binary groups into hexadecimal digits without repeating full decimal calculations.
The examples include hexadecimal values such as F0 and demonstrate mapping groups of four bits to digits.
Hexadecimal color codes used on the internet are introduced as a practical application of base 16.

1:31:30 Paired Base-Conversion Activity and Follow-Up

Students are assigned a paired activity in Module 2 involving calculations that convert numbers between bases.
Solutions may be submitted as typed work or as a photograph of calculations on paper.
The activity and discussion work are due Saturday; Indika Walimuni plans to review conversion questions in the next class.

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, indika walimuni.