Course3

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.

Sujoy Ghosh
Stack and Queues
I learnt the differences between Stack and Queues.
I learnt about the scenarios where Stack and Queues are useful.
I learnt how to implement Stack and Queues.
I learnt how to implement Stack using Queues.
I learnt that Stack has a class of its own but Queues need to be implemented using Linkedlists.