|
1 | 1 | # Data-Structure-and-Algorithms-Specialization |
2 | | -This repository contains all the solutions of assignments, starter files and other materials related to this specialization. |
| 2 | +This repository contains all the solutions of all assignments, starter files and other materials related to this specialization. |
| 3 | +[Data Structures & Algorithms](https://www.coursera.org/specializations/data-structures-algorithms) <br/><br/> |
| 4 | + |
| 5 | +Course 1 implemented using both C++ & Java. Others are implemented in Java. I will add C++ codes for other courses when my C++ implementation will be completed.<br /> |
| 6 | +I will update the repository when the rest of the courses will be finished |
| 7 | + |
| 8 | +### Course 1 ( [Algorithmic Toolbox](https://www.coursera.org/learn/algorithmic-toolbox) ) |
| 9 | + * Week 1 - Programming Challenges |
| 10 | + * Week 2 - Algorithmic Warm-up |
| 11 | + * Week 3 - Greedy Algorithms |
| 12 | + * Week 4 - Divide-and-Conquer |
| 13 | + * Week 5 - Dynamic Programming 1 |
| 14 | + * Week 6 - Dynamic Programming 2<br /><br /> |
| 15 | + |
| 16 | +### Course 2 ( [Data Structures](https://www.coursera.org/learn/data-structures) ) |
| 17 | + * Week 1 - Basic Data Structures |
| 18 | + * Week 2 - Dynamic Arrays and Amortized Analysis |
| 19 | + * Week 3 - Priority Queues and Disjoint Sets |
| 20 | + * Week 4 - Hash Tables |
| 21 | + * Week 5 - Binary Search Trees |
| 22 | + * Week 6 - Binary Search Trees 2<br /><br /> |
| 23 | + |
| 24 | +### Course 3 ( [Algorithms On Graphs](https://www.coursera.org/learn/algorithms-on-graphs)) |
| 25 | + * Week 1 - Decomposition of Graphs 1 |
| 26 | + * Week 2 - Decomposition of Graphs 2 |
| 27 | + * Week 3 - Paths in Graphs 1 |
| 28 | + * Week 4 - Paths in Graphs 2 |
| 29 | + * Week 5 - Minimum Spanning Trees |
| 30 | + * Week 6 - Advanced Shortest Paths Project (Optional)<br /><br /> |
| 31 | + |
| 32 | +### Course 4 ( [Algorithms On Strings](https://www.coursera.org/learn/algorithms-on-strings) ) |
| 33 | + * Week 1 - Suffix Trees |
| 34 | + * Week 2 - Burrows-Wheeler Transform and Suffix Arrays |
| 35 | + * Week 3 - Knuth–Morris–Pratt Algorithm |
| 36 | + * Week 4 - Constructing Suffix Arrays and Suffix Trees<br /><br /> |
| 37 | + |
0 commit comments