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

Policies
Advice
College
    Policies

Notes
Programs
Tutorials

CSCI 255
Others

Admin
previous     next     today     future     all    

Schedule for weeks 1 through 16

Wk Day Date TopicResourcesEvents

1TueAug 30
  • Introduction
  • You can learn anything video
  • Selective Soldering Machine
  • Pick and Place Machine
  • Assignment 0

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

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

  • 2TueSep 06
  • Proofs
  • AIDMA 2.1-2.3
  • xkcd: Proofs

  • ThuSep 08
  • Proofs
  • AIDMA 2.4-2.8
  • HW 2 due

  • FriSep 09
  • Programming Fundamentals and Algorithms
  • AIDMA 3.1-3.6

    3TueSep 13
  • Propositional Logic
  • AIDMA 4.1-4.2
  • HW 3 due

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

  • FriSep 16
  • Sets
  • AIDMA 5.1-5.2

    4TueSep 20
  • Functions, Partitions, and Equivalence Relations
  • AIDMA 5.3-5.4
  • HW 5 due

  • ThuSep 22
  • Sequences
  • AIDMA 6.1
  • HW 6 due

  • FriSep 23
  • Summations and Products
  • AIDMA 6.2

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

  • ThuSep 29
  • Growth Rates
  • Algorithm Analysis
  • AIDMA 7.2-7.3

    FriSep 30
  • Algorithm Analysis
  • IDAA 2.1,2.3 (SRQ!)

  • 6TueOct 04
  • Mathematical Induction
  • AIDMA 8.1
  • HW 8 due

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

  • FriOct 07
  • Analysing Recursive Algorithms
  • AIDMA 8.3.4-8.4
  • IDAA 2.4-2.5 (SRQ!)
  • HW 10 due

  • 7TueOct 11
  • No Class
  • Fall Recess

  • ThuOct 13
  • Catch up/review
  • HW 11 due

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

  • 8TueOct 18
  • Basic Counting
  • AIDMA 9.1-9.2

    ThuOct 20
  • Permutations and Combinations
  • AIDMA 9.3
  • Guest Instructor: Dr. DeJongh

  • FriOct 21
  • Binomial Theorem and Inclusion-Exclusion
  • AIDMA 9.4-9.5
  • HW 12 due
  • Guest Instructor: Dr. McFall

  • 9TueOct 25
  • Brute Force
  • IDAA 3.1, 3.2, 3.4 (SRQ)
  • Basic Sorting Algorithms Notes
  • HW 13 due

  • ThuOct 27
  • Exhaustive Search, BFS, and DFS
  • IDAA 3.5 (SRQ--from now on!)
  • BFS and DFS Notes
  • Data Structure Visualizations

  • FriOct 28
  • Decrease-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 01
  • Decrease-by-a-Constant-Factor
  • IDAA 4.4
  • Josephus Problem Video
  • HW 14 due

  • ThuNov 03
  • Variable-Size-Decrease
  • IDAA 4.5

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

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

  • ThuNov 10
  • Transform-and-Conquer
  • IDAA 6.1-6.2

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

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

  • ThuNov 17
  • Space-Time Trade-offs
  • IDAA 7.1-7.2 (through page 262)

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

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

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

  • FriNov 25
  • No Class
  • Thanksgiving Break

  • 14TueNov 29
  • Dynamic Programming
  • IDAA 8.4
  • Warshall's Algorithm Notes (Read)
  • Floyd's Algorithm Demo

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

  • FriDec 02
  • Greedy Algorithms
  • IDAA 9.4
  • Greedy Algorithms Notes

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

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

  • FriDec 09
  • Review

  • ExMonDec 12
  • Everything
  • Final Exam 9-11 am