Save For Later

Algorithms

Save For Later

Learn To Think Like A Computer Scientist

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists. About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

From Stanford University via Coursera
Hours 107
Instructor Tim Roughgarden
Language English
Subjects Programming Mathematics

Similar Courses

Sorted by relevance

Careers

An overview of related careers and their average salaries in the US. Bars indicate income percentile (33rd - 99th).

Teacher: Computer Science $55k

Instructor - Computer Science $72k

Lecturer of Computer Science $72k

Computer Science educator $78k

Computer Science Specialist $87k

Lecturer (Computer Science) $98k

MS Computer Science $106k

Professor Computer Science $109k

Computer Science R&D $129k

Associate Computer Science $133k

Professor - Computer Science $138k

MS in Computer Science $141k

Courses in this Specialization

Listed in the order in which they should be taken

Starts Course Information

Oct
5

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix...

Coursera | Stanford University

Save

Oct
5

Graph Search, Shortest Paths, and Data Structures

The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of...

Coursera | Stanford University

Save

Oct
5

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack,...

Coursera | Stanford University

Save

Oct
12

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them (You were viewing this course)

The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer,...

Coursera | Stanford University

Save

Coursera

&

Stanford University

From Stanford University via Coursera
Hours 107
Instructor Tim Roughgarden
Language English
Subjects Programming Mathematics

Careers

An overview of related careers and their average salaries in the US. Bars indicate income percentile (33rd - 99th).

Teacher: Computer Science $55k

Instructor - Computer Science $72k

Lecturer of Computer Science $72k

Computer Science educator $78k

Computer Science Specialist $87k

Lecturer (Computer Science) $98k

MS Computer Science $106k

Professor Computer Science $109k

Computer Science R&D $129k

Associate Computer Science $133k

Professor - Computer Science $138k

MS in Computer Science $141k

Similar Courses

Sorted by relevance