Algorithms's Full Profile
This course focuses on the fundamentals of computer algorithms, emphasizing methods useful in practice. We look into the algorithm analysis as a way to understand behavior of computer programs as a function of its input size. Using the big-O notation, we classify algorithms by their efficiency. We look into basic algorithm strategies and approaches to problem solving. Some of these approaches include the divide and conquer method, dynamic programming, and greedy programming paradigms. Sorting and searching algorithms are discussed in detail as they form part of a solution to a large number of problems solved using computers. We also provide an introduction to the graph theory and graph algorithms as they are also used in many computer-based applications today. We conclude the course with a look into a special class of problems called the NP-complete problems.
Days of the Week:
Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
- Level of Difficulty: All Levels
- Size: One-on-One
- Cost: Free
- Institution: Saylor
The mission of the Saylor Foundation is to make education freely available to all. Guided by the belief that technology has the potential to circumvent barriers that prevent many individuals from participating in traditional schooling models, the Foundation is committed to developing and advancing inventive and effective ways of harnessing technology in order to drive the cost of education down to zero
Questions about Algorithms
Want more info about Algorithms?
Get free advice from education experts and Noodle community members.