CSCI 255 Fall 2017
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

CSCI 125
CSCI 255
MATH 131 (01 and 02)
Others

Admin
previous     next     today     future     all    

Schedule for weeks 1 through 16

Wk Day Date TopicResourcesEvents

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

  • ThuAug 31Algorithms
  • AIDMA "How To"
  • AIDMA Ch 1
  • IDAA 1.1-1.3
  • Assignment 0 due

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

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

  • ThuSep 07ProofsAIDMA 2.4-2.8HW 2 due

    FriSep 08
  • Programming Fundamentals
  • Algorithms
  • AIDMA 3.1-3.6

    3TueSep 12Propositional LogicAIDMA 4.1-4.2HW 3 due

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

    FriSep 15SetsAIDMA 5.1-5.2

    4TueSep 19
  • Functions
  • Partitions
  • Equivalence Relations
  • AIDMA 5.3-5.4HW 5 due

    ThuSep 21SequencesAIDMA 6.1HW 6 due (extended to Friday)

    FriSep 22
  • Summations
  • Products
  • AIDMA 6.2

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

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

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

  • 6TueOct 03Mathematical InductionAIDMA 8.1HW 8 due

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

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

    7TueOct 10No ClassFall Recess

    ThuOct 12Catch up/reviewHW 11 due

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

    8TueOct 17Basic CountingAIDMA 9.1-9.2

    ThuOct 19
  • Permutations
  • Combinations
  • AIDMA 9.3

    FriOct 20
  • Binomial Theorem
  • Inclusion-Exclusion
  • AIDMA 9.4-9.5HW 12 due

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

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

  • FriOct 27Decrease-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)

  • 10TueOct 31Decrease-by-a-Constant-Factor
  • IDAA 4.4
  • Josephus Problem Video
  • HW 14 due

    ThuNov 02Variable-Size-DecreaseIDAA 4.5

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

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

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

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

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

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

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

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

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

    FriNov 24No ClassThanksgiving Break

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

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

    FriDec 01Greedy Algorithms
  • IDAA 9.4
  • Greedy Algorithms Notes

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

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

    FriDec 08Review

    ExTueDec 12EverythingFinal Exam 9-11 am