wk1

Datastructures consist of 2 parts what are they?

Elements each of which is either a data type Collectionor another data structure AND A set of associations or relationships (the structure) involving the collection of elements

Describe a Linear Structure with examples

Unique predecessor and unique successor. EG Stacks, Queues

Describe Hierichical structure

unique predecessor AND many successors eg Family tree

Describe Graph Structure

many predecessors and many successors eg Railway man, computer network

Describe set structure

no predecessors AND no successors, eg class of students

What are the steps to pick a data structure?

1) Analyse the problem 2) Determine the basic operations needed 3) Select the most efficient data structure

What is an Abstract Data Type (ADT)?

An ADT is a collection of data and associated methods stored as a single module.

An ADT ______ be directly access

An ADT __can not__ be directly access

What does an ADT consist of?

The data structure. The access methods. Modifier methods. internal methods

An ADT describes _____ information is stored ____ being specific about ____ the information is stored or organised

An ADT describes_WHAT_ information is stored _WITHOUT_ being specific about _HOW_ the information is stored or organised

The methods of the ADT specify _____you can and cant do without being specific about ____ its is achived

The methods of the ADT specify _WHAT_ you can and cant do without being specific about _HOW_ its is achived