PRINT PDF WORD CSV EXCEL
Edit Delete
Moocable is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Discord Algorithms Study Group for MIT 6.006 Introduction to Algorithms

20th April, 2022
Last date to join: 5th May, 2022

This Discord Algorithms Study Group for MIT 6.006 Introduction to Algorithms, Spring 2020. the group is to study and discuss the course (it's problems - lecture notes - book) and solve DSA problems in leetcode / codeforces The plane is to finish the course in roughly 3 months We hope to initiate a community, Where you can mutually contribute and benefit from others' experiences, skills, and backgrounds. You are welcome to ask questions, share your solutions to be reviewed by others, and even suggest further problems/topics.

Advanced-beginner English

Description

This course is an introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. It emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques for these problems.

Syllabus

1. Algorithms and Computation.
2. Data Structures and Dynamic Arrays.
Introduction to Algorithms - Problem Session 1: Asymptotic Behavior of Functions and Double-ended....
3. Sets and Sorting.
4. Hashing.
Problem Session 2 (MIT 6.006 Introduction to Algorithms, Spring 2020).
5. Linear Sorting.
Problem Session 3.
6. Binary Trees, Part 1.
7. Binary Trees, Part 2: AVL.
Problem Session 4.
8. Binary Heaps.
9. Breadth-First Search.
Quiz 1 review.
10. Depth-First Search.
11. Weighted Shortest Paths.
Problem Session 5.
12. Bellman-Ford.
Problem Session 6.
13. Dijkstra.
Problem Session 7.
14. APSP and Johnson.
Quiz 2 Review.
15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling.
16. Dynamic Programming, Part 2: LCS, LIS, Coins.
Problem Session 8.
17. Dynamic Programming, Part 3: APSP, Parens, Piano.
18. Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial.
19. Complexity.
Quiz 3 Review.
20. Course Review.21. Algorithms—Next Steps.

Introduction to Algorithms

Start Learning
Online Courses
MIT OpenCourseWare
Free
35 hours
No Certificate

Discord Algorithms Study Group for MIT 6.006 Introduction to Algorithms

20th April, 2022
Last date to join: 5th May, 2022
Start Learning
Affiliate notice

This Discord Algorithms Study Group for MIT 6.006 Introduction to Algorithms, Spring 2020. the group is to study and discuss the course (it's problems - lecture notes - book) and solve DSA problems in leetcode / codeforces The plane is to finish the course in roughly 3 months We hope to initiate a community, Where you can mutually contribute and benefit from others' experiences, skills, and backgrounds. You are welcome to ask questions, share your solutions to be reviewed by others, and even suggest further problems/topics.

Advanced-beginner English

  • Type
    Online Courses
  • Provider
    MIT OpenCourseWare
  • Pricing
    Free
  • Duration
    35 hours
  • Certificate
    No Certificate

This course is an introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. It emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques for these problems.

1. Algorithms and Computation.
2. Data Structures and Dynamic Arrays.
Introduction to Algorithms - Problem Session 1: Asymptotic Behavior of Functions and Double-ended....
3. Sets and Sorting.
4. Hashing.
Problem Session 2 (MIT 6.006 Introduction to Algorithms, Spring 2020).
5. Linear Sorting.
Problem Session 3.
6. Binary Trees, Part 1.
7. Binary Trees, Part 2: AVL.
Problem Session 4.
8. Binary Heaps.
9. Breadth-First Search.
Quiz 1 review.
10. Depth-First Search.
11. Weighted Shortest Paths.
Problem Session 5.
12. Bellman-Ford.
Problem Session 6.
13. Dijkstra.
Problem Session 7.
14. APSP and Johnson.
Quiz 2 Review.
15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling.
16. Dynamic Programming, Part 2: LCS, LIS, Coins.
Problem Session 8.
17. Dynamic Programming, Part 3: APSP, Parens, Piano.
18. Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial.
19. Complexity.
Quiz 3 Review.
20. Course Review.21. Algorithms—Next Steps.

Learning is better with Cohorts

Active hands-on learning
Build assignments each week
Feedback loop
Submit your assignment, and receive feedback from your peers. Stuck on a problem?
Learn with a cohort of peers
Join a group of like-minded people who want to learn and grow alongside you

Frequently asked questions

Yes. Our study groups (all of them) are free to join

You join the group and study the MOOC together on a schedule. The exact dates, deadlines, are created by the host

This depends on the host of your group. Some groups have weekly video calls for accountability + doubt solving.

Moocable is a community where you can find study partners, mentors, or people to collaborate on projects. It's designed for people who want to upskill, but struggle with self-learning. Users often post about their skills, goals, and what they're looking to learn or work on, and others can respond to form partnerships or groups. You can join our community

5th May, 2022

Quick Links

Browse by subject

Browse by provider

Browse by university

Browse by publisher

Browse by institution

Roadmaps

Posts