Stack Data Structure V1.0
Download as PPT, PDF4 likes2,794 views
The document discusses stacks, which are linear data structures that follow the LIFO (last-in, first-out) principle. Stacks allow elements to be inserted and removed from one end through push and pop operations. Common stack operations are described like push, pop, isEmpty and their functions. Examples of stack operations and conversions between infix, prefix and postfix notations are provided.
1 of 8
Downloaded 416 times
Ad
Recommended
Stack application
Stack applicationStudent This document discusses stack applications and operations. It provides examples of how stacks can be used for reversing data, converting decimal to binary, evaluating arithmetic expressions by converting infix to postfix notation, and backtracking. Basic stack operations include push, pop, and peeking at the top element. Stacks follow LIFO order and are commonly implemented using arrays or linked lists. Common applications include reversing strings or files, evaluating arithmetic expressions, and backtracking to achieve goals.
Stack Operation In Data Structure 
Stack Operation In Data Structure DivyeshKumar Jagatiya well prepared and detailed description of stack in data structure.
Also cover the topic of Infix, prefix and post fix notation...
Application of Stack - Yadraj Meena
Application of Stack - Yadraj MeenaDipayan Sarkar The document discusses stacks and their applications. It provides 3 key points:
1. A stack is an abstract data type that follows LIFO (last-in, first-out) principles with push and pop operations. Functions like stack_full and stack_empty are used to implement stacks.
2. Stacks have applications in converting infix notation to postfix notation and evaluating postfix expressions. The algorithms pop and push operators and operands to produce the postfix form or calculate values.
3. Examples show converting the infix expression (A * B + (C - D / E)) to postfix AB*C(D-F/)++ and evaluating the postfix form of True, False, NOT, AND,
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.
Stack - Data Structure
Stack - Data StructureBhavesh Sanghvi This document discusses stacks, which are data structures that only allow adding or removing items from the top. The key operations are push to add an item and pop to remove an item, making stacks follow LIFO (last in, first out) order. Stacks have many uses like evaluating expressions, where a postfix expression uses a stack to evaluate terms without regard for precedence rules. The document also covers converting infix expressions to postfix and prefix forms using a stack.
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.
03 stacks and_queues_using_arrays
03 stacks and_queues_using_arraystameemyousaf The document discusses stacks and their implementation and applications. Stacks are LIFO data structures that can be implemented using arrays. Key operations on stacks include push, pop, peek, isEmpty and isFull. Stacks have various applications including expression evaluation, recursion, function calls and memory management. Stacks can grow either upwards or downwards in the array.
Stack and queue
Stack and queueShakila Mahjabin The document discusses stacks and queues, which are fundamental data structures that can insert and remove items. Stacks follow the LIFO (last in, first out) principle, while queues follow the FIFO (first in, first out) principle. The document provides implementations of stacks and queues using linked lists and arrays and examples of their applications in parsing, compilers, undo functions, and more.
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.
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
Conversion of Infix To Postfix Expressions 
Conversion of Infix To Postfix Expressions Kulachi Hansraj Model School Ashok Vihar Stacks have several application areas including:
1) When functions are called to save return addresses and local variables.
2) To convert infix expressions to postfix form by acting as a placeholder.
3) To evaluate postfix expressions by holding operands and intermediate results.
Stacks
Stackssardorbek mamazhanov A stack is a last-in, first-out data structure where only the top element can be accessed. Elements can be added with push() and removed with pop(). Stacks have various implementations including arrays, vectors, and linked lists. Arrays have fixed size but best performance while vectors grow dynamically but may be slow if resizing. Linked lists allow constant time push/pop but are generally slower. Stacks have many applications including parsing with delimiters, operating system function calls, reverse polish notation calculators, and pathfinding algorithms.
Stack
StackGhaffar Khan The document discusses stacks and their implementation as linked lists and arrays. It defines a stack as a last-in, first-out data structure where insertion and deletion can only occur at one end, called the top. The key stack operations are push, which inserts at the top, pop, which removes from the top, and top, which retrieves the top element. Stacks have applications in postfix notation and converting infix to postfix expressions.
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.
Stacks in DATA STRUCTURE
Stacks in DATA STRUCTUREMandeep Singh A stack is 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. Stacks have common operations like push to add an element and pop to remove the top element. Stacks have many applications including evaluating arithmetic expressions in postfix notation, implementing recursion, and solving puzzles like Towers of Hanoi. The document discusses stack implementations using arrays and linked lists and provides examples of stack applications.
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.
Stack and its Applications : Data Structures ADT
Stack and its Applications : Data Structures ADTSoumen Santra Stacks are a data structure that follow the last-in, first-out (LIFO) principle. Elements are inserted and removed from the same end called the top of the stack. Common stack operations include push to add an element, pop to remove an element, peek to view the top element, and isEmpty to check if the stack is empty. Stacks have various applications like representing function call stacks, evaluating mathematical expressions, and solving puzzles like the Towers of Hanoi. They can be implemented using arrays or linked lists.
Stack_Application_Infix_Prefix.pptx
Stack_Application_Infix_Prefix.pptxsandeep54552 The document discusses applying a stack to evaluate arithmetic expressions. It provides examples of converting infix expressions to prefix expressions by reversing the order of operations and operands and pushing them onto a stack. It also gives examples of stack operations like push, pop, and arithmetic operations between popped elements to evaluate postfix expressions.
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.
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.
Application of Stacks
Application of StacksAin-ul-Moiz Khawaja The document discusses stacks and converting expressions between infix, postfix, and prefix notation. It provides examples and algorithms for converting infix expressions to postfix. The algorithms involve using an operator stack to determine the order of operations based on precedence rules. Operands are added to the output string and operators are pushed to the stack or popped and added to the output string based on their precedence.
Project of data structure
Project of data structureUmme habiba The document discusses various applications of stacks including:
1) Reversing strings by pushing characters onto a stack and popping them off in reverse order.
2) Calculator operations using postfix notation and a stack.
3) Recursive functions using a stack to store previous function calls and variables.
4) Determining if a word is a palindrome by pushing characters onto a stack and comparing to the popped off characters.
Code examples are provided for reversing strings, recursive summation, and determining palindromes using stacks.
Unit 3 stack
Unit 3 stackDabbal Singh Mahara This is course material for computer science and information technology for BSc csit TU, Kathmandu, Nepal.
Data structure Stack
Data structure StackPraveen Vishwakarma This document provides information about stacks as a data structure. It defines a stack as a linear data structure that only allows additions or deletions at one end, following the last-in, first-out (LIFO) principle. The key operations on a stack are push, which adds an element to the top, and pop, which removes an element from the top. The document also discusses stack terminology, different types of notations for expressions (infix, prefix, postfix), algorithms for converting between notations using a stack, an example C program for implementing a stack using an array, and summarizes the main characteristics of stacks.
STACK ( LIFO STRUCTURE) - Data Structure
STACK ( LIFO STRUCTURE) - Data StructureYaksh Jethva Stack which is known as LIFO structure.Which is type of the Linear data structure and it is Non-Primitive data structure.
Definition:Non primitive data structure are not a basic data structure and depends on other primitive data structure (Integer,float etc).
Non primitive data structure can't be operated by machine level instruction directly.
Data structure by Digvijay
Data structure by DigvijayDigvijay Singh Karakoti This document discusses stacks, which are non-linear data structures that follow the LIFO (last in, first out) principle. Stacks have operations like push and pop that insert and remove elements from the top of the stack. Pushing adds an element and increments the top pointer, while popping removes an element and decrements the top pointer. Stacks have applications in expression evaluation, memory management, and recursion. The document provides algorithms and code examples for implementing push and pop operations on a stack.
Stacks in Data Structure
Stacks in Data StructureLovely Professional University A stack is a basic data structure that can be logically thought as linear structure represented by a real physical stack or pile, a structure where insertion and deletion of items take place at one end called the top of the stack.
Introduction to stack
Introduction to stackvaibhav2910 Stacks are linear data structures that only allow insertion and deletion of elements from one end, called the top. Elements are inserted via a push operation and deleted via a pop operation. Stacks can be implemented using arrays, with a pointer tracking the top element. Common applications of stacks include reversing the order of elements and evaluating mathematical expressions by treating them as a postfix notation.
Data Structure (Stack)
Data Structure (Stack)Adam Mukharil Bachtiar Stack is a data structure that only allows elements to be added and removed from one end, called the top. It has components like a top pointer variable, elements that hold data, and a maximum size. Stacks can be implemented as arrays or linked lists. The main operations on a stack are push, which adds an element to the top, and pop, which removes an element from the top. These operations work similarly in array and linked list implementations, by incrementing or decrementing the top pointer and adding or removing the top element.
Stack Data structure
Stack Data structureB Liyanage Asanka This document provides an overview of stacks as a data structure. It defines stacks as linear structures that store data in a last-in, first-out manner. Key points covered include common stack operations like push and pop, complexity analysis, examples of where stacks are used, and C++ code for implementing a stack class with methods like push, pop, peek, and isEmpty.
Ad
More Related Content
What's hot (20)
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.
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
Conversion of Infix To Postfix Expressions
Conversion of Infix To Postfix Expressions Kulachi Hansraj Model School Ashok Vihar Stacks have several application areas including:
1) When functions are called to save return addresses and local variables.
2) To convert infix expressions to postfix form by acting as a placeholder.
3) To evaluate postfix expressions by holding operands and intermediate results.
Stacks
Stackssardorbek mamazhanov A stack is a last-in, first-out data structure where only the top element can be accessed. Elements can be added with push() and removed with pop(). Stacks have various implementations including arrays, vectors, and linked lists. Arrays have fixed size but best performance while vectors grow dynamically but may be slow if resizing. Linked lists allow constant time push/pop but are generally slower. Stacks have many applications including parsing with delimiters, operating system function calls, reverse polish notation calculators, and pathfinding algorithms.
Stack
StackGhaffar Khan The document discusses stacks and their implementation as linked lists and arrays. It defines a stack as a last-in, first-out data structure where insertion and deletion can only occur at one end, called the top. The key stack operations are push, which inserts at the top, pop, which removes from the top, and top, which retrieves the top element. Stacks have applications in postfix notation and converting infix to postfix expressions.
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.
Stacks in DATA STRUCTURE
Stacks in DATA STRUCTUREMandeep Singh A stack is 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. Stacks have common operations like push to add an element and pop to remove the top element. Stacks have many applications including evaluating arithmetic expressions in postfix notation, implementing recursion, and solving puzzles like Towers of Hanoi. The document discusses stack implementations using arrays and linked lists and provides examples of stack applications.
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.
Stack and its Applications : Data Structures ADT
Stack and its Applications : Data Structures ADTSoumen Santra Stacks are a data structure that follow the last-in, first-out (LIFO) principle. Elements are inserted and removed from the same end called the top of the stack. Common stack operations include push to add an element, pop to remove an element, peek to view the top element, and isEmpty to check if the stack is empty. Stacks have various applications like representing function call stacks, evaluating mathematical expressions, and solving puzzles like the Towers of Hanoi. They can be implemented using arrays or linked lists.
Stack_Application_Infix_Prefix.pptx
Stack_Application_Infix_Prefix.pptxsandeep54552 The document discusses applying a stack to evaluate arithmetic expressions. It provides examples of converting infix expressions to prefix expressions by reversing the order of operations and operands and pushing them onto a stack. It also gives examples of stack operations like push, pop, and arithmetic operations between popped elements to evaluate postfix expressions.
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.
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.
Application of Stacks
Application of StacksAin-ul-Moiz Khawaja The document discusses stacks and converting expressions between infix, postfix, and prefix notation. It provides examples and algorithms for converting infix expressions to postfix. The algorithms involve using an operator stack to determine the order of operations based on precedence rules. Operands are added to the output string and operators are pushed to the stack or popped and added to the output string based on their precedence.
Project of data structure
Project of data structureUmme habiba The document discusses various applications of stacks including:
1) Reversing strings by pushing characters onto a stack and popping them off in reverse order.
2) Calculator operations using postfix notation and a stack.
3) Recursive functions using a stack to store previous function calls and variables.
4) Determining if a word is a palindrome by pushing characters onto a stack and comparing to the popped off characters.
Code examples are provided for reversing strings, recursive summation, and determining palindromes using stacks.
Unit 3 stack
Unit 3 stackDabbal Singh Mahara This is course material for computer science and information technology for BSc csit TU, Kathmandu, Nepal.
Data structure Stack
Data structure StackPraveen Vishwakarma This document provides information about stacks as a data structure. It defines a stack as a linear data structure that only allows additions or deletions at one end, following the last-in, first-out (LIFO) principle. The key operations on a stack are push, which adds an element to the top, and pop, which removes an element from the top. The document also discusses stack terminology, different types of notations for expressions (infix, prefix, postfix), algorithms for converting between notations using a stack, an example C program for implementing a stack using an array, and summarizes the main characteristics of stacks.
STACK ( LIFO STRUCTURE) - Data Structure
STACK ( LIFO STRUCTURE) - Data StructureYaksh Jethva Stack which is known as LIFO structure.Which is type of the Linear data structure and it is Non-Primitive data structure.
Definition:Non primitive data structure are not a basic data structure and depends on other primitive data structure (Integer,float etc).
Non primitive data structure can't be operated by machine level instruction directly.
Data structure by Digvijay
Data structure by DigvijayDigvijay Singh Karakoti This document discusses stacks, which are non-linear data structures that follow the LIFO (last in, first out) principle. Stacks have operations like push and pop that insert and remove elements from the top of the stack. Pushing adds an element and increments the top pointer, while popping removes an element and decrements the top pointer. Stacks have applications in expression evaluation, memory management, and recursion. The document provides algorithms and code examples for implementing push and pop operations on a stack.
Stacks in Data Structure
Stacks in Data StructureLovely Professional University A stack is a basic data structure that can be logically thought as linear structure represented by a real physical stack or pile, a structure where insertion and deletion of items take place at one end called the top of the stack.
Introduction to stack
Introduction to stackvaibhav2910 Stacks are linear data structures that only allow insertion and deletion of elements from one end, called the top. Elements are inserted via a push operation and deleted via a pop operation. Stacks can be implemented using arrays, with a pointer tracking the top element. Common applications of stacks include reversing the order of elements and evaluating mathematical expressions by treating them as a postfix notation.
Viewers also liked (20)
Data Structure (Stack)
Data Structure (Stack)Adam Mukharil Bachtiar Stack is a data structure that only allows elements to be added and removed from one end, called the top. It has components like a top pointer variable, elements that hold data, and a maximum size. Stacks can be implemented as arrays or linked lists. The main operations on a stack are push, which adds an element to the top, and pop, which removes an element from the top. These operations work similarly in array and linked list implementations, by incrementing or decrementing the top pointer and adding or removing the top element.
Stack Data structure
Stack Data structureB Liyanage Asanka This document provides an overview of stacks as a data structure. It defines stacks as linear structures that store data in a last-in, first-out manner. Key points covered include common stack operations like push and pop, complexity analysis, examples of where stacks are used, and C++ code for implementing a stack class with methods like push, pop, peek, and isEmpty.
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.
Stack Data Structure & It's Application 
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.
Stack Applications
Stack ApplicationsKulachi Hansraj Model School Ashok Vihar Stack applications: Conversion of Infix To Postfix Expression algorithm and evaluation of postfix expression
Stacks
StacksTemperory mukesh A stack is a last-in, first-out data structure where only the top element can be accessed. Elements can be added with push() and removed with pop(). Stacks have various implementations including arrays, vectors, and linked lists. Arrays have fixed size but best performance while vectors grow dynamically but may be slow if resizing. Linked lists allow constant time push/pop but are generally slower. Stacks have many applications including parsing with delimiters, operating system function calls, reverse polish notation calculators, and pathfinding algorithms.
data structure, stack, stack data structure
data structure, stack, stack data structurepcnmtutorials The document discusses stacks, which are linear data structures that follow the LIFO (last in, first out) principle. Values are inserted into and retrieved from one end, called the top of the stack. The two main operations are push, which inserts a value into the stack, and pop, which retrieves a value. An example C program demonstrates these operations on a stack implemented with an array. The stack starts empty and grows as values are pushed on until it reaches its maximum size, at which point it is full. Values can be continuously popped off until the stack is empty again.
Stack Data Structre Introduction and source code
Stack Data Structre Introduction and source codeSL Coder In this slide show I am showing you what is stack data structure and c++ source code if you want learn more about this you can go to below link and watch a video.
https://youtu.be/TU7kOW5KErc
Algoritma dan Pemrograman C++ (Percabangan)
Algoritma dan Pemrograman C++ (Percabangan)Nabil Muhammad Firdaus Dokumen ini membahas penggunaan logika percabangan dalam algoritma dan pemrograman untuk menyelesaikan berbagai masalah seperti menentukan bilangan positif atau negatif, kelipatan 7 atau bukan, huruf vokal atau konsonan, status kelulusan cumlaude atau tidak, hasil kuadrat bilangan bulat atau bukan, dan kata palindrom atau bukan. Diberikan contoh algoritmanya dengan input, percabangan if-else, dan output.
It 405 materi 2 java dasar
It 405 materi 2 java dasarAyi Purbasari The document provides an overview of the Java programming language, including:
- Java's history and key principles of being concurrent, class-based, object-oriented and designed for platform independence.
- The structure of a Java program including primitive types, expressions, compiling and running programs, and flow control structures.
- An overview of Java versions and editions such as Java SE, Java EE, and Java ME. The Java virtual machine that runs Java bytecode is also discussed.
- A simple "Hello World" example demonstrates Java program structure and bytecode. Programming concepts like blocks, scopes, loops, and conditionals are reviewed.
Viisio based rich picture version 2.0
Viisio based rich picture version 2.0Mithun112 The document discusses using an e-government system to more quickly monitor, transfer, and initiate processes related to issues in government and society. E-government would allow problems to be tracked and addressed faster through electronic means rather than traditional methods. Initiating processes through an e-government system could help improve interactions between government bodies like Congress.
Career Hub Rich Picture
Career Hub Rich Pictureguestc990b6 The document discusses setting up a central career hub website to advertise jobs and events to students from various universities. It notes the desire to have employers directly input job postings and for students to apply for jobs, get notified of suitable opportunities, and find information on career events online. Questions are also raised about how the system would work, whether it needs to interface with other systems, how users will authenticate, and other implementation details.
MeTA MSP workshop: Issues and challenges: Rich picture
MeTA MSP workshop: Issues and challenges: Rich pictureMeTApresents The document discusses rich pictures, which are drawings that illustrate the complexity and relationships within a situation in a holistic way. Rich pictures use pictures, text, symbols and icons to show multiple perspectives on an issue. Developing a rich picture can help identify challenges and opportunities for improvement through group discussion. As an exercise, participants are asked to create rich pictures of their country cases involving key stakeholders in multi-stakeholder processes and identify 5 challenges arising from the relationships and context depicted.
Rich_Picture--IA_Manager.220131720
Rich_Picture--IA_Manager.220131720Thomas Callaghan The document describes a rich picture visualization for a new Information Architecture (IA) Manager role at Sapient Global Markets. The visualization shows the ecosystem surrounding the IA Manager role, including four key processes related to projects, corporate citizenship, careers, and user experience. Feedback was solicited from other IA Managers on questions, stakeholders, and relationships depicted in the rich picture as well as ways to enhance the visualization.
Program design techniques
Program design techniquesfika sweety Business value of business models
Requirements for software development
Requirements provide a description of what a proposed software application should do. Without detailed requirements, application development projects fail. Business models capture this detail in a way that is understandable to both the business users and the software developers. Business users do not need to understand how the system will be created; they need to understand how it will support their need. Business models are a better form of requirements for end users.
AN UPDATED REVIEW ON THE CONVENTIONAL AND UNCONVENTIONAL RICH PICTURE BUILD...
AN UPDATED REVIEW ON THE CONVENTIONAL AND UNCONVENTIONAL RICH PICTURE BUILD...American Research Thoughts Abstract: The topic of rich picture building exercise (RPBE) comes from the Soft Systems
Methodology (SSM) of P.B. Checkland in the early 80s. Since then, it has been studied and reported
in the academic literature. The recent academic works inspires the writer to review this topic and
argues that the mainstream study on RPBE can be considered as a conventional RPBE. The paper
then points out that there is also an unconventional RPBE which has been neglected in the academic
community. It reasons that the unconventional RPBE is also useful to express the proble m situation,
which is what stage 2 of the conventional SSM is all about. The unconventional RPBE can be
conducted either solely or as a complementary exercise with the conventional RPBE. A number of
RPBE options are identified in the discussion. The paper is intended to contribute to the theoretical
development of the RPBE.
CPI Rich Picture 
CPI Rich Picture Hossam El-Shazly CPI International Group Rich Picture
The above figure represents a brief description of the CPI International Group rich picture. According to Monk & Howard (1998) in their article Methods and Tools, they argued that the rich picture should represents primary stakeholders, their interrelations, their concerns as well as three very important components, structure process & concerns.
The CPI rich pictures illustrates most of the components referred to by Monk & Howard (1998) where it describes the business structure with its three main folds, pharmaceutical, education, and renewable energy. The rich picture also refers to the processes of import, export & registration in the pharmaceutical business where the core of the value creation process in this sector. It also draws a line for both the online and on campus corporate education model that used to support the group business worldwide and finally, the pictures illustrates the types of renewable energy installations & projects where the group is currently involved.
The rich picture also refers to the stakeholders of the CPI business worldwide including, agents, partners, governments, and clients. At the same time it defines the competition scale in business, particularly in the pharmaceutical and the energy markets. The rich picture also illustrates the continuos effect of the local and international policies and regulations in such highly regulated market.
References
Monk, A. & Howard, S. (1998) ‘Methods and tools, the rich picture: A tool for reasoning about work context’, Interactions, 5 (2), pp. 21-30, ACM [Online].
Data Structures - Lecture 5 [Stack]![Data Structures - Lecture 5 [Stack]](https://cdn.slidesharecdn.com/ss_thumbnails/lecture-5stack-150114114246-conversion-gate01-thumbnail.jpg?width=560&fit=bounds)
Data Structures - Lecture 5 [Stack]Muhammad Hammad Waseem The document discusses stacks and provides examples. It can be summarized as:
Stacks are data structures that follow the LIFO (last in, first out) principle where the last item added is the first removed. Items can only be added or removed from the top of the stack using push and pop operations. A common example is a stack of trays where only the top tray is accessible.
Linux vs. Windows
Linux vs. WindowsAnas R. The document discusses Linux vs Windows from a software engineering perspective. It examines which Linux distribution and Windows version should be compared and outlines various comparison factors like functionality, performance, dependability and usability. Ubuntu, Slax and Windows are compared based on these factors, with Linux noted to be better for servers and security/reliability, while Windows is focused more on desktop users and current status. The conclusion is that the nature of the producer can significantly impact requirements.
Linux vs windows
Linux vs windowsramadansanli This presentation compares the two most popular operating systems, Linux and Windows. It provides background on each OS, including their origins, versions, and key differences. The main point is to persuade the class to consider adopting Linux as their primary OS, as it is open source and free, while being more secure than Windows without viruses or malware. In conclusion, for students and schools especially, Linux is recommended as the best OS due to its low cost and customizability.
AN UPDATED REVIEW ON THE CONVENTIONAL AND UNCONVENTIONAL RICH PICTURE BUILD...
AN UPDATED REVIEW ON THE CONVENTIONAL AND UNCONVENTIONAL RICH PICTURE BUILD...American Research Thoughts
Ad
Similar to Stack Data Structure V1.0 (20)
STACK APPLICATIONS: INFOX TO POSTFIX CONVERSION AND EVALUATION OF POSTFIX EXP...
STACK APPLICATIONS: INFOX TO POSTFIX CONVERSION AND EVALUATION OF POSTFIX EXP...devismileyrockz STACK LIFO
Stack
StackMaleeha Khawar Hashmie A stack is a last-in, first-out data structure where elements can only be inserted or removed from one end. Stacks follow the LIFO principle. The document discusses stacks and their use in evaluating arithmetic expressions. Expressions can be written in infix, prefix, or postfix notation, and converting an infix expression to postfix notation allows it to be evaluated using a stack, with operators and operands pushed and popped off the stack from left to right.
Unit 3 stack
Unit 3 stackkalyanineve 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. Common stack operations include push to add an element and pop to remove an element. Stacks have many applications, such as converting infix notation to postfix notation and evaluating postfix expressions.
Stacks.ppt
Stacks.pptOliverKane3 - Templates in C++ allow functions and classes to be reused for different data types through generic programming. This avoids defining multiple functions to handle the same task on different types.
- A template can be viewed as a variable that can be instantiated to any data type. Two functions min() are shown, one for ints and one for doubles, demonstrating the need for templates.
- A template solution defines a single min() function that accepts any type through a template parameter <Type>. This provides a more flexible solution than separate overloaded functions.
Stacks.ppt
Stacks.pptOliverKane3 - Templates in C++ allow functions and classes to be reused for different data types through generic programming. This avoids defining multiple functions to handle the same task on different types.
- A template can be viewed as a variable that can be instantiated for any data type. Two min() functions showed how templates provide a cleaner solution than separate functions.
- A stack is an abstract data type that follows LIFO (last-in, first-out) behavior. Elements are added and removed only from one end, called the top. Common stack operations are push, pop, empty, and top.
Data Structure and Algorithms Stacks
Data Structure and Algorithms StacksManishPrajapati78 The document introduces stacks and their operations. It defines a stack as a last-in, first-out data structure that can only be accessed at one end. The key stack operations are push, which adds an item to the top, and pop, which removes an item from the top. It provides examples of stack representations using arrays and linked lists, and algorithms for implementing push and pop. The document also discusses postfix notation for arithmetic expressions and algorithms for evaluating expressions in postfix notation using a stack.
Stack
StackSwarup Boro The document discusses stacks, which are linear data structures that follow the LIFO (last in, first out) principle. Stacks can be implemented using arrays or linked lists. Elements are inserted and removed only from one end, called the top of the stack. Insertion is called pushing and removal is called popping. Stacks are used extensively in computer systems, for example in operating system function calls and interrupt handling. The Java programming language contains a Stack class that can be used by programmers.
Stack - Data Structure - Notes
Stack - Data Structure - NotesOmprakash Chauhan In computer science, a stack is an abstract data type that serves as a collection of elements, with two main principal operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed.
Data structures 
Data structures Rokonuzzaman Rony The document discusses stacks and their implementation and use. It begins by defining a stack as a collection of items that can be inserted or deleted from one end, following the LIFO principle. Common stack operations like push, pop and top are introduced. Stacks can be implemented using arrays or linked lists. The use of stacks to evaluate expressions in prefix, infix and postfix notations is covered, including the precedence of operators and the process to convert infix to postfix notation using a stack. Parentheses are also discussed in the conversion process.
Data Structures and Agorithm: DS 08 Infix to Postfix.pptx
Data Structures and Agorithm: DS 08 Infix to Postfix.pptxRashidFaridChishti Data Structures and Agorithm: DS 08 Infix to Postfix.pptx
Lec5-Stack-bukc-28022024-112316am (1) .pptx
Lec5-Stack-bukc-28022024-112316am (1) .pptxhaaamin01 An abstract data type (ADT) is a mathematical model for data structures that defines the type solely by the operations that can be performed on it. For example, a stack ADT can be defined by two operations: push, which inserts an item into the stack, and pop, which removes the top item. Abstract data types are theoretical entities used to simplify algorithm descriptions and formally describe programming language type systems. A stack is a linear data structure that follows the last-in, first-out principle, where items can only be inserted or removed from one end of the stack. Stacks have common applications in arithmetic expression evaluation, backtracking, and function call processing.
Data structures stacks
Data structures stacksmaamir farooq Stacks are linear data structures that follow the LIFO (last in, first out) principle. Elements are added and removed from the top of the stack. Stacks have two main operations - Push, which adds an element to the top of the stack, and Pop, which removes an element from the top. Stacks can be implemented using arrays or linked lists. Compilers use stacks to convert infix arithmetic expressions to postfix notation and then evaluate the postfix expression. This process involves pushing and popping operators from the stack.
computer notes - Data Structures - 6
computer notes - Data Structures - 6ecomputernotes The document discusses implementing a stack using a linked list as an alternative to an array. It explains that a linked list avoids size limitations of an array implementation. Elements can be inserted and removed from the start of the list in constant time, making it suitable for a stack. The four basic stack operations - push, pop, top, and isEmpty - can all be performed in constant time on this linked list implementation.
Expression evaluation
Expression evaluationJeeSa Sultana This document discusses different notations for representing mathematical expressions: infix, prefix, and postfix. In infix notation, operators are placed between operands (e.g. A + B). In prefix notation, operators come before operands (e.g. + A B). In postfix notation, operators follow operands (e.g. A B +). It notes that infix notation requires parentheses to determine the order of operations, while prefix and postfix notations do not. The document then provides a step-by-step example of converting an infix expression to postfix notation using a stack.
Stack
StackSwarup Kumar Boro Stacks are commonly used data structures that follow the LIFO (last in, first out) principle. They can be implemented using arrays or linked lists. Operations like push add an element to the top of the stack and pop removes an element from the top. Stacks have many applications in computing including implementing function calls, parsing expressions, and undo operations.
DS1.pptx
DS1.pptxMomin24 This document discusses infix, postfix, and prefix expressions and how to convert between them. It defines infix as having operators between operands, postfix as having operators after operands ordered by precedence, and prefix as having operators before operands ordered by precedence. It provides rules for operator precedence and explains how to convert an infix expression to both postfix and prefix notation with examples. Sample C code is also presented for converting an infix expression to postfix.
13 Stacks and Queues.pptx
13 Stacks and Queues.pptxssuserb7c8b8 This document discusses stacks and queues, which are abstract data types commonly used in programming. It describes their basic principles and operations, as well as implementations using arrays and linked lists. Stacks follow LIFO (last-in, first-out) order, while queues follow FIFO (first-in, first-out) order. The document provides examples of using stacks and queues to evaluate expressions, check parentheses matching, and manage memory and shared resources.
Ad
More from Zidny Nafan (6)
Materi 4 Information System Engineering Sim 1223511116853894 8
Materi 4 Information System Engineering Sim 1223511116853894 8Zidny Nafan The document discusses various aspects of information system development including:
1) Information system analysis focuses on solving business problems independently of the technology used.
2) System owners provide funding while system users directly interact with the system.
3) System design and development involves considering the data, processes, interfaces, and network needs from the perspectives of owners, users, designers and builders.
4) Successful system development requires project management techniques like PERT charts, Gantt charts, and Microsoft Project to plan, track progress, and ensure completion on time and on budget.
Stack Implementation
Stack ImplementationZidny Nafan The document discusses stacks and their implementation in Java using BlueJ. It explains what BlueJ is and how stacks can be implemented using static or dynamic data structures. It then provides code for a Stack class that implements a stack using an array to store objects. Methods like push(), pop(), isEmpty() etc are included. It also provides code for a StackTester class to demonstrate how the Stack class can be used by adding and removing integers. Exercises are included to modify StackTester to use strings instead of integers and to use a stack to check bracket balancing in code.
List Data Structure
List Data StructureZidny Nafan A list is a sequential data structure that allows additions and removals at any position, unlike stacks and queues. Common list operations include adding and removing nodes, updating node contents, checking if the list is empty/full, and initializing/destroying the list. Lists can be implemented using arrays (for static storage) or linked nodes (for dynamic storage). Array lists allow constant-time access but linear-time insertion/removal. Linked lists have linear-time access but constant-time insertion/removal. Both use probes and previous references to traverse the list during operations.
Queue Data Structure
Queue Data StructureZidny Nafan The document discusses queue data structures. A queue is a linear data structure where additions are made at the end/tail and removals are made from the front/head, following a First-In First-Out (FIFO) approach. Common queue operations include add, remove, check if empty, check if full. A queue can be stored using either a static array or dynamic linked nodes. The key aspects are maintaining references to the head and tail of the queue.
Recently uploaded (20)
The Evolution of Meme Coins A New Era for Digital Currency ppt.pdf
The Evolution of Meme Coins A New Era for Digital Currency ppt.pdfAbi john Analyze the growth of meme coins from mere online jokes to potential assets in the digital economy. Explore the community, culture, and utility as they elevate themselves to a new era in cryptocurrency.
Manifest Pre-Seed Update | A Humanoid OEM Deeptech In France
Manifest Pre-Seed Update | A Humanoid OEM Deeptech In Francechb3 The latest updates on Manifest's pre-seed stage progress.
TrsLabs - Fintech Product & Business Consulting
TrsLabs - Fintech Product & Business ConsultingTrs Labs Hybrid Growth Mandate Model with TrsLabs
Strategic Investments, Inorganic Growth, Business Model Pivoting are critical activities that business don't do/change everyday. In cases like this, it may benefit your business to choose a temporary external consultant.
An unbiased plan driven by clearcut deliverables, market dynamics and without the influence of your internal office equations empower business leaders to make right choices.
Getting things done within a budget within a timeframe is key to Growing Business - No matter whether you are a start-up or a big company
Talk to us & Unlock the competitive advantage
GyrusAI - Broadcasting & Streaming Applications Driven by AI and ML
GyrusAI - Broadcasting & Streaming Applications Driven by AI and MLGyrus AI Gyrus AI: AI/ML for Broadcasting & Streaming
Gyrus is a Vision Al company developing Neural Network Accelerators and ready to deploy AI/ML Models for Video Processing and Video Analytics.
Our Solutions:
Intelligent Media Search
Semantic & contextual search for faster, smarter content discovery.
In-Scene Ad Placement
AI-powered ad insertion to maximize monetization and user experience.
Video Anonymization
Automatically masks sensitive content to ensure privacy compliance.
Vision Analytics
Real-time object detection and engagement tracking.
Why Gyrus AI?
We help media companies streamline operations, enhance media discovery, and stay competitive in the rapidly evolving broadcasting & streaming landscape.
🚀 Ready to Transform Your Media Workflow?
🔗 Visit Us: https://gyrus.ai/
📅 Book a Demo: https://gyrus.ai/contact
📝 Read More: https://gyrus.ai/blog/
🔗 Follow Us:
LinkedIn - https://www.linkedin.com/company/gyrusai/
Twitter/X - https://twitter.com/GyrusAI
YouTube - https://www.youtube.com/channel/UCk2GzLj6xp0A6Wqix1GWSkw
Facebook - https://www.facebook.com/GyrusAI
Dev Dives: Automate and orchestrate your processes with UiPath Maestro
Dev Dives: Automate and orchestrate your processes with UiPath MaestroUiPathCommunity This session is designed to equip developers with the skills needed to build mission-critical, end-to-end processes that seamlessly orchestrate agents, people, and robots.
📕 Here's what you can expect:
- Modeling: Build end-to-end processes using BPMN.
- Implementing: Integrate agentic tasks, RPA, APIs, and advanced decisioning into processes.
- Operating: Control process instances with rewind, replay, pause, and stop functions.
- Monitoring: Use dashboards and embedded analytics for real-time insights into process instances.
This webinar is a must-attend for developers looking to enhance their agentic automation skills and orchestrate robust, mission-critical processes.
👨🏫 Speaker:
Andrei Vintila, Principal Product Manager @UiPath
This session streamed live on April 29, 2025, 16:00 CET.
Check out all our upcoming Dev Dives sessions at https://community.uipath.com/dev-dives-automation-developer-2025/.
Build Your Own Copilot & Agents For Devs
Build Your Own Copilot & Agents For DevsBrian McKeiver May 2nd, 2025 talk at StirTrek 2025 Conference.
#StandardsGoals for 2025: Standards & certification roundup - Tech Forum 2025
#StandardsGoals for 2025: Standards & certification roundup - Tech Forum 2025BookNet Canada Book industry standards are evolving rapidly. In the first part of this session, we’ll share an overview of key developments from 2024 and the early months of 2025. Then, BookNet’s resident standards expert, Tom Richardson, and CEO, Lauren Stewart, have a forward-looking conversation about what’s next.
Link to recording, transcript, and accompanying resource: https://bnctechforum.ca/sessions/standardsgoals-for-2025-standards-certification-roundup/
Presented by BookNet Canada on May 6, 2025 with support from the Department of Canadian Heritage.
Canadian book publishing: Insights from the latest salary survey - Tech Forum...
Canadian book publishing: Insights from the latest salary survey - Tech Forum...BookNet Canada Join us for a presentation in partnership with the Association of Canadian Publishers (ACP) as they share results from the recently conducted Canadian Book Publishing Industry Salary Survey. This comprehensive survey provides key insights into average salaries across departments, roles, and demographic metrics. Members of ACP’s Diversity and Inclusion Committee will join us to unpack what the findings mean in the context of justice, equity, diversity, and inclusion in the industry.
Results of the 2024 Canadian Book Publishing Industry Salary Survey: https://publishers.ca/wp-content/uploads/2025/04/ACP_Salary_Survey_FINAL-2.pdf
Link to presentation recording and transcript: https://bnctechforum.ca/sessions/canadian-book-publishing-insights-from-the-latest-salary-survey/
Presented by BookNet Canada and the Association of Canadian Publishers on May 1, 2025 with support from the Department of Canadian Heritage.
Webinar - Top 5 Backup Mistakes MSPs and Businesses Make .pptx
Webinar - Top 5 Backup Mistakes MSPs and Businesses Make .pptxMSP360 Data loss can be devastating — especially when you discover it while trying to recover. All too often, it happens due to mistakes in your backup strategy. Whether you work for an MSP or within an organization, your company is susceptible to common backup mistakes that leave data vulnerable, productivity in question, and compliance at risk.
Join 4-time Microsoft MVP Nick Cavalancia as he breaks down the top five backup mistakes businesses and MSPs make—and, more importantly, explains how to prevent them.
5kW Solar System in India – Cost, Benefits & Subsidy 2025
5kW Solar System in India – Cost, Benefits & Subsidy 2025Ksquare Energy Pvt. Ltd. With the cost of electricity increasing and ecological concerns becoming increasingly difficult to dismiss, numerous Indian homes and businesses are looking for improved means of meeting their energy requirements. That's where solar enters the picture not as a substitute, but as a trustworthy, long-term option. Among all the alternatives today, the 5kW solar system is a balanced option. It's strong enough for the majority of homes and small business installations, but small and inexpensive enough to bring about solar adoption at ease and efficiency.
Explore the complete guide to 5kW solar system installation in India. Learn about cost, daily output, subsidy in 2025, benefits for homes & businesses, and how to apply in Gujarat.
TrsLabs - Leverage the Power of UPI Payments
TrsLabs - Leverage the Power of UPI PaymentsTrs Labs Revolutionize your Fintech growth with UPI Payments
"Riding the UPI strategy" refers to leveraging the Unified Payments Interface (UPI) to drive digital payments in India and beyond. This involves understanding UPI's features, benefits, and potential, and developing strategies to maximize its usage and impact. Essentially, it's about strategically utilizing UPI to promote digital payments, financial inclusion, and economic growth.
AI and Data Privacy in 2025: Global Trends
AI and Data Privacy in 2025: Global TrendsInData Labs In this infographic, we explore how businesses can implement effective governance frameworks to address AI data privacy. Understanding it is crucial for developing effective strategies that ensure compliance, safeguard customer trust, and leverage AI responsibly. Equip yourself with insights that can drive informed decision-making and position your organization for success in the future of data privacy.
This infographic contains:
-AI and data privacy: Key findings
-Statistics on AI data privacy in the today’s world
-Tips on how to overcome data privacy challenges
-Benefits of AI data security investments.
Keep up-to-date on how AI is reshaping privacy standards and what this entails for both individuals and organizations.
HCL Nomad Web – Best Practices und Verwaltung von Multiuser-Umgebungen
HCL Nomad Web – Best Practices und Verwaltung von Multiuser-Umgebungenpanagenda Webinar Recording: https://www.panagenda.com/webinars/hcl-nomad-web-best-practices-und-verwaltung-von-multiuser-umgebungen/
HCL Nomad Web wird als die nächste Generation des HCL Notes-Clients gefeiert und bietet zahlreiche Vorteile, wie die Beseitigung des Bedarfs an Paketierung, Verteilung und Installation. Nomad Web-Client-Updates werden “automatisch” im Hintergrund installiert, was den administrativen Aufwand im Vergleich zu traditionellen HCL Notes-Clients erheblich reduziert. Allerdings stellt die Fehlerbehebung in Nomad Web im Vergleich zum Notes-Client einzigartige Herausforderungen dar.
Begleiten Sie Christoph und Marc, während sie demonstrieren, wie der Fehlerbehebungsprozess in HCL Nomad Web vereinfacht werden kann, um eine reibungslose und effiziente Benutzererfahrung zu gewährleisten.
In diesem Webinar werden wir effektive Strategien zur Diagnose und Lösung häufiger Probleme in HCL Nomad Web untersuchen, einschließlich
- Zugriff auf die Konsole
- Auffinden und Interpretieren von Protokolldateien
- Zugriff auf den Datenordner im Cache des Browsers (unter Verwendung von OPFS)
- Verständnis der Unterschiede zwischen Einzel- und Mehrbenutzerszenarien
- Nutzung der Client Clocking-Funktion
How analogue intelligence complements AI
How analogue intelligence complements AIPaul Rowe
Artificial Intelligence is providing benefits in many areas of work within the heritage sector, from image analysis, to ideas generation, and new research tools. However, it is more critical than ever for people, with analogue intelligence, to ensure the integrity and ethical use of AI. Including real people can improve the use of AI by identifying potential biases, cross-checking results, refining workflows, and providing contextual relevance to AI-driven results.
News about the impact of AI often paints a rosy picture. In practice, there are many potential pitfalls. This presentation discusses these issues and looks at the role of analogue intelligence and analogue interfaces in providing the best results to our audiences. How do we deal with factually incorrect results? How do we get content generated that better reflects the diversity of our communities? What roles are there for physical, in-person experiences in the digital world?
Role of Data Annotation Services in AI-Powered Manufacturing
Role of Data Annotation Services in AI-Powered ManufacturingAndrew Leo From predictive maintenance to robotic automation, AI is driving the future of manufacturing. But without high-quality annotated data, even the smartest models fall short.
Discover how data annotation services are powering accuracy, safety, and efficiency in AI-driven manufacturing systems.
Precision in data labeling = Precision on the production floor.
Hybridize Functions: A Tool for Automatically Refactoring Imperative Deep Lea...
Hybridize Functions: A Tool for Automatically Refactoring Imperative Deep Lea...Raffi Khatchadourian Efficiency is essential to support responsiveness w.r.t. ever-growing datasets, especially for Deep Learning (DL) systems. DL frameworks have traditionally embraced deferred execution-style DL code—supporting symbolic, graph-based Deep Neural Network (DNN) computation. While scalable, such development is error-prone, non-intuitive, and difficult to debug. Consequently, more natural, imperative DL frameworks encouraging eager execution have emerged but at the expense of run-time performance. Though hybrid approaches aim for the “best of both worlds,” using them effectively requires subtle considerations to make code amenable to safe, accurate, and efficient graph execution—avoiding performance bottlenecks and semantically inequivalent results. We discuss the engineering aspects of a refactoring tool that automatically determines when it is safe and potentially advantageous to migrate imperative DL code to graph execution and vice-versa.
Hybridize Functions: A Tool for Automatically Refactoring Imperative Deep Lea...
Hybridize Functions: A Tool for Automatically Refactoring Imperative Deep Lea...Raffi Khatchadourian
Stack Data Structure V1.0
- 1. Stack Data Structure By : Imam M Shofi
- 2. What is stack? A stack is a limited version of an array. New elements, or nodes as they are often called, can be added to a stack and removed from a stack only from one end. Access system a stack is referred to as a LIFO structure (Last-In First-Out) Some illustrations: stack of satay stack of CDs
- 3. Stacks operations Push : adds a new node Push(X,S) add the value X to the TOP of stack Pop : removes a node Pop(S) removes the TOP node and returns its value IsEmpty : reports whether the stack is empty IsEmpty(S) report whether the stack S is empty IsFull : reports whether the stack is full IsFull(S) report whether the stack S is full Initialize : creates/initializes the stack Initialize(S) create a new empty stack named S Destroy : deletes the contents of the stack (may be implemented by re-initializing the stack) Destroy(S) deletes the contents of the stack S
- 4. Illustration/example Operation Stack’s contents TOP value 1. Initialiaze(S) <empty> 0 2. Push(‘a’,S) a 1 3. Push(‘b’,S) a b 2 4. Push(‘c’,S) a b c 3 5. Pop(S) a b 2 6. Push(‘d’,S) a b d 3 7. Push(‘e’,S) a b d e 4 8. Pop(S) a b d 3 9. Pop(S) a b 2 10. Pop(S) a 1
- 5. Exercise What would the state of the stack be after the following operations: create stack push A onto stack push F onto stack pop item from stack push B onto stack pop item from stack pop item from stack Show the state of the stack and the value of each variable after execution of each of the following statements: A = 5 B = 3 C = 7 (a) create stack push A onto stack push C*C onto stack pop item from stack and store in B push B+A onto stack pop item from stack and store in A pop item from stack and store in B (b) create stack push B onto stack push C onto stack push A onto stack A=B*C push A+C onto stack pop item from stack and store in A pop item from stack and store in B pop item from stack and store in C
- 6. Converting between notations INFIX to PREFIX : (A+B) – (C*D) Do the first brace: (A+B), the PREFIX is +AB Do the second brace: (C*D), the PREFIX is *CD The end is operator -: +AB - *CD , the PREFIX is -+AB*CD INFIX to POSTFIX : (A+B) – (C*D) Do the first brace: (A+B), the POSTFIX is AB+ Do the second brace: (C*D), the POSTFIX is CD* The end is operator -: AB+ - CD* , the PREFIX is AB+CD*- PREFIX to INFIX : +/*A B C D Find the first operator: *, take 2 operands before the operator ( A and B ), the INFIX is (A*B) Find the second operator: /, take 2 operands before the operator ( A*B and C ), the INFIX is ((A*B)/C) Find the third operator: +, take 2 operands before the operator ( ((A*B)/C) and D ), the INFIX is ((A*B)/C)+D
- 7. Converting between notations(2) PREFIX to POSTFIX : +/*A B C D Find the first operator: *, take 2 operands before the operator ( A and B ), the POSTFIX is AB* Find the second operator: /, take 2 operands before the operator ( AB* and C ), the POSTFIX is AB*C/ Find the third operator: +, take 2 operands before the operator ( AB*C/ and D ), the POSTFIX is AB*C/D+ POSTFIX to INFIX : ABCD*/- Find the first operator: *, take 2 operands before the operator ( C and D ), the INFIX is (C*D) Find the second operator: /, take 2 operands before the operator ( (C*D) and B ), the INFIX is (B/(C*D) Find the third operator: -, take 2 operands before the operator ( (B/(C*D) and A ), the INFIX is A – (B/(C*D) POSTFIX to PREFIX : ABCD*/- Find the first operator: *, take 2 operands before the operator ( C and D ), the PREFIX is *CD Find the second operator: /, take 2 operands before the operator ( *CD and B ), the PREFIX is /B*CD Find the third operator: -, take 2 operands before the operator ( /B*CD and A ), the PREFIX is -A /B*CD
- 8. Exercise: Converting Convert these INFIX to PREFIX and POSTFIX : A / B – C / D (A + B) ^ 3 – C * D A ^ (B + C) Convert these PREFIX to INFIX and POSTFIX : + – / A B C ^ D E – + D E / X Y ^ + 2 3 – C D Convert these POSTFIX to INFIX and PREFIX : A B C + – G H + I J / * A B ^ C D + –