Brief Introduction
Welcome to the self paced course, Algorithms: Design and Analysis, Part 2! Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This course is an introduction to algorithms for learners with at least a little programming experience.
Description
Welcome to the self paced course, Algorithms: Design and Analysis, Part 2! Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This course is an introduction to algorithms for learners with at least a little programming experience. The course is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this course, you will have a greater mastery of algorithms than almost anyone without a graduate degree in the subject.
Specific topics in Part 2 include: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes), dynamic programming (knapsack, sequence alignment, optimal search trees, shortest paths), NP-completeness and what it means for the algorithm designer, analysis of heuristics, local search.
Learners will practice and master the fundamentals of algorithms through several types of assessments. There are 6 multiple-choice problem sets to test your understanding of the most important concepts. There are also 6 programming assignments, where you implement one of the algorithms covered in lecture in a programming language of your choosing. The course concludes with a multiple-choice final.
There are no assignment due dates and you can work through the course materials and assignments at your own pace.
Knowledge
- greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes)
- dynamic programming (knapsack, sequence alignment
- optimal search trees, shortest paths)
- NP-completeness and what it means for the algorithm designer
- analysis of heuristics
- local search
Data Structures and Algorithmic Trading: Machine Learning
- 2.5
-
![]()
![]()
![]()
![]()
![]()
Data Structures and Algorithmic Trading: Machine Learning, Stock Trading, Invest In Cryptocurrency, Build A Forex Robot Algorithmic trading is not an attempt to make a trading profit....
Java Programming: Solving Problems with Software
- 4.6
-
![]()
![]()
![]()
![]()
![]()
Learn to code in Java and improve your programming and problem-solving skills. You will learn to design algorithms as well as develop and debug programs....
Real-Time Mission-Critical Systems Design
- 0.0
-
![]()
![]()
![]()
![]()
![]()
This course can also be taken for academic credit as ECEA 5317, part of CU Boulder’s Master of Science in Electrical Engineering degree....
Natural Attenuation of Groundwater Contaminants: New Paradigms, Technologies, and Applications
- 4.8
-
![]()
![]()
![]()
![]()
![]()
Cleaning up the large number of groundwater contamination sites is a significant and complex environmental challenge. Course Overview and MNA as an Evolving Technology...
