Skip to content
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.

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

Stacks and queues #935

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
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
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.

Shashank Maurya
Stacks & Queues
I learnt that how elements are added i.e. push on top of the stack and pop from the top of the queue and in queue it is added at the back of the queue and removed from the front of the queue.
I learnt that stacks are often used for tasks that require backtracking such as parsing expressions or undo functionality and queues for handling requests or scheduling tasks.
I learnt that stacks are used in recursion and while queue is used in solving problems having sequential processing.