Computer Science 3102
Advanced Data Structures and
Algorithm Analysis
Catalog
Description
Description and utilization of formal ADT representations, especially those on lists, sets and graphs; time and space analysis of recursive and non-recursive algorithms, including graph and sorting algorithms; algorithm design techniques.
Prerequisites
1. Credit
in
2. Credit
or concurrent enrollment in
Lectures: TTH
9:00 – 10:20 AM - 0204 Tureaud Hall
Instructor
William E. Duncan
homepage: https://csc.lsu.edu/~duncan
Textbook
1. Required: Algorithm Design and Applications 1/E, Michael T. Goodrich and Roberto Tamassia (ISBN: 978-1118335918)
2. Supplementary: Data Structures and Algorithm Analysis in [C++ 4/e] or [Java 3/e], Mark Allen Weiss - (ISBN: [978-0132847377] or [978-0132576277])
Goal
To explore algorithm analysis and data structures so that students can make appropriate choices when designing programs.
By the end of this course, students will be able to:
- Employ advanced programming techniques such as functional cohesion and data abstraction in implementing advanced classical data structures,
- Derive and explain the use of asymptotic notations in evaluating associated algorithms, and
- Understand the use of various algorithm design techniques such as brute force, greedy, divide-and-conquer, dynamic programming, etc.
Evaluation
Grading will be based on homework assignments, programming projects, and two exams:
Homework Assignments 15%
Programming Projects 30%
Mid-Term Exam 25%
Final Exam 30%
Fall 2024