**Advanced **
**Analysis of Algorithms and Complexit****y**

(Problem
Solving Using Computers)

**CSC520:
Description, Objective,
Text,** **Slide Download**

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.

· To gain techniques on problem solving using computers

· To be able to design and analyze computer algorithms.

· To gain knowledge on computational complexity.

PDF Files & PowerPoint Slides:

Chapter(PDF files)

Topics

(Links to PowerPoint Slides)CH01 CH02 CH03 CH04 CH05 CH06 CH07 CH08 CH10 CH11 CH13 CH14