diff --git a/.Course3.un~ b/.Course3.un~
new file mode 100644
index 0000000..28a9c05
Binary files /dev/null and b/.Course3.un~ differ
diff --git a/Course3 b/Course3
index f980eeb..61e18bd 100644
--- a/Course3
+++ b/Course3
@@ -6,8 +6,7 @@ You can choose onemodule from the list below:-
 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.
+Shantanu Kharade
+Stacks & Queues
+I learnt how to implement function call management, undo/redo features and arithmeic expression evaluation using stacks.
+I learnt how to do system task scheduling, printer job spooling and asynchronous message passing with the queues.
diff --git a/Course3~ b/Course3~
new file mode 100644
index 0000000..f980eeb
--- /dev/null
+++ b/Course3~
@@ -0,0 +1,13 @@
+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.