Artificial Intelligence & Data Science
Star icon
Most Popular
Hands on Training icon
Hands On Training
Star icon
Hands on Training icon

Analysis of Algorithms by Coursera

Course Cover

5

(8)

compare button icon

Course Features

icon

Duration

21 hours

icon

Delivery Method

Online

icon

Available on

Limited Access

icon

Accessibility

Desktop, Laptop

icon

Language

English

icon

Subtitles

English

icon

Level

Advanced

icon

Teaching Type

Self Paced

icon

Video Content

21 hours

Course Description

This course will show you how to make accurate predictions and calculate large combinatorial structures. The course also covers real asymptotics and generating functions. The course then covers applications to analysis of algorithms, basic structures such as permutations, words, strings and strings.

All the features of this course are available to you at no cost. The certificate will not be awarded after completion.

Course Overview

projects-img

International Faculty

projects-img

Case Based Learning

projects-img

Post Course Interactions

projects-img

Case Studies,Instructor-Moderated Discussions

Skills You Will Gain

What You Will Learn

Analysis of Algorithms

Types of Recurrences

Exponential Generating Functions

Manipulating Expansions

Bivariate Asymptotics

Analytic Combinatorics

BGFs and Distributions

Strings and Tries

Strings and Words

Course Instructors

Robert Sedgewick

Professor of Computer Science

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton, where he was the founding chair of the Department of Computer Science. He received the Ph.D. degree from Stanford ...

Course Reviews

Average Rating Based on 8 reviews

5.0

100%

Course Cover