Introduction to Data Structures

specifying operations

(algorithms

software life cycle steps

1Problem Analysis 2 Structured Design 3 Implementation 4 Testing and Debugging 5 Production and Maintenance

The main feature of ADT is

a clear description of the input to each operation the action of each operation its return type

ADT to describe any data structures

linked lists queues stacks trees heaps graphs

linear

list, array, vector, linked list, sequence, queue, stack,deque

Reusabilty

using part of a program as a separate component of different systems

Adaptability

designing a software in a smart way that can be adopted easily to other applications across different platforms with reasonable maintain time or complemented by additional systems.

arbitrary

graph, network

Robustness

producing correct solutions and being able to handle inputs that are not expected for this application.

data structure

systematic way of organizing input data

Abstract Data Type (ADT)

the type of the data stored the operations that support the data

hierarchical:

tree, heap