From cc89fe6aa6892854fc0b980349476251a28fc394 Mon Sep 17 00:00:00 2001
From: shantanu-kharade <shantanu.kharade27@gmail.com>
Date: Sat, 21 Jun 2025 17:16:18 +0530
Subject: [PATCH] change the course 3 with my name, module and learning from
 the module

---
 .Course3.un~ | Bin 0 -> 3077 bytes
 Course3      |   9 ++++-----
 Course3~     |  13 +++++++++++++
 3 files changed, 17 insertions(+), 5 deletions(-)
 create mode 100644 .Course3.un~
 create mode 100644 Course3~

diff --git a/.Course3.un~ b/.Course3.un~
new file mode 100644
index 0000000000000000000000000000000000000000..28a9c05c0e214d546e61502486a02901be405914
GIT binary patch
literal 3077
zcmeH}J!=$E6ozMG6u-hMHl{m8h>8-cEiIHKK|xR!mw-jQ?wstsyYsQ!dnd*+zd*3l
zMr`#Lq|j2Zvyxa?L=f=@h<1A3yE{6j2trt^dEw0cV&)F#nKSq8n)KP7tet<3W>#KZ
z+5Ue1%*PAMyLTVmd;RjwjpuI{7I!Yc|LXn4?OSV66rGgd>y)svnJ1k;AfHp=nA&DA
zbl$3Sj#Sdmt?@d=+PcYN@|wx%+<JDNM#^hiw|Pp6Hdy91$z;-xjpd%_nEF<Y^pb2e
zhs`7!5=SH;v}HuP`}D&sRvXdUJFJRk#!a|l>6pYRjDCv3qcEs7g$(HKlih$LioTtd
z=O2|gE&+}}ak`_5``QfYW--)k2h6RlzzvIsBuarHxZ%c{8<H?p3Aa!Cahv;#+k_by
z%~oCu`~Z6%b9JpD3)7S^`%z_vaycPU*4q3E{-TZ+DRk&+`BQcie&BVu@`hjueof5P
z{E&rdN{+7Pe*BspuX;mA3v|2Sf=g<kR33$RJrD%;RSars$ie}HOqN0)hZwXW5&A;y
zag`bh29~I-y4Ahb$fTo$Qx>nJ#=b_(lF9nSai1wM&R-%G4^)q{-or2!`y__x&s?g!
zHJeM5qOBIJY#TlW><yPx<3|z>qJP1^6Yw|22B&%h&coJT{Bcg#mOBAyTUznQ;&`1(
a9ObaQzn$**arlx-!4mx+qutv2^5PfIkLiv8

literal 0
HcmV?d00001

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.