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.
Analysis of Algorithms프린스턴 대학교
이 강좌에 대하여
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.
- 5 stars76.15%
- 4 stars11.25%
- 3 stars5.96%
- 2 stars2.64%
- 1 star3.97%
ANALYSIS OF ALGORITHMS의 최상위 리뷰
I enjoyed problems given in the quizzes. The course is one of the best presentations I have seen.
Wonderful insights about the study of the algorithm's complexity and combinatoric logic.
This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems
Excellent course with very interesting and well explained topics, for those with certain background in mathematics (and, specially, in analysis and combinatorics).
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
Can I earn a certificate in this course?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.