Skip to content

Updated Course3 file as part of Exercise assigned under Version Control Module #939

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
tejaswinishivaprasad wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Updated Course3 file as part of Exercise assigned under Version Control Module #939

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 6 additions & 0 deletions Course3
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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.