Stack Data Structure & It's Application
46 likes31,408 views
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.
1 of 22
Ad
Recommended
stack presentation
stack presentationShivalik college of engineering The document introduces stacks and discusses their implementation and applications. It defines a stack as a data structure that follows LIFO order, where elements can only be added and removed from one end. Stacks have two main implementations - using arrays and linked lists. Common applications of stacks include undo/redo in editors, browser history, and evaluating postfix expressions.
Stacks IN DATA STRUCTURES
Stacks IN DATA STRUCTURESSowmya Jyothi 1) Stacks are linear data structures that follow the LIFO (last-in, first-out) principle. Elements can only be inserted or removed from one end called the top of the stack.
2) The basic stack operations are push, which adds an element to the top of the stack, and pop, which removes an element from the top.
3) Stacks have many applications including evaluating arithmetic expressions by converting them to postfix notation and implementing the backtracking technique in recursive backtracking problems like tower of Hanoi.
Stack
StackSeema Sharma This document discusses stacks and their applications. It defines a stack as a Last In First Out (LIFO) data structure where newly added items are placed on top. The core stack operations of PUSH, POP, and PEEK are described. An array implementation of stacks is presented and animations demonstrate push and pop operations. Applications of stacks like checking for balanced braces, converting infix to postfix notation, and postfix calculators are explained with examples. Pseudocode provides an algorithm for infix to postfix conversion using a stack.
Tree - Data Structure
Tree - Data StructureAshim Lamichhane This document provides an overview of trees as a non-linear data structure. It begins by discussing how trees are used to represent hierarchical relationships and defines some key tree terminology like root, parent, child, leaf, and subtree. It then explains that a tree consists of nodes connected in a parent-child relationship, with one root node and nodes that may have any number of children. The document also covers tree traversal methods like preorder, inorder, and postorder traversal. It introduces binary trees and binary search trees, and discusses operations on BSTs like search, insert, and delete. Finally, it provides a brief overview of the Huffman algorithm for data compression.
Queue Data Structure
Queue Data StructureLovely Professional University Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is open at both its ends. One end is always used to insert data (enqueue) and the other is used to remove data (dequeue). Queue follows First-In-First-Out methodology, i.e., the data item stored first will be accessed first.
Queues
QueuesAshim Lamichhane Queues
a. Concept and Definition
b. Queue as an ADT
c. Implementation of Insert and Delete operation of:
• Linear Queue
• Circular Queue
For More:
https://github.com/ashim888/dataStructureAndAlgorithm
http://www.ashimlamichhane.com.np/
Stacks overview with its applications
Stacks overview with its applicationsSaqib Saeed Stacks are linear data structures where elements are inserted and removed from the same end, known as the top. Common stack operations include push to add an element, pop to remove the top element, and peek to view the top element without removing it. Stacks are often implemented using arrays or linked lists and have O(1) time complexity for operations. Some applications of stacks include reversing data, converting numbers between bases, expression conversions, and backtracking problems like N-Queens.
Applications of stack
Applications of stackeShikshak The document discusses applications of stacks, including reversing strings and lists, Polish notation for mathematical expressions, converting between infix, prefix and postfix notations, evaluating postfix and prefix expressions, recursion, and the Tower of Hanoi problem. Recursion involves defining a function in terms of itself, with a stopping condition. Stacks can be used to remove recursion by saving local variables at each step.
Stack a Data Structure
Stack a Data StructureForwardBlog Enewzletter The document discusses stacks, which are a fundamental data structure used in programs. It defines a stack as a linear list of items where additions and deletions are restricted to one end, called the top. Common stack operations include push, which adds an element to the top, and pop, which removes an element from the top. Stacks have applications in parsing expressions, reversing strings, implementing depth-first search algorithms, and calculating arithmetic expressions in prefix and postfix notation. Stacks can be implemented using static arrays or dynamic arrays/linked lists.
Data Structure (Queue)
Data Structure (Queue)Adam Mukharil Bachtiar Queue is a first-in first-out (FIFO) data structure where elements can only be added to the rear of the queue and removed from the front of the queue. It has two pointers - a front pointer pointing to the front element and a rear pointer pointing to the rear element. Queues can be implemented using arrays or linked lists. Common queue operations include initialization, checking if empty/full, enqueue to add an element, and dequeue to remove an element. The document then describes how these operations work for queues implemented using arrays, linked lists, and circular arrays. It concludes by providing exercises to implement specific queue tasks.
Terminology of tree
Terminology of treeRacksaviR This document defines key terminology used in tree data structures. It explains that a tree is a hierarchical data structure composed of nodes connected by edges. The root node is the top node, with child nodes connected below and leaf nodes at the bottom with no children. Other terms defined include parent, sibling, internal and external nodes, degree, level, height, depth, path, and subtree.
Binary Search
Binary Searchkunj desai This document describes binary search and provides an example of how it works. It begins with an introduction to binary search, noting that it can only be used on sorted lists and involves comparing the search key to the middle element. It then provides pseudocode for the binary search algorithm. The document analyzes the time complexity of binary search as O(log n) in the average and worst cases. It notes the advantages of binary search are its efficiency, while the disadvantage is that the list must be sorted. Applications mentioned include database searching and solving equations.
1.4 expression tree 
1.4 expression tree Krish_ver2 The document discusses expression trees and algorithms for evaluating postfix, infix, and constructing binary expression trees. It explains that a binary expression tree represents a mathematical expression where each leaf node contains an operand and each non-leaf node contains an operator. The tree shows the order of operations based on the level of each node. The algorithms for evaluating infix and constructing the tree are similar except that pointers to nodes are pushed onto the stack instead of values.
Stack
StackZaid Shabbir A stack is a data structure where items can only be inserted and removed from one end. The last item inserted is the first item removed (LIFO). Common examples include stacks of books, plates, or bank transactions. Key stack operations are push to insert, pop to remove, and functions to check if the stack is empty or full. Stacks can be used to implement operations like reversing a string, converting infix to postfix notation, and evaluating arithmetic expressions.
Stack and Queue by M.Gomathi Lecturer
Stack and Queue by M.Gomathi Lecturergomathi chlm This document discusses stacks and queues as abstract data structures. Stacks follow LIFO (last in first out) order, adding and removing elements from one end. Queues follow FIFO (first in first out) order, adding to one end (rear) and removing from the other (front). The document provides examples of stack and queue applications and implementations using arrays.
Stacks Implementation and Examples
Stacks Implementation and Examplesgreatqadirgee4u The document summarizes lecture 2 of the CIS-122 Data Structures course. It covers applications of stacks like arithmetic expressions, recursion, quicksort, and towers of Hanoi. It also discusses stack implementations using arrays and linked lists and provides examples of infix to postfix conversion and evaluating arithmetic expressions using a stack.
trees in data structure 
trees in data structure shameen khan Tree and graph data structures are used to represent hierarchical data. A tree has nodes connected by edges in a parent-child relationship where each node can have zero or more children but only one parent, forming a rooted tree. Common tree types include binary trees where each node has at most two children, binary search trees where the left child is less than the parent which is less than the right child, and B-trees where nodes can have multiple children. Trees are traversed using in-order, pre-order and post-order algorithms.
Binary Tree in Data Structure
Binary Tree in Data StructureMeghaj Mallick Binary trees are a data structure where each node has at most two children. A binary tree node contains data and pointers to its left and right child nodes. Binary search trees are a type of binary tree where nodes are organized in a manner that allows for efficient searches, insertions, and deletions of nodes. The key operations on binary search trees are searching for a node, inserting a new node, and deleting an existing node through various algorithms that traverse the tree. Common traversals of binary trees include preorder, inorder, and postorder traversals.
Stacks
StacksMalainine Zaid The document discusses stacks and their implementation. It introduces stacks and their common operations like push and pop. It describes using stacks to solve problems like reversing a list, calculating in Reverse Polish Notation, and bracket matching by keeping track of opening brackets on a stack. Sample code is provided to implement a stack class with methods like push, pop and top to manipulate items on the stack.
Queue in Data Structure 
Queue in Data Structure Janki Shah Contents:
1. What is Queue?
2. Operations perform on Queue with Algorithm & Example
3. Types of Queue with required example
Data Structure and Algorithms Binary Search Tree
Data Structure and Algorithms Binary Search TreeManishPrajapati78 Binary search trees (BSTs) are data structures that allow for efficient searching, insertion, and deletion. Nodes in a BST are organized so that all left descendants of a node are less than the node's value and all right descendants are greater. This property allows values to be found, inserted, or deleted in O(log n) time on average. Searching involves recursively checking if the target value is less than or greater than the current node's value. Insertion follows the search process and adds the new node in the appropriate place. Deletion handles three cases: removing a leaf, node with one child, or node with two children.
STACKS IN DATASTRUCTURE
STACKS IN DATASTRUCTUREArchie Jamwal This document discusses stacks as a linear data structure. It defines a stack as a last-in, first-out (LIFO) collection where the last item added is the first removed. The core stack operations of push and pop are introduced, along with algorithms to insert, delete, and display items in a stack. Examples of stack applications include reversing strings, checking validity of expressions with nested parentheses, and converting infix notation to postfix.
Quick sort-Data Structure
Quick sort-Data StructureJeanie Arnoco Quicksort is a divide and conquer sorting algorithm that works by partitioning an array around a pivot value. It then recursively sorts the sub-arrays on each side. The key steps are: 1) Choose a pivot element to split the array into left and right halves, with all elements on the left being less than the pivot and all on the right being greater; 2) Recursively quicksort the left and right halves; 3) Combine the now-sorted left and right halves into a fully sorted array. The example demonstrates quicksorting an array of 6 elements by repeatedly partitioning around a pivot until the entire array is sorted.
Linked list
Linked listakshat360 Linked lists are linear data structures where each node contains a data field and a pointer to the next node. There are two types: singly linked lists where each node has a single next pointer, and doubly linked lists where each node has next and previous pointers. Common operations on linked lists include insertion and deletion which have O(1) time complexity for singly linked lists but require changing multiple pointers for doubly linked lists. Linked lists are useful when the number of elements is dynamic as they allow efficient insertions and deletions without shifting elements unlike arrays.
Linked List
Linked ListAshim Lamichhane a. Concept and Definition✓
b. Inserting and Deleting nodes ✓
c. Linked implementation of a stack (PUSH/POP) ✓
d. Linked implementation of a queue (Insert/Remove) ✓
e. Circular List
• Stack as a circular list (PUSH/POP) ✓
• Queue as a circular list (Insert/Remove) ✓
f. Doubly Linked List (Insert/Remove) ✓
For more course related material:
https://github.com/ashim888/dataStructureAndAlgorithm/
Personal blog
www.ashimlamichhane.com.np
Queue_Data_Structure.pptx
Queue_Data_Structure.pptxsandeep54552 Queue is a linear data structure where elements are inserted at the rear end and removed from the front end, making it a First In First Out (FIFO) structure. Elements are added to the back of the queue and the earliest elements exit from the front, similarly to waiting in line. Queues are useful for serving single shared resources like printers, scheduling CPU tasks, handling calls in call centers, and processing interrupts in real-time systems in the order they arrive.
Stack and Queue 
Stack and Queue Apurbo Datta The document discusses stacks and queues. It defines stacks as LIFO data structures and queues as FIFO data structures. It describes basic stack operations like push and pop and basic queue operations like enqueue and dequeue. It then discusses implementing stacks and queues using arrays and linked lists, outlining the key operations and memory requirements for each implementation.
stack & queue
stack & queuemanju rani This document discusses stacks and queues as linear data structures. It defines stacks as last-in, first-out (LIFO) collections where the last item added is the first removed. Queues are first-in, first-out (FIFO) collections where the first item added is the first removed. Common stack and queue operations like push, pop, insert, and remove are presented along with algorithms and examples. Applications of stacks and queues in areas like expression evaluation, string reversal, and scheduling are also covered.
16 combinatroics-2
16 combinatroics-2Tin học Sức sống The document summarizes key topics covered in a discrete mathematics lecture:
1. The binomial theorem for expanding (a+b)n and calculating coefficients using binomial coefficients.
2. Counting combinations with repetition using partitioning and binomial coefficients.
3. An introduction to finite probability, defining sample spaces, events, and calculating probabilities as ratios of event sizes to sample space sizes.
Virtual base class
Virtual base classTech_MX This document discusses the diamond problem that can occur with multiple inheritance in C++. Specifically, it shows an example where a class "four" inherits from classes "two" and "three", which both inherit from class "one". This results in two copies of the base class "one" being present in objects of class "four", leading to ambiguity when trying to access attributes from the base class. The document presents two ways to resolve this issue: 1) manual selection using scope resolution to specify which attribute to access, and 2) making the inheritance of the base class "one" virtual in classes "two" and "three", which ensures only one copy of the base class exists in class "four" objects. The virtual
Ad
More Related Content
What's hot (20)
Stack a Data Structure
Stack a Data StructureForwardBlog Enewzletter The document discusses stacks, which are a fundamental data structure used in programs. It defines a stack as a linear list of items where additions and deletions are restricted to one end, called the top. Common stack operations include push, which adds an element to the top, and pop, which removes an element from the top. Stacks have applications in parsing expressions, reversing strings, implementing depth-first search algorithms, and calculating arithmetic expressions in prefix and postfix notation. Stacks can be implemented using static arrays or dynamic arrays/linked lists.
Data Structure (Queue)
Data Structure (Queue)Adam Mukharil Bachtiar Queue is a first-in first-out (FIFO) data structure where elements can only be added to the rear of the queue and removed from the front of the queue. It has two pointers - a front pointer pointing to the front element and a rear pointer pointing to the rear element. Queues can be implemented using arrays or linked lists. Common queue operations include initialization, checking if empty/full, enqueue to add an element, and dequeue to remove an element. The document then describes how these operations work for queues implemented using arrays, linked lists, and circular arrays. It concludes by providing exercises to implement specific queue tasks.
Terminology of tree
Terminology of treeRacksaviR This document defines key terminology used in tree data structures. It explains that a tree is a hierarchical data structure composed of nodes connected by edges. The root node is the top node, with child nodes connected below and leaf nodes at the bottom with no children. Other terms defined include parent, sibling, internal and external nodes, degree, level, height, depth, path, and subtree.
Binary Search
Binary Searchkunj desai This document describes binary search and provides an example of how it works. It begins with an introduction to binary search, noting that it can only be used on sorted lists and involves comparing the search key to the middle element. It then provides pseudocode for the binary search algorithm. The document analyzes the time complexity of binary search as O(log n) in the average and worst cases. It notes the advantages of binary search are its efficiency, while the disadvantage is that the list must be sorted. Applications mentioned include database searching and solving equations.
1.4 expression tree
1.4 expression tree Krish_ver2 The document discusses expression trees and algorithms for evaluating postfix, infix, and constructing binary expression trees. It explains that a binary expression tree represents a mathematical expression where each leaf node contains an operand and each non-leaf node contains an operator. The tree shows the order of operations based on the level of each node. The algorithms for evaluating infix and constructing the tree are similar except that pointers to nodes are pushed onto the stack instead of values.
Stack
StackZaid Shabbir A stack is a data structure where items can only be inserted and removed from one end. The last item inserted is the first item removed (LIFO). Common examples include stacks of books, plates, or bank transactions. Key stack operations are push to insert, pop to remove, and functions to check if the stack is empty or full. Stacks can be used to implement operations like reversing a string, converting infix to postfix notation, and evaluating arithmetic expressions.
Stack and Queue by M.Gomathi Lecturer
Stack and Queue by M.Gomathi Lecturergomathi chlm This document discusses stacks and queues as abstract data structures. Stacks follow LIFO (last in first out) order, adding and removing elements from one end. Queues follow FIFO (first in first out) order, adding to one end (rear) and removing from the other (front). The document provides examples of stack and queue applications and implementations using arrays.
Stacks Implementation and Examples
Stacks Implementation and Examplesgreatqadirgee4u The document summarizes lecture 2 of the CIS-122 Data Structures course. It covers applications of stacks like arithmetic expressions, recursion, quicksort, and towers of Hanoi. It also discusses stack implementations using arrays and linked lists and provides examples of infix to postfix conversion and evaluating arithmetic expressions using a stack.
trees in data structure
trees in data structure shameen khan Tree and graph data structures are used to represent hierarchical data. A tree has nodes connected by edges in a parent-child relationship where each node can have zero or more children but only one parent, forming a rooted tree. Common tree types include binary trees where each node has at most two children, binary search trees where the left child is less than the parent which is less than the right child, and B-trees where nodes can have multiple children. Trees are traversed using in-order, pre-order and post-order algorithms.
Binary Tree in Data Structure
Binary Tree in Data StructureMeghaj Mallick Binary trees are a data structure where each node has at most two children. A binary tree node contains data and pointers to its left and right child nodes. Binary search trees are a type of binary tree where nodes are organized in a manner that allows for efficient searches, insertions, and deletions of nodes. The key operations on binary search trees are searching for a node, inserting a new node, and deleting an existing node through various algorithms that traverse the tree. Common traversals of binary trees include preorder, inorder, and postorder traversals.
Stacks
StacksMalainine Zaid The document discusses stacks and their implementation. It introduces stacks and their common operations like push and pop. It describes using stacks to solve problems like reversing a list, calculating in Reverse Polish Notation, and bracket matching by keeping track of opening brackets on a stack. Sample code is provided to implement a stack class with methods like push, pop and top to manipulate items on the stack.
Queue in Data Structure
Queue in Data Structure Janki Shah Contents:
1. What is Queue?
2. Operations perform on Queue with Algorithm & Example
3. Types of Queue with required example
Data Structure and Algorithms Binary Search Tree
Data Structure and Algorithms Binary Search TreeManishPrajapati78 Binary search trees (BSTs) are data structures that allow for efficient searching, insertion, and deletion. Nodes in a BST are organized so that all left descendants of a node are less than the node's value and all right descendants are greater. This property allows values to be found, inserted, or deleted in O(log n) time on average. Searching involves recursively checking if the target value is less than or greater than the current node's value. Insertion follows the search process and adds the new node in the appropriate place. Deletion handles three cases: removing a leaf, node with one child, or node with two children.
STACKS IN DATASTRUCTURE
STACKS IN DATASTRUCTUREArchie Jamwal This document discusses stacks as a linear data structure. It defines a stack as a last-in, first-out (LIFO) collection where the last item added is the first removed. The core stack operations of push and pop are introduced, along with algorithms to insert, delete, and display items in a stack. Examples of stack applications include reversing strings, checking validity of expressions with nested parentheses, and converting infix notation to postfix.
Quick sort-Data Structure
Quick sort-Data StructureJeanie Arnoco Quicksort is a divide and conquer sorting algorithm that works by partitioning an array around a pivot value. It then recursively sorts the sub-arrays on each side. The key steps are: 1) Choose a pivot element to split the array into left and right halves, with all elements on the left being less than the pivot and all on the right being greater; 2) Recursively quicksort the left and right halves; 3) Combine the now-sorted left and right halves into a fully sorted array. The example demonstrates quicksorting an array of 6 elements by repeatedly partitioning around a pivot until the entire array is sorted.
Linked list
Linked listakshat360 Linked lists are linear data structures where each node contains a data field and a pointer to the next node. There are two types: singly linked lists where each node has a single next pointer, and doubly linked lists where each node has next and previous pointers. Common operations on linked lists include insertion and deletion which have O(1) time complexity for singly linked lists but require changing multiple pointers for doubly linked lists. Linked lists are useful when the number of elements is dynamic as they allow efficient insertions and deletions without shifting elements unlike arrays.
Linked List
Linked ListAshim Lamichhane a. Concept and Definition✓
b. Inserting and Deleting nodes ✓
c. Linked implementation of a stack (PUSH/POP) ✓
d. Linked implementation of a queue (Insert/Remove) ✓
e. Circular List
• Stack as a circular list (PUSH/POP) ✓
• Queue as a circular list (Insert/Remove) ✓
f. Doubly Linked List (Insert/Remove) ✓
For more course related material:
https://github.com/ashim888/dataStructureAndAlgorithm/
Personal blog
www.ashimlamichhane.com.np
Queue_Data_Structure.pptx
Queue_Data_Structure.pptxsandeep54552 Queue is a linear data structure where elements are inserted at the rear end and removed from the front end, making it a First In First Out (FIFO) structure. Elements are added to the back of the queue and the earliest elements exit from the front, similarly to waiting in line. Queues are useful for serving single shared resources like printers, scheduling CPU tasks, handling calls in call centers, and processing interrupts in real-time systems in the order they arrive.
Stack and Queue
Stack and Queue Apurbo Datta The document discusses stacks and queues. It defines stacks as LIFO data structures and queues as FIFO data structures. It describes basic stack operations like push and pop and basic queue operations like enqueue and dequeue. It then discusses implementing stacks and queues using arrays and linked lists, outlining the key operations and memory requirements for each implementation.
stack & queue
stack & queuemanju rani This document discusses stacks and queues as linear data structures. It defines stacks as last-in, first-out (LIFO) collections where the last item added is the first removed. Queues are first-in, first-out (FIFO) collections where the first item added is the first removed. Common stack and queue operations like push, pop, insert, and remove are presented along with algorithms and examples. Applications of stacks and queues in areas like expression evaluation, string reversal, and scheduling are also covered.
Viewers also liked (7)
16 combinatroics-2
16 combinatroics-2Tin học Sức sống The document summarizes key topics covered in a discrete mathematics lecture:
1. The binomial theorem for expanding (a+b)n and calculating coefficients using binomial coefficients.
2. Counting combinations with repetition using partitioning and binomial coefficients.
3. An introduction to finite probability, defining sample spaces, events, and calculating probabilities as ratios of event sizes to sample space sizes.
Virtual base class
Virtual base classTech_MX This document discusses the diamond problem that can occur with multiple inheritance in C++. Specifically, it shows an example where a class "four" inherits from classes "two" and "three", which both inherit from class "one". This results in two copies of the base class "one" being present in objects of class "four", leading to ambiguity when trying to access attributes from the base class. The document presents two ways to resolve this issue: 1) manual selection using scope resolution to specify which attribute to access, and 2) making the inheritance of the base class "one" virtual in classes "two" and "three", which ensures only one copy of the base class exists in class "four" objects. The virtual
Stack data structure
Stack data structureTech_MX The document discusses implementation of stacks. It describes stacks as linear data structures that follow LIFO principles. Key stack operations like push and pop are outlined. Stacks are often implemented using arrays or linked lists. Examples of stack applications include recursion handling, expression evaluation, parenthesis checking, and backtracking problems. Conversion from infix to postfix notation using a stack is also demonstrated.
Permutation & Combination
Permutation & CombinationPuru Agrawal A short presentation to explain the use of permutations and combinations and some examples to illustrate the concepts. This was made as an assignment in which i was to explain the concepts to the class.
Permutation and combination
Permutation and combinationSadia Zareen 1) The document discusses permutations and combinations, which are ways of arranging or selecting items from a group.
2) A permutation is an arrangement of items that considers order, while a combination disregards order.
3) Formulas are provided to calculate the number of permutations and combinations for a given number of items selected from a larger set.
Permutations and combinations examples
Permutations and combinations examplesLeo Crisologo This document contains 13 examples of permutations and combinations problems from a Mathematics 4 class. It provides example problems involving passcode combinations, palindromes, paths on a grid, lottery number selection, triangles in an octagon, quiz answers, multiple choice exams, hamburger toppings, NBA championship series outcomes, poker hands, and donut flavors. The document is intended to illustrate different applications of permutations and combinations in mathematics.
Permutations & Combinations
Permutations & Combinationsrfant Students will learn to find permutations and combinations.
Students will learn how to calculate the probability of an event using permutations.
Ad
Similar to Stack Data Structure & It's Application (20)
Stacks
StacksSadaf Ismail The document discusses stacks and their implementation using linked lists. It defines a stack as a last-in, first-out data structure that allows insertion and deletion of elements only at one end, called the top. Key stack operations like push, pop and peek are described along with their algorithms. Linked list and array implementations of stacks are presented. Common applications of stacks like balancing symbols, postfix notation calculators, and infix to postfix conversion are also covered.
04 stacks
04 stacksRajan Gautam 1. The document discusses stacks and their implementation as a data structure. Stacks follow the last-in, first-out (LIFO) principle and can be implemented using either arrays (static implementation) or linked lists (dynamic implementation).
2. Common stack operations like push, pop, peek and isEmpty are described along with their time complexities. Converting expressions from infix to postfix notation using stacks is also covered.
3. Examples of implementing stacks using arrays and linked lists in C programming language are provided, including functions for push, pop and traversal operations. Converting infix expressions to equivalent postfix forms using stack operations is demonstrated through examples.
Stacks in c++
Stacks in c++Vineeta Garg The document discusses stacks in C++. It defines a stack as a data structure that follows LIFO (Last In First Out) principle where the last element added is the first to be removed. Stacks can be implemented using arrays or linked lists. The key operations on a stack are push which adds an element and pop which removes an element. Example applications of stacks include function call stacks, converting infix to postfix notation, and reversing arrays.
Stack data structure
Stack data structurerogineojerio020496 The document discusses stacks and their implementation and operations. It defines a stack as a linear data structure that follows the LIFO principle. Stacks can be implemented using arrays or linked lists. The two main operations on a stack are push and pop. Push adds an element to the top of the stack, while pop removes an element from the top. The document provides examples of these operations and discusses applications of stacks such as converting infix to postfix notation.
Data structure lab manual
Data structure lab manualnikshaikh786 The document describes implementing a queue using an array. It provides algorithms for enQueue() and deQueue() operations. EnQueue() inserts elements at the rear by incrementing rear and checking for full. DeQueue() deletes elements from the front by incrementing front and checking for empty. The queue uses front and rear pointers to manage insertion and deletion of elements based on FIFO principle using an underlying fixed-size array.
Stack linked list
Stack linked listbhargav0077 The document discusses different implementations of stacks and queues using linked lists and arrays. It describes how stacks can be implemented using a linked list, with push and pop operations adding and removing nodes from the head of the list. Queues can also be implemented with linked lists or arrays, but arrays require additional logic to maintain first-in, first-out order efficiently. Common applications of stacks and queues include evaluating expressions, checking for balanced brackets, and managing tasks in operating systems and server requests.
Stacks
Stackssweta dargad Data Structure- Stack operations may involve initializing the stack, using it and then de-initializing it. Apart from these basic stuffs, a stack is used for the following two primary operations −
PUSH, POP, PEEP
Stack and its applications
Stack and its applicationsAhsan Mansiv Stack is an abstract data type that serves as a linear collection of elements. It has two main operations: push, which adds an element to the top of the stack, and pop, which removes the top element. A stack follows last-in, first-out (LIFO) order, meaning the last element added is the first removed. Common real-world examples of stacks include piles of plates and books.
STACK AND ITS OPERATIONS IN DATA STRUCTURES.pptx
STACK AND ITS OPERATIONS IN DATA STRUCTURES.pptxKALPANAC20 This document discusses stacks as a data structure. It defines a stack as a Last In First Out (LIFO) structure where the last item inserted is the first out. Key stack operations like push, pop, peek and isEmpty are described. Examples of stack applications include checking for balanced brackets, converting infix to postfix notation, implementing an undo/redo feature and recursion. The document also provides pseudocode for converting an infix expression to postfix using a stack and describes how a postfix calculator evaluates expressions.
In C++ a function used to put data into a stack is typically called a.docx
In C++ a function used to put data into a stack is typically called a.docxtristans3 In C++ a function used to put data into a stack is typically called a what?
Solution
Push function used to put data into a stack
A Stack is a data structure which works on the principle LIFO(Last In, First Out).The basic operations in a Stack are :
1. Push : In which we push the data into the stack.
2. Pop : In which we remove an element from the Stack.
All insertions and removals are done only from one side of the Stack , which is called the \'top\' of the Stack.
A stack is generally used in function calls where the local variables are pushed onto the Stack and when the function returns ,
it pops the variables from the Stack.
// Push operation to insert an element on top of stack.
void Push(int x)
{
if(top == MAX_SIZE -1) { // overflow case.
cout<<\"Error: stack overflow\ \";
return;
}
A[++top] = x;
}
.
stack (1).pptx
stack (1).pptxCrazyKiller4 The document discusses stacks and their implementation and applications. It begins by defining a stack as a data structure that follows the LIFO (last in, first out) principle. It then describes the basic stack operations of push, pop, peek, and initialization. It provides algorithms to implement these operations using an array. Several applications of stacks are covered, including converting numbers between different bases, reversing strings, checking for palindromes, and evaluating postfix/prefix expressions. The document also discusses converting infix expressions to postfix notation using an operator stack. Overall, the document provides a comprehensive introduction to stacks, their implementation, and common uses.
What is Stack, Its Operations, Queue, Circular Queue, Priority Queue
What is Stack, Its Operations, Queue, Circular Queue, Priority QueueBalwant Gorad Explain Stack and its Concepts, Its Operations, Queue, Circular Queue, Priority Queue. Explain Queue and It's Operations
Data Structures, Abstract Data Types
Unit 3 Stacks and Queues.pptx
Unit 3 Stacks and Queues.pptxYogesh Pawar 1. The document discusses stacks and queues as linear data structures. It describes stack operations like push and pop and provides algorithms for implementing these operations.
2. An example program for implementing a stack using an array is presented, with functions defined for push, pop, and display operations on the stack.
3. Applications of stacks discussed include reversing a list or string by pushing characters onto a stack and popping them off in reverse order, and converting infix expressions to postfix using a stack.
Stack,queue and linked list data structure.pptx
Stack,queue and linked list data structure.pptxyukti266975 Presentation gives brief overview of various operations on data structures
Stack.pptx
Stack.pptxAliRaza899305 The document discusses stacks and their implementation. It defines stacks as ordered collections where insertions and deletions occur at one end. Common stack operations like push and pop are described. Stacks can be implemented using arrays or linked lists. Various stack applications are mentioned like checking balanced symbols.
DS UNIT1_STACKS.pptx
DS UNIT1_STACKS.pptxVeerannaKotagi1 The document discusses stacks and stack operations in C. It defines a stack as a linear data structure that follows the LIFO principle, where elements are added and removed from one end called the top. The key stack operations are PUSH to add an element, POP to remove an element, and DISPLAY to output the stack. It provides algorithms for implementing PUSH and POP and handling exceptions like stack overflow. The document also covers postfix notation, where operators follow operands, and the postfix evaluation algorithm using a stack.
01 stack 20160908_jintaek_seo
01 stack 20160908_jintaek_seoJinTaek Seo The document outlines a presentation on mobile game programming and stacks. It discusses abstract data types (ADTs), data structures, and specifically focuses on stacks. It provides examples of stack implementations in C++ using classes and templates. Finally, it discusses algorithms that use stacks, including converting number systems, evaluating postfix notation, and converting infix to postfix notation.
Ad
More from Tech_MX (20)
Uid
UidTech_MX The document discusses India's Unique Identification (UID) project and the Unique Identification Authority of India (UIDAI). It describes the purpose of UIDAI as providing a unique identification number to all Indian residents. It outlines the enrollment and authentication processes and discusses the various agencies, technologies, and challenges involved in implementing the UID system on a large scale. Key risks discussed include issues relating to adoption, privacy/security of biometric data, and ensuring the system's long-term sustainability.
Theory of estimation
Theory of estimationTech_MX The document discusses key concepts in estimation theory including point estimation, interval estimation, and sample size determination. Point estimation involves calculating a single value to estimate an unknown population parameter. Interval estimation provides a range of values that the population parameter is likely to fall within. Sample size is important for balancing statistical power and cost; larger samples improve precision but also increase expenses. The document outlines methods for constructing confidence intervals for means, proportions, and differences between parameters.
Templates in C++
Templates in C++Tech_MX Templates allow functions and classes to operate on generic types in C++. There are two types of templates: class templates and function templates. Function templates are functions that can operate on generic types, allowing code to be reused for multiple types without rewriting. Template parameters allow types to be passed to templates, similar to how regular parameters pass values. When a class, function or static member is generated from a template, it is called template instantiation.
String & its application
String & its applicationTech_MX The document discusses strings in C and common string functions. It defines a string as an array of characters terminated by a null character. It describes two ways to use strings - with a character array or string pointer. It then explains functions such as strcpy(), strcat(), strcmp() that copy, append, or compare strings. Other functions like memcpy(), memcmp() operate on a specified number of characters rather than null-terminated strings.
Statistical quality__control_2
Statistical quality__control_2Tech_MX Statistical Quality Control (SQC) is used to evaluate organizational quality through statistical tools. SQC can be classified into descriptive statistics, statistical process control, and acceptance sampling. Descriptive statistics describe quality characteristics and relationships through measures like the mean and standard deviation. Statistical process control uses random sampling to determine if a process is producing products within a predetermined range. Acceptance sampling involves random inspection of samples to determine if an entire lot should be accepted or rejected. Control charts graphically show whether sample data falls within the normal variation limits.
Spss
SpssTech_MX SPSS is a statistical software package used for data management and analysis. It can import data from various file formats, perform complex statistical analyses and generate reports, tables, and graphs. Some key features include an easy to use interface, robust statistical procedures, and the ability to work with different operating systems. While powerful and popular, SPSS is also expensive and less flexible than open-source alternatives like R for advanced or custom analyses.
Spanning trees & applications
Spanning trees & applicationsTech_MX This document discusses minimum spanning trees. It defines a minimum spanning tree as a spanning tree of a connected, undirected graph that has a minimum total cost among all spanning trees of that graph. The document provides properties of minimum spanning trees, including that they are acyclic, connect all vertices, and have n-1 edges for a graph with n vertices. Applications of minimum spanning trees mentioned include communication networks, power grids, and laying telephone wires to minimize total length.
Set data structure 2
Set data structure 2Tech_MX The document discusses various data structures for representing sets and algorithms for performing set operations on those data structures. It describes representing sets as linked lists, trees, hash tables, and bit vectors. For linked lists, it provides algorithms for union, intersection, difference, equality testing, and other set operations. It also discusses how bit vectors can be used to efficiently represent the presence or absence of elements in a set and perform operations using bitwise logic.
Set data structure 
Set data structure Tech_MX Sets are collections of unique elements that do not allow repetition. Elements must satisfy membership rules to be included in a set. Common set operations include union, intersection, difference and subset testing. Sets can be mutable, allowing addition and removal of elements, or immutable. Hash functions are used to map elements to locations in hash tables, enabling fast set operations on large collections. Spelling checkers use hash tables to implement sets and check dictionary words against input words.
Real time Operating System
Real time Operating SystemTech_MX This document discusses real-time operating systems (RTOS). It defines RTOS as operating systems that are able to respond to inputs immediately within a specified time delay. It compares RTOS to general operating systems and discusses the types, characteristics, functions, and applications of RTOS. Examples of RTOS like VxWorks are provided. The key functions of an RTOS include task management, scheduling, resource allocation, and interrupt handling. RTOS are widely used in applications that require deterministic responses like avionics, medical devices, industrial automation, and more.
Parsing
ParsingTech_MX The document discusses parsing in compilers. It defines parsing as the second stage after lexical analysis, where a parser checks if the stream of tokens from the lexical analyzer is grammatically correct by generating a parse tree. The fundamental theory behind parsing is context-free grammar, which is used to define languages and check parsing. The document then discusses context-free grammars, parse trees, ambiguity, and provides examples of grammars for Boolean expressions to illustrate parsing concepts.
Mouse interrupts (Assembly Language & C)
Mouse interrupts (Assembly Language & C)Tech_MX This document discusses interrupts and the mouse on the 8086 CPU. It describes how interrupts work on the 8086, including hardware, software, and interrupt service routines. It explains the fetch-execute cycle of the CPU and the interrupt sequence. It then covers mouse features like pixels and the mouse pointer. It discusses the interrupt vector table format and how mouse functions like initializing, displaying, hiding the cursor, and getting button/position information are accessed through interrupt 33h.
Motherboard of a pc
Motherboard of a pcTech_MX The motherboard is the central circuit board in a computer that connects the various components like the CPU, memory, storage, and peripherals. It provides the electrical pathways allowing these components to communicate with each other. Over time, more functions have been integrated onto motherboards, from basic components in early computers to modern boards that support complex graphics, audio, and networking. The motherboard contains the BIOS, chipset that directs data flow, and expansion slots to connect additional components. Common motherboard failures include catastrophic failures during early use, intermittent component failures, and difficult to diagnose issues causing crashes or reboots.
More on Lex
More on LexTech_MX This document provides additional information about LEX and describes several LEX patterns, variables, functions, start conditions, and examples. It explains that LEX is used for text processing and scanner generation. It also describes pattern matching symbols, special directives like ECHO and REJECT, variables like yytext, and functions like yylex(), yyless(), and yywrap(). Examples are provided for multi-file scanning, counting character sequences, and generating HTML.
MultiMedia dbms
MultiMedia dbmsTech_MX A multimedia database management system (MMDBMS) stores and manages multimedia data like text, images, audio, and video. Multimedia data can be stored in three parts - raw data, registering data, and descriptive data. Registering data provides interpretation information, descriptive data describes content and structure, and raw data is the unformatted information content like pixels. An MMDBMS allows input, output, modification, deletion, comparison, and evaluation operations on different multimedia data types. MMDBMS design can be based on object-oriented or entity-relationship database models.
Merging files (Data Structure)
Merging files (Data Structure)Tech_MX This document discusses different techniques for merging files in revision control systems. It begins by introducing the concept of merging as reconciling multiple changes made to files. It then discusses external sorting techniques that can handle large amounts of data. The main merging techniques covered are two-way merging, three-way merging, and k-way merging. Two-way merging considers differences between two files alone, while three-way merging also looks at the original parent file. Three-way merging is generally more reliable with less need for user intervention. K-way merging uses a tournament sort algorithm to merge an arbitrary number of files.
Memory dbms
Memory dbmsTech_MX This document discusses memory-based database management systems (MDBMS). Key points include:
- An MDBMS stores the database in main memory rather than disk storage for faster access speed. However, data is transient and could be lost if power is lost.
- MDBMS are well-suited for applications with frequent data reads, shared databases with many users, or where performance is critical. They are less suitable when data persistence is required.
- Sybase implemented an MDBMS that uses memory as a virtual disk volume, retaining the SQL interface. Transactions are stored in a transfer table then committed to the original disk-based database.
Linkers
LinkersTech_MX This document provides an introduction to the linker and linking process. It discusses how a linker binds external references in object files to the correct memory addresses. The key steps are:
1. The linker takes object files generated by the compiler and combines them into a single executable.
2. It performs relocation which modifies the object code to reflect the actual memory addresses assigned during linking.
3. The linking process resolves symbols and allows references between separate object programs to be combined into a fully linked executable.
Linear regression
Linear regressionTech_MX This document provides an example of simple linear regression with one independent variable. It explains that linear regression finds the line of best fit by estimating values for the slope (b1) and y-intercept (b0) that minimize the sum of the squared errors between the observed data points and the regression line. It provides the formulas for calculating the least squares estimates of b1 and b0. The document includes a table of temperature and sales data and a corresponding scatter plot as an example of simple linear regression analysis.
Keyboard interrupt
Keyboard interruptTech_MX The document discusses various keyboard and video interrupts used in 8086 processors. It explains that interrupts allow efficient processing of I/O without wasting CPU time waiting. INT 21h is used for keyboard and file operations depending on the value in register AH. INT 16h provides keyboard services like reading keys. INT 10h controls video modes and can set pixels, write text, and get display information. Example programs demonstrate using interrupts to get input, output text, and retrieve the date.
Recently uploaded (20)
Presentation of the MIPLM subject matter expert Erdem Kaya
Presentation of the MIPLM subject matter expert Erdem KayaMIPLM Presentation of the MIPLM subject matter expert Erdem Kaya
LDMMIA Reiki Master Spring 2025 Mini Updates
LDMMIA Reiki Master Spring 2025 Mini UpdatesLDM Mia eStudios As of Mid to April Ending, I am building a new Reiki-Yoga Series. No worries, they are free workshops. So far, I have 3 presentations so its a gradual process. If interested visit: https://www.slideshare.net/YogaPrincess
https://ldmchapels.weebly.com
Blessings and Happy Spring. We are hitting Mid Season.
Introduction to Vibe Coding and Vibe Engineering
Introduction to Vibe Coding and Vibe EngineeringDamian T. Gordon Introduction to Vibe Coding and Vibe Engineering
YSPH VMOC Special Report - Measles Outbreak Southwest US 4-30-2025.pptx
YSPH VMOC Special Report - Measles Outbreak Southwest US 4-30-2025.pptxYale School of Public Health - The Virtual Medical Operations Center (VMOC) A measles outbreak originating in West Texas has been linked to confirmed cases in New Mexico, with additional cases reported in Oklahoma and Kansas. The current case count is 795 from Texas, New Mexico, Oklahoma, and Kansas. 95 individuals have required hospitalization, and 3 deaths, 2 children in Texas and one adult in New Mexico. These fatalities mark the first measles-related deaths in the United States since 2015 and the first pediatric measles death since 2003.
The YSPH Virtual Medical Operations Center Briefs (VMOC) were created as a service-learning project by faculty and graduate students at the Yale School of Public Health in response to the 2010 Haiti Earthquake. Each year, the VMOC Briefs are produced by students enrolled in Environmental Health Science Course 581 - Public Health Emergencies: Disaster Planning and Response. These briefs compile diverse information sources – including status reports, maps, news articles, and web content– into a single, easily digestible document that can be widely shared and used interactively. Key features of this report include:
- Comprehensive Overview: Provides situation updates, maps, relevant news, and web resources.
- Accessibility: Designed for easy reading, wide distribution, and interactive use.
- Collaboration: The “unlocked" format enables other responders to share, copy, and adapt seamlessly. The students learn by doing, quickly discovering how and where to find critical information and presenting it in an easily understood manner.
The ever evoilving world of science /7th class science curiosity /samyans aca...
The ever evoilving world of science /7th class science curiosity /samyans aca...Sandeep Swamy The Ever-Evolving World of
Science
Welcome to Grade 7 Science4not just a textbook with facts, but an invitation to
question, experiment, and explore the beautiful world we live in. From tiny cells
inside a leaf to the movement of celestial bodies, from household materials to
underground water flows, this journey will challenge your thinking and expand
your knowledge.
Notice something special about this book? The page numbers follow the playful
flight of a butterfly and a soaring paper plane! Just as these objects take flight,
learning soars when curiosity leads the way. Simple observations, like paper
planes, have inspired scientific explorations throughout history.
Handling Multiple Choice Responses: Fortune Effiong.pptx
Handling Multiple Choice Responses: Fortune Effiong.pptxAuthorAIDNationalRes INTRO TO STATISTICS
INTRO TO SPSS INTERFACE
CLEANING MULTIPLE CHOICE RESPONSE DATA WITH EXCEL
ANALYZING MULTIPLE CHOICE RESPONSE DATA
INTERPRETATION
Q & A SESSION
PRACTICAL HANDS-ON ACTIVITY
Ultimate VMware 2V0-11.25 Exam Dumps for Exam Success
Ultimate VMware 2V0-11.25 Exam Dumps for Exam SuccessMark Soia Boost your chances of passing the 2V0-11.25 exam with CertsExpert reliable exam dumps. Prepare effectively and ace the VMware certification on your first try
Quality dumps. Trusted results. — Visit CertsExpert Now: https://www.certsexpert.com/2V0-11.25-pdf-questions.html
Biophysics Chapter 3 Methods of Studying Macromolecules.pdf
Biophysics Chapter 3 Methods of Studying Macromolecules.pdfPKLI-Institute of Nursing and Allied Health Sciences Lahore , Pakistan. This chapter provides an in-depth overview of the viscosity of macromolecules, an essential concept in biophysics and medical sciences, especially in understanding fluid behavior like blood flow in the human body.
Key concepts covered include:
✅ Definition and Types of Viscosity: Dynamic vs. Kinematic viscosity, cohesion, and adhesion.
⚙️ Methods of Measuring Viscosity:
Rotary Viscometer
Vibrational Viscometer
Falling Object Method
Capillary Viscometer
🌡️ Factors Affecting Viscosity: Temperature, composition, flow rate.
🩺 Clinical Relevance: Impact of blood viscosity in cardiovascular health.
🌊 Fluid Dynamics: Laminar vs. turbulent flow, Reynolds number.
🔬 Extension Techniques:
Chromatography (adsorption, partition, TLC, etc.)
Electrophoresis (protein/DNA separation)
Sedimentation and Centrifugation methods.
pulse ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulse
pulse ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulsesushreesangita003 what is pulse ?
Purpose
physiology and Regulation of pulse
Characteristics of pulse
factors affecting pulse
Sites of pulse
Alteration of pulse
for BSC Nursing 1st semester
for Gnm Nursing 1st year
Students .
vitalsign
World war-1(Causes & impacts at a glance) PPT by Simanchala Sarab(BABed,sem-4...
World war-1(Causes & impacts at a glance) PPT by Simanchala Sarab(BABed,sem-4...larencebapu132 This is short and accurate description of World war-1 (1914-18)
It can give you the perfect factual conceptual clarity on the great war
Regards Simanchala Sarab
Student of BABed(ITEP, Secondary stage)in History at Guru Nanak Dev University Amritsar Punjab 🙏🙏
Exploring-Substances-Acidic-Basic-and-Neutral.pdf
Exploring-Substances-Acidic-Basic-and-Neutral.pdfSandeep Swamy Exploring Substances:
Acidic, Basic, and
Neutral
Welcome to the fascinating world of acids and bases! Join siblings Ashwin and
Keerthi as they explore the colorful world of substances at their school's
National Science Day fair. Their adventure begins with a mysterious white paper
that reveals hidden messages when sprayed with a special liquid.
In this presentation, we'll discover how different substances can be classified as
acidic, basic, or neutral. We'll explore natural indicators like litmus, red rose
extract, and turmeric that help us identify these substances through color
changes. We'll also learn about neutralization reactions and their applications in
our daily lives.
by sandeep swamy
Social Problem-Unemployment .pptx notes for Physiotherapy Students
Social Problem-Unemployment .pptx notes for Physiotherapy StudentsDrNidhiAgarwal Unemployment is a major social problem, by which not only rural population have suffered but also urban population are suffered while they are literate having good qualification.The evil consequences like poverty, frustration, revolution
result in crimes and social disorganization. Therefore, it is
necessary that all efforts be made to have maximum.
employment facilities. The Government of India has already
announced that the question of payment of unemployment
allowance cannot be considered in India
To study Digestive system of insect.pptx
To study Digestive system of insect.pptxArshad Shaikh Education is one thing no one can take away from you.”
One Hot encoding a revolution in Machine learning
One Hot encoding a revolution in Machine learningmomer9505 A brief introduction to ONE HOT encoding a way to communicate with machines
Operations Management (Dr. Abdulfatah Salem).pdf
Operations Management (Dr. Abdulfatah Salem).pdfArab Academy for Science, Technology and Maritime Transport This version of the lectures is provided free of charge to graduate students studying the Operations Management course at the MBA level.
Presentation on Tourism Product Development By Md Shaifullar Rabbi
Presentation on Tourism Product Development By Md Shaifullar RabbiMd Shaifullar Rabbi Presentation on Tourism Product Development By Md Shaifullar Rabbi, Assistant Manager- SABRE Bangladesh.
Unit 6_Introduction_Phishing_Password Cracking.pdf
Unit 6_Introduction_Phishing_Password Cracking.pdfKanchanPatil34 Initial stages of attacks, Phishing, Password Cracking, guidelines to prevent password attacks, Strong password, weak password,
Political History of Pala dynasty Pala Rulers NEP.pptx
Political History of Pala dynasty Pala Rulers NEP.pptxArya Mahila P. G. College, Banaras Hindu University, Varanasi, India. The Pala kings were people-protectors. In fact, Gopal was elected to the throne only to end Matsya Nyaya. Bhagalpur Abhiledh states that Dharmapala imposed only fair taxes on the people. Rampala abolished the unjust taxes imposed by Bhima. The Pala rulers were lovers of learning. Vikramshila University was established by Dharmapala. He opened 50 other learning centers. A famous Buddhist scholar named Haribhadra was to be present in his court. Devpala appointed another Buddhist scholar named Veerdeva as the vice president of Nalanda Vihar. Among other scholars of this period, Sandhyakar Nandi, Chakrapani Dutta and Vajradatta are especially famous. Sandhyakar Nandi wrote the famous poem of this period 'Ramcharit'.
YSPH VMOC Special Report - Measles Outbreak Southwest US 4-30-2025.pptx
YSPH VMOC Special Report - Measles Outbreak Southwest US 4-30-2025.pptxYale School of Public Health - The Virtual Medical Operations Center (VMOC)
Biophysics Chapter 3 Methods of Studying Macromolecules.pdf
Biophysics Chapter 3 Methods of Studying Macromolecules.pdfPKLI-Institute of Nursing and Allied Health Sciences Lahore , Pakistan.
Operations Management (Dr. Abdulfatah Salem).pdf
Operations Management (Dr. Abdulfatah Salem).pdfArab Academy for Science, Technology and Maritime Transport
Political History of Pala dynasty Pala Rulers NEP.pptx
Political History of Pala dynasty Pala Rulers NEP.pptxArya Mahila P. G. College, Banaras Hindu University, Varanasi, India.
Stack Data Structure & It's Application
- 2. What is stack ? Stack is a special type of data structure. Compared to a container. Last In First Out.
- 3. What is push ? Inserting a element into stack.
- 4. What is stack overflow ? Pushing elements when stack is full. When top exceeds size of stack .
- 5. Algorithm push Procedure Push (Value) If TOP is equal to MAX Output an error that the Stack is full Else Add 1 to TOP Put data in Value into TOP position End If End Procedure
- 6. What is pop ? Removing the top element from the stack.
- 7. What is stack underflow ? Performing pop operation when a stack is empty. When top equals zero.
- 8. Algorithm pop Procedure Pop If TOP is equal to Zero then Stack is empty “Underflow” Else Output value from Stack at TOP position Subtract 1 from TOP End If End Procedure
- 10. Applications of stack Start up & Shut down. Function calling. Argument passing in c.
- 11. System Startup
- 13. System Shutdown
- 15. Function calling
- 16. void three() { printf("Three startedn"); printf("Three endedn"); } void two() { printf("Two startedn"); three(); printf("Two endedn"); } void one() { printf("One startedn"); two(); printf("One endedn"); } void main() { clrscr(); printf("Main startedn"); one(); printf("Main endedn"); getch(); }
- 17. Output Main started One started Two started Three started Three ended Two ended One ended Main ended
- 18. Argument passing in C • Consider the following program :- # include <stdio.h> # include <conio.h> void main() { int a=3; clrscr(); printf(“%d %d%d%d”,a++,++a,++a,a++); getch(); } Expected o/p. 3566
- 19. But o/p is 6 6 5 3 Because the argument are passed from right to left in a stack and then sent to printf function.
- 20. %d %d Top %d %d 6 Called function ie, printf(…); Here the input is taken from stack 6 So, the data order will be 6 6 5 3. 5 Therefore the o/p will be 6 6 5 3. 3
- 21. Conclusion Stack is one of the efficient way to implement discipline to system.
- 22. Thank You.