Introduction to Stack, ▪ Stack ADT, ▪ Implementation of Stack using array, ▪ Concept of implicit and explicit stack.

Mar 22, 20250 likes454 views

Dr. Madhuri Jawale

ESIT137: Fundamentals of Data Structure
Sanjivani Rural Education Society’s
Sanjivani College of Engineering, Kopargaon-423603
(An Autonomous Institute Affiliated to Savitribai Phule Pune University, Pune)
NACC ‘A’ Grade Accredited, ISO 9001:2015 Certified
Department of Information Technology
(UG Programme - NBAAccredited)
Dr. M.A. Jawale
Professor and Head, Dept. of IT

Stack
➢ Stack is a linear data structure in which all additions and deletions are restricted
one end, called the top.
➢ If you insert a data series into a stack and then remove it, the order of the data is
revered. Data input as {5,10,15,20} is removed as {20,15,10,5}.
➢ This reversing attribute is why stacks are known as the LIFO (Last In First Out)
data structure.
➢ There are many real-life examples of a stack. Consider an example of plates
stacked over one another in the canteen. The plate which is at the top is the first
one to be removed, So, it can be simply seen to follow LIFO (Last In First Out)
Unit-III: Part-I Stack & Queue Dr. Madhuri Jawale Department of Information Technology

Most read

Implementation of Stack
➢ The basic operations that can be performed on a stack include push, pop, and top.
➢ There are two ways to implement a stack:
▪ Using array
▪ Using linked list
Unit-III: Part-I Stack & Queue Dr. Madhuri Jawale Department of Information Technology

Reference
1. Richard F. Gilberg & Behrouz A. Forouzan, “Data Structures: A Pseudocode
Approach with C, Second Edition”, Cengage Learning.
2. Ellis Horowitz, Sartaj Sahani, Susan Anderson-Freed “Fundamentals of Data
Structures in C”, Universities Press, 2008.
Unit-III: Part-I Stack & Queue Dr. Madhuri Jawale Department of Information Technology

Continue….
Unit-III: Part-I Stack & Queue Dr. Madhuri Jawale Department of Information Technology

Basic Operations on Stack
➢ push() : To insert an element into the stack. If the stack is full, then it is said to be
an Overflow condition.
➢ pop() : To remove an element from the stack. If the stack is empty, then it is said
to be an Underflow condition.
➢ top() : Returns the top element of the stack.
➢ isEmpty() : Returns true if stack is empty else false.
➢ size() : Returns the size of stack.
Unit-III: Part-I Stack & Queue Dr. Madhuri Jawale Department of Information Technology

The document discusses various searching algorithms like linear search and binary search. It provides details on how linear search works by sequentially checking each element of an unsorted array to find a target value. Binary search is described as more efficient for sorted arrays, as it repeatedly divides the search space in half by comparing the target to the middle element. Implementation of both iterative and recursive binary search algorithms is demonstrated through pseudocode.

ESIT135 Problem Solving Using Python Notes of Unit-1 and Unit-2prasadmutkule1

Stack Applications : Infix to postfix conversion, Evaluation of postfix expre...Dr. Madhuri Jawale

ITE Course Unit 1Productivity Tools For An EngineersNitinShelake4

ESIT135 Problem Solving Using Python Notes of Unit-3prasadmutkule1

Fundamentals of Data Structure_Unit I.pptxDr. Madhuri Jawale

ESIT135 Problem Solving Using Python Notes of Unit-2 and Unit-3prasadmutkule1

Unit 1- Python- Features, Variables, Data Types, Operators and ExpressionsGawaliSwapnali13

list.pptxSwapnaliGawali5

The document discusses lists in Python. It defines mutable and immutable objects in Python and provides examples of lists as mutable objects. It describes how to create lists, access list elements using indexes and slicing, update and delete list elements, and various methods available for lists like append(), insert(), pop(), etc. It also discusses traversing lists, built-in functions for lists like len(), min(), max() etc. and arithmetic operations on lists.

ESIT135 : Unit 1 Python Basics ConceptsSwapnaliGawali5

ESIT135: Unit 3 Topic: functions in pythonSwapnaliGawali5

JAVASRIPT and PHP (Hypertext Preprocessor)shelakenitinit

Unit-4 Basic Concepts of Tuple in Python .pptxSwapnaliGawali5

Unit4-Basic Concepts and methods of Dictionary.pptxSwapnaliGawali5

VCE Unit 03vv.pptxskilljiolms

The document discusses data structures and algorithms including stacks, queues, and their implementations using arrays and linked lists. Key points: 1. Stacks follow LIFO principle and allow insertion/removal at one end only. Queues follow FIFO principle. Both can be implemented using arrays or linked lists. 2. Common stack operations like push, pop, and peek have O(1) time complexity. Queue operations like enqueue and dequeue also have O(1) time complexity. 3. Linked list implementations of stacks and queues allocate memory dynamically and don't have size limits like arrays. 4. A circular queue treats the last node as connected to the first, forming a ring. This allows insertion

Informe técnico - Métodos de búsqueda Unidad 6 (Rubí Verónica)Rubi Veronica Chimal Cuxin

Este documento describe diferentes métodos de búsqueda en estructuras de datos, incluyendo búsqueda secuencial, binaria y hash. La búsqueda secuencial revisa elementos de forma lineal hasta encontrar el objetivo, mientras que la búsqueda binaria divide la estructura ordenada a la mitad de forma recursiva. El método hash mapea claves a posiciones usando funciones como módulo o cuadrado, pudiendo causar colisiones que se resuelven con técnicas como encadenamiento o arreglos anidados.

Linked listFURQAN M LODHI

This document provides an overview of linked lists as a data structure. It discusses the components of linked list nodes that contain data and a pointer to the next node. It also describes different types of linked lists like singly linked, doubly linked, and circular linked lists. Key operations like insertion, retrieval, and deletion of nodes are demonstrated with code examples. The advantages of linked lists like dynamic size and efficient insertions/deletions are contrasted with arrays.

Stacks & Queues By Ms. Niti Arorakulachihansraj

The document discusses stacks and queues as linear data structures. It defines stacks and queues, describes their common operations like push, pop, insert and delete, and ways to implement them using arrays and linked lists. Array implementation of stacks and queues is shown along with diagrams. Linked list implementation of stacks and queues is also discussed with diagrams showing the insertion and deletion of nodes. Sample programs to implement stacks and queues using arrays and linked lists are mentioned.

Deletion operation in array(ds)chauhankapil

Deletion operation in an array involves shifting elements to the left to fill the space left by the deleted element. The algorithm shifts each element from index i+1 to the left by one index to overwrite the deleted element at index i. It then decrements the last index of the array by one to account for the reduced length. For example, to delete element E from the array, element F would shift to index 3, G to index 4, and so on, and the last index would decrement from 8 to 7.

VCE Unit 04vv.pptxskilljiolms

The document discusses various sorting algorithms including insertion sort, merge sort, quick sort, heap sort, and hashing techniques. Insertion sort works by building a sorted list one item at a time from an unsorted list. Merge sort divides the list into halves, recursively sorts each half, and then merges the sorted halves. Quick sort selects a pivot element and partitions the list into sublists based on element values relative to the pivot. Heap sort uses a heap data structure to arrange elements in ascending or descending order. Hashing maps keys to values in a hash table using hash functions to optimize data retrieval.

deque and it applicationsSathasivam Rangasamy

DS UNIT 1.pdfSeethaDinesh

This document provides an overview of data structures and algorithms. It defines data structures as a way to store and organize data for efficient access and updating. There are two main categories of data structures - linear and non-linear. Common linear data structures include arrays and linked lists, while trees and graphs are examples of non-linear data structures. The document also describes common operations for stacks and queues like push, pop, enqueue and dequeue. It concludes by discussing different notations for writing arithmetic expressions like infix, prefix and postfix notations.

Stack Data Structure & It's Application Tech_MX

Stack is a last-in, first-out (LIFO) data structure where elements are inserted and removed from the top. Pushing adds an element to the top of the stack, while popping removes the top element. A stack overflow occurs when pushing to a full stack, while a stack underflow happens when popping an empty stack. Stack applications include system startup/shutdown processes, function calling where the last function called is the first to return, and argument passing in C where arguments are pushed right-to-left and popped left-to-right.

Different Sorting tecniques in Data StructureTushar Gonawala

This document discusses various sorting algorithms like insertion sort, bubble sort, selection sort and quick sort. It provides pseudocode to implement insertion sort, bubble sort and selection sort. Insertion sort works by inserting elements in the sorted position of a list. Bubble sort works by exchanging adjacent elements to push larger elements to the end. Selection sort finds the minimum element and swaps it with the first unsorted element in each iteration. Quick sort is a highly efficient sorting algorithm that works by selecting a pivot element.

Double ended queuejyoti_lakhani

Trees in data structuresASairamSairam1

This document discusses trees as a non-linear data structure. It defines key tree terminology such as root node, leaf node, and describes different types of trees including binary trees, binary search trees, and expression trees. Binary trees can have at most two children per node and are used in applications like expression evaluation. Binary search trees store elements in sorted order with left subtrees containing smaller elements and right subtrees containing larger elements. Expression trees represent arithmetic expressions with operators as internal nodes and operands as leaf nodes.

What is Stack, Its Operations, Queue, Circular Queue, Priority QueueBalwant Gorad

Stack in C.pptxRituSarkar7

This document discusses stacks, which are linear data structures that follow a first-in, last-out (FILO) principle. Stacks can be implemented using arrays or linked lists. Key stack operations include push, which adds an element to the top of the stack, and pop, which removes an element from the top. Stacks have applications in recursion, expression evaluation, simulating recursion, and algorithms like depth-first search and quicksort. The document provides examples and pseudocode for stack operations and implementations using arrays and linked lists.

More Related Content

What's hot (20)

ESIT135 Problem Solving Using Python Notes of Unit-2 and Unit-3prasadmutkule1

Unit 1- Python- Features, Variables, Data Types, Operators and ExpressionsGawaliSwapnali13

list.pptxSwapnaliGawali5

ESIT135 : Unit 1 Python Basics ConceptsSwapnaliGawali5

ESIT135: Unit 3 Topic: functions in pythonSwapnaliGawali5

JAVASRIPT and PHP (Hypertext Preprocessor)shelakenitinit

Unit-4 Basic Concepts of Tuple in Python .pptxSwapnaliGawali5

Unit4-Basic Concepts and methods of Dictionary.pptxSwapnaliGawali5

VCE Unit 03vv.pptxskilljiolms

Informe técnico - Métodos de búsqueda Unidad 6 (Rubí Verónica)Rubi Veronica Chimal Cuxin

Linked listFURQAN M LODHI

Stacks & Queues By Ms. Niti Arorakulachihansraj

Deletion operation in array(ds)chauhankapil

VCE Unit 04vv.pptxskilljiolms

deque and it applicationsSathasivam Rangasamy

DS UNIT 1.pdfSeethaDinesh

Stack Data Structure & It's Application Tech_MX

Different Sorting tecniques in Data StructureTushar Gonawala

Double ended queuejyoti_lakhani

Trees in data structuresASairamSairam1

ESIT135 Problem Solving Using Python Notes of Unit-2 and Unit-3prasadmutkule1

Unit 1- Python- Features, Variables, Data Types, Operators and ExpressionsGawaliSwapnali13

list.pptxSwapnaliGawali5

ESIT135 : Unit 1 Python Basics ConceptsSwapnaliGawali5

ESIT135: Unit 3 Topic: functions in pythonSwapnaliGawali5

JAVASRIPT and PHP (Hypertext Preprocessor)shelakenitinit

Unit-4 Basic Concepts of Tuple in Python .pptxSwapnaliGawali5

Unit4-Basic Concepts and methods of Dictionary.pptxSwapnaliGawali5

VCE Unit 03vv.pptxskilljiolms

Informe técnico - Métodos de búsqueda Unidad 6 (Rubí Verónica)Rubi Veronica Chimal Cuxin

Linked listFURQAN M LODHI

Stacks & Queues By Ms. Niti Arorakulachihansraj

Deletion operation in array(ds)chauhankapil

VCE Unit 04vv.pptxskilljiolms

deque and it applicationsSathasivam Rangasamy

DS UNIT 1.pdfSeethaDinesh

Stack Data Structure & It's Application Tech_MX

Different Sorting tecniques in Data StructureTushar Gonawala

Double ended queuejyoti_lakhani

Trees in data structuresASairamSairam1

Similar to Introduction to Stack, ▪ Stack ADT, ▪ Implementation of Stack using array, ▪ Concept of implicit and explicit stack. (20)

What is Stack, Its Operations, Queue, Circular Queue, Priority QueueBalwant Gorad

Stack in C.pptxRituSarkar7

Stack Data StructureRabin BK

The document discusses stack data structures. It defines a stack as a linear data structure that follows the LIFO (last in, first out) principle. Elements can only be inserted or removed from one end, called the top. Common stack operations include push to add an element, pop to remove an element, and functions to check if the stack is empty or full. Stacks have many real-world applications like processing function calls and arithmetic expressions.

2.1 STACK & QUEUE ADTSP. Subathra Kishore, KAMARAJ College of Engineering and Technology, Madurai

This document discusses data structures stacks and queues. It provides definitions and examples of stacks and queues. Stacks follow LIFO (last in first out) and are useful for undo sequences and function calls. Queues follow FIFO (first in first out) and are useful for things like printer queues. The document discusses implementations of stacks and queues using arrays and linked lists. It provides pseudocode for common stack and queue operations like push, pop, enqueue, dequeue.

Stacks.pptx in software engineering in simple understandingMohammedAnas871930

Data Structures - Lecture 2 - Unit 2.pptxDanielNesaKumarC

This document discusses different types of data structures including stacks, queues, and circular queues. It provides details on their operations, implementations, and applications. Stacks follow LIFO order and support push and pop operations. Queues follow FIFO order and support insert and delete operations. Circular queues are similar but the front and rear pointers move in a circular fashion. Implementations can use arrays or linked lists. Applications include recursive programming, expression evaluation, scheduling processes, and more.

Data Structure Ibrahim MH

Stacks and Queue,Concept of Stack,LIFO,Fifo,shaikhdaniyal8603

DSA Lab Manual C Scheme.pdfBharati Vidyapeeth COE, Navi Mumbai

STACKS implimentarions AND stack applications .pptxDr. Amna Mohamed

Stacks in Data StructureLovely Professional University

StacksLovely Professional University

A stack is a last-in, first-out data structure where elements can only be added (pushed) or removed (popped) from one end, called the top. Common applications include reversing words, implementing undo functions, backtracking in algorithms, and managing function calls and memory allocation using a call stack. Stacks are often implemented using arrays, where an index tracks the top element and elements are added or removed by changing the top index and relevant array values.

Data Structures Stack and Queue Data Structurespoongothai11

Stack and QueueSelvaraj Seerangan

Stack & QueueHasan Mahadi Riaz

This presentation summarizes stack and queue data structures. It includes: - An introduction to linear and non-linear data structures, including arrays, stacks, and queues. - Definitions of stacks as LIFO data structures and queues as FIFO data structures. Operations for each like push, pop, enqueue, dequeue are described. - Algorithms for common operations on stacks and queues like insertion, deletion, and display are provided in pseudocode. - Examples of applications of stacks and queues in areas like reversing strings, scheduling, and buffers. - Differences between stacks and queues are outlined. - Code examples in C of implementing stack push/pop and queue enqueue/dequeue operations

Unit i(dsc++)Durga Devi

The document contains the syllabus for the second semester of the first year of a B.Tech. program. It outlines 6 units that will be covered related to data structures and C++ programming. Unit I introduces concepts like abstract data types, stacks, queues and their implementations. Unit II covers linked lists and representing stacks and queues with linked lists. Unit III discusses trees and graphs. Unit IV covers searching and sorting algorithms. Units V and VI cover object-oriented programming concepts in C++ like classes, objects, inheritance and templates. The document also lists lab assignments related to implementing various data structures and algorithms in C programming language.

Data structure stack&queue basicsSelvin Josy Bai Somu

This document discusses stacks and queues, which are linear data structures. Stacks follow LIFO (last in, first out) and use push and pop operations. Queues follow FIFO (first in, first out) and use insertion at the rear and deletion at the front. Real-world examples of stacks include discs in a holder and tokens in a stack. Real-world examples of queues include lines at counters. Stacks and queues have various applications like reversing strings, expression evaluation, job scheduling, and memory/process management in operating systems.

Stack and its operations, Queue and its operationspoongothai11

StacksShivam Singh

The document provides an introduction to stacks, including: 1) Stacks follow the LIFO (last-in, first-out) principle where elements added last are the first to be removed. 2) Basic stack operations include push, which adds an element, and pop, which removes the top element. 3) Stacks can be implemented using arrays or linked lists, with arrays allowing random access but linked lists being more flexible in memory allocation.

Stack data structure class 12 cbse 2024.pptxPradeepVithule

What is Stack, Its Operations, Queue, Circular Queue, Priority QueueBalwant Gorad

Stack in C.pptxRituSarkar7

Stack Data StructureRabin BK

2.1 STACK & QUEUE ADTSP. Subathra Kishore, KAMARAJ College of Engineering and Technology, Madurai

Stacks.pptx in software engineering in simple understandingMohammedAnas871930

Data Structures - Lecture 2 - Unit 2.pptxDanielNesaKumarC

Data Structure Ibrahim MH

Stacks and Queue,Concept of Stack,LIFO,Fifo,shaikhdaniyal8603

DSA Lab Manual C Scheme.pdfBharati Vidyapeeth COE, Navi Mumbai

STACKS implimentarions AND stack applications .pptxDr. Amna Mohamed

Stacks in Data StructureLovely Professional University

StacksLovely Professional University

Data Structures Stack and Queue Data Structurespoongothai11

Stack and QueueSelvaraj Seerangan

Stack & QueueHasan Mahadi Riaz

Unit i(dsc++)Durga Devi

Data structure stack&queue basicsSelvin Josy Bai Somu

Stack and its operations, Queue and its operationspoongothai11

StacksShivam Singh

Stack data structure class 12 cbse 2024.pptxPradeepVithule

Recently uploaded (20)

Rearchitecturing a 9-year-old legacy Laravel application.pdfTakumi Amitani

An initiative to re-architect a Laravel legacy application that had been running for 9 years using the following approaches, with the goal of improving the system’s modifiability: ・Event Storming ・Use Case Driven Object Modeling ・Domain Driven Design ・Modular Monolith ・Clean Architecture This slide was used in PHPxTKY June 2025. https://phpxtky.connpass.com/event/352685/

Fundamentals of Digital Design_Class_12th April.pptxdrdebarshi1993

Pavement and its types, Application of rigid and Flexible PavementsSakthivel M

Universal Human Values and professional ethics Quantum AKTU BVE401Unknown

How Binning Affects LED Performance & Consistency.pdfMina Anis

🔍 What’s Inside: 📦 What Is LED Binning? • The process of sorting LEDs by color temperature, brightness, voltage, and CRI • Ensures visual and performance consistency across large installations 🎨 Why It Matters: • Inconsistent binning leads to uneven color and brightness • Impacts brand perception, customer satisfaction, and warranty claims 📊 Key Concepts Explained: • SDCM (Standard Deviation of Color Matching) • Recommended bin tolerances by application (e.g., 1–3 SDCM for retail/museums) • How to read bin codes from LED datasheets • The difference between ANSI/NEMA standards and proprietary bin maps 🧠 Advanced Practices: • AI-assisted bin prediction • Color blending and dynamic calibration • Customized binning for high-end or global projects

社内勉強会資料_Chain of Thought .NABLAS株式会社

本資料「To CoT or not to CoT?」では、大規模言語モデルにおけるChain of Thought（CoT）プロンプトの効果について詳しく解説しています。 CoTはあらゆるタスクに効く万能な手法ではなく、特に数学的・論理的・アルゴリズム的な推論を伴う課題で高い効果を発揮することが実験から示されています。一方で、常識や一般知識を問う問題に対しては効果が限定的であることも明らかになりました。複雑な問題を段階的に分解・実行する「計画と実行」のプロセスにおいて、CoTの強みが活かされる点も注目ポイントです。 This presentation explores when Chain of Thought (CoT) prompting is truly effective in large language models. The findings show that CoT significantly improves performance on tasks involving mathematical or logical reasoning, while its impact is limited on general knowledge or commonsense tasks.

Water demand - Types , variations and WDSdhanashree78

Présentation_gestion[1] [Autosaved].pptxKHADIJAESSAKET

The first edition of the AIAG-VDA FMEA.pptxMayank Mathur

grade 9 science q1 quiz.pptx science quiznorfapangolima

TEA2016AAT 160 W TV application design examplessuser1be9ce

Great power lithium iron phosphate cellssalmankhan835951

Understanding Amplitude Modulation : A GuideCircuitDigest

SEW make Brake BE05 – BE30 Brake – Repair Kitprojectultramechanix

Fundamentals of Digital Design_Class_21st May - Copy.pptxdrdebarshi1993

362 Alec Data Center Solutions-Slysium Data Center-AUH-ABB Furse.pdfdjiceramil

02 - Ethics & Professionalism - BEM, IEM, MySET.PPTSharinAbGhani1

COMPOSITE COLUMN IN STEEL CONCRETE COMPOSITES.pptravicivil

Development of Portable Biomass Briquetting Machine (S, A & D)-1.pptxaniket862935

First Come First Serve Scheduling in real time operating system.pptxKavitaBagewadi2

Rearchitecturing a 9-year-old legacy Laravel application.pdfTakumi Amitani

Fundamentals of Digital Design_Class_12th April.pptxdrdebarshi1993

Pavement and its types, Application of rigid and Flexible PavementsSakthivel M

Universal Human Values and professional ethics Quantum AKTU BVE401Unknown

How Binning Affects LED Performance & Consistency.pdfMina Anis

社内勉強会資料_Chain of Thought .NABLAS株式会社

Water demand - Types , variations and WDSdhanashree78

Présentation_gestion[1] [Autosaved].pptxKHADIJAESSAKET

The first edition of the AIAG-VDA FMEA.pptxMayank Mathur

grade 9 science q1 quiz.pptx science quiznorfapangolima

TEA2016AAT 160 W TV application design examplessuser1be9ce

Great power lithium iron phosphate cellssalmankhan835951

Understanding Amplitude Modulation : A GuideCircuitDigest

SEW make Brake BE05 – BE30 Brake – Repair Kitprojectultramechanix

Fundamentals of Digital Design_Class_21st May - Copy.pptxdrdebarshi1993

362 Alec Data Center Solutions-Slysium Data Center-AUH-ABB Furse.pdfdjiceramil

02 - Ethics & Professionalism - BEM, IEM, MySET.PPTSharinAbGhani1

COMPOSITE COLUMN IN STEEL CONCRETE COMPOSITES.pptravicivil

Development of Portable Biomass Briquetting Machine (S, A & D)-1.pptxaniket862935

First Come First Serve Scheduling in real time operating system.pptxKavitaBagewadi2

Introduction to Stack, ▪ Stack ADT, ▪ Implementation of Stack using array, ▪ Concept of implicit and explicit stack.

1. ESIT137: Fundamentals of Data Structure Sanjivani Rural Education Society’s Sanjivani College of Engineering, Kopargaon-423603 (An Autonomous Institute Affiliated to Savitribai Phule Pune University, Pune) NACC ‘A’ Grade Accredited, ISO 9001:2015 Certified Department of Information Technology (UG Programme - NBAAccredited) Dr. M.A. Jawale Professor and Head, Dept. of IT

2. Stack & Queue ➢ Stack ▪ Introduction to Stack, ▪ Stack ADT, ▪ Implementation of Stack using array, ▪ Concept of implicit and explicit stack. ➢ References Unit-III: Part-I Stack & Queue Dr. Madhuri Jawale Department of Information Technology

3. Stack ➢ Stack is a linear data structure in which all additions and deletions are restricted one end, called the top. ➢ If you insert a data series into a stack and then remove it, the order of the data is revered. Data input as {5,10,15,20} is removed as {20,15,10,5}. ➢ This reversing attribute is why stacks are known as the LIFO (Last In First Out) data structure. ➢ There are many real-life examples of a stack. Consider an example of plates stacked over one another in the canteen. The plate which is at the top is the first one to be removed, So, it can be simply seen to follow LIFO (Last In First Out) Unit-III: Part-I Stack & Queue Dr. Madhuri Jawale Department of Information Technology

4. Continue…. Unit-III: Part-I Stack & Queue Dr. Madhuri Jawale Department of Information Technology

5. Basic Operations on Stack ➢ push() : To insert an element into the stack. If the stack is full, then it is said to be an Overflow condition. ➢ pop() : To remove an element from the stack. If the stack is empty, then it is said to be an Underflow condition. ➢ top() : Returns the top element of the stack. ➢ isEmpty() : Returns true if stack is empty else false. ➢ size() : Returns the size of stack. Unit-III: Part-I Stack & Queue Dr. Madhuri Jawale Department of Information Technology

6. Implementation of Stack ➢ The basic operations that can be performed on a stack include push, pop, and top. ➢ There are two ways to implement a stack: ▪ Using array ▪ Using linked list Unit-III: Part-I Stack & Queue Dr. Madhuri Jawale Department of Information Technology

7. Reference 1. Richard F. Gilberg & Behrouz A. Forouzan, “Data Structures: A Pseudocode Approach with C, Second Edition”, Cengage Learning. 2. Ellis Horowitz, Sartaj Sahani, Susan Anderson-Freed “Fundamentals of Data Structures in C”, Universities Press, 2008. Unit-III: Part-I Stack & Queue Dr. Madhuri Jawale Department of Information Technology