Search result for Design and analysis of algorithm Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 1,057 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
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 Heap, Min/Max-Heaps and Properties of Heaps Partition and Quicksort Algorithm Analysis of Quicksort Algorithm...
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). Guiding Principles for Analysis of Algorithms Big Omega and Theta Welcome and Week 1 Overview Analysis of Contraction Algorithm...
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. ●Describe the process of instructional design and instructional design models Talent Development and the Role of Instructional Design in TD...
Approximation Algorithms
by Mark de Berg- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 15 hours to complete
The goal of this course is to become familiar with important algorithmic concepts and techniques needed to effectively deal with such problems. - Graph terminology, representations of graphs (adjacency lists and adjacency matrix), basic graph algorithms (BFS, DFS, topological sort, shortest paths) Analysis of the greedy-algorithm Analysis of the PTAS for knapsack: approximation ratio...
Algorithm Design and Analysis
by Sampath Kannan- 0.0
-
![]()
![]()
![]()
![]()
![]()
4 Weeks
Learn about the core principles of computer science: algorithmic thinking and computational problem solving. 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. How to analyze the efficiency of algorithms...
$149
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....
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 Proof of Cut Property [Advanced - Optional] Correctness of Kruskal's Algorithm Correctness of Clustering Algorithm Analysis of Union-by-Rank [Advanced - Optional]...
Related searches
Software Architecture & Design
by Spencer Rugaber , Eric Feron , Jarrod Parkes- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 2 months
This course will equip students with the skills and knowledge necessary to accomplish the following objectives: Software Architecture and Design teaches the principles and concepts involved in the analysis and design of large software systems....
Free
Approximation Algorithms Part I
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 36 hours to complete
This course assumes knowledge of a standard undergraduate Algorithms course, and particularly emphasizes algorithms that can be designed using linear programming, a favorite and amazingly successful technique in this area. 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....
Fundamentals of Audio and Music Engineering: Part 1 Musical Sound & Electronics
by Robert Clark , Mark Bocko- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
In this course students learn the basic concepts of acoustics and electronics and how they can applied to understand musical sound and make music with electronic instruments. Week 6 - Guitar Pickup and Effects Analysis MB & Design and Construction of a Guitar Amplifier MB Design Overview and Tone Control Analysis...
