Skip to content Skip to navigation

Algorithms: Design and Analysis, Part 1 (Summer '16)

Date: 
Monday, August 8, 2016
Go to Course

About this Course

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This course is an introduction to algorithms for learners with at least a little programming experience. The course is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this course, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists. Specific topics include: "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 the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

Syllabus

Week 1

  1. I. INTRODUCTION (Week 1)
  2. II. ASYMPTOTIC ANALYSIS (Week 1)
  3. III. DIVIDE & CONQUER ALGORITHMS (Week 1)
  4. Problem Set #1
  5. Programming Assignment #1
  • Quiz: Problem Set #1
  • Quiz: Programming Assignment #1

Week 2

  1. IV. THE MASTER METHOD (Week 2)
  2. V. QUICKSORT - ALGORITHM (Week 2)
  3. VI. QUICKSORT - ANALYSIS (Week 2)
  4. VII. PROBABILITY REVIEW (Week 2)
  5. Problem Set #2
  6. Programming Assignment #2
  • Quiz: Problem Set #2
  • Quiz: Programming Question #2

Week 3

  1. VIII. LINEAR-TIME SELECTION (Week 3)
  2. IX. GRAPHS AND THE CONTRACTION ALGORITHM (Week 3)
  3. Problem Set #3
  4. Programming Assignment #3
  • Quiz: Problem Set #3
  • Quiz: Programming Assignment #3

Week 4

  1. X. GRAPH SEARCH AND CONNECTIVITY (Week 4)
  2. Problem Set #4
  3. Programming Assignment #4
  • Quiz: Problem Set #4
  • Quiz: Programming Assignment #4

Week 5

  1. XI. DIJKSTRA'S SHORTEST-PATH ALGORITHM (Week 5)
  2. XII. HEAPS (Week 5)
  3. XIII. BALANCED BINARY SEARCH TREES (Week 5)
  4. Problem Set #5
  5. Programming Assignment #5
  • Quiz: Problem Set #5
  • Quiz: Programming Assignment #5

Week 6

  1. XIV. HASHING: THE BASICS (Week 6)
  2. XV. UNIVERSAL HASHING (Week 6)
  3. XV. BLOOM FILTERS (Week 6)
  4. PREVIEW OF PART 2
  5. Problem Set #6
  6. Programming Assignment #6
  • Quiz: Problem Set #6
  • Quiz: Programming Assignment #6

Week 7

  1. Final Exam
  • Quiz: Final Exam

 

Instructor(s): 
Tim Roughgarden
Algorithms: Design and Analysis, Part I  Course Image

View All Courses

Access learning material from upcoming, self-study, and completed courses...