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. All the features of this course are available for free. It does not offer a certificate upon completion.
Bitstrings with Restrictions
Loading...
Avis
4.5 (160 évaluations)
- 5 stars76,25Â %
- 4 stars11,87Â %
- 3 stars5,62Â %
- 2 stars2,50Â %
- 1 star3,75Â %
AV
24 août 2020
I enjoyed problems given in the quizzes. The course is one of the best presentations I have seen.
ON
7 avr. 2020
Wonderful insights about the study of the algorithm's complexity and combinatoric logic.
À partir de la leçon
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.
Enseigné par
Robert Sedgewick
William O. Baker *39 Professor of Computer Science
Explorer notre catalogue
Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.
Coursera Footer
© 2022 Coursera Inc. Tous droits réservés.
