Lecture slides, illustrated readings and worked examples.
Computer engineering; transistors, logic gates and memory; binary and hexadecimal; character and signal representation; numeric limits and storage.
Interpret representations through worked examples, including signed arithmetic, overflow and floating point. Introduce the Arduino kit and its role in the course.
Read Week 1 → · Slides (PDF · 76 pages) ↓
Lecture overview →CPU, registers and memory; stored programs and the instruction cycle; I/O, buses, DMA and communication.
Decode and trace VizMachine instructions; distinguish values from addresses; examine branches, byte copying and bit masks.
Read Week 2 → · Slides (PDF · 63 pages) ↓
Lecture overview →Problem formulation, flowcharts and pseudocode; sequence, selection and repetition; correctness and termination, with a first look at efficiency.
Trace display output, decisions and loops in VizMachine; connect algorithm descriptions to readable assembly and a short C preview.
Read Week 3 → · Slides (PDF · 62 pages) ↓
Lecture overview →Processes and cores; scheduling, context switching and interrupts; concurrency and parallelism; OS services, startup and protection.
Use the mechanic-shop analogy and saved execution state to explain CPU sharing and process resumption.
Read Week 4 → · Slides (PDF · 32 pages) ↓
Lecture overview →Language abstraction and paradigms; syntax and meaning; compilation, interpretation, bytecode, linking and portability.
Read and test C variables, types, expressions and formatted output; compare integer and floating-point division and trace a supplied loop.
Read Week 5 → · Slides (PDF · 91 pages) ↓
Lecture overview →Sensors and actuators; sampling and quantization; noise, calibration, feedback, hysteresis, timing and embedded-system tradeoffs.
Trace C conditions and loops and explain an Arduino onboard-LED sketch. Button input and additional state examples are optional extensions.
Read Week 6 → · Slides (PDF · 69 pages) ↓
Lecture overview →Requirements, decomposition, interfaces, testing, validation and maintenance; designing software around observable behavior.
Use functions, parameters and return values; traverse a one-dimensional array and check its bounds. Higher-dimensional diagrams provide context for Week 8.
Read Week 7 → · Slides (PDF · 75 pages) ↓
Lecture overview →Compare linear and binary search, insertion sort, correctness and termination; explain growth in work and time/memory tradeoffs.
Revisit one-dimensional traversal, then trace rows, columns, nested loops and boundary checks in a two-dimensional array.
Read Week 8 → · Slides (PDF · 67 pages) ↓
Lecture overview →Circuit and packet switching; network organization, addressing, routing, protocol layers and transport services.
Trace C addresses and pointer arguments; distinguish array capacity from string length and process a bounded text buffer safely.
Read Week 9 → · Slides (PDF · 75 pages) ↓
Lecture overview →ARPANET and Internet development; clients and servers, URLs, DNS, HTTP, browser resources and caching.
Read, process and write text files in C; check opening, conversion, end-of-file and output failures using supplied or recorded readings.
Read Week 10 → · Slides (PDF · 100 pages) ↓
Lecture overview →Database systems, relations, keys and queries; consistency, transactions, indexes and access to shared information.
Use C structs and record arrays; search, update, save and reload records. Compare unions and binary storage briefly, and revisit sorted search from Week 8.
Read Week 11 → · Slides (PDF · 93 pages) ↓
Lecture overview →AI history, symbolic search, expert systems, machine learning, neural networks and generative models; evaluation and limitations.
Trace linked lists and their pointer operations; compare stacks, queues and tree representations. Guided implementation remains focused on the supplied singly linked list.
Read Week 12 → · Slides (PDF · 99 pages) ↓
Lecture overview →Security objectives and threats; encryption, hashes, authentication, signatures, certificates, TLS and privacy.
Follow a C/Arduino data path from acquisition through validation and computation to PC logging; reason about failed and rejected inputs.
Read Week 13 → · Slides (PDF · 67 pages) ↓
Lecture overview →Connect representation, architecture, operating systems, algorithms, software design, data organization, networks, AI and security.
Explain short C traces and diagnose an Arduino-to-PC data path; use questions and existing quiz activities to consolidate earlier learning.
Read Week 14 → · Slides (PDF · 38 pages) ↓
Lecture overview →Wednesday recitation supports the lecture. Friday lab sheets, prelabs and reports are on the CSE107 lab page.