Search result for Computational problems Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 129 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Problem Solving Using Computational Thinking
by Chris Quintana- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 11 hours to complete
Thinking through problems this way is Computational Thinking. This course is designed for anyone who is just beginning programming, is thinking about programming or simply wants to understand a new way of thinking about problems critically. -To develop solutions through the application of Computational Thinking concepts to real world problems Foundations of Computational Thinking...
Computational Thinking for Problem Solving
by Susan Davidson- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
Computational thinking is the process of approaching a problem in a systematic manner and creating and expressing a solution such that it can be carried out by a computer. Many quantitative and data-centric problems can be solved using computational thinking and an understanding of computational thinking will give you a foundation for solving problems that have real-world, social impact....
Algorithmic Thinking (Part 2)
by Luay Nakhleh , Scott Rixner , Joe Warren- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 12 hours to complete
Experienced Computer Scientists analyze and solve computational problems at a level of abstraction that is beyond that of any particular programming language. This two-part class is designed to train students in the mathematical concepts and process of "Algorithmic Thinking", allowing them to build simpler, more efficient solutions to computational problems....
Algorithmic Toolbox
by Alexander S. Kulikov , Michael Levin , Neil Rhodes , Pavel Pevzner , Daniel M Kane- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 39 hours to complete
The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second). Practice solving algorithmic interview problems...
Algorithmic Design and Techniques
by Pavel Pevzner , Daniel Kane , Alexander S. Kulikov , Michael Levin- 0.0
-
![]()
![]()
![]()
![]()
![]()
6 Weeks
Learn how to design algorithms, solve computational problems and implement solutions efficiently. In this course, part of the Algorithms and Data Structures MicroMasters program, you will learn basic algorithmic techniques and ideas for computational problems, which arise in practical applications such as sorting and searching, divide and conquer, greedy algorithms and dynamic programming....
$99
Advanced Programming in C++
by Aspen Olmsted , Itay Tal- 0.0
-
![]()
![]()
![]()
![]()
![]()
8 Weeks
They will also learn to analyze the computational complexity of their code. Computational complexity theory focuses on classifying computational problems according to their inherent difficulty and relating these classes to each other. The theory formalizes this intuition by introducing mathematical models of computation to study these problems and quantifying their computational complexity, i....
$332
Convex Optimization
by Stephen Boyd , Henryk Blasinski- 0.0
-
![]()
![]()
![]()
![]()
![]()
8 Weeks
This course concentrates on recognizing and solving convex optimization problems that arise in applications. This course concentrates on recognizing and solving convex optimization problems that arise in applications. Ernest Ryu is a PhD candidate in Computational and Mathematical Engineering at Stanford University. Madeleine Udell is a PhD candidate in Computational and Mathematical Engineering at Stanford University....
Related searches
Convex Optimization
by Stephen Boyd , Henryk Blasinski- 0.0
-
![]()
![]()
![]()
![]()
![]()
8 Weeks
This course concentrates on recognizing and solving convex optimization problems that arise in applications. This course concentrates on recognizing and solving convex optimization problems that arise in applications. Ernest Ryu is a PhD candidate in Computational and Mathematical Engineering at Stanford University. Madeleine Udell is a PhD candidate in Computational and Mathematical Engineering at Stanford University....
Abstraction, Problem Decomposition, and Functions
by Dr. Tim "Dr. T" Chamillard- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 17 hours to complete
This course is the third course in the specialization exploring both computational thinking and beginning C programming. Throughout this course the computational thinking topics you'll explore are abstraction, which is deciding which details matter for the problem you're trying to solve, and problem decomposition, which is about breaking large problems into smaller sub-problems to handle complexity....
Introduction to Graduate Algorithms
by Eric Vigoda , Arpan Chakraborty- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 3 months
Learn advanced techniques for designing algorithms and apply them to hard computational problems....
Free
