Information Technology
Star icon
Most Popular
Trending Arrow Icon
Trending
Hands on Training icon
Hands On Training
Star icon
Trending Arrow Icon
Hands on Training icon

Algorithms Specialization by Coursera

Course Cover
compare button icon

Course Features

icon

Duration

4 months

icon

Delivery Method

Online

icon

Available on

Limited Access

icon

Accessibility

Desktop, Laptop

icon

Language

English

icon

Subtitles

English

icon

Level

Intermediate

icon

Effort

4 hours per week

icon

Teaching Type

Self Paced

Course Description

Computer science is based on algorithms. This subject is both practical and intellectually deep. For those who have some programming experience, this specialization introduces you to algorithms. Although this specialization is rigorous, it emphasizes conceptual understanding and the bigger picture rather than details and low-level execution. This specialization will help you excel in technical interviews, and allow you to communicate fluently about algorithms with computer scientists.

About the instructor: Tim Roughgarden has been a professor at Stanford University's Computer Science Department since 2004. He is an author and teacher who has published extensively on algorithms and their applications.

Course Overview

projects-img

International Faculty

projects-img

Case Based Learning

projects-img

Post Course Interactions

projects-img

Case Studies,Hands-On Training,Instructor-Moderated Discussions

Skills You Will Gain

Prerequisites/Requirements

Some related experience required

What You Will Learn

Asymptotic ("Big-oh") notation, Sorting and searching, Divide and conquer (master method, integer and matrix multiplication, closest pair), and Randomized algorithms (QuickSort, contraction algorithm for min cuts)

Data structures (heaps, balanced search trees, hash tables, bloom filters), Graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysi

Greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and Dynamic programming (knapsack, sequence alignment, optimal search trees)

Course Instructors

Tim Roughgarden

Professor

Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University. He received a BS in Applied Mathematics from Stanford in 1997, and a Ph...
Course Cover