What Will You Learn?
"Big-oh" notation
Sorting and searching
Divide and conquer (master method, integer and matrix multiplication, closest pair)
Randomized algorithms (QuickSort, contraction algorithm for min cuts)
Data structures (heaps, balanced search trees, hash tables, bloom filters)
Graph primitives (applications of BFS and DFS, connectivity, shortest paths)
About This Course
Provider: Edx
Format: Online
Duration: 24 hours to complete [Approx]
Target Audience: Intermediate
Learning Objectives: After completing this free course learners will be able to master the fundamentals of algorithms through several types of assessments.
Course Prerequisites: Basic programming skills in a language such as Python, Java, or C
Assessment and Certification: Earn a Certificate upon completion from the relevant Provider
Instructor: Standford Online
Key Topics: Algorithms, Matrix Multiplication, Master Theorem, Divide And Conquer, Data Structures, Bloom Filter, Computer Science
Topic Covered:
- - Introduction
- - Asymptotic Analysis
- - Divide & Conquer Algorithms
- - The Master Method
- - Quicksort - Algorithm
- - Quicksort - Analysis
- - Probability Review
- - Linear-Time Selection
- - Graphs and the Contraction Algorithm
- - Graph Search and Connectivity
- - Dijkstra's Shortest-Path Algorithm
- - Heaps
- - Balanced Binary Search Trees
- - Hashing: The Basics
- - Universal Hashing
- - Bloom Filters
- - Final Exam
0 Comments