STACKS IN DATASTRUCTURE

Nov 21, 2014Download as PPTX, PDF111 likes108,089 views

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.

STACK
SUBMITTED BY:
Archie Jamwal
SUBMITTED TO:
Mrs. Ruchi Gupta

DATA
STRUCTURE
LINEAR DATA
STRUCTURE
NON LINEAR
DATA
STRUCTURE
ARRAY QUEUE STACK

What is Linear Data Structure
In linear data structure, data is arranged
in linear sequence.
 Data items can be traversed in a single
run.
 In linear data structure elements are
accessed or placed in contiguous(together
in sequence) memory location.

WHAT Is
 A stack is called a last-in-first-out (LIFO)
collection. This means that the last thing
we added (pushed) is the first thing that
gets pulled (popped) off.
 A stack is a sequence of items that are
accessible at only one end of the sequence.

Operations that can be performed
on STACK:
 PUSH.
 POP.

PUSH : It is used to insert items into the stack.
POP: It is used to delete items from stack.
TOP: It represents the current location of data
in stack.

ALGORITHM OF INSERTION IN
STACK: (PUSH)
1. Insertion(a,top,item,max)
2. If top=max then
print ‘STACK OVERFLOW’
exit
else
3. top=top+1
end if
4. a[top]=item
5. Exit

ALGORITHM OF DELETION IN
STACK: (POP)
1. Deletion(a,top,item)
2. If top=0 then
print ‘STACK UNDERFLOW’
exit
else
3. item=a[top]
end if
4. top=top-1
5. Exit

ALGORITHM OF DISPLAY IN
STACK:
1.Display(top,i,a[i])
2.If top=0 then
Print ‘STACK EMPTY’
Exit
Else
3.For i=top to 0
Print a[i]
End for
4.exit

APPLICATIONS OF STACKS ARE:
I. Reversing Strings:
• A simple application of stack is reversing strings.
To reverse a string , the characters of string are
pushed onto the stack one by one as the string
is read from left to right.
• Once all the characters
of string are pushed onto stack, they are
popped one by one. Since the character last
pushed in comes out first, subsequent pop
operation results in the reversal of the string.

For example:
To reverse the string ‘REVERSE’ the string is
read from left to right and its characters are
pushed . LIKE:
onto a stack.

II. Checking the validity of an expression
containing nested parenthesis:
• Stacks are also used to check whether a given
arithmetic expressions containing nested
parenthesis is properly parenthesized.
• The program for checking the validity of an
expression verifies that for each left parenthesis
braces or bracket ,there is a corresponding
closing symbol and symbols are appropriately
nested.

For example:
VALID INPUTS INVALID INPUTS
{ }
{ ( }
( { [ ] } )
( [ ( ( ) ] )
{ [ ] ( ) }
{ } [ ] )
[ { ( { } [ ] ( {
[ { ) } ( ] } ]
})}]

III. Evaluating arithmetic expressions:
INFIX notation:
The general way of writing arithmetic
expressions is known as infix notation.
e.g, (a+b)
PREFIX notation:
e.g, +AB
POSTFIX notation:
e.g: AB+

Conversion of INFIX to POSTFIX conversion:
Example: 2+(4-1)*3 step1
2+41-*3 step2
2+41-3* step3
241-3*+ step4

CURRENT
SYMBOL
ACTION
PERFORMED
STACK STATUS POSTFIX
EXPRESSION
( PUSH C C 2
2 2
+ PUSH + (+ 2
( PUSH ( (+( 24
4 24
- PUSH - (+(- 241
1 POP 241-
) (+ 241-
* PUSH * (+* 241-
3 241-3
POP * 241-3*
POP + 241-3*+
)
CONVERSION OF INFIX INTO POSTFIX
2+(4-1)*3 into 241-3*+

The document provides an introduction to data structures. It defines data structures as representations of logical relationships between data elements that consider both the elements and their relationships. It classifies data structures as either primitive or non-primitive. Primitive structures are directly operated on by machine instructions while non-primitive structures are built from primitive ones. Common non-primitive structures include stacks, queues, linked lists, trees and graphs. The document then discusses arrays as a data structure and operations on arrays like traversal, insertion, deletion, searching and sorting.

Queue pptSouravKumar328

The document discusses different types of queues, including simple, circular, priority, and double-ended queues. It describes the basic queue operations of enqueue and dequeue, where new elements are added to the rear of the queue and existing elements are removed from the front. Circular queues are more memory efficient than linear queues by connecting the last queue element back to the first, forming a circle. Priority queues remove elements based on priority rather than order of insertion. Double-ended queues allow insertion and removal from both ends. Common applications of queues include CPU and disk scheduling, synchronization between asynchronous processes, and call center phone systems.

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.

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.

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.

stack presentationShivalik college of engineering

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.

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.

Infix to postfix conversionThen Murugeshwari

The document discusses converting expressions from infix to postfix notation. In infix notation, operators are between operands. In postfix notation, operators follow operands. The algorithm scans the infix expression left to right, appending operands to the output and handling operators and parentheses by pushing/popping from a stack based on precedence. An example converts the infix expression A * (B + C) - D / E to postfix AB+C*+DE/-.

queue & its applicationssomendra kumar

The document discusses different types of queues including their representations, operations, and applications. It describes queues as linear data structures that follow a first-in, first-out principle. Common queue operations are insertion at the rear and deletion at the front. Queues can be represented using arrays or linked lists. Circular queues and priority queues are also described as variants that address limitations of standard queues. Real-world and technical applications of queues include CPU scheduling, cashier lines, and data transfer between processes.

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.

B and B+ treeAshish Arun

linked list in data structure shameen khan

This document discusses data structures and linked lists. It provides definitions and examples of different types of linked lists, including: - Single linked lists, which contain nodes with a data field and a link to the next node. - Circular linked lists, where the last node links back to the first node, forming a loop. - Doubly linked lists, where each node contains links to both the previous and next nodes. - Operations on linked lists such as insertion, deletion, traversal, and searching are also described.

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.

Queue data structureanooppjoseph

BINARY TREE REPRESENTATION.pptSeethaDinesh

Binary trees are a non-linear data structure where each node has at most two children, used to represent hierarchical relationships, with nodes connected through parent-child links and traversed through preorder, inorder, and postorder methods; they can be represented through arrays or linked lists and support common operations like search, insert, and delete through comparing node values and restructuring child pointers.

single linked listSathasivam Rangasamy

This document discusses the implementation of a single linked list data structure. It describes the nodes that make up a linked list, which have an info field to store data and a next field pointing to the next node. The document outlines different ways to represent linked lists, including static arrays and dynamic pointers. It also provides algorithms for common linked list operations like traversing, inserting, and deleting nodes from the beginning, end, or a specified position within the list.

Abstract data typesPoojith Chowdhary

This document discusses data abstraction and abstract data types (ADTs). It defines an ADT as a collection of data along with a set of operations on that data. An ADT specifies what operations can be performed but not how they are implemented. This allows data structures to be developed independently from solutions and hides implementation details behind the ADT's operations. The document provides examples of list ADTs and an array-based implementation of a list ADT in C++.

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.

Stacksrihariyenduri

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 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.

ArraysSARITHA REDDY

The document discusses arrays in data structures using C programming language. It defines what an array is and describes different types of arrays like one-dimensional, two-dimensional, and multi-dimensional arrays. It also explains array operations such as insertion, deletion, traversal, reversing, sorting, and searching. Additionally, it covers merging of arrays, arrays of pointers, and using arrays to represent polynomials.

Data types in pythonRaginiJain21

The document discusses Python data types. It describes the numeric data types integer, float, and complex which are used to represent numbers. Integer is a whole number without decimals, float has decimals, and complex numbers have real and imaginary parts. None is described as a null value. Strings are arrays of characters and can be indexed. Tuples and lists are ordered collections that can hold heterogeneous data types. Sets are unordered collections of unique items. Dictionaries are unordered collections of key-value pairs that allow accessing values via keys.

Queue in Data Structure Janki Shah

Doubly Linked List || Operations || AlgorithmsShubham Sharma

Presentation on queueRojan Pariyar

List in PythonSiddique Ibrahim

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.

Stack_Data_Structure.pptxsandeep54552

This document discusses stacks as a linear data structure that follows the LIFO (Last-In First-Out) principle. Key points include: - Stacks allow insertion and deletion from one end only (the top) through PUSH and POP operations. - Common applications of stacks include reversing strings, checking validity of expressions with nested parentheses, and converting infix notation to postfix notation for arithmetic expressions. - The document provides examples and algorithms for common stack operations like insertion, deletion, and display.

More Related Content

What's hot (20)

Infix to postfix conversionThen Murugeshwari

queue & its applicationssomendra kumar

Data Structure (Queue)Adam Mukharil Bachtiar

B and B+ treeAshish Arun

linked list in data structure shameen khan

Linked listakshat360

Queue data structureanooppjoseph

BINARY TREE REPRESENTATION.pptSeethaDinesh

single linked listSathasivam Rangasamy

Abstract data typesPoojith Chowdhary

StackZaid Shabbir

Stacksrihariyenduri

Data structure by DigvijayDigvijay Singh Karakoti

Stacks in c++Vineeta Garg

ArraysSARITHA REDDY

Data types in pythonRaginiJain21

Queue in Data Structure Janki Shah

Doubly Linked List || Operations || AlgorithmsShubham Sharma

Presentation on queueRojan Pariyar

List in PythonSiddique Ibrahim

Infix to postfix conversionThen Murugeshwari

queue & its applicationssomendra kumar

Data Structure (Queue)Adam Mukharil Bachtiar

B and B+ treeAshish Arun

linked list in data structure shameen khan

Linked listakshat360

Queue data structureanooppjoseph

BINARY TREE REPRESENTATION.pptSeethaDinesh

single linked listSathasivam Rangasamy

Abstract data typesPoojith Chowdhary

StackZaid Shabbir

Stacksrihariyenduri

Data structure by DigvijayDigvijay Singh Karakoti

Stacks in c++Vineeta Garg

ArraysSARITHA REDDY

Data types in pythonRaginiJain21

Queue in Data Structure Janki Shah

Doubly Linked List || Operations || AlgorithmsShubham Sharma

Presentation on queueRojan Pariyar

List in PythonSiddique Ibrahim

Similar to STACKS IN DATASTRUCTURE (20)

STACK AND ITS OPERATIONS IN DATA STRUCTURES.pptxKALPANAC20

Stack_Data_Structure.pptxsandeep54552

Stack_Overview_Implementation_WithVode.pptxchandankumar364348

The document discusses the stack data structure. A stack is a collection of elements that follow the LIFO (last-in, first-out) principle. Elements can be inserted and removed from the top of the stack only. Stacks have common applications like undo functions in text editors and web browser history. Formally, a stack is an abstract data type that supports push, pop, top, is_empty and length operations. The document provides examples and explanations of stack operations and applications like infix to postfix conversion, expression evaluation, balancing symbols, function calls and reversing a string.

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.

DS-UNIT 3 FINAL.pptxprakashvs7

The document discusses stacks and queues as data structures. It defines a stack as a linear data structure that follows the LIFO principle with insertion and deletion occurring at one end. Key stack operations are described as push, pop, peek, isEmpty and isFull. Queue is defined as a linear structure that follows the FIFO principle with insertion at the rear and deletion at the front. Common queue operations are enqueue, dequeue, peek, isEmpty and isFull. Array and linked list implementations of stacks and queues are also covered.

Stacks Data structure.pptxline24arts

This document discusses stacks and their use as a data structure. It begins by defining what a stack is, namely a data structure that follows the last-in, first-out (LIFO) principle. Common stack operations like push, pop, and peek are introduced. Examples are given of how stacks are used in applications like undo mechanisms, expression evaluation, and validating parentheses in expressions. The key operations and algorithms for implementing a stack are described, including pseudocode for push, pop, and display functions. Finally, examples are provided of how stacks can be used to reverse strings, validate parentheses, and convert infix expressions to postfix form.

stack-Intro.pptxDEEPAK948083

The document discusses stacks and their applications. It defines a stack as a Last In First Out (LIFO) data structure. Key stack operations are described such as push, pop, and peek. An array implementation of a stack is presented and applications like checking balanced brackets, converting infix to postfix notation, and postfix calculators are covered. Example code and diagrams are provided to illustrate stack concepts and operations.

Data Structures And Algorithms(stacks queues)lahariit406

Stack,queue and linked list data structure.pptxyukti266975

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.

Data Structures: Stacks (Part 1)Ramachandra Adiga G

The document describes stacks and queues. Stacks are linear lists that only allow insertions and deletions at one end, following the LIFO principle. Queues are linear lists that only allow insertions at one end and deletions at the other, following the FIFO principle. Common applications of stacks include expression evaluation and recursion, while queues are often used for task scheduling and message buffering.

Unit 3 stackDabbal Singh Mahara

Stack ppt file of Stack DSA For lab in the lab of DSA lecture and Lab.pptaamirali1061a

Stack data structures with definition and codebansidharj11

stack-111104232459-phpapp02.pdfKalpana Mohan

This document discusses stacks as a data structure. It defines a stack as a Last In First Out (LIFO) structure where newly added items are placed on top. The core stack operations of push, pop, and peek are described. An array implementation of a stack is presented, along with applications like checking for balanced braces, converting infix to postfix notation, and a postfix calculator. Pseudocode provides an algorithm for infix to postfix conversion using a stack.

Stackssweta dargad

6 - STACKS in Data Structure and Algorithm.pptxRahulRaj493025

Stack - Data Structure - NotesOmprakash Chauhan

week 7,8,10,11 alll files included from .pptLidetAdmassu

Stack and its operations, Queue and its operationspoongothai11

STACK AND ITS OPERATIONS IN DATA STRUCTURES.pptxKALPANAC20

Stack_Data_Structure.pptxsandeep54552

Stack_Overview_Implementation_WithVode.pptxchandankumar364348

Data structure lab manualnikshaikh786

DS-UNIT 3 FINAL.pptxprakashvs7

Stacks Data structure.pptxline24arts

stack-Intro.pptxDEEPAK948083

Data Structures And Algorithms(stacks queues)lahariit406

Stack,queue and linked list data structure.pptxyukti266975

StacksSadaf Ismail

Data Structures: Stacks (Part 1)Ramachandra Adiga G

Unit 3 stackDabbal Singh Mahara

Stack ppt file of Stack DSA For lab in the lab of DSA lecture and Lab.pptaamirali1061a

Stack data structures with definition and codebansidharj11

stack-111104232459-phpapp02.pdfKalpana Mohan

Stackssweta dargad

6 - STACKS in Data Structure and Algorithm.pptxRahulRaj493025

Stack - Data Structure - NotesOmprakash Chauhan

week 7,8,10,11 alll files included from .pptLidetAdmassu

Stack and its operations, Queue and its operationspoongothai11

Recently uploaded (20)

Michelle Rumley & Mairéad Mooney, Boole Library, University College Cork. Tra...Library Association of Ireland

Presentation on Tourism Product Development By Md Shaifullar RabbiMd Shaifullar Rabbi

YSPH VMOC Special Report - Measles Outbreak Southwest US 5-3-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 817 from Texas, New Mexico, Oklahoma, and Kansas. 97 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. CURRENT CASE COUNT: 817 (As of 05/3/2025) • Texas: 688 (+20)(62% of these cases are in Gaines County). • New Mexico: 67 (+1 )(92.4% of the cases are from Eddy County) • Oklahoma: 16 (+1) • Kansas: 46 (32% of the cases are from Gray County) HOSPITALIZATIONS: 97 (+2) • Texas: 89 (+2) - This is 13.02% of all TX cases. • New Mexico: 7 - This is 10.6% of all NM cases. • Kansas: 1 - This is 2.7% of all KS cases. DEATHS: 3 • Texas: 2 – This is 0.31% of all cases • New Mexico: 1 – This is 1.54% of all cases US NATIONAL CASE COUNT: 967 (Confirmed and suspected): INTERNATIONAL SPREAD (As of 4/2/2025) • Mexico – 865 (+58) ‒Chihuahua, Mexico: 844 (+58) cases, 3 hospitalizations, 1 fatality • Canada: 1531 (+270) (This reflects Ontario's Outbreak, which began 11/24) ‒Ontario, Canada – 1243 (+223) cases, 84 hospitalizations. • Europe: 6,814

Operations Management (Dr. Abdulfatah Salem).pdfArab Academy for Science, Technology and Maritime Transport

LDMMIA Reiki Master Spring 2025 Mini UpdatesLDM Mia eStudios

Handling Multiple Choice Responses: Fortune Effiong.pptxAuthorAIDNationalRes

Ultimate VMware 2V0-11.25 Exam Dumps for Exam SuccessMark Soia

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

UNIT 3 NATIONAL HEALTH PROGRAMMEE. SOCIAL AND PREVENTIVE PHARMACYDR.PRISCILLA MARY J

How to Subscribe Newsletter From Odoo 18 WebsiteCeline George

To study the nervous system of insect.pptxArshad Shaikh

The *nervous system of insects* is a complex network of nerve cells (neurons) and supporting cells that process and transmit information. Here's an overview: Structure 1. *Brain*: The insect brain is a complex structure that processes sensory information, controls behavior, and integrates information. 2. *Ventral nerve cord*: A chain of ganglia (nerve clusters) that runs along the insect's body, controlling movement and sensory processing. 3. *Peripheral nervous system*: Nerves that connect the central nervous system to sensory organs and muscles. Functions 1. *Sensory processing*: Insects can detect and respond to various stimuli, such as light, sound, touch, taste, and smell. 2. *Motor control*: The nervous system controls movement, including walking, flying, and feeding. 3. *Behavioral responThe *nervous system of insects* is a complex network of nerve cells (neurons) and supporting cells that process and transmit information. Here's an overview: Structure 1. *Brain*: The insect brain is a complex structure that processes sensory information, controls behavior, and integrates information. 2. *Ventral nerve cord*: A chain of ganglia (nerve clusters) that runs along the insect's body, controlling movement and sensory processing. 3. *Peripheral nervous system*: Nerves that connect the central nervous system to sensory organs and muscles. Functions 1. *Sensory processing*: Insects can detect and respond to various stimuli, such as light, sound, touch, taste, and smell. 2. *Motor control*: The nervous system controls movement, including walking, flying, and feeding. 3. *Behavioral responses*: Insects can exhibit complex behaviors, such as mating, foraging, and social interactions. Characteristics 1. *Decentralized*: Insect nervous systems have some autonomy in different body parts. 2. *Specialized*: Different parts of the nervous system are specialized for specific functions. 3. *Efficient*: Insect nervous systems are highly efficient, allowing for rapid processing and response to stimuli. The insect nervous system is a remarkable example of evolutionary adaptation, enabling insects to thrive in diverse environments. The insect nervous system is a remarkable example of evolutionary adaptation, enabling insects to thrive

2541William_McCollough_DigitalDetox.docxcontactwilliamm2546

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.

Phoenix – A Collaborative Renewal of Children’s and Young People’s Services C...Library Association of Ireland

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.

SPRING FESTIVITIES - UK AND USA -Colégio Santa Teresinha

How to Set warnings for invoicing specific customers in odooCeline George

SCI BIZ TECH QUIZ (OPEN) PRELIMS XTASY 2025.pptxRonisha Das

Unit 6_Introduction_Phishing_Password Cracking.pdfKanchanPatil34

CBSE - Grade 8 - Science - Chemistry - Metals and Non Metals - WorksheetSritoma Majumder

Introduction All the materials around us are made up of elements. These elements can be broadly divided into two major groups: Metals Non-Metals Each group has its own unique physical and chemical properties. Let's understand them one by one. Physical Properties 1. Appearance Metals: Shiny (lustrous). Example: gold, silver, copper. Non-metals: Dull appearance (except iodine, which is shiny). 2. Hardness Metals: Generally hard. Example: iron. Non-metals: Usually soft (except diamond, a form of carbon, which is very hard). 3. State Metals: Mostly solids at room temperature (except mercury, which is a liquid). Non-metals: Can be solids, liquids, or gases. Example: oxygen (gas), bromine (liquid), sulphur (solid). 4. Malleability Metals: Can be hammered into thin sheets (malleable). Non-metals: Not malleable. They break when hammered (brittle). 5. Ductility Metals: Can be drawn into wires (ductile). Non-metals: Not ductile. 6. Conductivity Metals: Good conductors of heat and electricity. Non-metals: Poor conductors (except graphite, which is a good conductor). 7. Sonorous Nature Metals: Produce a ringing sound when struck. Non-metals: Do not produce sound. Chemical Properties 1. Reaction with Oxygen Metals react with oxygen to form metal oxides. These metal oxides are usually basic. Non-metals react with oxygen to form non-metallic oxides. These oxides are usually acidic. 2. Reaction with Water Metals: Some react vigorously (e.g., sodium). Some react slowly (e.g., iron). Some do not react at all (e.g., gold, silver). Non-metals: Generally do not react with water. 3. Reaction with Acids Metals react with acids to produce salt and hydrogen gas. Non-metals: Do not react with acids. 4. Reaction with Bases Some non-metals react with bases to form salts, but this is rare. Metals generally do not react with bases directly (except amphoteric metals like aluminum and zinc). Displacement Reaction More reactive metals can displace less reactive metals from their salt solutions. Uses of Metals Iron: Making machines, tools, and buildings. Aluminum: Used in aircraft, utensils. Copper: Electrical wires. Gold and Silver: Jewelry. Zinc: Coating iron to prevent rusting (galvanization). Uses of Non-Metals Oxygen: Breathing. Nitrogen: Fertilizers. Chlorine: Water purification. Carbon: Fuel (coal), steel-making (coke). Iodine: Medicines. Alloys An alloy is a mixture of metals or a metal with a non-metal. Alloys have improved properties like strength, resistance to rusting.

Michelle Rumley & Mairéad Mooney, Boole Library, University College Cork. Tra...Library Association of Ireland

Presentation on Tourism Product Development By Md Shaifullar RabbiMd Shaifullar Rabbi

YSPH VMOC Special Report - Measles Outbreak Southwest US 5-3-2025.pptxYale School of Public Health - The Virtual Medical Operations Center (VMOC)

Operations Management (Dr. Abdulfatah Salem).pdfArab Academy for Science, Technology and Maritime Transport

LDMMIA Reiki Master Spring 2025 Mini UpdatesLDM Mia eStudios

Handling Multiple Choice Responses: Fortune Effiong.pptxAuthorAIDNationalRes

Ultimate VMware 2V0-11.25 Exam Dumps for Exam SuccessMark Soia

Exploring-Substances-Acidic-Basic-and-Neutral.pdfSandeep Swamy

UNIT 3 NATIONAL HEALTH PROGRAMMEE. SOCIAL AND PREVENTIVE PHARMACYDR.PRISCILLA MARY J

How to Subscribe Newsletter From Odoo 18 WebsiteCeline George

To study the nervous system of insect.pptxArshad Shaikh

2541William_McCollough_DigitalDetox.docxcontactwilliamm2546

Biophysics Chapter 3 Methods of Studying Macromolecules.pdfPKLI-Institute of Nursing and Allied Health Sciences Lahore , Pakistan.

Phoenix – A Collaborative Renewal of Children’s and Young People’s Services C...Library Association of Ireland

The ever evoilving world of science /7th class science curiosity /samyans aca...Sandeep Swamy

SPRING FESTIVITIES - UK AND USA -Colégio Santa Teresinha

How to Set warnings for invoicing specific customers in odooCeline George

SCI BIZ TECH QUIZ (OPEN) PRELIMS XTASY 2025.pptxRonisha Das

Unit 6_Introduction_Phishing_Password Cracking.pdfKanchanPatil34

CBSE - Grade 8 - Science - Chemistry - Metals and Non Metals - WorksheetSritoma Majumder

STACKS IN DATASTRUCTURE

1. STACK SUBMITTED BY: Archie Jamwal SUBMITTED TO: Mrs. Ruchi Gupta

2. DATA STRUCTURE LINEAR DATA STRUCTURE NON LINEAR DATA STRUCTURE ARRAY QUEUE STACK

3. What is Linear Data Structure In linear data structure, data is arranged in linear sequence.  Data items can be traversed in a single run.  In linear data structure elements are accessed or placed in contiguous(together in sequence) memory location.

4. WHAT Is  A stack is called a last-in-first-out (LIFO) collection. This means that the last thing we added (pushed) is the first thing that gets pulled (popped) off.  A stack is a sequence of items that are accessible at only one end of the sequence.

5. EXAMPLES OF STACK:

6. Operations that can be performed on STACK:  PUSH.  POP.

7. PUSH : It is used to insert items into the stack. POP: It is used to delete items from stack. TOP: It represents the current location of data in stack.

8. ALGORITHM OF INSERTION IN STACK: (PUSH) 1. Insertion(a,top,item,max) 2. If top=max then print ‘STACK OVERFLOW’ exit else 3. top=top+1 end if 4. a[top]=item 5. Exit

9. ALGORITHM OF DELETION IN STACK: (POP) 1. Deletion(a,top,item) 2. If top=0 then print ‘STACK UNDERFLOW’ exit else 3. item=a[top] end if 4. top=top-1 5. Exit

10. ALGORITHM OF DISPLAY IN STACK: 1.Display(top,i,a[i]) 2.If top=0 then Print ‘STACK EMPTY’ Exit Else 3.For i=top to 0 Print a[i] End for 4.exit

11. APPLICATIONS OF STACKS ARE: I. Reversing Strings: • A simple application of stack is reversing strings. To reverse a string , the characters of string are pushed onto the stack one by one as the string is read from left to right. • Once all the characters of string are pushed onto stack, they are popped one by one. Since the character last pushed in comes out first, subsequent pop operation results in the reversal of the string.

12. For example: To reverse the string ‘REVERSE’ the string is read from left to right and its characters are pushed . LIKE: onto a stack.

13. II. Checking the validity of an expression containing nested parenthesis: • Stacks are also used to check whether a given arithmetic expressions containing nested parenthesis is properly parenthesized. • The program for checking the validity of an expression verifies that for each left parenthesis braces or bracket ,there is a corresponding closing symbol and symbols are appropriately nested.

14. For example: VALID INPUTS INVALID INPUTS { } { ( } ( { [ ] } ) ( [ ( ( ) ] ) { [ ] ( ) } { } [ ] ) [ { ( { } [ ] ( { [ { ) } ( ] } ] })}]

15. III. Evaluating arithmetic expressions: INFIX notation: The general way of writing arithmetic expressions is known as infix notation. e.g, (a+b) PREFIX notation: e.g, +AB POSTFIX notation: e.g: AB+

16. Conversion of INFIX to POSTFIX conversion: Example: 2+(4-1)*3 step1 2+41-*3 step2 2+41-3* step3 241-3*+ step4

17. CURRENT SYMBOL ACTION PERFORMED STACK STATUS POSTFIX EXPRESSION ( PUSH C C 2 2 2 + PUSH + (+ 2 ( PUSH ( (+( 24 4 24 - PUSH - (+(- 241 1 POP 241- ) (+ 241- * PUSH * (+* 241- 3 241-3 POP * 241-3* POP + 241-3*+ ) CONVERSION OF INFIX INTO POSTFIX 2+(4-1)*3 into 241-3*+

18. THANK YOU 

STACKS IN DATASTRUCTURE

Recommended

More Related Content

What's hot (20)

Similar to STACKS IN DATASTRUCTURE (20)

Recently uploaded (20)

STACKS IN DATASTRUCTURE