Spring 2019
CSC 2400: Algorithms
================

SYLLABUS
----------
Syllabus 2400-003


TA for assistance and questions
--------------------------------------
To Be Announced


SLIDES
----------
01. Introduction
02. Fundamentals of the Analysis of Algorithm Efficiency
03. Brute Force and Exhaustive Search
04. Decrease and Conquer
05. Divide and Conquer
06. Transform and Conquer
07. Space and Time Trade-Offs
08. Dynamic Programming


ASSIGNMNENTS
-----------------------
Reading 00: Algorithms Ethics Paper
Chapter 01: Introduction
Chapter 02: Fundamentals of the Analysis of Algorithm Efficiency
Chapter 03: Brute Force and Exhaustive Search
Chapter 04: Decrease and Conquer
Chapter 05: Divide and Conquer
Chapter 06: Transform and Conquer
Chapter 07: Space and Time Trade-Offs
Chapter 08: Dynamic Programming


ASSIGNMENT SOLUTIONS
-------------------------------------
Chapter 01: Introduction
Chapter 02: Fundamentals of the Analysis of Algorithm Efficiency
Chapter 03: Brute Force and Exhaustive Search
Chapter 04: Decrease and Conquer
Chapter 05: Divide and Conquer
Chapter 06: Transform and Conquer
Chapter 07: Space and Time Trade-Offs
Chapter 08: Dynamic Programming


EXAM RELATED STUFF
-------------------
Exam Cheat Sheet Template: Print YOUR name and seating number in the appropriate BOX.