Algorithms Specialization by Coursera
Course Features
Duration
4 months
Delivery Method
Online
Available on
Limited Access
Accessibility
Desktop, Laptop
Language
English
Subtitles
English
Level
Intermediate
Effort
4 hours per week
Teaching Type
Self Paced
Course Description
Course Overview
International Faculty
Case Based Learning
Post Course Interactions
Case Studies,Hands-On Training,Instructor-Moderated Discussions
Skills You Will Gain
Prerequisites/Requirements
Some related experience required
What You Will Learn
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)
Data structures (heaps, balanced search trees, hash tables, bloom filters), Graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysi
Greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and Dynamic programming (knapsack, sequence alignment, optimal search trees)
Course Instructors