Computer Science: The Good Parts
summary
Asserts that a four-year CS degree is unnecessary for practical CS and demonstrates concrete exercises and results: implement a minimal list in Ruby, contrast a linear search with O(n) vs O(log n) vs O(n^2), build a binary tree and model graphs for shortest paths, cite Atom’s divide-and-conquer speedup, and point to real systems where software mattered—the Curiosity landing works because of Margaret Hamilton’s priority threading and Grace Hopper’s original “moth” bug.
AI-written summary · about
chapters (11)
- 0:00Start
- 3:59Data Structures
- 5:34Linked List
- 7:18Binary Tree
- 9:16Graph
- 13:13Algorithms
- 15:17Margaret Hamilton
- 16:24Complexity
- 21:54The Future
- 22:25Alan Turing
- 24:58Grace Hopper
related talks
33mFun, Friendly Computer Science
30mComputer science you might (not) want to know
41mI Took Computer Science College “That Way”. Now What?
56mKeynote: Rethinking Computer Science Education
35mHow Much CompSci Can Go Teach
43mNon-linear paths to tech are the new black!
53mKeynote: Computer Science Education for the Next Generation
27mTech Parents Do's and Don'ts for Teaching Your Kids Programming