MODULE 1: DATA STRUCTURE AND ALGORITHMS

DATA STRUCTURE

A data structure is an arrangement  of data in a computer’s memory or disk storage space.

Linear

there is a unique first and unique last  element and every other element has a unique  predecessor and a unique successor.

Non-Linear

There is no unique first or last element.

Sequential Access

Elements  must  be  accessed  in some specified order.

Direct Access

Elements can be accessed at  random, in any order. Any element can be  accessed without accessing its predecessor or  successor.

Homogenous

All the elements in the structure  are of the same data type.

Ex. Arrays

Heterogenous

The  elements  in  the  structure  are of different data types.

Example: Record in C++

DATA STRUCTURE OPERATIONS

Traversing

Searching

Inserting

Deleting

Ordering

Categorizing

Traversing

Accessing each record exactly  once in order that same items in the records may be processed.

Searching

Finding the location of the record with  a given unique identifier or finding the locations of all records, which satisfy one or more conditions.

Inserting

Adding a new record to the  structure.

Deleting

Removing a record from the  structure.

Ordering

Arranging of items in some  sequence and/or in different sets, and accordingly.

Categorizing

Grouping and labelling items with similar properties together.

ALGORITHM

Algorithm can  be  defined  as  a  sequence  of definite and effective instructions, which terminates with the production of correct output  from the given input.

SPECIFYING ALGORITHM

Plain English

Programming Language

Pseudocode – an outline of a program written in a form that can be  easily converted into real programming language.