Autoplay
Autocomplete
Speed
Previous Lecture
Complete and Continue
Premium Membership
Orientation
1. DO THIS FIRST
2. Accountability meetings
3. Good updates / bad updates
4. Quizzes
Methodology / Observations
Claims and evidence 1: What is a claim? (5:12)
Claims and evidence 2: Incomplete descriptive data (2:41)
Claims and evidence 3: Complete descriptive data (2:04)
Claims and evidence 4: Moving from incomplete to complete (2:02)
The call stack and columns
Quiz: Call stack observations, part 1
Quiz: Call stack observations, part 2
(anonymous)
Quiz: Scope observations, part 1
Quiz: Scope observations, part 2
Quiz: Scope observations, part 3
Don't be misled 1 (8:48)
Claims and evidence 5: Proximity to truth (5:18)
Quiz: this, part 1
this: case 1
Quiz: this, part 2
this: case 2
Quiz: this, part 3
Don't be misled 2 (3:45)
Don't be misled 3 (10:07)
this, case 3
Quiz: this part 4
this, case 4
Methodology / Code reviews
Variable necessity (1:29)
Variable specificity (6:38)
Variable placement and functions (4:22)
Variable placement and loops (7:00)
Implicit versus explicit (13:37)
Process for naming variables (2:15)
todolist.html, naming the todos array (8:17)
todoList.html, naming the todo text property (6:30)
todoList.html, naming the completed property (4:10)
todoList.html, naming the add function (6:17)
todoList.html, naming variables inside of add (7:00)
todoList.html, naming the edit function, simple approach (1:55)
todoList.html, naming the edit function, comprehensive approach (11:47)
todoList.html, naming the edit function, making a decision (6:08)
todoList.html, handleEditClick parameters and variables (9:19)
todoList.html, remaining functions and variables (7:22)
Methodology / Assessments info
Accessing interactive assessments
The code review process (4:02)
If you've passed an assessment already
Methodology / Scientific Writing
Introduction (revised 9/4/21)
Quality control
Nonsense
Inconsistency
Wordiness
Methodology / How to Solve Problems
The right way
Overview
Problem solving toolkit
Mental cues for top-down outlines
Demo: Exchanging values of two variables
A412 / Exchanges 1 / Assessment
A412 / Exchanges 1 / Solution
A462 / Exchanges 2 / Assessment
A462 / Exchanges 2 / Solution
A379 / Middle / Assessment
A379 / Middle / Solution
Describing iterative logic (8:05)
A897 / Grades / Assessment
A897 / Grades / Solution
A115 / Average / Assessment
A115 / Average / Solution
A551 / Simple Series 1 / Assessment
A551 / Simple Series 1 / Solution
A283 / Product / Assessment
A283 / Product / Solution
A837 / Simple Series 2 / Assessment
A837 / Simple Series 2 / Solution
A720 / Exchanges 3 / Assessment
A720 / Exchanges 3 / Solution
A671 / Order / Assessment
A671 / Order / Solution
A657 / Move Last / Assessment
A657 / Move Last / Solution
Methodology / Preparing your mind
1. On reading
2. What can we learn from novelists?
3. A novelist takes on programming
4. A programmer takes on novels
5. Difficulty is blinding
6. The relationship between reading and writing
Methodology / Reading (or how to methodically rip apart a codebase)
1. Initial reading (required, do not skip)
2. jQuery is irrelevant (7:32)
3. The steps (76:34)
4. Event listeners, toggle, delete, filter (71:15)
5. edit, editKeyup, update (53:13)
6. Rendering with templates (42:15)
7. localStorage, init (33:39)
Methodology / Testing (how to write code that makes sure your code works)
1. What is testing? (17:05)
2. forEach, first steps (20:24)
3. forEach, callback arguments (13:49)
4. forEach, optional this (29:09)
5. filter (51:39)
6. map (44:34)
7. reduce, first steps (19:40)
8. reduce, deciphering docs (48:00)
9. reduce, finishing up (103:25)
Methodology / SimpleTest (extending and improving existing code)
1. Error handling, setTimeout (30:46)
2. Constructors, console.log output (58:17)
3. Where we are now (33:44)
Methodology / Testing assessments
Essential code only!! (1:53)
Assessment: find
Methodology / AccountingJS (escape from tutorial land)
1. Introduction to the library (16:26)
2. Approaching docs like a pro (32:46)
3. What are IIFEs? (26:55)
4. IIFEs and sharing data (16:05)
5. Scopes, locals, closures, globals (17:08)
6. librarySystem (44:18)
7. noConflict (30:58)
8. Prototypes, an introduction (15:49)
9. Prototypes and constructors (23:01)
10. isString, !!, and String.prototype (29:26)
11. Remaining internal helper methods (31:38)
12. checkCurrencyFormat (29:53)
13. toFixed and rounding issues (42:19)
14. formatMoney and style (21:53)
15. Recursion, what is it? (38:58)
16. Recursing through the DOM (33:10)
17. Recursively mapping arrays (49:25)
18. Regular expressions, first look (47:25)
19. Regular expression capture groups (23:18)
20. Lookaheads and backreferences (19:31)
21. formatNumber (34:44)
22. unformat, new RegExp (22:33)
23. When Googling goes nowhere (19:27)
24. formatColumn (30:12)
25. Thinking recursively (23:06)
26. Broken tests (42:21)
27. Retrospective (59:33)
Methodology / Performance
Assessment: A function in three ways (3:10)
Solution: A function in three ways
Exercise: Try various inputs
Exercise: Line counting (11:30)
Quiz: Line counting
Discussion: Initial observations (27:33)
Discussion: Extracting a pattern in two ways (26:28)
Exercise: Timing
Timing code (4:17)
Timing analysis (6:45)
Discussion: Finite constraints (25:39)
Discussion: Measuring memory (28:17)
Memory examples, primitives and objects (6:16)
Memory and responsibility (4:25)
Discussion: Worst, best, average (27:52)
Assessment: Arrangements
Assessment: Table observations (5:57)
Gordon's table observations (7:37)
Total cost and individual terms (5:43)
Coefficients (4:33)
Notation (6:38)
Methodology / Underscore (staying calm when there's more code than you can read)
1. Don't read every line of code (7:13)
2. What is Underscore? (7:41)
3. Two minute setup (1:45)
4. Before you start (13:47)
5. Remember main.js? (13:23)
6. main.js event listeners (16:14)
7. Strategically setting breakpoints (26:07)
Discrete Math
Discrete math or "math for computer science"
Discrete math / Lectures 1-9 / Quiz / Set equality
Discrete math / Lectures 1-9 / Bonus / Set equality
Discrete math / Lectures 1-9 / Quiz / Subsets
Discrete math / Lectures 10-15 / Quiz / Logical equivalence 1
Discrete math / Lectures 10-15 / Quiz / Logical equivalence 2
Discrete math / Lectures 16-21 / Quiz / Implications
Discrete math / Lectures 22-29 / Quiz / Quantifiers
Discrete math / Lectures 30-41 / Quiz / Proofs
Discrete math / Lectures 42-44 / Quiz / Summations
Discrete math / Lectures 45-49 / Quiz / Recursion
Discrete math / Lectures 50-55 / Quiz / Set theory
Discrete math / Lectures 56-59 / Quiz / Relations
Discrete math / Lectures 60-75 / Quiz / Strings
Discrete math / Lectures 76-82 / Quiz / Graphs
Algorithms and Data Structures
Algorithms / Resources (updated on 3/8/2021)
Algorithms / How to study
Algorithms / Assessment / Input and output
Algorithms / Assessment / Insertion sort
Algorithms / Assessment / Nearest neighbor
Algorithms / Assessment / Closed tours
Algorithms / Assessment / Chains
7. reduce, first steps
Lecture content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock