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. 

Suggested Readings

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.
Dates:
  • 5 October 2015, 6 weeks
  • 29 June 2015, 6 weeks
  • 19 January 2015, 6 weeks
  • 13 October 2014, 6 weeks
  • 28 April 2014, 6 weeks
  • 1 July 2013, 6 weeks
  • 28 January 2013, 6 weeks
  • 11 June 2012, 6 weeks
  • 12 March 2012, 5 weeks
Course properties:
  • Free:
  • Paid:
  • Certificate:
  • MOOC:
  • Video:
  • Audio:
  • Email-course:
  • Language: English Gb

Reviews

No reviews yet. Want to be the first?

Register to leave a review

Show?id=n3eliycplgk&bids=695438
Included in selections:
6-046jf05 Algorithms
Algorithms and data structures from the beginning to advanced analysis.
Introcomplexitylogo Network Science
Networks, graphs etc.
Vyyjayfzd3pynkssdhnqwcrx4bk4ennc1-ren956ujr2e1pya9umefxe-z08yngaz4nptzjr4nqcte0whwul=s0#w=1724&h=1060 Алгоритмизация вычислений
1 курс МИЭМ ВШЭ, 4 кредита
NVIDIA
More on this topic:
Lkq5d-g-umgnk574hji50bkwklgwosqb37yrfyqnh6jqfravvrdppxyufbqfejrkgls-tkeblf43omuuefw=s0#w=436&h=268 Intro to Parallel Programming. Using CUDA to Harness the Power of GPUs
Learn the fundamentals of parallel computing with the GPU and the CUDA programming...
Extensionflag Data Structures and Algorithms
This is a rigorous course on the design and analysis of efficient algorithms...
Classlogo Algorithmic Thinking
Experienced Computer Scientists analyze and solve computational problems at...
81094_d4ff_10 Introduction to Data Structures & Algorithms in Java
Designed to help understand the fundamentals of DS & Algorithms really well...
6-845f10 Quantum Complexity Theory
This course is an introduction to quantum computational complexity theory, the...
More from 'Computer Science':
9395b535-1fa7-4ed4-9fd8-98b86ba682d9-98e1ff5caeec.small UX Research
In this MOOC you will learn how to connect with users at every step of a digital...
61be438f-28b9-4339-9437-21c34b3c3dd6-e9ecfcecaf58.small UX Prototyping
Become a prototyping virtuoso! Master the ability to propel your creative team...
Df0769a9-8b89-44ae-b223-4e9de3905b38-b5f92c09ad8d.small UX Data Analysis
Become a UX data scientist! From qualitative data analysis to big data Web analytics...
0b33df59-ff43-4433-8c99-b3defeca1ad8-1c29cdafeead.small UX Management
Be a UX advocate! Lead the gamut of user-centered design activities, while sharing...
Developers-logo Google's Python Class
Welcome to Google's Python Class -- this is a free class for people with a little...
More from 'Coursera':
Success-from-the-start-2 First Year Teaching (Secondary Grades) - Success from the Start
Success with your students starts on Day 1. Learn from NTC's 25 years developing...
New-york-city-78181 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...
Small-icon.hover Aboriginal Worldviews and Education
This course will explore indigenous ways of knowing and how this knowledge can...
Ac-logo Analytic Combinatorics
Analytic Combinatorics teaches a calculus that enables precise quantitative...
Talk_bubble_fin2 Accountable Talk®: Conversation that Works
Designed for teachers and learners in every setting - in school and out, in...

© 2013-2019