Enviar búsqueda
Cargar
Data Structure Basics
•
12 recomendaciones
•
1,457 vistas
Shakila Mahjabin
Seguir
CSC-391 course material. Data structure and algorithm basic.
Leer menos
Leer más
Educación
Tecnología
Denunciar
Compartir
Denunciar
Compartir
1 de 24
Descargar ahora
Descargar para leer sin conexión
Recomendados
Ppl for students unit 1,2 and 3
Ppl for students unit 1,2 and 3
Akshay Nagpurkar
Loaders ( system programming )
Loaders ( system programming )
Adarsh Patel
Lecture 01 introduction to compiler
Lecture 01 introduction to compiler
Iffat Anjum
System Programming- Unit I
System Programming- Unit I
Saranya1702
Compiler design
Compiler design
Thakur Ganeshsingh Thakur
Python programming : Classes objects
Python programming : Classes objects
Emertxe Information Technologies Pvt Ltd
Software Engineering Methodologies
Software Engineering Methodologies
Damian T. Gordon
5. stored procedure and functions
5. stored procedure and functions
Amrit Kaur
Recomendados
Ppl for students unit 1,2 and 3
Ppl for students unit 1,2 and 3
Akshay Nagpurkar
Loaders ( system programming )
Loaders ( system programming )
Adarsh Patel
Lecture 01 introduction to compiler
Lecture 01 introduction to compiler
Iffat Anjum
System Programming- Unit I
System Programming- Unit I
Saranya1702
Compiler design
Compiler design
Thakur Ganeshsingh Thakur
Python programming : Classes objects
Python programming : Classes objects
Emertxe Information Technologies Pvt Ltd
Software Engineering Methodologies
Software Engineering Methodologies
Damian T. Gordon
5. stored procedure and functions
5. stored procedure and functions
Amrit Kaur
20160331_Automate the boring stuff with python
20160331_Automate the boring stuff with python
Sungman Jang
Compiler Design
Compiler Design
Mir Majid
Yacc
Yacc
BBDITM LUCKNOW
Algorithms Lecture 2: Analysis of Algorithms I
Algorithms Lecture 2: Analysis of Algorithms I
Mohamed Loey
Software maintenance Unit5
Software maintenance Unit5
Mohammad Faizan
Numeric functions in SQL | Oracle
Numeric functions in SQL | Oracle
Vimal Raj
Python : Data Types
Python : Data Types
Emertxe Information Technologies Pvt Ltd
Chapter 05 classes and objects
Chapter 05 classes and objects
Praveen M Jigajinni
Python programming : Strings
Python programming : Strings
Emertxe Information Technologies Pvt Ltd
Time and Space Complexity
Time and Space Complexity
Ashutosh Satapathy
Symbol table design (Compiler Construction)
Symbol table design (Compiler Construction)
Tech_MX
P code
P code
Sandeep Rv
Linker and Loader
Linker and Loader
sonalikharade3
JDBC
JDBC
Ankit Desai
Single Pass Assembler
Single Pass Assembler
Satyamevjayte Haxor
Command line-arguments-in-java-tutorial
Command line-arguments-in-java-tutorial
Kuntal Bhowmick
Complexity Analysis of Recursive Function
Complexity Analysis of Recursive Function
Meghaj Mallick
Two pass Assembler
Two pass Assembler
Satyamevjayte Haxor
Paging and segmentation
Paging and segmentation
Piyush Rochwani
Operating system deign and implementation
Operating system deign and implementation
sangrampatil81
Webpage Visual Design and Online Prototype
Webpage Visual Design and Online Prototype
amoore155
Chapter 3.1
Chapter 3.1
sotlsoc
Más contenido relacionado
La actualidad más candente
20160331_Automate the boring stuff with python
20160331_Automate the boring stuff with python
Sungman Jang
Compiler Design
Compiler Design
Mir Majid
Yacc
Yacc
BBDITM LUCKNOW
Algorithms Lecture 2: Analysis of Algorithms I
Algorithms Lecture 2: Analysis of Algorithms I
Mohamed Loey
Software maintenance Unit5
Software maintenance Unit5
Mohammad Faizan
Numeric functions in SQL | Oracle
Numeric functions in SQL | Oracle
Vimal Raj
Python : Data Types
Python : Data Types
Emertxe Information Technologies Pvt Ltd
Chapter 05 classes and objects
Chapter 05 classes and objects
Praveen M Jigajinni
Python programming : Strings
Python programming : Strings
Emertxe Information Technologies Pvt Ltd
Time and Space Complexity
Time and Space Complexity
Ashutosh Satapathy
Symbol table design (Compiler Construction)
Symbol table design (Compiler Construction)
Tech_MX
P code
P code
Sandeep Rv
Linker and Loader
Linker and Loader
sonalikharade3
JDBC
JDBC
Ankit Desai
Single Pass Assembler
Single Pass Assembler
Satyamevjayte Haxor
Command line-arguments-in-java-tutorial
Command line-arguments-in-java-tutorial
Kuntal Bhowmick
Complexity Analysis of Recursive Function
Complexity Analysis of Recursive Function
Meghaj Mallick
Two pass Assembler
Two pass Assembler
Satyamevjayte Haxor
Paging and segmentation
Paging and segmentation
Piyush Rochwani
Operating system deign and implementation
Operating system deign and implementation
sangrampatil81
La actualidad más candente
(20)
20160331_Automate the boring stuff with python
20160331_Automate the boring stuff with python
Compiler Design
Compiler Design
Yacc
Yacc
Algorithms Lecture 2: Analysis of Algorithms I
Algorithms Lecture 2: Analysis of Algorithms I
Software maintenance Unit5
Software maintenance Unit5
Numeric functions in SQL | Oracle
Numeric functions in SQL | Oracle
Python : Data Types
Python : Data Types
Chapter 05 classes and objects
Chapter 05 classes and objects
Python programming : Strings
Python programming : Strings
Time and Space Complexity
Time and Space Complexity
Symbol table design (Compiler Construction)
Symbol table design (Compiler Construction)
P code
P code
Linker and Loader
Linker and Loader
JDBC
JDBC
Single Pass Assembler
Single Pass Assembler
Command line-arguments-in-java-tutorial
Command line-arguments-in-java-tutorial
Complexity Analysis of Recursive Function
Complexity Analysis of Recursive Function
Two pass Assembler
Two pass Assembler
Paging and segmentation
Paging and segmentation
Operating system deign and implementation
Operating system deign and implementation
Destacado
Webpage Visual Design and Online Prototype
Webpage Visual Design and Online Prototype
amoore155
Chapter 3.1
Chapter 3.1
sotlsoc
Basics in algorithms and data structure
Basics in algorithms and data structure
Eman magdy
Chapter 7.4
Chapter 7.4
sotlsoc
Logic Formulation 2
Logic Formulation 2
deathful
Chap 2(const var-datatype)
Chap 2(const var-datatype)
Bangabandhu Sheikh Mujibur Rahman Science and Technology University
2. electric field calculation
2. electric field calculation
Bangabandhu Sheikh Mujibur Rahman Science and Technology University
Digital Logic
Digital Logic
Dilum Bandara
Problem Solving with Algorithms and Data Structure - Lists
Problem Solving with Algorithms and Data Structure - Lists
Yi-Lung Tsai
Problem Solving with Algorithms and Data Structure - Graphs
Problem Solving with Algorithms and Data Structure - Graphs
Yi-Lung Tsai
Komunikasyon
Komunikasyon
deathful
Data Structure & Algorithms | Computer Science
Data Structure & Algorithms | Computer Science
Transweb Global Inc
Data structures and algorithms
Data structures and algorithms
Julie Iskander
មេរៀនៈ Data Structure and Algorithm in C/C++
មេរៀនៈ Data Structure and Algorithm in C/C++
Ngeam Soly
Program logic formulation
Program logic formulation
Sara Corpuz
Destacado
(15)
Webpage Visual Design and Online Prototype
Webpage Visual Design and Online Prototype
Chapter 3.1
Chapter 3.1
Basics in algorithms and data structure
Basics in algorithms and data structure
Chapter 7.4
Chapter 7.4
Logic Formulation 2
Logic Formulation 2
Chap 2(const var-datatype)
Chap 2(const var-datatype)
2. electric field calculation
2. electric field calculation
Digital Logic
Digital Logic
Problem Solving with Algorithms and Data Structure - Lists
Problem Solving with Algorithms and Data Structure - Lists
Problem Solving with Algorithms and Data Structure - Graphs
Problem Solving with Algorithms and Data Structure - Graphs
Komunikasyon
Komunikasyon
Data Structure & Algorithms | Computer Science
Data Structure & Algorithms | Computer Science
Data structures and algorithms
Data structures and algorithms
មេរៀនៈ Data Structure and Algorithm in C/C++
មេរៀនៈ Data Structure and Algorithm in C/C++
Program logic formulation
Program logic formulation
Similar a Data Structure Basics
2.02.Data_structures_and_algorithms (1).pptx
2.02.Data_structures_and_algorithms (1).pptx
DrBashirMSaad
DS_PPT.ppt
DS_PPT.ppt
MeghaKulkarni27
Data structures and algorithms short note (version 14).pd
Data structures and algorithms short note (version 14).pd
Nimmi Weeraddana
DATA STRUCTURES - SHORT NOTES
DATA STRUCTURES - SHORT NOTES
suthi
Introduction to Data Structure.pptx
Introduction to Data Structure.pptx
GlenardDSarmiento
UNITIII LDS.pdf
UNITIII LDS.pdf
meenamadhuvandhi2
Introduction to data structure ppt
Introduction to data structure ppt
NalinNishant3
Chapter 1 Introduction to Data Structures and Algorithms.pdf
Chapter 1 Introduction to Data Structures and Algorithms.pdf
Axmedcarb
Datastructures using c++
Datastructures using c++
Gopi Nath
DS Module 1.pptx
DS Module 1.pptx
SaralaT3
Introduction to Data Structures .
Introduction to Data Structures .
Ashutosh Satapathy
DATA STRUCTURE IN C LANGUAGE
DATA STRUCTURE IN C LANGUAGE
shubhamrohiwal6
DS Module 1.pptx
DS Module 1.pptx
sarala9
Data structure (basics)
Data structure (basics)
ShrushtiGole
Data Structures & Recursion-Introduction.pdf
Data Structures & Recursion-Introduction.pdf
MaryJacob24
Data structure
Data structure
Gaurav Handge
Data Structures and algoithms Unit - 1.pptx
Data Structures and algoithms Unit - 1.pptx
mexiuro901
DATA STRUCTURE AND ALGORITHMS
DATA STRUCTURE AND ALGORITHMS
Adams Sidibe
Introduction to Data Structure
Introduction to Data Structure
Jazz Jinia Bhowmik
2. Introduction to Data Structure.pdf
2. Introduction to Data Structure.pdf
SulabhPawaia
Similar a Data Structure Basics
(20)
2.02.Data_structures_and_algorithms (1).pptx
2.02.Data_structures_and_algorithms (1).pptx
DS_PPT.ppt
DS_PPT.ppt
Data structures and algorithms short note (version 14).pd
Data structures and algorithms short note (version 14).pd
DATA STRUCTURES - SHORT NOTES
DATA STRUCTURES - SHORT NOTES
Introduction to Data Structure.pptx
Introduction to Data Structure.pptx
UNITIII LDS.pdf
UNITIII LDS.pdf
Introduction to data structure ppt
Introduction to data structure ppt
Chapter 1 Introduction to Data Structures and Algorithms.pdf
Chapter 1 Introduction to Data Structures and Algorithms.pdf
Datastructures using c++
Datastructures using c++
DS Module 1.pptx
DS Module 1.pptx
Introduction to Data Structures .
Introduction to Data Structures .
DATA STRUCTURE IN C LANGUAGE
DATA STRUCTURE IN C LANGUAGE
DS Module 1.pptx
DS Module 1.pptx
Data structure (basics)
Data structure (basics)
Data Structures & Recursion-Introduction.pdf
Data Structures & Recursion-Introduction.pdf
Data structure
Data structure
Data Structures and algoithms Unit - 1.pptx
Data Structures and algoithms Unit - 1.pptx
DATA STRUCTURE AND ALGORITHMS
DATA STRUCTURE AND ALGORITHMS
Introduction to Data Structure
Introduction to Data Structure
2. Introduction to Data Structure.pdf
2. Introduction to Data Structure.pdf
Más de Shakila Mahjabin
Computer processing
Computer processing
Shakila Mahjabin
Arrays in CPP
Arrays in CPP
Shakila Mahjabin
CSC 433 Sample normalization SQL Question
CSC 433 Sample normalization SQL Question
Shakila Mahjabin
SQL : introduction
SQL : introduction
Shakila Mahjabin
Normalization
Normalization
Shakila Mahjabin
Solution of Erds
Solution of Erds
Shakila Mahjabin
Entity Relationship Diagram
Entity Relationship Diagram
Shakila Mahjabin
Ch1- Introduction to dbms
Ch1- Introduction to dbms
Shakila Mahjabin
Stack and queue
Stack and queue
Shakila Mahjabin
Algo analysis
Algo analysis
Shakila Mahjabin
Merge sort and quick sort
Merge sort and quick sort
Shakila Mahjabin
Codes on structures
Codes on structures
Shakila Mahjabin
Arrays
Arrays
Shakila Mahjabin
array, function, pointer, pattern matching
array, function, pointer, pattern matching
Shakila Mahjabin
String operation
String operation
Shakila Mahjabin
Más de Shakila Mahjabin
(15)
Computer processing
Computer processing
Arrays in CPP
Arrays in CPP
CSC 433 Sample normalization SQL Question
CSC 433 Sample normalization SQL Question
SQL : introduction
SQL : introduction
Normalization
Normalization
Solution of Erds
Solution of Erds
Entity Relationship Diagram
Entity Relationship Diagram
Ch1- Introduction to dbms
Ch1- Introduction to dbms
Stack and queue
Stack and queue
Algo analysis
Algo analysis
Merge sort and quick sort
Merge sort and quick sort
Codes on structures
Codes on structures
Arrays
Arrays
array, function, pointer, pattern matching
array, function, pointer, pattern matching
String operation
String operation
Último
Science 7 - LAND and SEA BREEZE and its Characteristics
Science 7 - LAND and SEA BREEZE and its Characteristics
KarinaGenton
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
Marc Dusseiller Dusjagr
microwave assisted reaction. General introduction
microwave assisted reaction. General introduction
Maksud Ahmed
Grant Readiness 101 TechSoup and Remy Consulting
Grant Readiness 101 TechSoup and Remy Consulting
TechSoup
The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13
Steve Thomason
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impact
dawncurless
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
NirmalaLoungPoorunde1
Measures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and Mode
Thiyagu K
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptx
manuelaromero2013
Mastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory Inspection
SafetyChain Software
APM Welcome, APM North West Network Conference, Synergies Across Sectors
APM Welcome, APM North West Network Conference, Synergies Across Sectors
Association for Project Management
A Critique of the Proposed National Education Policy Reform
A Critique of the Proposed National Education Policy Reform
Chameera Dedduwage
Hybridoma Technology ( Production , Purification , and Application )
Hybridoma Technology ( Production , Purification , and Application )
Sakshi Ghasle
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Sapana Sha
Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha elections
anshu789521
Concept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.Compdf
UmakantAnnand
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
heathfieldcps1
URLs and Routing in the Odoo 17 Website App
URLs and Routing in the Odoo 17 Website App
Celine George
MENTAL STATUS EXAMINATION format.docx
MENTAL STATUS EXAMINATION format.docx
PoojaSen20
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Krashi Coaching
Último
(20)
Science 7 - LAND and SEA BREEZE and its Characteristics
Science 7 - LAND and SEA BREEZE and its Characteristics
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
microwave assisted reaction. General introduction
microwave assisted reaction. General introduction
Grant Readiness 101 TechSoup and Remy Consulting
Grant Readiness 101 TechSoup and Remy Consulting
The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impact
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
Measures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and Mode
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptx
Mastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory Inspection
APM Welcome, APM North West Network Conference, Synergies Across Sectors
APM Welcome, APM North West Network Conference, Synergies Across Sectors
A Critique of the Proposed National Education Policy Reform
A Critique of the Proposed National Education Policy Reform
Hybridoma Technology ( Production , Purification , and Application )
Hybridoma Technology ( Production , Purification , and Application )
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha elections
Concept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.Compdf
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
URLs and Routing in the Odoo 17 Website App
URLs and Routing in the Odoo 17 Website App
MENTAL STATUS EXAMINATION format.docx
MENTAL STATUS EXAMINATION format.docx
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Data Structure Basics
1.
Data Structures and Algorithms Lec-1 CSC
391
2.
2 Data Structures and
Algorithms Data Structure ©SMT, Faculty, CSE, IUBAT In computer science, a data structure is a particular way of storing and organizing data in a computer’s memory so that it can be used efficiently. Data may be organized in many different ways. The logical or mathematical model of a particular organization of data is called a data structure.
3.
3 Data Structures and
Algorithms Types Categories of Data Structure: The data structure can be classified in to major types: • Linear Data Structure • Non-linear Data Structure 1. Linear Data Structure: A data structure is said to be linear if its elements form any sequence. There are basically two ways of representing such linear structure in memory. a) One way is to have the linear relationships between the elements represented by means of sequential memory location. These linear structures are called arrays. b) The other way is to have the linear relationship between the elements represented by means of pointers or links. These linear structures are called linked lists. ©SMT, Faculty, CSE, IUBAT
4.
4 Data Structures and
Algorithms The common examples of linear data structure are- Arrays, Queues, Stacks, Linked lists 2. Non-linear Data Structure: This structure is mainly used to represent data containing a hierarchical relationship between elements. e.g. graphs, family trees and table of contents. Types ©SMT, Faculty, CSE, IUBAT
5.
5 Data Structures and
Algorithms Memory Allocation ©SMT, Faculty, CSE, IUBAT Memory allocation can be classified as either Contiguous Linked Indexed Prototypical examples: Contiguous allocation: arrays Linked allocation: linked lists
6.
6 Data Structures and
Algorithms Contiguous Allocation ©SMT, Faculty, CSE, IUBAT An array stores n objects in a single contiguous space of memory Unfortunately, if more memory is required, a request for new memory usually requires copying all information into the new memory In general, you cannot request for the operating system to allocate to you the next n memory locations
7.
7 Data Structures and
Algorithms Linked Allocation ©SMT, Faculty, CSE, IUBAT Linked storage such as a linked list associates two pieces of data with each item being stored: The object itself, and A reference to the next item In C++ that reference is the address of the next node
8.
8 Data Structures and
Algorithms Linked Allocation ©SMT, Faculty, CSE, IUBAT This is a class describing such a node template <typename Type> class Node { private: Type element; Node *next_node; public: // ... };
9.
9 Data Structures and
Algorithms Linked Allocation ©SMT, Faculty, CSE, IUBAT The operations on this node must include: Constructing a new node Accessing (retrieving) the value Accessing the next pointer Node( const Type& = Type(), Node* = nullptr ); Type retrieve() const; Node *next() const; Pointing to nothing has been represented as: C NULL Java/C# null C++ (old) 0 C++ (new) nullptr Symbolically Ø
10.
10 Data Structures and
Algorithms Linked Allocation ©SMT, Faculty, CSE, IUBAT For a linked list, however, we also require an object which links to the first object The actual linked list class must store two pointers A head and tail: Node *head; Node *tail; Optionally, we can also keep a count int count; The next_node of the last node is assigned nullptr
11.
11 Data Structures and
Algorithms Linked Allocation ©SMT, Faculty, CSE, IUBAT The class structure would be: template <typename Type> class List { private: Node<Type> *head; Node<Type> *tail; int count; public: // constructor(s)... // accessor(s)... // mutator(s)... };
12.
12 Data Structures and
Algorithms Indexed Allocation ©SMT, Faculty, CSE, IUBAT With indexed allocation, an array of pointers (possibly NULL) link to a sequence of allocated memory locations Used in the C++ standard template library Computer engineering students will see indexed allocation in their operating systems course
13.
13 Data Structures and
Algorithms Indexed Allocation ©SMT, Faculty, CSE, IUBAT Matrices can be implemented using indexed allocation: 1 2 3 4 5 6
14.
14 Data Structures and
Algorithms Indexed Allocation ©SMT, Faculty, CSE, IUBAT Matrices can be implemented using indexed allocation Most implementations of matrices (or higher-dimensional arrays) use indices pointing into a single contiguous block of memory Row-major order Column-major order C, Python Matlab, Fortran 1 2 3 4 5 6
15.
15 Data Structures and
Algorithms Data Structure Formats ©SMT, Faculty, CSE, IUBAT We will look at some variations or hybrids of these memory allocations including: Trees Graphs Array Linked List Stack Queue
16.
16 Data Structures and
Algorithms Trees ©SMT, Faculty, CSE, IUBAT The linked list can be used to store linearly ordered data What if we have multiple next pointers? A rooted tree (weeks 4-6) is similar to a linked list but with multiple next pointers
17.
17 Data Structures and
Algorithms Trees ©SMT, Faculty, CSE, IUBAT Data frequently contain a hierarchical relationship between various elements. The data structure which reflects this relationship is called a rooted tree graph or, simply, a tree. A tree is a variation on a linked list: Each node points to an arbitrary number of subsequent nodes Useful for storing hierarchical data 2.2.2.2
18.
18 Data Structures and
Algorithms Graphs ©SMT, Faculty, CSE, IUBAT Suppose we allow arbitrary relations between any two objects in a container Given n objects, there are n2 – n possible relations If we allow symmetry, this reduces to For example, consider the network 2 2 n n 2.2.2.2 Data sometimes contains a relationship between pairs of elements which is not necessarily hierarchical in nature, e.g. an airline flights only between the cities connected by lines. This data structure is called Graph.
19.
19 Data Structures and
Algorithms Arrays ©SMT, Faculty, CSE, IUBAT 2.2.2.2 The simplest type of data structure is a linear (or one dimensional) array. A list of a finite number n of similar data referenced respectively by a set of n consecutive numbers, usually 1, 2, 3 . . . . . . . n. if we choose the name A for the array, then the elements of A are denoted by subscript notation A 1 , A 2 , A 3 . . . . A n or by the parenthesis notation A (1), A (2), A (3) . . . . . . A (n) or by the bracket notation A [1], A [2], A [3] . . . . . . A [n] Example: A linear array A[8] consisting of numbers is pictured in following figure
20.
20 Data Structures and
Algorithms Linked List ©SMT, Faculty, CSE, IUBAT A linked list, or one way list is a linear collection of data elements, called nodes, where the linear order is given by means of pointers. Each node is divided into two parts: The first part contains the information of the element/node The second part contains the address of the next node (link /next pointer field) in the list. There is a special pointer Start/List contains the address of first node in the list. If this special pointer contains null, means that List is empty.
21.
21 Data Structures and
Algorithms Array of Linked Lists ©SMT, Faculty, CSE, IUBAT Suppose we allow arbitrary relations between any two objects in a container Alternatively, we could use a hybrid: an array of linked lists A B C D E F G H I J K L 2.2.2.2
22.
22 Data Structures and
Algorithms Queue and Stack ©SMT, Faculty, CSE, IUBAT Queue: A queue, also called FIFO system, is a linear list in which deletions can take place only at one end of the list, the Font of the list and insertion can take place only at the other end Rear. Stack: It is an ordered group of homogeneous items of elements. Elements are added to and removed from the top of the stack (the most recently added items are at the top of the stack). The last element to be added is the first to be removed (LIFO: Last In, First Out).
23.
23 Data Structures and
Algorithms Data Structures Operations ©SMT, Faculty, CSE, IUBAT The data appearing in our data structures are processed by means of certain operations. In fact, the particular data structure that one chooses for a given situation depends largely in the frequency with which specific operations are performed. The following four operations play a major role in this text: Traversing: accessing each record/node exactly once so that certain items in the record may be processed. (This accessing and processing is sometimes called “visiting” the record.)
24.
24 Data Structures and
Algorithms Data Structures Operations ©SMT, Faculty, CSE, IUBAT Searching: Finding the location of the desired node with a given key value, or finding the locations of all such nodes which satisfy one or more conditions. Inserting: Adding a new node/record to the structure. Deleting: Removing a node/record from the structure.
Descargar ahora