Algorithms: Design and Analysis, Part 1

Tim Roughgarden, Stanford University

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.

In this course you will learn several fundamental principles of algorithm design. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication. You'll learn several blazingly fast primitives for computing on graphs, such as how to compute connectivity information and shortest paths. Finally, we'll study how allowing the computer to "flip coins" can lead to elegant and practical algorithms and data structures. Learn the answers to questions such as: How do data structures like heaps, hash tables, bloom filters, and balanced search trees actually work, anyway? How come QuickSort runs so fast? What can graph algorithms tell us about the structure of the Web and social networks? Did my 3rd-grade teacher explain only a suboptimal algorithm for multiplying two numbers?

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.

Recommended Background

How to program in at least one programming language (like C, Java, or Python); and familiarity with proofs, including proofs by induction and by contradiction.  At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors.

No specific textbook is required for the course.  Much of the course material is covered by the well-known textbooks on algorithms, and the student is encouraged to consult their favorite for additional information.

Course Format

The class will consist of lecture videos, generally between 10 and 15 minutes in length. These usually integrated quiz questions. There will also be standalone homeworks and programming assignments that are not part of video lectures, and a final exam.

FAQ

• Will I get a statement of accomplishment after completing this class?

Yes. Students who successfully complete the class will receive a statement of accomplishment signed by the instructor.

• What is the format of the class?

The class consists of lecture videos, which are broken into small chunks, usually between eight and twelve minutes each. Some of these may contain integrated quiz questions. There will also be standalone quizzes that are not part of video lectures. There will be approximately two hours worth of video content per week.

• What should I know to take this class? How to program in at least one programming language (like C, Java, or Python); familiarity with proofs, including proofs by induction and by contradiction; and some discrete probability, like how to compute the probability that a poker hand is a full house. At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors.

• 2015年10月05日, 6 星期
• 2015年6月29日, 6 星期
• 2015年1月19日, 6 星期
• 2014年10月13日, 6 星期
• 2014年4月28日, 6 星期
• 2013年7月01日, 6 星期
• 2013年1月28日, 6 星期
• 2012年6月11日, 6 星期
• 2012年3月12日, 5 星期

• 免费:
• 收费:
• 证书:
• MOOC:
• 视频讲座:
• 音频讲座:
• Email-课程:
• 语言: 英语

反馈

Algorithms
Algorithms and data structures from the beginning to advanced analysis.
Network Science
Networks, graphs etc.
Алгоритмизация вычислений
1 курс МИЭМ ВШЭ, 4 кредита

Combinatorial Analysis
This course analyzes combinatorial problems and methods for their solution....
Introduction to Algorithms (SMA 5503)
This course teaches techniques for the design and analysis of efficient algorithms...
Foundations of Algorithms and Computational Techniques in Systems Biology
This subject describes and illustrates computational approaches to solving problems...
Algorithmic Thinking
Experienced Computer Scientists analyze and solve computational problems at...
Graph Partitioning and Expanders
The Course In this research-oriented graduate course, we will study algorithms...

Artificial Intelligence (AI)
Learn the fundamentals of Artificial Intelligence (AI), and apply them. Design...
Machine Learning
Master the essentials of machine learning and algorithms to help improve learning...
Animation and CGI Motion
Learn the science behind movie animation from the Director of Columbia’s Computer...
Robotics
Learn the core techniques for representing robots that perform physical tasks...
Neo4j Koans
A koan-style tutorial in Java for Neo4j. This set of Koans provides a hands...

First Year Teaching (Secondary Grades) - Success from the Start
Success with your students starts on Day 1. Learn from NTC's 25 years developing...
Understanding 9/11: Why Did al Qai’da Attack America?
This course will explore the forces that led to the 9/11 attacks and the policies...
Aboriginal Worldviews and Education
This course will explore indigenous ways of knowing and how this knowledge can...
Analytic Combinatorics
Analytic Combinatorics teaches a calculus that enables precise quantitative...
Accountable Talk®: Conversation that Works
Designed for teachers and learners in every setting - in school and out, in...