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
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....
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....
Основы программирования на Python
by Густокашин Михаил Сергеевич- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 87 hours to complete
Язык программирования Python является одним из самых простых в освоении и популярных языков программирования. Целью курса является изучение основных конструкций языка Python, которые пригодятся при решении широкого круга задач – от анализа данных до разработки новых программных продуктов. Также слушатели познакомятся с основами различных парадигм программирования: процедурным, функциональным и объектно-ориентированным программированием....
离散数学概论 Discrete Mathematics Generality
by 陈斌- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 27 hours to complete
离散数学是计算机科学的基础理论，离散结构的基础知识和逻辑思维的形式化是信息技术类学生的基本功，离散数学的基本概念是理科专业学生进行信息类课程学习的重要基础。 本课程介绍计算机科学和信息技术理论基础的概念和思想方法，介绍数理逻辑、集合论、图论、抽象代数和形式语言与自动机等各部分的基本概念，介绍离散数学基本概念和空间信息技术之间的联系与结合，培养学生理解和掌握离散数学基本概念，采用形式化方法分析问题，并能自觉运用逻辑分析、结构层次分析和同构类比等思想方法解决问题的能力。 数理逻辑：基本概念 01-课程介绍 02-正式内容之前：形式化及其极限 03-正式内容之前：悖论、版画、卡农 04-数理逻辑介绍 05-什么是命题 06-排中律 07-命题符号化 08-逻辑联结词（上） 09-逻辑联结词（下） 10-命题公式 11-真值函数 12-命题形式化 课件 测验#1 数理逻辑：命题逻辑及形式系统 13-重言式 14-逻辑等价式和逻辑蕴涵式 15-代入原理和替换原理 16-证明逻辑等价式和逻辑蕴涵式 17-范式及基本术语 18-求范式的一般步骤 19-主范式 20-联结词集完备性 21-形式系统和证明、演绎 22-命题演算形式系统PC 23-PC中的定理证明 24-三个元定理 25-定理判定问题 课件 测验#2 数理逻辑：谓词逻辑及形式系统 26-数理逻辑-个体、谓词和量词 27-数理逻辑-谓词公式 28-数理逻辑-谓词公式永真式 29-数理逻辑-谓词演算形式系统FC 30-数理逻辑-全称引入规则及存在消除规则 31-数理逻辑-自然推理系统 32-数理逻辑-ND中的定理证明 课件 测验#3 集合论：集合代数 33-集合论与无限 34-集合基本概念 35-子集合 36-集合基本运算 37-集合族及运算 38-归纳定义 39-自然数的定义...
Квантовые вычисления (Quantum computing)
by Сысоев Сергей Сергеевич- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
Квантовые вычисления — это технологии будущего, в которых остро нуждаются уже в современном мире. Потребность в специалистах технологии будущего подтверждает актуальность данного курса сегодня. В течение курса учащиеся поймут где точки соприкосновения физики и информатики, знакомятся с алгоритмами для квантового компьютера, алгоритмами Шора и алгоритмами Гровера. Введение О чем этот курс?...
Previous
