Scribd
Upload
12 views14 pages

Topic5 01 Data Structures Intro SLIDES GS Lahcen

The document provides an overview of data structures, defining them as containers for data organized in specific ways, including linear (lists, stacks, queues) and non-linear structures (trees, heaps, graphs). It emphasizes the relationship between data structures and algorithms, highlighting the necessity of algorithms for manipulating and accessing data. Key concepts such as time and space complexity, recursion, and various sorting methods are also introduced.

Uploaded by

fardin123rahman07
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
12 views14 pages

Topic5 01 Data Structures Intro SLIDES GS Lahcen

The document provides an overview of data structures, defining them as containers for data organized in specific ways, including linear (lists, stacks, queues) and non-linear structures (trees, heaps, graphs). It emphasizes the relationship between data structures and algorithms, highlighting the necessity of algorithms for manipulating and accessing data. Key concepts such as time and space complexity, recursion, and various sorting methods are also introduced.

Uploaded by

fardin123rahman07
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

Data structures

introduction
Algorithms Analysis of
algorithms
Recursion • Time and space complexity
• Recursive algorithm
• Comparison and no comparison sorting algorithms
Sorting • Hashing

Hashing
Algorithms Analysis of
algorithms
Recursion
Sorting
Hashing
Structures
Data

• Data structures are data containers where data is


organised in a specific way
• The simplest data structure has a linear
organisation of data
• The first one we will study
Algorithms Analysis of
algorithms
Recursion
Sorting
Hashing

Lists, stacks and queues Linear data structures


Structures

• We have already seen arrays and Hashtables


• All linear data structures store one number
Data

after the other following a line.


• But they differ in the way to access elements
Algorithms Analysis of
algorithms
Recursion
Sorting
Hashing

Lists, stacks and queues


Structures

Non linear DS have hierarchical organisation


Trees
Data

1st type of non linear DS


Heaps
Algorithms Analysis of
algorithms
Recursion
Sorting
Hashing

Lists, stacks and queues


Structures

Trees
Data

Heaps Non-linear data structure

Graphs
Data Structure

Lets define what a data structure is


Data Structure

1. Is a container of data
Data Structure

1. Is a container of data
2. Data is organised in a
specific way
Data Structure

1. Is a container of data
2. Data is organised in a
specific way

Lists are organised in a linear manner.


Data Structure

1. Is a container of data
2. Data is organised in a
specific way

Trees and Heaps are organised in hierarchical manner


Data Structure

1. Is a container of data
2. Data is organised in a
specific way

3. Specific functions to For example:


manipulate and access the main function of hashtables are:
search, insert and remove
data
Data Structure

1. We will see what specific function are used for each data structure
2. Data structures and algorithms are closely related
1. You can not have a data structure without a series of algorithms to help us
operate the data stored in the data structure
Algorithms Analysis of
algorithms
Recursion
Sorting
Hashing

Lists, stacks and queues


Structures

Trees
Data

Heaps
Graphs

You might also like