Search result for Algorithms Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 103 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Computer Vision Basics
by Radhakrishna Dasari , Junsong Yuan- 4.2
-
![]()
![]()
![]()
![]()
![]()
Approx. 13 hours to complete
By the end of this course, learners will understand what computer vision is, as well as its mission of making computers see and interpret the world as humans do, by learning core concepts of the field and receiving an introduction to human vision capabilities. The course covers crucial elements that enable computer vision: digital signal processing, neuroscience and artificial intelligence....
Introduction to numerical analysis
by Evgeni Burovski- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
Numerical computations historically play a crucial role in natural sciences and engineering. These days however, it’s not only traditional «hard sciences»: whether you do digital humanities or biotechnology, whether you design novel materials or build artificial intelligence systems, virtually any quantitative work involves some amount of numerical computing . We rely on libraries which package tried-and-tested, battle-hardened numerical primitives....
Competitive Programmer's Core Skills
by Alexander S. Kulikov , Alexander Logunov , Kirill Simonov , Aliaksei Tolstsikau- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 32 hours to complete
During the course, you’ll learn everything needed to participate in real competitions — that’s the main goal. Along the way you’ll also gain useful skills for which competitive programmers are so highly valued by employers: ability to write efficient, reliable, and compact code, manage your time well when it’s limited, apply basic algorithmic ideas to real problems, etc....
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 15 hours to complete
The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees). Week 1 Application: Internet Routing Application: Sequence Alignment Introduction to Greedy Algorithms Application: Optimal Caching Problem Definition A Greedy Algorithm Correctness Proof - Part I...
Data Structures
by Alexander S. Kulikov , Michael Levin , Daniel M Kane , Neil Rhodes- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 25 hours to complete
A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments....
VLSI CAD Part I: Logic
by Rob A. Rutenbar- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 23 hours to complete
A modern VLSI chip has a zillion parts -- logic, control, memory, interconnect, etc. How do we design these complex chips? Answer: CAD software tools. How do people manage to design these complicated chips? Answer: a sequence of computer aided design (CAD) tools takes an abstract description of the chip, and refines it step-wise to a final design....
Excel/VBA for Creative Problem Solving, Part 2
by Charlie NuttelmanTop Instructor- 4.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 20 hours to complete
"Excel/VBA for Creative Problem Solving, Part 2" builds off of knowledge and skills obtained in "Excel/VBA for Creative Problem Solving, Part 1" and is aimed at learners who are seeking to augment, expand, optimize, and increase the efficiency of their Excel spreadsheet skills by tapping into the powerful programming, automation, and customization capabilities available with Visual Basic for Applications (VBA)....
Automated Reasoning: satisfiability
by Hans Zantema- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 25 hours to complete
In this course you will learn how to apply satisfiability (SAT/SMT) tools to solve a wide range of problems. Several basic examples are given to get the flavor of the applications: fitting rectangles to be applied for printing posters, scheduling problems, solving puzzles, and program correctness. To get a flavor of the topic this may work out fine....
Introduction to Graph Theory
by Alexander S. Kulikov- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 21 hours to complete
We invite you to a fascinating journey into Graph Theory — an area which connects the elegance of painting and the rigor of mathematics; is simple, but not unsophisticated. Graph Theory gives us, both an easy way to pictorially represent many major mathematical results, and insights into the deep theories behind them....
Problem Solving Using Computational Thinking
by Chris Quintana- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 11 hours to complete
Have you ever heard that computers "think"? Believe it or not, computers really do not think. Instead, they do exactly what we tell them to do. Programming is, "telling the computer what to do and how to do it. " Thinking through problems this way is Computational Thinking. No prior programming is needed....
Previous
