Algorithms Tentative outline

 

Recursion Practice Problems

Here are some cool data structure visualizations

Week1:MLK day,  Jan 20

  • Chapter 1 and 2  Algorithms and their Analysis (complexity)
  • PPTs lecture1  (These are on Drive Y in lab 119 under my name/algorithms
  • Software:  Visual C++ 2013.  Get your copy running NOW!  (If you want to do your projects in Linux that would be ok!, just tell me.)
  • Project#0: Digit Counting (Due Jan 25th) Program Submission Format

Week2:Jan 25-27:

Chapter 3:Growth of Functions and Series

Week3:Feb 1-3

  • More Algorithm Complexity (ppts Lecture 3 and 4)
  • Recurrence Relations and Merge Sort (see ppt) (See video)
  • MIT Video: Models of Computation

Week4:Feb 8:10

Week5: Feb 15-17

 

Week6: Feb 22-24:

Week7:Feb 29 Mar 2

  • Creating a dynamic median heap
  • Hashing
  • Exam 2 Wed

Week8: Mar 7-9

———————SPRING BREAK—————–

Week9: March 30

  • Project#2 due on Wed
  • Finish RB trees

Weel10:  April 4-6

  • Graphs
  • MST,Prim’s algorithm
  • BFS, DFS
  • Shortest Paths

Week11:Apr 11-13

  • treeclass is the main program for your treeclass that is due friday. I removed the .cpp so you can download it.  You must add it back.
  • More graphs
  • Exam 3 Wed

Week12:Apr 18-20

Week13:Apr 25-27

  • LCS , Optimal BST Trees etc

Week14:May 2-4

  • Exam 4 Mon 2

Comprehensive Final Exam Monday May 11 @ 3:30


Comments are closed.