TYPES DATA STRUCTURES( LINEAR AND NON LINEAR)....

Aug 1, 2016Download as PPTX, PDF26 likes27,914 views

Shail Nakum

IT WILL HELP YOU TO STUDY ABOUT TYPES OF DATA STRUCTURES IN BRIEF.. THANK YOU FOR SUPPORT PLZ GIVE THE FEEDBACK...

Presentation
On
TYPES OF DATA STRUCTURES
Sub:
DATA
STRUCTURES
3nd Sem Computer
(2015-16)
Prepared By:
Name: Shail M Nakum
Enr No: 150410107054
Class: S.Y.: Computer
Div.-I

Data
Structure
It is a logical way of
storing data and it also
define mechanism of
retrieve data.

Types of
Data Structure
DATA
STRUCTURE
NON LINEARLINEAR 38/1/2016
SHAIL M. NAKUM (150410107054)

8/1/2016SHAIL M. NAKUM (150410107054) 4
Difference between
Linear and Nonlinear
Data Structures

8/1/2016SHAIL M. NAKUM (150410107054) 5
• Main difference between linear and nonlinear
data structures lie in the way they organize
data elements.
• In linear data structures, data elements are
organized sequentially and therefore they are
easy to implement in the computer’s memory.
• In nonlinear data structures, a data element
can be attached to several other data elements
to represent specific relationships that exist
among them.

8/1/2016SHAIL M. NAKUM (150410107054) 6
• Due to this nonlinear structure, they might be
difficult to be implemented in computer’s
linear memory compared to implementing
linear data structures.
• Selecting one data structure type over the
other should be done carefully by considering
the relationship among the data elements that
needs to be stored.

Linear
Data Structure
1.Array
2.Stack
3.Queue
4.Linked List
78/1/2016SHAIL M. NAKUM (150410107054)

1.Array
• An array is a collection of
homogeneous type of data
elements.
• An array is consisting of a
collection of elements .
88/1/2016SHAIL M. NAKUM (150410107054)

Array
Representation
98/1/2016SHAIL M. NAKUM (150410107054)

2.Stack
A Stack is a list of elements in
which an element may be inserted or
deleted at one end which is known
as TOP of the stack.
108/1/2016SHAIL M. NAKUM (150410107054)

Operation Performed
of Stack
Push: add an element
in stack
Pop: remove an
element in stack
118/1/2016SHAIL M. NAKUM (150410107054)

Stack Representation
128/1/2016SHAIL M. NAKUM (150410107054)

3.Queue
A queue is a linear list of element in
which insertion can be done at one end
which is known as front and deletion
can be done which is known as rear.
138/1/2016SHAIL M. NAKUM (150410107054)

Representation of
Queue
55 65 75
148/1/2016SHAIL M. NAKUM (150410107054)

4.Linked List
A Linked list is a linear collection of data
elements .It has two part one is info and
other is link part.info part gives
information and link part is address of
next node
158/1/2016SHAIL M. NAKUM (150410107054)

Linked
Representation
168/1/2016SHAIL M. NAKUM (150410107054)

2.Non Linear
1.Tree
2.Graph
178/1/2016SHAIL M. NAKUM (150410107054)

1.Tree
In computer science, a tree is a
widely-used data structure that
emulates a hierarchical tree
structure with a set of linked nodes.
188/1/2016SHAIL M. NAKUM (150410107054)

Tree Representation
198/1/2016SHAIL M. NAKUM (150410107054)

2.Graph
A graph data structure may also
associate to each edge some edge value,
such as a symbolic label or a numeric
attribute (cost, capacity, length, etc.).
208/1/2016SHAIL M. NAKUM (150410107054)

Graph
Representation
218/1/2016SHAIL M. NAKUM (150410107054)

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.

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.

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.

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.

Basics of pointer, pointer expressions, pointer to pointer and pointer in fun...Jayanshu Gundaniya

��

Pointers are a data type in C that contain memory addresses as their values. They allow programs to indirectly access and manipulate the data stored at those addresses. Pointers can be used to pass arguments by reference, return values from functions, access array elements, and link data structures like linked lists. Proper initialization of pointers is important to avoid issues like accessing protected memory or going out of array bounds.

AVL Tree in Data Structure Vrushali Dhanokar

��

This document discusses AVL trees, which are height-balanced binary search trees. It defines AVL trees, explains why they are useful by comparing insertion performance to regular binary search trees, and covers balance factors, rotations, and the insertion algorithm. Key points made include that AVL trees have logarithmic time complexity for operations through self-balancing, and maintain an extra balance factor field for each node. Various example questions related to building AVL trees from data are also provided.

Linked ListRaaviKapoor

��

Linked list Advantages and disadvantages Types of linked lists Singly linked list Doubly linked list Header linked lists Applications of linked list Algorithm to search a value Example of LinkedList Algorithm for inserting a node single link list Applications of Arrays data in continuous memory queues stacks beginning of a linked list traversing a linked list Algorithm for traversing Grounded header linked list Circular Header linked list

sorting and its typesSIVASHANKARIRAJAN

��

This document discusses different types of sorting algorithms. It describes internal sorting and external sorting, with internal sorting handling all data in memory and external sorting requiring external memory. Bubble sort, selection sort, and insertion sort are briefly explained as examples of sorting methods. Bubble sort works by comparing adjacent elements and swapping if out of order, selection sort finds the minimum element and selection sort inserts elements into the sorted position. Pseudocode and examples are provided for each algorithm.

Breadth First Search & Depth First SearchKevin Jadiya

��

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.

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.

Unit 5 internal sorting & filesDrkhanchanaR

��

Data Structure and Algorithms Linked ListManishPrajapati78

��

The document discusses different types of linked lists including: - Singly linked lists that can only be traversed in one direction. - Doubly linked lists that allow traversal in both directions using forward and backward pointers. - Circular linked lists where the last node points back to the first node allowing continuous traversal. - Header linked lists that include a header node at the beginning for simplified insertion and deletion. Header lists can be grounded where the last node contains a null pointer or circular where the last node points to the header. - Two-way or doubly linked lists where each node contains a forward and backward pointer allowing bidirectional traversal through the list.

Binary Tree TraversalDhrumil Panchal

��

358 33 powerpoint-slides_14-sorting_chapter-14sumitbardhan

��

The document describes several sorting algorithms: 1) Bubble sort repeatedly compares and swaps adjacent elements, moving the largest values to the end over multiple passes. It has a complexity of O(n^2). 2) Insertion sort inserts elements one by one into the sorted portion of the array by shifting elements and comparing. It is O(n^2) in worst case but O(n) if nearly sorted. 3) Selection sort finds the minimum element and swaps it into the first position in each pass to build the sorted array. It has complexity O(n^2). 4) Merge sort divides the array into halves recursively, then merges the sorted halves to produce the fully sorted array.

Ppt on Linked list,stack,queueSrajan Shukla

��

This document discusses different types of linked lists, including singly linked lists, circular linked lists, and doubly linked lists. It provides examples of circular linked lists and explains that in a circular linked list, the last node contains the address of the first node so that the list can be traversed repeatedly. The document also discusses common linked list operations like insertion and deletion of nodes. Finally, it covers stacks and queues, defining them as LIFO and FIFO data structures, respectively, and providing examples of their implementation and different types.

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.

Back patchingsanthiya thavanthi

��

This document discusses backpatching and syntax-directed translation for boolean expressions and flow-of-control statements. It describes using three functions - Makelist, Marklist, and Backpatch - to generate code with backpatching during a single pass. Boolean expressions are translated by constructing syntax trees and associating semantic actions to record quadruple indices for later backpatching. Flow-of-control statements like IF and WHILE are handled similarly, using marker nonterminals to record quadruple numbers for backpatching statement lists.

bus and memory tranfer (computer organaization)Siddhi Viradiya

��

A bus system is an efficient way to transfer data between registers in a computer. It uses a set of common lines that can selectively connect one register at a time to allow its information to be transferred. One way to construct a bus system is by using multiplexers. For example, a 4-bit system with 4 registers would use 4 multiplexers, each with 3 inputs to selectively connect the bits of one register to the common 4-line bus. Control signals on the multiplexer selection lines determine which register is connected to the bus at any given time.

Data Types - Premetive and Non Premetive Raj Naik

��

This document discusses data types in C programming. It describes primitive data types like integers, floats, characters and their syntax. It also covers non-primitive data types like arrays, structures, unions, and linked lists. Arrays store a collection of similar data types, structures group different data types, and unions store different types in the same memory location. Linked lists are dynamic data structures using pointers. The document also provides overviews of stacks and queues, describing their LIFO and FIFO properties respectively.

Stacks and Queue - Data StructuresDr. Jasmine Beulah Gnanadurai

��

The document discusses stacks and queues as abstract data types. It describes their basic operations and implementations using arrays. Stacks follow LIFO (last-in, first-out) order and can be used for applications like undo operations. Queues follow FIFO (first-in, first-out) order and can be used where ordering of elements is important, like in printing queues. The document also discusses infix, prefix and postfix notations for arithmetic expressions and provides an algorithm to convert infix to postfix notation using a stack. Finally, it describes different types of queues including linear and circular queues.

Programming in c Arraysjanani thirupathi

��

An array is a collection of data that holds a fixed number of values of the same type. Arrays allow storing multiple values in a single variable through indices. There are one-dimensional, two-dimensional, and multi-dimensional arrays. One-dimensional arrays use a single subscript, two-dimensional arrays use two subscripts like rows and columns, and multi-dimensional arrays can have more than two subscripts. Arrays can be initialized during declaration with values or initialized at runtime by user input or other methods. Elements are accessed using their indices and operations can be performed on the elements.

Array Introduction One-dimensional array Multidimensional arrayimtiazalijoono

��

Graph in data structureAbrish06

��

This document defines and provides examples of graphs and their representations. It discusses: - Graphs are data structures consisting of nodes and edges connecting nodes. - Examples of directed and undirected graphs are given. - Graphs can be represented using adjacency matrices or adjacency lists. Adjacency matrices store connections in a grid and adjacency lists store connections as linked lists. - Key graph terms are defined such as vertices, edges, paths, and degrees. Properties like connectivity and completeness are also discussed.

Array data structuremaamir farooq

��

Searching and sortingPoojithaBollikonda

��

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.

Non Linear Data StructuresAdarsh Patel

��

UHV UNIT-5 IMPLICATIONS OF THE ABOVE HOLISTIC UNDERSTANDING OF HARMONY ON ...ariomthermal2031

��

UHV Unit - 4 HARMONY IN THE NATURE AND EXISTENCE.pptxariomthermal2031

��

More Related Content

What's hot (20)

Breadth First Search & Depth First SearchKevin Jadiya

��

STACKS IN DATASTRUCTUREArchie Jamwal

��

ArraysSARITHA REDDY

��

Unit 5 internal sorting & filesDrkhanchanaR

��

Data Structure and Algorithms Linked ListManishPrajapati78

��

Binary Tree TraversalDhrumil Panchal

��

358 33 powerpoint-slides_14-sorting_chapter-14sumitbardhan

��

Ppt on Linked list,stack,queueSrajan Shukla

��

Applications of stackeShikshak

��

Back patchingsanthiya thavanthi

��

bus and memory tranfer (computer organaization)Siddhi Viradiya

��

Data Types - Premetive and Non Premetive Raj Naik

��

Stacks and Queue - Data StructuresDr. Jasmine Beulah Gnanadurai

��

Programming in c Arraysjanani thirupathi

��

Array Introduction One-dimensional array Multidimensional arrayimtiazalijoono

��

Graph in data structureAbrish06

��

Array data structuremaamir farooq

��

Searching and sortingPoojithaBollikonda

��

Stack and its Applications : Data Structures ADTSoumen Santra

��

Non Linear Data StructuresAdarsh Patel

��

Breadth First Search & Depth First SearchKevin Jadiya

��

STACKS IN DATASTRUCTUREArchie Jamwal

��

ArraysSARITHA REDDY

��

Unit 5 internal sorting & filesDrkhanchanaR

��

Data Structure and Algorithms Linked ListManishPrajapati78

��

Binary Tree TraversalDhrumil Panchal

��

358 33 powerpoint-slides_14-sorting_chapter-14sumitbardhan

��

Ppt on Linked list,stack,queueSrajan Shukla

��

Applications of stackeShikshak

��

Back patchingsanthiya thavanthi

��

bus and memory tranfer (computer organaization)Siddhi Viradiya

��

Data Types - Premetive and Non Premetive Raj Naik

��

Stacks and Queue - Data StructuresDr. Jasmine Beulah Gnanadurai

��

Programming in c Arraysjanani thirupathi

��

Array Introduction One-dimensional array Multidimensional arrayimtiazalijoono

��

Graph in data structureAbrish06

��

Array data structuremaamir farooq

��

Searching and sortingPoojithaBollikonda

��

Stack and its Applications : Data Structures ADTSoumen Santra

��

Non Linear Data StructuresAdarsh Patel

��

Recently uploaded (20)

UHV UNIT-5 IMPLICATIONS OF THE ABOVE HOLISTIC UNDERSTANDING OF HARMONY ON ...ariomthermal2031

��

UHV Unit - 4 HARMONY IN THE NATURE AND EXISTENCE.pptxariomthermal2031

��

Kamal 2, new features and practical examplesIgor Aleksandrov

��

Industry 4.0: Transforming Modern Manufacturing and BeyondGtxDriver

��

This document explores the fundamental concepts, technologies, and applications of Industry 4.0. Topics include automation, IoT (Internet of Things), smart factories, cyber-physical systems, and the integration of AI and big data analytics in industrial processes. It serves as a comprehensive resource for students, professionals, and enthusiasts eager to delve into the fourth industrial revolution.

CNC Technology Unit-1 for IV Year 24-25 MECHC Sai Kiran

��

Intro PPT SY_HONORS.pptx- Teaching schemePriyanka Dange

��

UHV unit-2UNIT - II HARMONY IN THE HUMAN BEING.pptxariomthermal2031

��

UNIT - II HARMONY IN THE HUMAN BEING

NFPA 70B & 70E Changes and Additions Webinar Presented By FlukeTranscat

��

Join us for this webinar about NFPA 70B & 70E changes and additions. NFPA 70B and NFPA 70E are both essential standards from the National Fire Protection Association (NFPA) that focus on electrical safety in the workplace. Both standards are critical for protecting workers, reducing the risk of electrical accidents, and ensuring compliance with safety regulations in industrial and commercial environments. Fluke Sales Applications Manager Curt Geeting is presenting on this engaging topic: Curt has worked for Fluke for 24 years. He currently is the Senior Sales Engineer in the NYC & Philadelphia Metro Markets. In total, Curt has worked 40 years in the industry consisting of 14 years in Test Equipment Distribution, 4+ years in Mfg. Representation, NAED Accreditation, Level 1 Thermographer, Level 1 Vibration Specialist, and Power Quality SME.

UHV UNIT-I INTRODUCTION TO VALUE EDUCATION .pptxariomthermal2031

��

INTRODUCTION TO VALUE EDUCATION

Supervised Learning Ensemble Techniques Machine LearningShivarkarSandip

��

Why the Engineering Model is Key to Successful ProjectsMaadhu Creatives-Model Making Company

��

LA11-Case study of motherboard and internal components of motheroard.docxVidyaAshokNemade

��

PLANT CELL REACTORS presenation PTC amityUrjaMoon

��

Project Manager | Integrated Design ExpertBARBARA BIANCO

��

Barbara Bianco Project Manager and Project Architect, with extensive experience in managing and developing complex projects from concept to completion. Since September 2023, she has been working as a Project Manager at MAB Arquitectura, overseeing all project phases, from concept design to construction, with a strong focus on artistic direction and interdisciplinary coordination. Previously, she worked at Progetto CMR for eight years (2015-2023), taking on roles of increasing responsibility: initially as a Project Architect, and later as Head of Research & Development and Competition Area (2020-2023). She graduated in Architecture from the University of Genoa and obtained a Level II Master’s in Digital Architecture and Integrated Design from the INArch Institute in Rome, earning the MAD Award. In 2009, she won First Prize at Urban Promo Giovani with the project "From Urbanity to Humanity", a redevelopment plan for the Maddalena district of Genoa focused on the visual and perceptive rediscovery of the city. Experience & Projects Barbara has developed projects for major clients across various sectors (banking, insurance, real estate, corporate), overseeing both the technical and aesthetic aspects while coordinating multidisciplinary teams. Notable projects include: The Sign Business District for Covivio, Milan New L'Oréal Headquarters in Milan, Romolo area Redevelopment of Via C. Colombo in Rome for Prelios, now the PWC headquarters Interior design for Spark One & Spark Two, two office buildings in the Santa Giulia district, Milan (Spark One: 53,000 m²) for In.Town-Lendlease She has also worked on international projects such as: International Specialized Hospital of Uganda (ISHU) – Kampala Palazzo Milano, a residential building in Taiwan for Chonghong Construction Chua Lang Street Building, a hotel in Hanoi Manjiangwan Masterplan, a resort in China Key Skills ✔️ Integrated design: managing and developing projects from concept to completion ✔️ Artistic direction: ensuring aesthetic quality and design consistency ✔️ Project management: coordinating clients, designers, and multidisciplinary consultants ✔️ Software proficiency: AutoCAD, Photoshop, InDesign, Office Suite ✔️ Languages: Advanced English, Basic French ✔️ Leadership & problem-solving: ability to lead teams and manage complex processes in dynamic environments

windrose1.ppt for seminar of civil .pptxnukeshpandey5678

��

CNC Technology Unit-4 for IV Year 24-25 MECHC Sai Kiran

��

Artificial intelligence and Machine learning in remote sensing and GISamirthamm2083

��

Scalling Rails: The Journey to 200M NotificationsGustavo Araujo

��

Intro of Airport Engg..pptx-Definition of airport engineering and airport pla...Priyanka Dange

��

Mastering Secure Login Mechanisms for React Apps.pdfBrion Mario

��

UHV UNIT-5 IMPLICATIONS OF THE ABOVE HOLISTIC UNDERSTANDING OF HARMONY ON ...ariomthermal2031

��

UHV Unit - 4 HARMONY IN THE NATURE AND EXISTENCE.pptxariomthermal2031

��

Kamal 2, new features and practical examplesIgor Aleksandrov

��

Industry 4.0: Transforming Modern Manufacturing and BeyondGtxDriver

��

CNC Technology Unit-1 for IV Year 24-25 MECHC Sai Kiran

��

Intro PPT SY_HONORS.pptx- Teaching schemePriyanka Dange

��

UHV unit-2UNIT - II HARMONY IN THE HUMAN BEING.pptxariomthermal2031

��

NFPA 70B & 70E Changes and Additions Webinar Presented By FlukeTranscat

��

UHV UNIT-I INTRODUCTION TO VALUE EDUCATION .pptxariomthermal2031

��

Supervised Learning Ensemble Techniques Machine LearningShivarkarSandip

��

Why the Engineering Model is Key to Successful ProjectsMaadhu Creatives-Model Making Company

��

LA11-Case study of motherboard and internal components of motheroard.docxVidyaAshokNemade

��

PLANT CELL REACTORS presenation PTC amityUrjaMoon

��

Project Manager | Integrated Design ExpertBARBARA BIANCO

��

windrose1.ppt for seminar of civil .pptxnukeshpandey5678

��

CNC Technology Unit-4 for IV Year 24-25 MECHC Sai Kiran

��

Artificial intelligence and Machine learning in remote sensing and GISamirthamm2083

��

Scalling Rails: The Journey to 200M NotificationsGustavo Araujo

��

Intro of Airport Engg..pptx-Definition of airport engineering and airport pla...Priyanka Dange

��

Mastering Secure Login Mechanisms for React Apps.pdfBrion Mario

��

TYPES DATA STRUCTURES( LINEAR AND NON LINEAR)....

1. Presentation On TYPES OF DATA STRUCTURES Sub: DATA STRUCTURES 3nd Sem Computer (2015-16) Prepared By: Name: Shail M Nakum Enr No: 150410107054 Class: S.Y.: Computer Div.-I

2. Data Structure It is a logical way of storing data and it also define mechanism of retrieve data.

3. Types of Data Structure DATA STRUCTURE NON LINEARLINEAR 38/1/2016 SHAIL M. NAKUM (150410107054)

4. 8/1/2016SHAIL M. NAKUM (150410107054) 4 Difference between Linear and Nonlinear Data Structures

5. 8/1/2016SHAIL M. NAKUM (150410107054) 5 • Main difference between linear and nonlinear data structures lie in the way they organize data elements. • In linear data structures, data elements are organized sequentially and therefore they are easy to implement in the computer’s memory. • In nonlinear data structures, a data element can be attached to several other data elements to represent specific relationships that exist among them.

6. 8/1/2016SHAIL M. NAKUM (150410107054) 6 • Due to this nonlinear structure, they might be difficult to be implemented in computer’s linear memory compared to implementing linear data structures. • Selecting one data structure type over the other should be done carefully by considering the relationship among the data elements that needs to be stored.

7. Linear Data Structure 1.Array 2.Stack 3.Queue 4.Linked List 78/1/2016SHAIL M. NAKUM (150410107054)

8. 1.Array • An array is a collection of homogeneous type of data elements. • An array is consisting of a collection of elements . 88/1/2016SHAIL M. NAKUM (150410107054)

9. Array Representation 98/1/2016SHAIL M. NAKUM (150410107054)

10. 2.Stack A Stack is a list of elements in which an element may be inserted or deleted at one end which is known as TOP of the stack. 108/1/2016SHAIL M. NAKUM (150410107054)

11. Operation Performed of Stack Push: add an element in stack Pop: remove an element in stack 118/1/2016SHAIL M. NAKUM (150410107054)

12. Stack Representation 128/1/2016SHAIL M. NAKUM (150410107054)

13. 3.Queue A queue is a linear list of element in which insertion can be done at one end which is known as front and deletion can be done which is known as rear. 138/1/2016SHAIL M. NAKUM (150410107054)

14. Representation of Queue 55 65 75 148/1/2016SHAIL M. NAKUM (150410107054)

15. 4.Linked List A Linked list is a linear collection of data elements .It has two part one is info and other is link part.info part gives information and link part is address of next node 158/1/2016SHAIL M. NAKUM (150410107054)

16. Linked Representation 168/1/2016SHAIL M. NAKUM (150410107054)

17. 2.Non Linear 1.Tree 2.Graph 178/1/2016SHAIL M. NAKUM (150410107054)

18. 1.Tree In computer science, a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes. 188/1/2016SHAIL M. NAKUM (150410107054)

19. Tree Representation 198/1/2016SHAIL M. NAKUM (150410107054)

20. 2.Graph A graph data structure may also associate to each edge some edge value, such as a symbolic label or a numeric attribute (cost, capacity, length, etc.). 208/1/2016SHAIL M. NAKUM (150410107054)

21. Graph Representation 218/1/2016SHAIL M. NAKUM (150410107054)

22. 228/1/2016SHAIL M. NAKUM (150410107054)

�ݺ�ߣ

TYPES DATA STRUCTURES( LINEAR AND NON LINEAR)....

Recommended

More Related Content

What's hot (20)

Recently uploaded (20)

TYPES DATA STRUCTURES( LINEAR AND NON LINEAR)....