Documents
Stern Warning
Any notes found here are intended to supplement your own lecture notes.
They are not a substitute for attending class.
Lec No. | Topic | PDF link (Dixon) and (Gibson) |
PPTX link (Gibson) |
---|---|---|---|
Lec 01 | Introduction | PDF (D) PDF (G) | PPT (G) |
Syllabus, Using GL & emacs, Intro to Computing, Binary Numbers | |||
Lec 02 | Algorithmic Thinking | PDF (D) PDF (G) | PPT (G) |
Program Development, Pseudocode, Flowcharts, Control Structures, Debugging | |||
Lec 03 | Variables | PDF (D) PDF (G) | PPT (G) |
Python, Variables, Software Development, I/O | |||
Lec 04 | Expressions | PDF (D) PDF (G) | PPT (G) |
Expressions, Operators, Order of Operations, Types, Constants | |||
Lec 05 | Comparison Operators | PDF (D) PDF (G) | PPT (G) |
Comparison and Logical Operators, Boolean Expressions, Practice Problems | |||
Lec 06 | Decision Structures | PDF (D) PDF (G) | PPT (G) |
One-Way, Two-Way, and Multi-Way Decision Structures (if structures) | |||
Lec 07 | Strings and Lists | PDF (D) PDF (G) | PPT (G) |
Lists, Strings, Representation of Strings, String Functions, String Formatting | |||
Lec 08 | For Loops | PDF (D) PDF (G) | PPT (G) |
Intro to for Loops, range() Function | |||
Lec 09 | While Loops | PDF (D) PDF (G) | PPT (G) |
Intro to while Loops, append() and remove(), Nested Loops, 2D Lists | |||
Lec 10 | File I/O | PDF (D) PDF (G) | PPT (G) |
Escape Sequences, File Processing, open(), Reading from Files | |||
Lec 11 | File I/O (cont) | PDF (D) PDF (G) | PPT (G) |
Splitting Input into Variables, Writing to Files, close() | |||
Lec 12 | Midterm Review | PDF (G) | PPT (G) |
Exam Rules, Format, Content, Advice | |||
Lec 13 | Functions | PDF (D) PDF (G) | PPT (G) |
Purpose of Functions, Defining Functions, Calling Functions, Parameters, Scope | |||
Lec 14 | Functions (cont) | PDF (D) PDF (G) | PPT (G) |
Returning Values, Modifying Parameters, Modular Programming | |||
Lec 15 | Program Design | PDF (D) PDF (G) | PPT (G) |
What is "Good Code"?, Top-Down / Bottom-Up, Modular Development | |||
Lec 16 | Classes and Modules | PDF (D) PDF (G) | PPT (G) |
More on "Good Quality" Code, import, Modules, Intro to Classes and Objects | |||
Lec 17 | Classes and Modules (cont) | PDF (D) PDF (G) | PPT (G) |
Constructors (__init__), Data and Class Attributes, Built-In Methods | |||
Lec 18 | Classes and Modules (final) | PDF (D) PDF (G) | PPT (G) |
Class Inheritance | |||
Lec 19 | Recursion | PDF (D) PDF (G) | PPT (G) |
Recursion, Stacks, Designing Recursive Functions | |||
Lec 20 | Recursion (cont) | PDF (D) PDF (G) | PPT (G) |
Recursive Code Trace, Examples (Binary Search, etc.), Iteration vs Recursion | |||
Lec 21 | Tuples | PDF (D) PDF (G) | |
Tuples (Data Structure), Tuples and Functions, Tuple Operations | |||
Lec 22 | Dictionaries | PDF (D) PDF (G) | PPT (G) |
Dictionaries (Building, Accessing, and Manipulating) | |||
Lec 23 | Algorithms and Analysis | PDF (D) PDF (G) | PPT (G) |
Review (Tuples, Dicts), Search Algorithms, Asymptotic Analysis ("Run" Time) | |||
Lec 24 | Sorting | PDF (D) PDF (G) | PPT (G) |
Sorting Algorithms (Selection, Bubble, Quick, Radix), More on "Run" Time | |||
Lec 25 | Final Exam Review | PDF (D) PDF (G) | PPT (G) |
Exam Rules, Format, Content, Advice | |||
Lec 0X | Careers in Computer Science | PDF (D) PDF (G) | PPT (G) |
Careers, Interdisciplinary Fields, Job Descriptions, Higher Education |