link
Source: www.coursera.org
list
6 sequences
assignment
Level : Introductory
chat_bubble_outline
Language : English
card_giftcard
240 points
Users' reviews
Key Information
credit_card
Free access
verified_user
Free certificate
timer
30 hours in total
About the content
In this course you will learn several fundamental principles of algorithm design: divide-and-conquer methods, graph algorithms, practical data structures (heaps, hash tables, search trees), randomized algorithms, and more.
more_horiz
Read more
more_horiz
Read less
dns
Syllabus
Week 1: Introduction. Asymptotic analysis including big-oh notation. Divide-and-conquer algorithms for sorting, counting inversions, matrix multiplication, and closest pair.
Week 2: Running time analysis of divide-and-conquer algorithms. The master method. Introduction to randomized algorithms, with a probability review. QuickSort.
Week 3: More on randomized algorithms and probability. Computing the median in linear time. A randomized algorithm for the minimum graph cut problem.
Week 4: Graph primitives. Depth- and breadth-first search. Connected components in undirected graphs. Topological sort in directed acyclic graphs. Strongly connected components in directed graphs.
Week 5: Dijkstra's shortest-path algorithm. Introduction to data structures. Heaps and applications.
Week 6: Further data structures. Hash tables and applications. Balanced binary search trees.
Week 2: Running time analysis of divide-and-conquer algorithms. The master method. Introduction to randomized algorithms, with a probability review. QuickSort.
Week 3: More on randomized algorithms and probability. Computing the median in linear time. A randomized algorithm for the minimum graph cut problem.
Week 4: Graph primitives. Depth- and breadth-first search. Connected components in undirected graphs. Topological sort in directed acyclic graphs. Strongly connected components in directed graphs.
Week 5: Dijkstra's shortest-path algorithm. Introduction to data structures. Heaps and applications.
Week 6: Further data structures. Hash tables and applications. Balanced binary search trees.
record_voice_over
Instructors
- Tim Roughgarden - Computer Science
store
Content Designer
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
assistant
Platform
Coursera is a digital company offering massive open online course founded by computer teachers Andrew Ng and Daphne Koller Stanford University, located in Mountain View, California.
Coursera works with top universities and organizations to make some of their courses available online, and offers courses in many subjects, including: physics, engineering, humanities, medicine, biology, social sciences, mathematics, business, computer science, digital marketing, data science, and other subjects.
Reviews
4.8
/5
Average
starstarstarstarstar
1
starstarstarstarstar
0
starstarstarstarstar
0
starstarstarstarstar
0
starstarstarstarstar
0
Content
5/5
Platform
4.5/5
Animation
5/5
You are the designer of this MOOC?
keyboard_arrow_left
grade
keyboard_arrow_right
Integrate the reviews system
1 review
0 points
