{
    "links":{},
    "photo":"https://coursera-course-photos.s3.amazonaws.com/b8/a99c90ef60cd3677af72de4b128ec8/aofa-logo.png",
    "courseFormat":"There will be one lecture (about 80 minutes) and a problem set each week.",
    "smallIcon":"https://d15cw65ipctsrr.cloudfront.net/45/e34eeed7950dbc63909ad29a7ffbce/aofa-logo.png",
    "universityLogo":"",
    "video":"HICqzbexJlg",
    "smallIconHover":"https://d15cw65ipctsrr.cloudfront.net/45/e34eeed7950dbc63909ad29a7ffbce/aofa-logo.png",
    "shortDescription":"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.",
    "id":688,
    "estimatedClassWorkload":"6-8 hours/week",
    "universityLogoSt":"",
    "targetAudience":1,
    "courseSyllabus":"<div>Lecture &nbsp;1 &nbsp;Analysis of Algorithms</div><div>Lecture &nbsp;2 &nbsp;Recurrences</div><div>Lecture &nbsp;3 &nbsp;Solving recurrences with GFs</div><div>Lecture &nbsp;4 &nbsp;Asymptotics</div><div>Lecture &nbsp;5 &nbsp;The symbolic method</div><div>Lecture &nbsp;6 &nbsp;Trees</div><div>Lecture &nbsp;7 &nbsp;Permutations</div><div>Lecture &nbsp;8 &nbsp;Strings and Tries</div><div>Lecture &nbsp;9 &nbsp;Words and Mappings</div>",
    "aboutTheCourse":"Analysis of Algorithms aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the scientific analysis of algorithms in computer science and for the study of scientific models in many other disciplines, including probability theory, statistical physics, computational biology and information theory. This course covers recurrence relations, generating functions, asymptotics, and fundamental structures such as trees, permutations, strings, tries, words, and mappings, in the context of applications to the analysis of algorithms.",
    "largeIcon":"https://d15cw65ipctsrr.cloudfront.net/7b/a34bd0352c11e4ae1bdd88b9e8f59b/aofa-logo.png",
    "suggestedReadings":"This course is based on the textbook&nbsp;An Introduction to the Analysis of Algorithms by Sedgewick and Flajolet. You can obtain this book from the following:\n<br><a href=\"http://www.amazon.com/Introduction-Analysis-Algorithms-2nd/dp/032190575X/ref=sr_1_1?ie=UTF8&amp;qid=1421166053&amp;sr=8-1&amp;keywords=introduction+to+analysis+of+algorithms\" target=\"_blank\">Amazon</a>,&nbsp;<a href=\"http://www.barnesandnoble.com/w/an-introduction-to-the-analysis-of-algorithms-robert-sedgewick/1116748585?ean=9781502575869\" target=\"_blank\" title=\"null\">Barnes and Noble</a>, or&nbsp;<a href=\"http://www.informit.com/store/introduction-to-the-analysis-of-algorithms-9780321905758\" target=\"_blank\" title=\"null\">InformIT.com</a><br>You can find (free) web materials associated with the textbook at&nbsp;<a href=\"http://aofa.cs.princeton.edu/home\" target=\"_blank\" title=\"Link: http://aofa.cs.princeton.edu/home\">http://aofa.cs.princeton.edu/home</a>.",
    "videoId":"",
    "faq":"<strong>Does Princeton award credentials or reports regarding my work in this course?</strong><p>No certificates, statements of accomplishment, or other credentials will be awarded in connection with this course.</p>",
    "shortName":"aofa",
    "name":"Analysis of Algorithms",
    "subtitleLanguagesCsv":"en",
    "recommendedBackground":"<p>Math through calculus and basic familiarity with programming in a modern language such as Java. Knowledge of basic algorithms and data structures from\n    <span>&nbsp;<a href=\"https://www.coursera.org/course/algs4partI\" target=\"_blank\">Algorithms, Part I</a> is helpful but not required. The video&nbsp;<a href=\"http://www.youtube.com/embed/TkcN9stH1f8?rel=0&amp;hd=1&amp;autoplay=1&amp;close_caption=1&amp;iv_load_policy=1&amp;modestbranding=0&amp;showinfo=0&amp;showsearch=0\">From Analysis of Algorithms to Analytic Combinatorics: A Journey with Philippe Flajolet</a>, is an&nbsp;optional (since it contains some advanced&nbsp;material\n    that is beyond the scope of this course) overview that gives some historical\n    perspective and introduces this course and <a href=\"https://www.coursera.org/course/ac\" target=\"_blank\">Analytic Combinatorics</a>.&nbsp;</span>\n</p>",
    "aboutTheInstructor":""
}