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
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....
Computational Geometry
by Alexander S. Kulikov , Aliaksei Tolstsikau , Kira Vyatkina- 3.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 19 hours to complete
This course represents an introduction to computational geometry – a branch of algorithm theory that aims at solving problems about geometric objects. Its application areas include computer graphics, computer-aided design and geographic information systems, robotics, and many others. Point inclusion in a polygon 1. 1 Introduction 1. 2 Problem statement 1....
Big Data Analysis with Scala and Spark
by Prof. Heather Miller- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 28 hours to complete
Manipulating big data distributed over a cluster using functional concepts is rampant in industry, and is arguably one of the first widespread industrial uses of functional ideas. This is evidenced by the popularity of MapReduce and Hadoop, and most recently Apache Spark, a fast, in-memory distributed collections framework written in Scala....
Cloud Computing Concepts, Part 1
by Indranil Gupta- 4.4
-
![]()
![]()
![]()
![]()
![]()
Approx. 23 hours to complete
Cloud computing systems today, whether open-source or used inside companies, are built using a common set of core techniques, algorithms, and design philosophies – all centered around distributed systems. Learn about such fundamental distributed computing "concepts" for cloud computing. Know how these systems work from the inside out. Get your hands dirty using these concepts with provided homework exercises....
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search). Week 1 Single-Source Shortest Paths, Revisted Optimal Substructure The Basic Algorithm I The Basic Algorithm II...
Number Theory and Cryptography
by Alexander S. Kulikov , Michael Levin , Владимир Подольский- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 19 hours to complete
We all learn numbers from the childhood. Some of us like to count, others hate it, but any person uses numbers everyday to buy things, pay for services, estimated time and necessary resources. People have been wondering about numbers’ properties for thousands of years. Famous 20th century mathematician G. H. You will even pass a cryptographic quest!...
Previous
