CS-3510: Design and Analysis of Algorithms

Section A'

School of Computer Science, Georgia Tech

Spring 2020


Course Objectives

The course covers basic techniques (such as divide-and-conquer, dynamic programming, greedy algorithms, local search) for the design and analysis of efficient algorithms for standard computational problems (related to graphs, hashing, sorting, optimization, etc). It also provides an introduction to the theory of NP-Completeness.


Instructor

Teaching assistants


Table of Contents


Course Information


Important Dates


Textbooks

We will use the following textbook (required). The following books are optional and they can be used as references:


Syllabus and Timeline (subject to changes)


Homeworks and Programming Project

Material will be due at 11:59pm on the specified date and should be submitted using Canvas.


Grading

Notes about grading:


Communication with the instructor and the TAs


Course Policies