Stacks Part I (Marathi) | Data Structures and Algorithms for Beginners | upGrad Centre
In this video, we explain the Stack Data Structure in DSA in a simple and beginner-friendly way. You will understand how a stack works on the LIFO (Last In First Out) principle and how it is used in real programming scenarios.
We cover all important stack operations like push, pop, peek (top), isEmpty, and size, along with easy examples. You will also learn how a stack is implemented using arrays and linked lists, and how it works in languages like Java.
This video also explains stack overflow and stack underflow, their causes, and how to avoid them. Finally, we discuss key applications of stack in data structures such as recursion, function calls, browser history, and undo/redo operations.
🔗 Prefer learning offline? Explore upGrad centers in your city: https://bit.ly/42MIAg2
Following are the concepts covered in this topic :
00:00 – Introduction
00:20 – What is Stack?
01:10 – LIFO (Last In First Out) Principle Explained
02:10 – Push Operation
03:00 – Pop Operation
03:50 – Peek / Top Operation
04:30 – isEmpty Operation
05:00 – Size Operation
05:30 – Stack Implementation (Array, Linked List, Built-in Stack)
06:10 – Applications of Stack
07:30 – Characteristics of Stack
08:20 – Stack Overflow and Underflow
09:20 – Prevention of Overflow and Underflow
10:00 – Summary of Stack Data Structure
#stacks #dsainjava #datastructuresandalgorithms #stack #dsa #datastructures #codingforbeginners #programming #java #datastructureandalgorithms #dsainjava #upgradlearning