From 16f16b85b27324469e2b05260e2c752cb18d3cf2 Mon Sep 17 00:00:00 2001
From: tejaswinishivaprasad
 <158717347+tejaswinishivaprasad@users.noreply.github.com>
Date: Sat, 3 Feb 2024 21:26:59 +0530
Subject: [PATCH] Updated Course3 file as part of Exercise assigned under
 Version Control Module

---
 Course3 | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/Course3 b/Course3
index f980eeb..be4301d 100644
--- a/Course3
+++ b/Course3
@@ -11,3 +11,9 @@ 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.
+
+Tejaswini Shivaprasad
+Stcaks & Queues
+Stacks are data structures that follow the Last In, First Out (LIFO) principle, where the last element added is the first one to be removed.
+Queues, on the other hand, adhere to the First In, First Out (FIFO) principle, where the first element added is the first one to be removed.
+Both stacks and queues are commonly used in computer science for managing data and implementing various algorithms.