CSCI 255 Fall 2015
Introduction to Algorithms and Discrete Structures
Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook
Homework

Policies
College
    Policies
Advice

Notes
Programs
Tutorials

Others

Admin
previous     next     today     future     all    

Schedule for weeks 1 through 16

Wk Day Date TopicResourcesEvents

1TueSep 01Introduction
  • You can learn anything video
  • Selective Soldering Machine
  • Pick and Place Machine

  • ThuSep 03Algorithms
  • AIDMA "How To"
  • AIDMA Ch 1
  • IDAA 1.1-1.3
  • Assignment 0 due

    FriSep 04
  • Data Structures
  • Graphs
  • IDAA 1.4
  • AIDMA 10 (yes, ten)
  • HW 1 due

    2TueSep 08ProofsAIDMA 2.1-2.3

    ThuSep 10ProofsAIDMA 2.4-2.8HW 2 due

    FriSep 11Programming Fundamentals and AlgorithmsAIDMA 3.1-3.6

    3TueSep 15Propositional LogicAIDMA 4.1-4.2HW 3 due

    ThuSep 17
  • Predicates
  • Quantifiers
  • Normal Forms
  • Bitwise Operations
  • AIDMA 4.3-4.5HW 4 due

    FriSep 18SetsAIDMA 5.1-5.2

    4TueSep 22Functions, Partitions, and Equivalence RelationsAIDMA 5.3-5.4HW 5 due

    ThuSep 24SequencesAIDMA 6.1HW 6 due

    FriSep 25Summations and ProductsAIDMA 6.2

    5TueSep 29Asymptotic Notation
  • AIDMA 7.1
  • IDAA 2.2 (No SRQ)
  • HW 7 due

    ThuOct 01
  • Growth Rates
  • Algorithm Analysis
  • AIDMA 7.2-7.3

    FriOct 02Algorithm Analysis
  • IDAA 2.1,2.3 (SRQ!)

  • 6TueOct 06No ClassFall Recess

    ThuOct 08Mathematical InductionAIDMA 8.1HW 8 due

    FriOct 09Recursion and Solving Recurrence Relations
  • AIDMA 8.2-8.3.3
  • IDAA Appendix B (optional)
  • HW 9 due

    7TueOct 13Analysing Recursive Algorithms
  • AIDMA 8.3.4-8.4
  • IDAA 2.4-2.5 (SRQ!)
  • HW 10 due

    ThuOct 15Catch up/reviewHW 11 due

    FriOct 16
  • AIDMA 1-8, 10
  • IDAA 1-2
  • Midterm Exam

    8TueOct 20Basic CountingAIDMA 9.1-9.2

    ThuOct 22Permutations and CombinationsAIDMA 9.3

    FriOct 23Binomial Theorem and Inclusion-ExclusionAIDMA 9.4-9.5HW 12 due

    9TueOct 27Brute Force
  • IDAA 3.1, 3.2, 3.4
  • Basic Sorting Algorithms Notes
  • HW 13 due

    ThuOct 29Exhaustive Search, BFS, and DFS
  • IDAA 3.5
  • BFS and DFS Notes
  • Data Structure Visualizations

  • FriOct 30Decrease-and-Conquer
  • IDAA 4.1-4.2
  • Basic Sorts (see Insertion Sort)
  • BFS and DFS Notes (see Topological Sort)
  • Data Structure Visualizations (See two Topological Sort ones)

  • 10TueNov 03Decrease-by-a-Constant-FactorIDAA 4.4HW 14 due

    ThuNov 05Variable-Size-DecreaseIDAA 4.5

    FriNov 06Divide-and-Conquer
  • IDAA 5.1-5.2
  • Quicksort Notes
  • Merge Sort Notes

  • 11TueNov 10Tree Traversal and Matrix Multiplication
  • IDAA 5.3-5.4
  • Strassen's Algorithm Notes
  • Sorting Worst Case
  • HW 15 due

    ThuNov 12Transform-and-Conquer
  • IDAA 6.1-6.2
  • LU Decomposition Example

  • FriNov 13Transform-and-Conquer
  • IDAA 6.4-6.5
  • Heapsort Notes

  • 12TueNov 17Problem Reduction
  • IDAA 6.6
  • Reduction Examples
  • HW 16 due

    ThuNov 19Space-Time Trade-offsIDAA 7.1-7.2 (through page 262)

    FriNov 20Dynamic Programming
  • IDAA 8.1
  • Fibonacci Demo
  • Recursive Functions (Fibonacci)
  • Dynamic Programming Notes

  • 13TueNov 24Dynamic Programming
  • IDAA 8.2
  • HW 17 due

    ThuNov 26No Class
  • Turkey (or Tofurky or maybe even Turducken)
  • Stuffing
  • Mashed Potatoes
  • Gravy
  • Thanksgiving Break

    FriNov 27No ClassThanksgiving Break

    14TueDec 01Dynamic Programming
  • IDAA 8.4
  • Warshall's Algorithm Notes
  • Floyd's Algorithm Demo

  • ThuDec 03Greedy Algorithms
  • IDAA 9.1-9.2
  • MST Notes
  • Animations (See Prim's and Kruskal's)
  • HW 18 due

    FriDec 04Greedy Algorithms
  • IDAA 9.4
  • Greedy Algorithms Notes
  • Exam Problem due

    15TueDec 08P, NP, and NP-Complete
  • IDAA 11.3
  • P, NP, and NP-Complete Notes

  • ThuDec 10Quantum Computing
  • Quantum Computing Notes
  • Quantum Computation Introduction (A little more in depth)
  • HW 19 due

    FriDec 11Review

    ExTueDec 15EverythingFinal Exam 9-11 am