technifyedWeekly list

Free online

Data Structures courses

Learn Data Structures online: university courses, full YouTube courses, and courses with free certificates, from the IITs, MIT, Harvard, Google, Microsoft and more.

407 courses

Explore subjects

Showing 407 courses

Massachusetts Institute of Technology

MIT 6.006 Introduction to Algorithms, Fall 2011

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performa…

Video playlist
  • YouTube
  • 47 videos, 42 hours
  • Self-paced
  • Free video

Harvard University

CS50's Introduction to Computer Science

An introduction to the intellectual enterprises of computer science and the art of programming.

  • edX
  • 12 weeks, 5 - 14 hours per week
  • Self-paced
  • Free to audit
  • Paid certificate
  • Beginner

Princeton University

Algorithms, Part I

4.912,148 ratings

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part…

  • Coursera
  • 6 weeks of study, 6–10 hours per week.
  • Self-paced
  • Paid certificate

Princeton University

Algorithms, Part II

4.92,050 ratings

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part…

  • Coursera
  • 6 weeks of study, 6–10 hours per week.
  • Self-paced
  • Paid certificate

Stanford Online

Graph Search, Shortest Paths, and Data Structures

4.82,001 ratings

The primary topics in this part of the specialization are: 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…

  • Coursera
  • 4 weeks of study, 4-8 hours/week
  • Self-paced
  • Paid certificate

Stanford Online

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

4.8832 ratings

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, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).

  • Coursera
  • 4 weeks of study, 4-8 hours/week
  • Self-paced
  • Paid certificate

MIT OpenCourseWare

Prediction: Machine Learning and Statistics

Prediction is at the heart of almost every scientific discipline, and the study of generalization (that is, prediction) from data is the central topic of machine learning and statistics, and more generally, data mining. Machine learning and statistical methods are used throughout the scientific wor…

  • MIT
  • Self-paced
  • Free course
  • Advanced

Massachusetts Institute of Technology

MIT 6.851 Advanced Data Structures, Spring 2012

View the complete course: http://ocw.mit.edu/6-851S12 Instructor: Erik Demaine Videos of 6.851 Lectures Spring 2012 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Video playlist
  • YouTube
  • 22 videos, 30 hours
  • Self-paced
  • Free video

MIT OpenCourseWare

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

This course focuses on the algorithms for analyzing and designing geometric foldings. Topics include reconfiguration of foldable structures, linkages made from one-dimensional rods connected by hinges, folding two-dimensional paper (origami), and unfolding and folding three-dimensional polyhedra. A…

  • MIT
  • Self-paced
  • Free course
  • Advanced

The University of Michigan

Programming for Everybody (Getting Started with Python)

4.7182 ratings

This course is a "no prerequisite" introduction to Python Programming. You will learn about variables, conditional execution, repeated execution and how we use functions. The homework is done in a web browser so you can do all of the programming assignments on a phone or public computer.

  • edX
  • Self-paced
  • Free to audit
  • Paid certificate
  • Beginner

MIT OpenCourseWare

Advanced Algorithms

This is a graduate course on the design and analysis of algorithms, covering several advanced topics not studied in typical introductory courses on algorithms. It is especially designed for doctoral students interested in theoretical computer science.

  • MIT
  • Self-paced
  • Free course
  • Advanced

MIT OpenCourseWare

Computer Algorithms in Systems Engineering

This course covers concepts of computation used in analysis of engineering systems. It includes the following topics: data structures, relational database representations of engineering data, algorithms for the solution and optimization of engineering system designs (greedy, dynamic programming, br…

  • MIT
  • Self-paced
  • Free course
  • Advanced

MIT OpenCourseWare

Techniques in Artificial Intelligence (SMA 5504)

6.825 is a graduate-level introduction to artificial intelligence. Topics covered include: representation and inference in first-order logic, modern deterministic and decision-theoretic planning techniques, basic supervised learning methods, and Bayesian network inference and learning. This course…

  • MIT
  • Self-paced
  • Free course
  • Advanced

MIT OpenCourseWare

Parallel Computing

This is an advanced interdisciplinary introduction to applied parallel computing on modern supercomputers. It has a hands-on emphasis on understanding the realities and myths of what is possible on the world’s fastest machines. We will make prominent use of the Julia Language, a free, open-source,…

  • MIT
  • Self-paced
  • Free course
  • Advanced

MIT OpenCourseWare

Programming for the Puzzled

This class builds a bridge between the recreational world of algorithmic puzzles (puzzles that can be solved by algorithms) and the pragmatic world of computer programming, teaching students to program while solving puzzles. Python syntax and semantics required to understand the code are explained…

  • MIT
  • Self-paced
  • Free course
  • Advanced

IIT Kanpur

Data Structures and Algorithms Design

Computer Science and Engineering course by Prof. Nitin Saxena.

  • NPTEL
  • 12 weeks, 40 lectures
  • Self-paced
  • Free course
  • Paid certificate
  • Advanced

University of Michigan

Python Data Structures

4.997,356 ratings

This course will introduce the core data structures of the Python programming language. We will move past the basics of procedural programming and explore how we can use the Python built-in data structures such as lists, dictionaries, and tuples to perform increasingly complex data analysis. This c…

  • Coursera
  • 2-4 hours/week
  • Self-paced
  • Paid certificate

Stanford University

Algorithms: Design and Analysis, Part 1

4.713 ratings

Welcome to the self paced course, Algorithms: Design and Analysis! 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 e…

  • edX
  • Self-paced
  • Free to audit
  • Paid certificate
  • Intermediate

MIT OpenCourseWare

Distributed Algorithms

Distributed algorithms are algorithms designed to run on multiple processors, without tight centralized control. In general, they are harder to design and harder to understand than single-processor sequential algorithms. Distributed algorithms are used in many practical systems, ranging from large…

  • MIT
  • Self-paced
  • Free course
  • Advanced