CSC 331: Algorithm Analysis

1
CSC 331 Algorithm Analysis

• Spring, 2005

2
Catalog Description

• CSC 331. Algorithm Analysis 4shThis course
  introduces formal techniques to support the
  design and analysis of algorithms. Topics
  include asymptotic complexity bounds, techniques
  of analysis, and algorithmic strategies.
  Strategies include brute-force, greedy,
  divide-and-conquer, and backtracking.
  Fundamental computing algorithms will be explored
  and developed. Prerequisite CSC 230, MTH 206.
  Offered spring.

3
Course Topics, according to ACM/IEEE Curriculum
Matrix

• DS5 Graphs and Trees
• Trees
• Undirected graphs
• Directed graphs
• Spanning trees
• Traversal strategies
• PF2 Algorithms and Problem Solving
• Problem-solving strategies
• The role of algorithms in the problem-solving
  process
• The concept and properties of algorithms
• PF3 Fundamental Data Structures
• Linked Structures
• Implementation strategies for hash tables
• Implementation strategies for graphs and trees

4
Course Topics, according to ACM/IEEE Curriculum
Matrix, contd

• AL1 Basic algorithmic analysis
• Asymptotic complexity bounds
• Empirical measurements of performance
• Time and space tradeoffs in algorithms
• Using recurrence relations to analyze recursive
  algorithms
• AL2 Algorithmic strategies
• Brute-force algorithms
• Greedy algorithms
• Divide-and-conquer
• Backtracking
• Branch-and-bound
• Pattern Matching

5
Course Topics, according to ACM/IEEE Curriculum
Matrix, contd

• AL3 Fundamental computing algorithms
• Simple numerical algorithms
• Sequential and binary search algorithms
• Quadratic sorting algorithms (selection,
  insertion)
• O(N log N) sorting algorithms (quicksort,
  mergesort, heapsort)
• Hash tables
• Binary Search Trees
• Representation of graphs (adjacency list,
  adjacency matrix)
• Depth-first and Breadth-first traversals
• Shortest path algorithms
• Minimum spanning tree
• AL8 Advanced Algorithmic Analysis
• Dynamic Programming

6
Course Administration

• Prerequisites
• CSC 230 Algorithm Development
• MTH 206 Discrete Structures
• No oral presentation requirements
• Course Text Introduction to Algorithms (Second
  Edition) by Corman, Leiserson, Rivest, and Stein.
  McGraw-Hill, 2001

7
Course Technology

• Software Java compiler/IDE
• Eclipse, JBuilder, or environment of students
  choice
• Operating System Windows XP
• Course Hardware Lab PCs

8
Course Assessment

• Comprehensive Final average 62.41
• Programming Projects average 71.28
• Theory Homework average 70.80
• Final class grade average 73.02