Lecture Notes & Additional Examples

Date	Description	File(s)
1/23	datatypes; operators; variables & assignment; semicolon	lec-01-23.txt
1/25	tracing (memory model, tabular); comma; general loop template	lec-01-25.txt, feedback
1/30	structs; accumulation; conditionals; vectors	lec-01-30.txt, feedback
2/01	$-notation; strings; random numbers; birthday problem; vector operations; Pascal's triangle	lec-02-01.txt, feedback
2/06	conditionals; vector concat; E3; Pascal's triangle; subarrays (indexing)	lec-02-06.txt, feedback
2/08	logical values; logical operations; logical functions; quantifiers; DeMorgan's Laws; uses of logical stuff (control, counting, indexing/filtering)	lec-02-08.txt, feedback
2/13	$input$; $while$ loops; processing input sequence with stopping value; review of logic	lec-02-13.txt, feedback
2/15	processing input example (max); loop invariants (E4 solution); functions	lec-02-15.txt, feedback
2/20	loop invariant for max of 0-terminated sequence; arrays as look-up tables; chars as array indices; Matlab path; scripts; functions	lec-02-20.txt, feedback, loop invariant demo, lec220.m
2/22	(newsgroup demo); (matlab demo); key analogy for understanding functions	lec-02-22.txt, feedback
2/27	box scope diagram memory model for functions	lec-02-27.txt, feedback, f-g-trace.txt, fib-trace.txt, boxscope.m, strhcat.m, boxfib.m, boxe7.m
3/01	loop techniques for processing sequences: invariant/picture, answer so far, previous value; examples: sum, max, leftmost mode	lec-03-01.txt, feedback
3/06	Lecture: apply techniques from 3/01 lecture to maximum subsequence sum. feedback Monster lecture sketch: lec-03-06.0.txt: 0. overview of monster lecture sketch lec-03-06.1.txt: 1. introduction to the maximum subsequence sum problem lec-03-06.2.txt: 2. (3/08 preview) analyzing program performance lec-03-06.3.txt: 3. naive and better solutions to max subsequence sum lec-03-06.4.txt: 4. sophisticated solution to maximum subsequence sum lec-03-06.5.txt: 5. makepoly and evalpoly examples from E8.1/P4.2; error-checking
3/08	debugging; performance	lec-03-08.txt, feedback
3/13	examples of analyzing performance; 2-D arrays (creation, operations, functions, indexing)	lec-03-13.txt, feedback
3/15	T2 format; R2.3 tracing solution; E11 solution (introspection; $repmat$; trick with logical arrays and coordinate matrices)	lec-03-15.txt, feedback
3/27	P5.3 hints; Picture explanation of Condorcet; P5.2 intro; $find$	lec-03-27.txt, feedback
3/28	Bonus material: $sparse$, permutations, inverse permutations, $sort$, Instant Runoff Voting	lec-03-28.txt
3/28	More bonus material: 2D loop range, $cell$ arrays, sieve of erathosthenes, $setxor$, $setdiff$	lec-03-28a.txt
3/29	P5.2 hints; P5 Q&A; Matlab wrap-up	lec-03-29.txt, feedback
4/03	Java: statement terminator, comments, blocks, conditionals, loops, variable declaration and initialization, scalar datatypes and values; intro/motivation for references	lec-04-03.txt, feedback
4/05	Java: printing; classes and methods (syntax and tracing); main method of target class; CodeWarrior demo; P6 preview; scalar operations and functions; one-dimensional Java arrays	lec-04-05.txt, feedback
4/10	Java: r-value versus l-value; Pascal's triangle (1D arrays, functions); 2D arrays; strings	lec-04-10.txt, feedback form
4/12	Java lecture sketch preview: $public$ versus $private$, objects, static versus instance	lec-04-12.txt

MATLAB Chapman

• Bookfiles (zip file)
• Errata (pdf)
• Individual Chapters

Notes

• You benefit most by running these examples, not just reading!
• The provided code might be sparse on documentation.
• You might find some discrepancies between the lecture and files here.
• Use at your own risk. You really should carefully test and try similar examples.
• To access examples from the textbooks and related websites, see the Material page.
• Examples from CS100J and previous offerings of CS100:
  2001 [Fall 100J]
  2000 [Fall 100M] [Spring 100J]
  1999 [Fall 100B]
• Websites of previous offerings of CS100 (beware that there used to be an A-vs-B instead of J-vs-M distinction and that different semesters cover/emphasize different material):
  2001 [Fall 100J]
  2000 [Spring 100J] [Summer 100J] [Fall 100M] [Fall 100J]
  1999 [Spring 100A] [Summer 100A] [Fall 100A] [Fall 100B]
  1998 [Spring 100A] [Summer 100A] [Fall 100A] [Fall 100B]
  1997 [Spring] [Summer 100A] [Fall 100A] [Fall 100B]
  1996 [Spring 100A] [Summer 100A] [Fall 100A] [Fall 100B]