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.
Exercises
Loading...
Revisiones
ON
Apr 08, 2020
Wonderful insights about the study of the algorithm's complexity and combinatoric logic.
HL
Mar 10, 2018
This is great course if you already done some algorithms courses and want to go deeper.
De la lección
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.
Impartido por:
Robert Sedgewick
William O. Baker *39 Professor of Computer Science
Explora nuestro catálogo
Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.
© 2020 Coursera Inc. Todos los derechos reservados.
