This Course ” **Data structures and Algorithms mit** ” provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems.

- After you finishing the course
**Introduction to Algorithms**you will be able to solve the efficient procedures for solving problems on large inputs. - You going to learn a bunch of different data structures. We’ll call them classic data structures, like binary search trees, hash tables that are called dictionaries in Python and data structures such as balanced binary search trees that are more efficient than just the regular binary search trees.
- In this course you will look at classic data structures and classical algorithms for these data structures, including things like sorting and matching, and so on. And one of the nice things about this class is that you’ll be doing real implementations of these data structures and algorithms in Python. And in particular are each of the problem sets in this class are going to have both a theory part to them, and a programming part to them. So hopefully it’ll all tie together.

**Data structures and Algorithms mit**

**Instructor(s):**

- Prof. Erik Demaine
- Prof. Srini Devadas

## MIT Course Number:

6.006

## As Taught In:

Fall 2011

## Level:

Undergraduate

**Video Lectures:**

## Lecture Notes:

**Textbooks:**

- Cormen, Thomas, Charles Leiserson, Ronald Rivest, and Clifford Stein. Introduction to Algorithms. 3rd ed. MIT Press, 2009. ISBN: 9780262033848.

## Softwares:

Software’s listed by MIT.

**Duration Course:**

12 Units.