CSC 3102 Advanced Data Structures and Algorithms Analysis

Fall 2019, Patrick Taylor Hall 1221, Tuesday/Thursday  9:00-10:20 am (Section 1)


Instructor:  Rahul Shah,  Patrick Taylor Hall 3272J, ,  Office hours:  Wednesdays 10am-12noon 
TA/ Grader : TBA

Supporting Instructor: Jake Ardoin
Section 2 Instructor: Dipak Singh


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.

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