Menu / Introduction to EECS I / Mini-lecture Videos

Videos:

Week 1

• 01.01: prog.eval (Interpreters, Environments, and Evaluation)
• 01.02: prog.procedures (Procedures)
• 01.03: prog.lists (Lists)
• 01.04: prog.listComprehensions (List Comprehensions)
• 01.05: prog.classesInstances (Classes and Instances)
• 01.06: prog.methods (Methods)
• 01.07: prog.initMethods (The __init__ Method)
• 01.08: prog.timeClass (Class for representing and manipulating times)
• 01.09: prog.inheritance (Inheritance in object-oriented programming)
• 01.10: prog.listOperations (Operations on lists)
• 01.11: prog.proceduresAreFirstClass (Procedures can be passed as arguments or returned as values from other procedures)
• 01.12: prog.recursion (Iterative and tree recursion on integers)
• 01.13: prog.structuralRecursion (Recursion on nested-list structure)

Week 2

• 02.01: search.intro (Introduction to search problem formulation)
• 02.02: search.dfsbfs (Depth-first and breadth-first search order)
• 02.03: search.pruning (Simple pruning and dynamic programming make search more efficient)

Week 3

• 03.01: search.ucs (Adding costs: uniform cost search)
• 03.02: search.heuristic (Focusing search with a heuristic)

Week 4

• 04.01: sm.primitives (Primitive state machines; turnstile example)
• 04.02: sm.primitives2 (Primitive state machines: accumulator example)
• 04.03: sm.python (Representing state machines in Python)
• 04.04: sm.combinations (Cascade and parallel combination of SMs)
• 04.05: sm.feedback (Feedback operation on SMs)
• 04.06: sys.lti (Introduction to LTI systems)
• 04.07: sys.signals (Signals are infinite sequences)
• 04.08: sys.blockDiagrams (Block diagrams show operations on signals)
• 04.09: sys.operatorAlgebra (Manipulating operator expressions)
• 04.10: sys.feedback (Systems with feedback)
• 04.11: sys.combination (Combining system definitions to get a single system)

Week 5

• 05.01: sys.systemFunctions (System functions and composition)
• 05.02: sys.firstOrderSystems (Single mode generates exponential US response)
• 05.03: sys.secondOrderSystems (Additive decomposition; dominant mode)
• 05.04: sys.complexPoles.1 (Poles can be complex; exponentiation. (Sorry for the failure to clip...I'll re-record this week!))
• 05.05: sys.complexPoles.2 (Exponential magnitude, linear angle; periodic)
• 05.06: sys.findingPoles (Roots of denominator in z = 1/R. (Another clipping failure...it was late ;-) )
• 05.07: sys.convergence (Convergence properties of unit-sample response)
• 05.08: sys.superposition (Superposition and response to transient signals)
• 05.09: sys.rootLocus (Effect of changing gain on the poles of a system, and hence its behavior)

Week 7

• 07.01: circ.conservationLaws (Conservation laws: KCL and KVL)
• 07.02: circ.components (Components: Resistors, voltage sources, and current sources)
• 07.03: circ.seriesParallel (Series and parallel combinations of resistors)
• 07.04: circ.dividers (Voltage and current dividers)
• 07.05: circ.loading (Loading effects)
• 07.06: circ.nvcc (NVCC method for systematically solving any circuit)
• 07.07: circ.onePort (One-port abstraction of linear circuits)
• 07.08: circ.superposition (Superposition property and handling multiple sources)

Week 8

• 08.01: circ.opAmp (Op amps as voltage-controlled voltage sources; negative feedback)
• 08.02: circ.idealOpAmp (Ideal model, power rails)
• 08.03: circ.noninvertingAmp (Non-inverting amplifier using an op-amp)
• 08.04: circ.invertingAmp (Inverting amplifier using an op-amp)
• 08.05: circ.addSubtract (Adder and subtractor using op-amps)

Week 9

• 09.01: circ.thevenin (Thevenin equivalent circuits. Note error: R_? should be V_o / I_o)
• 09.02: circ.norton (Norton equivalent circuits)
• 09.03: circ.thevenin.example (An example of why circuit equivalents are useful)

Week 11

• 11.01: prob.distributions (Basic discrete probability)
• 11.02: prob.randomVariable (Random variables: joint dist, conditioning, marginals)
• 11.03: prob.bayes (Bayes' rule)

Week 12

• 12.01: prob.se (State Estimation)
• 12.02: prob.se.example (State Estimation: Example)