CSC 3102: Advanced Data Structures and Algorithm Analysis

Fall 2008

Announcement

WELCOME! The CSC 3102: Advanced Data Structures and Algorithm Analysis class meets in 215 Williams Hall from 12:10 pm to 1:30 pm on every Tuesday and Thursday. Click below for more information.

Course Information (one slide per page)

Course Information (all slides in one page)

Lecture notes and other materials are posted on regular basis.

See "Assignments" section for the quiz/homework/programming assignments.

Lecture Notes

Algorithmic Basics

• Notion of Algorithm
• Fundamentals of Algorithmic Problem Solving
• Important Problem Types
• Analysis of Algorithm Efficiency
• Nonrecursive and Recursive Algorithms

Fundamental Data Structures

• Linear Lists
• Tree Basics
• Balanced Search Trees
• B Trees
• Graph Basics and Traversals
• Topological Sorting

Algorithm Design Techniques

• Brute Force
• Divide-and-Conquer
• Decrease-and-Conquer
• Transform-and-Conquer
• Space and Time Tradeoffs
• Dynamic Programming
• Greedy Techniques
• More on Algorithms
• Final Exam and Review

Homework Assignments

Visit the blackboard.lsu.edu site

Programming Assignments

Visit the blackboard.lsu.edu site