Scribd
Upload
9 views8 pages

07 - Datatypes (HR - 2021) - Finalized

Uploaded by

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

07 - Datatypes (HR - 2021) - Finalized

Uploaded by

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

An Introduction to

Algorithms
By
Hossein Rahmani
[email protected]
http://webpages.iust.ac.ir/h_rahmani/

1
Intro

Complexity Data Structure Trees

Dynamic
Programming Sorting Hash Functions

Greedy Algorithm Misc Graph/Tree


Algorithms

2
Data Structure
• A construct that can be defined within a
programming language to store a collection of
data
– one may store some data in an array of integers,
an array of objects, or an array of arrays
Abstract Data Type (ADT)
• Definition: a collection of data together
with a set of operations on that data
– specifications indicate what ADT operations do,
but not how to implement them
– data structures are part of an ADT’s
implementation
• Programmer can use an ADT without
knowing its implementation.
Typical Operations on Data
• Add data to a data collection
• Remove data from a data collection
• Ask questions about the data in a data
collection. E.g., what is the value at a
particular location, and is x in the collection?
Why ADT
• Hide the unnecessary details
• Help manage software complexity
• Easier software maintenance
• Functionalities are less likely to change
• Localised rather than global changes
Data Abstraction

7
Illustration

You might also like