關於此課程：This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures such as permutations, trees, strings, words, and mappings.
製作方： Princeton University
教學方： Robert Sedgewick, William O. Baker *39 Professor of Computer Science
Computer Science
| 級別 | 高級設置 |
| 語言 | English |
| 如何通過 | 通過所有計分作業以完成課程。 |
| 用戶評分 |
授課大綱
第 1 週
Analysis of Algorithms
We begin by considering historical context and motivation for the scientific study of algorithm performance. Then we consider a classic example that illustrates the key ingredients of the process: the analysis of Quicksort. The lecture concludes with a discussion of some resources that you might find useful during this course.
4 個視頻, 2 個閱讀材料
- 阅读: Getting Started
- 視頻: A Scientific Approach
- 視頻: Example: Quicksort
- 視頻: Resources
- 阅读: Exercises from Lecture 1
- 讨论提示: Exercises from Lecture 1
已評分: Analysis of Algorithms
第 2 週
Recurrences
We begin this lecture with an overview of recurrence relations, which provides us with a direct mathematical model for the analysis of algorithms. We finish by examining the fascinating oscillatory behavior of the divide-and-conquer recurrence corresponding to the mergesort algorithm and the general "master theorem" for related recurrences.
5 個視頻, 1 個閱讀材料, 2 個練習測驗
- 視頻: Telescoping
- 练习测验: Pop Quiz on Telescoping
- 視頻: Types of Recurrences
- 視頻: Mergesort
- 視頻: Master Theorem
- 练习测验: Pop Quiz on the Master Theorem
- 阅读: Exercises from Lecture 2
- 讨论提示: Exercises from Lecture 2
已評分: Recurrences
第 3 週
Generating Functions
Since the 17th century, scientists have been using generating functions to solve recurrences, so we continue with an overview of generating functions, emphasizing their utility in solving problems like counting the number of binary trees with N nodes.
5 個視頻, 1 個閱讀材料
- 視頻: Counting with Generating Functions
- 視頻: Catalan Numbers
- 視頻: Solving Recurrences
- 視頻: Exponential Generating Functions
- 阅读: Exercises from Lecture 3
- 讨论提示: Exercises from Lecture 3
已評分: Generating Functions
第 4 週
Asymptotics
Exact answers are often cumbersome, so we next consider a scientific approach to developing approximate answers that, again, mathematicians and scientists have used for centuries.
4 個視頻, 1 個閱讀材料
- 視頻: Manipulating Expansions
- 視頻: Asymptotics of Finite Sums
- 視頻: Bivariate Asymptotics
- 阅读: Exercises from Lecture 4
- 讨论提示: Exercises from Lecture 4
已評分: Asymptotics
第 5 週
Analytic Combinatorics
Analytic Combinatorics. With a basic knowledge of recurrences, generating functions, and asymptotics, you are ready to learn and appreciate the basic features of analytic combinatorics, a systematic approach that avoids much of the detail of the classical methods that we have been considering. We introduce unlabeled and labelled combinatorial classes and motivate our basic approach to studying them, with numerous examples.
4 個視頻, 2 個閱讀材料
- 視頻: Labelled Objects
- 視頻: Coefficient Asymptotics
- 阅读: Errata
- 視頻: Perspective
- 阅读: Exercises from Lecture 5
- 讨论提示: Exercises from Lecture 5
已評分: Analytic Combinatorics
第 6 週
Trees
The quintessential recursive structure, trees of various sorts are ubiquitous in scientific enquiry, and they arise explicitly in countless computing applications. You can find broad coverage in the textbook, but the lecture focuses on the use of analytic combinatorics to enumerate various types of trees and study parameters.
4 個視頻, 1 個閱讀材料
- 視頻: Binary Search Trees
- 視頻: Path Length
- 視頻: Other Types of Trees
- 阅读: Exercises from Lecture 6
- 讨论提示: Exercises from Lecture 6
已評分: Trees
第 7 週
Permutations
The study of sorting algorithms is the study of properties of permutations. We introduce analytic-combinatoric approaches to studying permutations in the context of this relationship.
5 個視頻, 1 個閱讀材料
- 視頻: Sets of Cycles
- 視頻: Left-Right-Minima
- 視頻: Other Parameters
- 視頻: BGFs and Distributions
- 阅读: Exercises from Lecture 7
- 讨论提示: Exercises from Lecture 7
已評分: Permutations
第 8 週
Strings and Tries
From DNA sequences to web indices, strings (sequences of characters) are ubiquitous in modern computing applications, so we use analytic combinatorics to study their basic properties and then introduce the trie, an essential and fundamental structure not found in classical combinatorics.
5 個視頻, 1 個閱讀材料
- 視頻: Languages
- 視頻: Tries
- 視頻: Trie Parameters
- 視頻: Exercises
- 阅读: Exercises from Lecture 8
- 讨论提示: Exercises from Lecture 8
已評分: Strings and Tries
第 9 週
Words and Mappings
We view strings as sets of characters or as functions from [1..N] to [1..M] to study classical occupancy problems and their application to fundamental hashing algorithms. Functions from [1..N] to [1..N] are mappings, which have an interesting and intricate structure that we can study with analytic combinatorics.
6 個視頻, 1 個閱讀材料
- 視頻: Birthday Problem
- 視頻: Coupon Collector Problem
- 視頻: Hash Tables
- 視頻: Mappings
- 視頻: Exercises
- 阅读: Exercises from Lecture 9
- 讨论提示: Exercises from Lecture 9
已評分: Strings and Words
常見問題解答
運作方式
课程作业
每门课程都像是一本互动的教科书，具有预先录制的视频、测验和项目。
来自同学的帮助
与其他成千上万的学生相联系，对想法进行辩论，讨论课程材料，并寻求帮助来掌握概念。
製作方
Princeton University
Princeton University is a private research university located in Princeton, New Jersey, United States. It is one of the eight universities of the Ivy League, and one of the nine Colonial Colleges founded before the American Revolution.
評分和審閱
This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems
This is great course if you already done some algorithms courses and want to go deeper.
IF
This course offers an extensive coverage of mathematical material like tools and techniques, putting special emphasis on simple principles and never losing its focus on the general perspective of the topic.
Developing insight on analytic functions together with combinatorics and the practical applications of theory into code gives a significant advantage over using naive approaches.
A special appreciation to Prof. Sedgewick's endless efforts for disseminating mathematical knowledge among programmers, over this platform and even outside!
Thank you very much.