CSC438                  Advanced Data Structures & Algorithm Design        

 

 

Description

Algorithm analysis and design, sorting algorithms, hashing, search trees, disjoint sets, graph algorithms,
divide and conquer, greedy algorithms, dynamic programming, backtracking, and NP completeness.

 

Objectives

        To gain techniques on problem solving using computers.

        To be able to design and analyze computer algorithms.

   

Text

Computer Algorithms: Introduction to Design & Analysis, by
Sara Baase and Allen Van Gelder.

 

Representative Topics

 

Topics

(Some sections may be assigned as reading.)

Reading Chapter

Approximate No. of Weeks

Analyzing Algorithms and Problems

1

1

Data Abstraction and Basic Data Structures

2

2

Sorting

4

1

Selection and Adversary Arguments

5

0.5

Dynamic Sets and Searching

6

1

Graphs and Graph Traversals

7

1

Graph Optimization Problems and Greedy Algorithms

8

1

Dynamic Programming

10

0.5

NP-Complete Problems

13

1

Parallel Algorithms

14

1

 

PDF Files & PowerPoint Slides for the Topics

BenChoi.info
111201