forked from upgrad-edu/Courses
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCourse3
18 lines (16 loc) · 893 Bytes
/
Course3
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
Hello you can tell us your name and the module name from course1 you want to contribute to.
You can choose onemodule from the list below:-
1)Stacks & Queues
2)Hashtables
3)Binary Trees & BSTs
4)Priority Queues & Heaps
5)Graphs & Graph Algorithms
Saubhik Mukherjee
Graphs & Graph Algorithms
I learnt how to implement a graph using edge list, adjacency lists and adjacency matrix.
I learnt how to do BFS and DFS traversals on a graph.
I learnt how to use Dijkstra's algorithm to find the shortest path from a vertex in a directed graph.
Yash Berry
Hashtables
I haven't learnt any of the modules mentioned here yet since all these topics will be covered in Course 3 and this exercise is from Course 2.
However, this is my first time learning how to code and I am learning new things everyday. The thrill of approaching deadlines every Wednesday is very, for lack of a better word, refreshing.