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
Algorithms, Part II
by Robert Sedgewick , Kevin Wayne- 4.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 63 hours to complete
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms. All the features of this course are available for free....
Computer Science: Algorithms, Theory, and Machines
by Robert Sedgewick , Kevin Wayne- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 20 hours to complete
This course introduces the broader discipline of computer science to people having basic familiarity with Java programming. It covers the second half of our book Computer Science: An Interdisciplinary Approach (the first half is covered in our Coursera course Computer Science: Programming with a Purpose, to be released in the fall of 2018)....
Analysis of Algorithms
by Robert Sedgewick- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 21 hours to complete
This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures such as permutations, trees, strings, words, and mappings....
Approximation Algorithms Part I
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 36 hours to complete
Approximation algorithms, Part I How efficiently can you pack objects into a minimum number of boxes? How well can you cluster nodes so as to cheaply separate a network into components around a few centers? These are examples of NP-hard combinatorial optimization problems. The course content and in particular the homework is of a theoretical nature without any programming assignments....
Competitive Programming for Beginners
by Filipp Rukhovich , Ilia Stepanov , Oleg Hristenko , Vladislav Nevstruev- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 153 hours to complete
This online course will help you to join the world of competitive programming and even become worldwide competitions participant! The course includes theoretical and practical aspects that are necessary to solve problems of any difficulties. You will also learn how to submit your solution to the testing system. Program Modules: Module 1: Basic Algorithms...
Approximation Algorithms Part II
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 33 hours to complete
Approximation algorithms, Part 2 This is the continuation of Approximation algorithms, Part 1. Here you will learn linear programming duality applied to the design of some approximation algorithms, and semidefinite programming applied to Maxcut. The course content and in particular the homework is of a theoretical nature without any programming assignments....
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. But you don't need to be a computer scientist to think like a computer scientist! In fact, we encourage students from any field of study to take this course....
Build a Modern Computer from First Principles: From Nand to Tetris (Project-Centered Course)
by Shimon SchockenTop Instructor , Noam NisanTop Instructor- 4.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 44 hours to complete
What you’ll achieve: In this project-centered course* you will build a modern computer system, from the ground up. We’ll divide this fascinating journey into six hands-on projects that will take you from constructing elementary logic gates all the way through creating a fully functioning general purpose computer. What you’ll need: Course format:...
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 17 hours to complete
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts). Week 1 Why Study Algorithms? Integer Multiplication Karatsuba Multiplication About the Course Merge Sort: Motivation and Example...
Excel/VBA for Creative Problem Solving, Part 1
by Charlie NuttelmanTop Instructor- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
"Excel/VBA for Creative Problem Solving, Part 1" 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). New to computer programming? e. Macro recording, VBA procedures, and debugging...
Previous
