CSC 3102  Advanced Data Structures and Algorithms Analysis

Fall 2014, Lockett 0010 ,  Tuesday/Thursday  1:30-2:50 pm


Instructor:  Rahul Shah,  Patrick Taylor Hall 3122A, ,  Office hours:  Wednesdays 10am-12noon
TA/ Grader : Jace Courville, Sudip Biswas

Textbook: Data Sturctures and Algorithms in C++ by Goodrich, Tamassia and Mount (Wiley)
Reference book:Introduction to Algorithms (second edition) by  Cormen, Leiserson, Rivest and Stein,
Also:Data structures and Algorithms in Java by  Goodrich and Tamassia (if you prefer Java)

Syllabus: Sorting, Complexity, Search Trees, Hashing,    Tries/Text processing, Dynamic Programming, Graph Algorithms and Data Structures.

Grading:  25% Midterm, 25% Finals, 20% Homeworks, 20% Programming Assignments, 10% Class/Forum Participation plus extra credits for challenge problems. Grading will be on the curve. Homework problems can be discussed, but you must write your own answers.

Webpage:  Basic outline material will be on the webpage but most of the course materials will be accessible through Moodle (you have to login to your PAWS account).

The course will primarily focus on building Algorithmic Problem Solving and Programming Skills.