You are on page 1of 2

Grade 13, 6/9/2016

Abstract Data types (ADT)


Objectives :
1. Describe the concept of ADT
2. Distinguish between ADTs
a) Stack (LIFO), queues (FIFO) single linked list (insert and delete)
definition, structure and operation
Example

William owns a restaurant that sells: breakfast lunch and dinner he boosts a huge
clientele which includes politics etc he has a record of all their orders and the
persons who dine at the restaurant what is the data structure of Williams
restaurant?

Common Data processing operations:


The Following are the most common data operations to be carried out on Data
structure.
Traversing the data (ie processing data in a list)
Addition of data
Deletion of data
Sorting of data Into some order
Searching for a specific item of data
Merging different set data

You should be already to carry out any of the above operations with manual or
computerized systems.

All data processing on a computer involves the manipulation in the computers


memory in different ways according how it is to be processed and the different
methods of organizing data are known as data Structure.
Computer languages such as c has elementary data types IT, STRING, CHAR. And
some built in structured or composite data types (Data structure) eg ARRAY
FUNTION.

ADDED DATA September 7, 2016

Abstracted Data types


1. Mathematical models of a set of data values or information that store similar
behavior or qualities that can be specified and identified independently for
specific requirements

2. A data type can be considered abstract when it is defined in the terms of


operations on it implementation is hidden (so that we can always replace one
implementation with another for eg. Efficiency reasons this will interfere with
anything in the program)
3. ADT is a kind of abstraction where the data type international form is hidden
behind a set of access functions. Values of the type are created and inspected
only by calls to the access functions this allows the implementation in the
type to be changed without requiring any changes outside the module in
which it is defined

TYPES OF ADT NB schoology


1. List has information
2. Stack on ADT in C
3. Queues

You might also like