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 CSC 1351 or CSC 1254

2.      Credit or concurrent enrollment in CSC 2259 or EE 2740.

 

Lectures:  MTWTF     8:30 am – 10:00 am - 0103 Tureaud Hall

 

Instructor
William E. Duncan

homepage: https://csc.lsu.edu/~duncan

 
Office Hours

 

 

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.

 

Course Calendar

 
Evaluation

 

Grading will be based on homework assignments, programming projects, and two exams:

 

Programming Projects        30%

Mid-Term Exam               30%

Final Exam                  40%

 

 

Summer 2019