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
Combinatorics and Probability
by Alexander S. Kulikov , Владимир Подольский- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 21 hours to complete
Counting is one of the basic mathematically related tasks we encounter on a day to day basis. The main question here is the following. If we need to count something, can we do anything better than just counting all objects one by one? All these questions are addressed by a mathematical field called Combinatorics....
Algorithms on Graphs
by Alexander S. Kulikov , Michael Levin , Daniel M Kane , Neil Rhodes- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 55 hours to complete
If you have ever used a navigation service to find optimal route and estimate time to destination, you've used algorithms on graphs. In this course, you will first learn what a graph is and what are some of the most important properties. You will use these algorithms if you choose to work on our Fast Shortest Routes industrial capstone project....
Excel/VBA for Creative Problem Solving, Part 3 (Projects)
by Charlie NuttelmanTop Instructor- 4.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 16 hours to complete
In this course, learners will complete several VBA projects. It is highly recommended that learners first take "Excel/VBA for Creative Problem Solving, Part 1" and "Excel/VBA for Creative Problem Solving, Part 2". This course builds off of skills learned in those two courses. This is a project-based course. Getting Started Welcome...
Data Structures and Performance
by Christine Alvarado , Mia Minnes , Leo Porter- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 42 hours to complete
How do Java programs deal with vast quantities of data? Many of the data structures and algorithms that work with introductory toy examples break when applications process real, large data sets. Efficiency is critical, but how do we achieve it, and how do we even measure it? This is an intermediate Java course....
Algorithms for Searching, Sorting, and Indexing
by Sriram Sankaranarayanan- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 34 hours to complete
This course covers basics of algorithm design and analysis, as well as algorithms for sorting arrays, data structures such as priority queues, hash functions, and applications such as Bloom filters. Algorithms for Searching, Sorting, and Indexing can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform....
Everyday Excel, Part 3 (Projects)
by Charlie NuttelmanTop Instructor- 5
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
"Everyday Excel, Part 3 (Projects)" is a continuation of "Everyday Excel, Parts 1 and 2". It is a capstone, projects-based course in which you will apply what you've learned previously to more complex, somewhat open-ended projects (open-ended with respect to the fact that they can be solved in multiple ways). Introduction and General Course Information...
Operations Research (1): Models and Applications
by 孔令傑 (Ling-Chieh Kung)- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 11 hours to complete
Operations Research (OR) is a field in which people use mathematical and engineering methods to study optimization problems in Business and Management, Economics, Computer Science, Civil Engineering, Industrial Engineering, etc. This course introduces frameworks and ideas about various types of optimization problems in the business world. Course Overview Prelude 1-1: Motivation....
Detección de objetos
by Antonio López Peña , Ernest Valveny , Maria Vanrell- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
¿Te interesa la visión por computador? ¿Te gustaría conocer qué métodos puedes utilizar para detectar y reconocer objetos en una imagen? En este curso te introducirás en los principios básicos de cualquier sistema automático de detección y reconocimiento de objetos en imágenes. Finalizar el curso te permitirá: • Conocer las principales técnicas para la descripción y clasificación de una imagen,...
Sesenta años de inteligencia artificial
by Carlos GershensonTop Instructor- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 5 hours to complete
En este curso, ofrecido por la UNAM, cubriremos el pasado, presente y futuro de la inteligencia artificial. También mencionaremos los conceptos más importantes que serán útiles en el resto del programa especializado. Discutiremos las implicaciones sociales, éticas y filosóficas de los desarrollos en inteligencia artificial. El pensamiento de la inteligencia artificial...
算法设计与分析 Design and Analysis of Algorithms
by Wanling Qu- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 25 hours to complete
课程教学目标 针对实际问题需求，进行数学建模并选择高效求解算法的训练，为提高学生的素质和创新能力打下必要的基础。主要内容涉及：面对实际问题建立数学模型、设计正确的求解算法、算法的效率估计、改进算法的途径、问题计算复杂度的估计、难解问题的确定和应对策略等等。本课程是算法课程的基础部分，主要涉及算法的设计、分析与改进途径，其他有关计算复杂性的内容将在后续课程中加以介绍。 课程内容安排 本课程的内容分成两大部分：算法的基础知识、通用算法设计技术与分析方法。 第一部分是算法基础知识，约占20%，主要介绍算法相关的基本概念和数学基础。比如，什么是算法的伪码描述？什么是算法最坏情况下和平均情况下的时间复杂度？算法时间复杂度函数的主要性质，算法复杂度估计中常用的数学方法，如序列求和及递推方程求解。 第二部分是通用的算法设计技术与分析方法，主要介绍分治策略、动态规划、贪心法、回溯与分支限界。主要介绍这些设计技术的使用条件、分析方法、改进途径，并给出一些重要的应用。 算法基础 001本周教学内容简介 002算法设计的两个例子 003问题的计算复杂度：排序问题 004货郎问题与计算复杂性 005算法及其时间复杂度 006算法的伪码表示 007函数的渐近的界 008有关函数渐近的界的定理 009几类重要的函数 第一周作业 序列求和与递推方程 010本周教学内容简介 011序列求和的方法 012递推方程与算法分析 013迭代法求解递推方程 014差消法求解递推方程 015递归树 016主定理及其证明 017主定理的应用 第二周作业 分治算法的设计与分析 018本周教学内容简介 019分治策略的设计思想 020分治算法的一般描述和分析方法 021芯片测试 022快速排序 023幂乘算法及应用 024改进分治算法的途径1：减少子问题数 025改进分治算法的途径2：增加预处理 第三周作业 分治算法的典型应用 026本周教学内容简介（01:19） 027选最大与选最小 028选第二大 029一般选择问题的算法设计 030一般选择问题的算法分析 031卷积及应用 032卷积计算 033快速傅立叶变换FFT算法 034平面点集的凸包 第四周作业 动态规划算法 035本周教学内容简介 036动态规划算法的例子...
Previous
