CSE Algorithms | CSE 6140 - Fall 2014

 

Course Details:

Time: TR 12:05 - 1:25pm

Location: Klaus 1456


 

Instructor: Bistra Dilkina

Email: bdilkina@cc.gatech.edu (best way to contact me)

Office hours: Thur 2-3pm in my office, Klaus 1304


TA1: Elias Khalil <lyes@gatech.edu>

Office hours:Mon 11:30-12:30 Klaus 1315, Thur 5:00-6:00pm Klaus CSE common area


TA2: Mehrdad Farajtabar <mehrdad@gatech.edu>

Office hours: Wed 4:00-5:00 Klaus 1315, Fri 4:00-5:00 Klaus 1315


TA3: Spurthi Amba Hombaiah<sah6@gatech.edu>

Office hours:Tue 5:00-6:00, Fri 1:30-2:30 Klaus CSE common area.

 

Piazza Forum: https://piazza.com/gatech/fall2014/cse6140/home



Course Description


This course will introduce students to designing  scalable and effective algorithms for computational science & engineering applications. The course focuses on algorithm design, complexity analysis, experimentation, and optimization, for important science and engineering applications.


Students will develop knowledge and skills concerning:


Fall 2014 Tentative Topics: also click for detailed Lecture SCHEDULE.


Pre-requisites: design and analysis of algorithms (GT CS 3510 or equivalent).


Students (from the Sciences, Engineering, and Computing) interested in algorithmic applications in science and engineering are encouraged to take this course. 


This course can be taken for satisfying the theory breadth requirement by computer science graduate students (M.S. and non-theory Ph.D. students).  This course cannot be taken by ACO students to satisfy their core requirement and by theory Ph.D. students in computer science to satisfy the theory breadth requirement.


Most of the homeworks will involve proofs. Some programming questions in homeworks and your project will require coding in your choice of language.


Grading:

 

Textbooks:


CLASS POLICIES