Algorithms

Author:

Shai Simonson

Subject:

Mathematics and Statistics

Institution Name:

ArsDigita University

Collection:

ArsDigita University

Grade Level:

Post-secondary

Abstract:

The design of algorithms is studied, according to methodology and application. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms. Analysis of algorithms is studied - worst case, average case, and amortized - with an emphasis on the close connection between the time complexity of an algorithm and the underlying data structures. NP-Completeness theory is examined along with methods of coping with intractability, such as approximation and probabilistic algorithms.

Languages:

English

Material Type:

Full Course, Homework and Assignments, Lecture Notes, Readings, Syllabi, Video Lectures, Other

Media Format:

Text/HTML, Downloadable docs, Video

Technical Requirements:

RealPlayer, large video files

Conditions of Use:

Creative Commons Attribution-Share Alike 2.0