CS361 Site Map

CS361 Schedule of Activities

Section 1 - ADTs
- asst: Asst: Unix account setup
- reading: Abstraction and Abstract Data Types
- selfassess: Self-Assessment: Getting Familiar with the Assessment Interface
- reading: CS 361 Textbook reading
- selfassess: Self-assessment: Working with interfaces in C++
- reading: CS 361 Textbook reading
- asst: Asst: Slow Stringulation
- reading: A Class Design Checklist: Discussion
- quiz: Quiz: Classe Critique
- reading: Introducing the SpellCheck Problem
- selfasst: Working from interfaces
Section 2 - Worst Case Analysis
- reading: Text Reading: chapter 3
- reading: Analysis of Algorithms: Motivation
- reading: Analysis of Algorithms: Worst Case Complexity
- selfassess: Self-Assessment - Definition of complexity
- reading: Text Reading: chapter 4
- reading: The Algebra of Big-O
- quiz: Quiz - big-O algebra
- reading: Analysis Rules for Program Statements
- reading: Analysis of Algorithms: the Cut-and-Paste Method
- selfassess: Self-Assessment: Simple Complexity
- reading: Analysis of Algorithms: Spell Check Example
- asst: Asst: Complex Simplicity
Section 3 - Generic Programming
- reading: Algorithms as Patterns for Code
- asst: Asst: Feel like you're being set up?
- reading: Function Templates
- asst: Asst: Sum Enchanted Evening
- reading: Class Templates
- asst: Asst: Con-template-ing the Matrix
- reading: Iterators: an ADT for Positions
- reading: Textbook reading: 6.3, 7.3.9
- asst: Asst: Beware the Irate Iterator
- reading: Generic Programming
- asst: Asst: Lop the Loop
Section 4 - Average Case Analysis
- reading: Analysis of Algorithms: Average Case Analysis
- quiz: Quiz - Average Case Analysis
- reading: Randomization
- asst: Asst: A Plague on Plagiarism!
- reading: Generating Random Permutations
- reading: Textbook reading: 4.4
- asst: Asst: It's About Time
Section 5 - Linear Sequences
- reading: The Standard Library: Overview
- reading: Textbook reading: 6, 8
- reading: Vectors
- asst: Asst: Vectoring In on a Target
- reading: Textbook reading: 9
- reading: Lists
- asst: Asst: Making a List and Checking It Twice
- reading: Linked List Applications
- quiz: Quiz - linear sequences
Section 6 - Sorting
- reading: Textbook reading: 4.2.4
- reading: Sorting --- Insertion Sort
- asst: Asst: Maintaining Order in the Classroom
- reading: Sorting --- Shell's Sort
- asst: Asst: She Sells C++ Shell's
- reading: Sorting Speed Limits
- asst: Asst: Assorted Sorted Sordid Sections
- event: Midterm Exam (first day)
- exam: Midterm Exam (last day)
- reading: Textbook reading: 8.3.3
- reading: Sorting --- Merge Sort
- quiz: I Remember MergeSort (memory overhead)
- reading: Textbook reading: 14.5
- reading: Sorting --- Quick Sort
- quiz: Quiz: Sorting
Section 7 - Stacks and Queues
- reading: Textbook reading: 10-10.3
- reading: Stacks
- asst: Balancing Act
- reading: Textbook reading: 10.4 to end of chapter
- reading: Queues
- asst: Asst: Mind Your Peas and Queues
- reading: Textbook reading: 11 (skim 11.4)
- reading: Deques
- asst: Asst: He's Not Playing with a Full Deque
Section 8 - Algorithmic Styles
- reading: Algorithmic Styles
- reading: Textbook reading: 3.4, 14.1
- asst: Asst: Try to Keep your Distance
- asst: Asst: Coming to Your Census
Section 9 - Sets and Maps
- reading: Textbook reading: 12-12.2, 12.4-12.5
- reading: Sets and MultiSets
- asst: Asst: Farewell to CS361Set
- reading: Textbook reading: 16-16.3
- reading: Maps and MultiMaps
- asst: Asst: You Can Count On It
- asst: Asst: Set Your Course by the Map
Section 10 - Trees
- reading: Textbook reading: 13-13.2
- reading: Trees
- reading: Textbook reading: 13.4-13.6
- asst: Asst: Is It Bigger Than a Breadbox?
- reading: Traversing Trees with Iterators
- asst: Asst: How Much is it? OK, I'll Bi That.
- reading: Textbook reading: 12.6
- reading: Binary Search Trees
- asst: Asst: I Left the Map Right Over Bi That Tree
- reading: Textbook reading: 14.3
- reading: Balanced Search Trees
- asst: Asst: Wood Yew Like That Tree Cut Into Logs?
Section 11 - Hashing
- reading: Hashing
- reading: Textbook reading: 17
- asst: Asst: Key-ping It Straight
- reading: Resolving Collisions
- reading: Rehashing (Variable Hashing)
- asst: Asst: Try Not to Make a Hash of It
Section 12 - Heaps and Priority Queues
- reading: Priority Queues and Heaps
- asst: Asst: A Priority Call
- reading: Textbook reading: 15, skipping 15.3
- reading: Heapsort
- asst: Asst: Contemplating an Introspective Sort
Section 13 - Graphs and NP Problems
- reading: Graphs --- the Basics
- selfassess: Self-assessment: Graph Basics
- reading: Textbook reading: 19-19.4
- reading: Graphs --- ADT Traversing
- asst: Asst: Can You Profit from a Net Loss?
- reading: Graphs --- Sample Algorithms
- asst: Asst: Can I Get Your Autograph?
- reading: Exponential, and NP Algorithms
Section 50 - Other Important Dates
- meeting: Orientation meeting, 3:20-3:50
- event: Add/Drop Deadline
- event: Fall Holiday (from 12-Oct-02 to 15-Oct-02)
- event: Drop Deadline
- event: Thanksgiving Holiday (from 27-Nov-02 to 01-Dec-02)
- event: Last day of classes.
- event: Last day to take students evaluation of teaching survey.
- exam: Final Exam starts
- exam: Final Exam ends