CSCI 255 Fall 2013
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 27Introduction
  • Selective Soldering Machine
  • Pick and Place Machine
    • ThuAug 29Discrete Mathematics
  • ADM Preface (pgs v-vii)
  • ADM 1 (pgs 3-27)
    • FriAug 30C/C++
  • Pointer Basics
  • Pointer Fun with Binky
  • Pointer Fun with Binky (C version on YouTube)
  • Pointers and Memory
  • Pointer Demonstration
    		• HW 1 due
    2TueSep 03Proofs
  • IDMA 1 (pgs 1-11)
  • 7x13=28
  • 25/5=14
    • ThuSep 05
  • Algorithms
  • C/C++
  • IDMA 2 (pgs 21-31)
    • FriSep 06Propositional Logic
  • IDMA 3.1 (pgs 41-50)
    		• HW 2 due
    3TueSep 10Sets
  • IDMA 3.2 (pgs 50-60)
    		• HW 3 due
    ThuSep 12Boolean Algebra
  • IDMA 3.3 (pgs 62-69)
    		• HW 4 due
    FriSep 13Sequences and Summations
  • IDMA 4.1-4.2 (pgs 81-92)
    		• HW 5 due
    4TueSep 17Asymptotic Notation
  • IDMA 5.1 (pgs 101-110)
  • DMA 2-2.4 (pgs 31-41)
    		• HW 6 due
    ThuSep 19Asymptotic NotationHW 7 due
    FriSep 20Algorithm Analysis
  • IDMA 5.2-5.3 (pgs 110-119)
  • ADM 2.5-2-9 (pgs 41-57)
    		•
    5TueSep 24More Algorithm AnalysisHW 8 due
    ThuSep 26Induction
  • IDMA 6.1 (pgs 131-139)
    		• HW 9 due
    FriSep 27Review/Catch upHW 10 due
    6TueOct 01Recursion and Recurrence Relations
  • IDMA 6.2-6.3 (pgs 140-157)
    • ThuOct 03Analyzing Recursive Algorithms
  • IDMA 6.4 (pgs 157-162)
    		• HW 11 due
    FriOct 04No Class
    7TueOct 08Catch up and Review
    ThuOct 10Midterm Exam
  • IDMA 1-6
  • ADM 1-2
    • FriOct 11Matrices
  • Matrix Tutorial (Read it)
  • Matrices (Wikibooks)
    		•
    8TueOct 15No Class (Fall Recess)
    ThuOct 17Counting
  • IDMA 7.1-7.3 (pgs 171-184)
    • FriOct 18More Counting
  • IDMA 7.4-7.5 (pgs 184-192)
    		• HW 12 due
    9TueOct 22Data Structures ReviewADM 3.1-3.5 (pgs 65-85)HW 13 due
    ThuOct 24More Data StructuresADM 3.6-3.9 (pgs 85-98)HW 14 due
    FriOct 25
  • Sorting Basics
  • Heapsort
    		• ADM 4.1-4.4 (pgs 103-120)
    10TueOct 29Divide and Conquer
  • Quicksort
  • Mergesort
  • ADM 4.5-4.10 (pgs 120-138)
    		• HW 15 due
    ThuOct 31Graphs
  • IDMA 8 (pgs 201-210)
  • ADM 5.1-5.4 (pgs 145-160)
  • Graphs notes
  • Algoraph
    • FriNov 01BFS
  • ADM 5.5-5.7 (pgs 161-169)
  • Data Structures Visualizations
  • BFS and DFS Notes
    		•
    11TueNov 05DFS
  • ADM 5.8-5.10 (pgs 169-184)
  • Data Structures Visualizations
    		• HW 16 due
    ThuNov 07
  • Algoraph
    		• Bring laptop (if you have one)
    FriNov 08
  • Minimum Spanning Trees
  • ADM 6.1-6.2 (pgs 191-205)
  • MST Notes
  • Prim's Algorithm Demo
  • Kruskal's Algorithm Demo
    		• HW 17 due
    12TueNov 12
  • Shortest Path
  • Dijkstra's Algorithm
  • ADM 6.3-6.4 (pgs 205-217)
  • MST Notes (last page)
    		• HW 18 due
    ThuNov 14
  • Review Day
    		• HW 17 due (redo)
    FriNov 15
  • Network Flow
  • Matching
  • ADM 6.5-6.6 (pgs 217-225)
  • Ford Fulkerson Algorithm Applet
    		• HW 18 due (redo)
    13TueNov 19Dynamic Programming
  • ADM 8.1(pgs 273-280)
  • Recursive Functions Example
    		• HW 19 due
    ThuNov 21Dynamic Programming
  • ADM 8.3, 8.6.1 (pgs 289-291, 300-301)
  • Read Dynamic Programming Notes
  • Dynamic Programming Slides
    • FriNov 22Dynamic Programmming
  • ADM 8.7,8.9 (pgs 301-304,307-310)
  • Dynamic Programming Slides
    		• HW 20 due
    14TueNov 26Greedy Algorithms
  • Greedy Algorithms Slides
    • ThuNov 28No Class (Thanksgiving)
    FriNov 29No Class (Thanksgiving)
    15TueDec 03
  • Greedy Algorithms
  • Algorithmic Techniques
    		• HW 21 due
    ThuDec 05ReviewHW 22 due
    FriDec 06Review
    ExTueDec 10Final Exam, 12:30-2:30