Algorithms
| Rating: | Not rated yet |
| Rate item | |
| Type: | Course Related Materials |
| Grade Level: | Post-secondary |
Author: Shai Simonson
Subject: Mathematics and Statistics
Institution Name:
ArsDigita University
Collection Name: ArsDigita University
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.
Details
Course Type: Full Course
Material Types: Homework and Assignments, Lecture Notes, Syllabi, Textbooks and Readings, Video Lectures, Other
Media Formats: Text/HTML, Downloadable docs, Video
Language: English
Additional Information
Geographic
Regional Relevance: All