CIS 110 LecturesA tentative list of lecture topics is given below. These may change in the course of the semester. Lecture slides will be posted as they are ready; there is no guarantee they will be posted in advance of the lecture.
This semester, we are recording lectures using the Echo360 system. In general, either the 12:00pm or 1:00pm lecture will be posted to the video page sometime after class.
Some things to keep in mind:
- Recording can fail for a variety of reasons, and there is no guarantee any particular lecture will be available.
- Recordings do not capture in-class demonstrations, the chalkboard, or questions from students. They are not a replacement for attending lecture.
- You are responsible for all material covered in class whether or not the recording captures it.
- The current technology may capture audio for several minutes before and/or after lecture. Please keep this in mind when talking to me before and after class!.
|1||5 Sep||Introductory Lecture|
|2||7, 10, 12 Sep||Program Arguments and Types||§ 1.1 - 1.2|
|3||12, 14, 17 Sep||Conditionals and loops||§ 1.3|
|4||19 Sep||Arrays||§ 1.4|
|5||21 Sep||N-Body||§ 1.4 - 1.5||HW 2, I/O pdf|
|6||24 Sep||Arrays and Input and Output (Cont'd)||§ 1.4 - 1.5|
|7||26 Sep||Functions||§ 2.1||function demo|
|8||28 Sep, 1 Oct||Libraries and Recursion||§ 2.1 - 2.3||pdf (Libraries)||pdf (Recursion)||Towers of Hanoi Demo|
|9||3 Oct||Review (Come with questions!)|
|10||5 Oct||Midterm||The midterm will take place during lecture time; locations are TBD|
|11||8, 10, 12 Oct||Encryption and Number Systems||§ 0. Prologue, Booksite § 5.1|
|12||15 Oct||Arrays, Part 2 (2-D Arrays and Call-by-Reference)||§ 1.4||pdf (2-D Array section)|
|13||17 Oct, 19 Oct, 22 Oct, 24 Oct||Computer Architecture, TOY||Booksite § 5.2||X-Toy||multiply.toy|
|14||26 Oct||TOY, Part 2||fastmultiply.toy|
|15||31 Oct||Error Correcting Codes||Homework 6||No slides (audio recording available); only Hamming codes will be on exam|
|16||2 Nov||Sorting||§ 4.2||Algorythmics, www.sorting-algorithms.com, http://www.brian-borowski.com/Software/Sorting/, Sample code: Insertion.java, Merge.java|
|17||5, 7, 9 Nov||Data Types||§ 3.1 and 3.2||3.1 3.2|
|18||12, 14, 16 Nov||Stacks and Queues||§ 4.3, but not parameterized types/generics||LinkedStackOfDoubles.java RPNCalc.java|
|19||19 Nov||Topological Sort and Depth-First Search||No Slides||FloodFill.java, Homework 8|
|21, 23 Nov||Thanksgiving: No Class|
|20||26, 28, 30 Nov||Dynamic Programming|
Credits: In addition to material from the Introduction to Programming book, these lectures are based on additional material provided by Dr. Kevin Wayne, Donna Gabai, and Prof. Robert Sedgewick of Princeton University.