Advanced Analysis of Algorithms and Complexity

(Problem Solving Using Computers)

 

CSC520: Description, Objective, Text, Slide Download

 

Description

Formal analysis of time and space requirements of various algorithms, greedy algorithms, divide-and-conquer, dynamic programming, P and NP algorithms; Turing machines and unsolvability.

 

Objectives

        To gain techniques on problem solving using computers

        To be able to design and analyze computer algorithms.  

        To gain knowledge on computational complexity.
    

Text

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

 

PDF Files & PowerPoint Slides:

 

Chapter
(PDF files)

Topics

(Links to PowerPoint Slides)

CH01

Analyzing Algorithms and Problems

CH02

Data Abstraction and Basic Data Structures

CH03

Recursion and Induction

CH04

Sorting

CH05

Selection and Adversary Arguments

CH06

Dynamic Sets and Searching

CH07

Graphs and Graph Traversals

CH08

Graph Optimization Problems and Greedy Algorithms

CH10

Dynamic Programming

CH11

String Matching

CH13

NP-Complete Problems

CH14

Parallel Algorithms

BenChoi.info
091019