Search result for Algorithm analysis and design Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 1,086 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Algorithm Design and Analysis
by Sampath Kannan- 0.0
-
![]()
![]()
![]()
![]()
![]()
4 Weeks
This course, part of the Computer Science Essentials for Software Development Professional Certificate program, is an introduction to design and analysis of algorithms, and answers along the way these and many other interesting computational questions. After completing this course you will be able to design efficient and correct algorithms using sophisticated data structures for complex computational tasks....
$149
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). Big Omega and Theta Welcome and Week 1 Overview Overview, Resources, and Policies Analysis of Contraction Algorithm...
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. Merge Sort Algorithm, Analysis and Proof of Correctness Partition and Quicksort Algorithm Analysis of Quicksort Algorithm Quickselect Algorithm and its Applications...
Instructional Design Foundations and Applications
by Eunjung Grace Oh- 4.1
-
![]()
![]()
![]()
![]()
![]()
Approx. 13 hours to complete
This course, Instructional Design Foundations, introduces learners to the conceptual and theoretical foundations of instructional design as well as the analysis aspect of instructional systems design in order to create an innovative instructional solution to performance problems in organizations. Instructional Theories and Models for Instructional Design Talent Development and the Role of Instructional Design in TD...
Data Structures and Design Patterns for Game Developers
by Dr. Tim "Dr. T" Chamillard- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 22 hours to complete
Data structures and design patterns are both general programming and software architecture topics that span all software, not just games. Module 1: Explore a Dynamic Array data structure and learn the basics of algorithm analysis Module 4: Learn why design patterns are so useful and discover a number of design patterns useful in game development Dynamic Arrays and Algorithm Analysis...
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). Prim's MST Algorithm Overview, Resources, and Policies Kruskal's MST Algorithm Correctness of Kruskal's Algorithm Implementing Kruskal's Algorithm via Union-Find I Implementing Kruskal's Algorithm via Union-Find II...
Problem Solving, Python Programming, and Video Games
by Duane Szafron , Paul Lu- 4.2
-
![]()
![]()
![]()
![]()
![]()
Approx. 78 hours to complete
Syntax Analysis (statement and assignment statement) Syntax Analysis (binary expression and binary operator) Syntax Analysis (import statement and module) Syntax Analysis (method call and attribute reference) Semantic Analysis (method call and attribute reference) Lexical Analysis (newline, indent and dedent) Syntax Analysis (elif and else clauses) Semantic Analysis (elif and else clause)...
Related searches
Simulation, Algorithm Analysis, and Pointers
by Dr. Tim "Dr. T" Chamillard- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 11 hours to complete
Throughout this course the computational thinking topics you'll explore are: automation, simulation, parallelization, and algorithm analysis. Module 1: Learn how to read, write, and append to files. Module 3: Learn how to perform algorithm analysis to quantify algorithm complexity Algorithm Analysis Algorithm Analysis Lecture and Reading Code Algorithm Analysis Practice Quiz Algorithm Analysis Graded Quiz...
Approximation Algorithms Part II
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 33 hours to complete
Here you will learn linear programming duality applied to the design of some approximation algorithms, and semidefinite programming applied to Maxcut. By taking the two parts of this course, you will be exposed to a range of problems at the foundations of theoretical computer science, and to powerful design and analysis techniques....
Approximation Algorithms Part I
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 36 hours to complete
By taking this course, you will be exposed to a range of problems at the foundations of theoretical computer science, and to powerful design and analysis techniques. Vertex cover and Linear Programming Lecture: Approximation algorithm Lecture: Analysis A reference on this stopping time analysis Multiway Cut and Randomized Rounding Lecture: analysis...
