Lecture List

Caveat

These are electronic records of class discussion from Math 230 01 (Programming and Mathematical Problem Solving). They are generally captured as a class unfolds, and slightly cleaned up afterwards. They are not clean, carefully-planned lecture notes in the usual sense. They are more an electronic equivalent of notes on the blackboard: they record some of what the instructor said, some of what students said, the things that really happened in the class—including the misunderstandings, false starts, and similar things that happen in real classes. The goal of these notes is as much to help students remember how they learned as it is to help them remember what they learned (because the “how” of learning is at least as important as the “what”).

Please make WWW or other electronic links to this page only—I want people reading these notes to see the “caveat” above.

Send comments, questions, etc. related to these notes to Doug Baldwin.

1. Aug. 25—Introduction
2. Aug. 27—Installing Matlab, no lecture notes
3. Aug. 29—Matlab’s User Interafce
4. Sep. 3—Variables and Types
5. Sep. 5—Simple Expressions
6. Sep. 8—Algorithms and Expressions
7. Sep. 10—Expressions and Lotteries
8. Sep. 12—Vectors
9. Sep. 15—Vectors, Part 2
10. Sep. 17—Vectors, Part 3
11. Sep. 19—Vectors, Part 4
12. Sep. 22—Sampling in Vectors
13. Sep. 24—Nyquist’s Theorem
14. Sep. 26—Introduction to Plotting
15. Sep. 29—Plotting and Testing Spirals
16. Oct. 1—Plotting Spirals, Part 2
17. Oct. 3—Introduction to Image Processing with Matlab
18. Oct. 6—Image Processing with Matlab, Part 2
19. Oct. 8—Image Processing with Matlab, Part 3
20. Oct. 10—Exam 1, no lecture notes
21. Oct. 15—Image Processing with Matlab, Part 4
22. Oct. 17—Introduction to Numerical Integration
23. Oct. 20—“For” Loops
24. Oct. 22—Vectorization vs Loops
25. Oct. 24—Numerical Integration Wrap-Up
26. Oct. 27—The Geometric Distribution
27. Oct. 29—While Loops
28. Oct. 31—Probability Experiment Lab
29. Nov. 3—Newton’s Method
30. Nov. 5—Newton’s Method Algorithms
31. Nov. 7—Newton’s Method Coding
32. Nov. 10—Wrapping Up Newton’s Method
33. Nov. 12—Introduction to the Bisection Method
34. Nov. 14—The Bisection Algorithm
35. Nov. 17—Bisection Coding
36. Nov. 19—Exam 2, no lecture notes
37. Nov. 21—Cell Arrays
38. Nov. 24—Relations and Cell Arrays
39. Dec. 1—Relations Lab
40. Dec. 3—A Relational “Select” Algorithm
41. Dec. 5—Comparing Possibly Dissimilar Values
42. Dec. 8—Wrapping Up