UNIT 1 Introduction, algorithmic notation PDF

Preview

Summary

Unit 1 contains Introduction, algorithmic notation, Space and Time analysis of an algorithm, information and its storage representation, Representation and its manipulation of strings, Pattern Matching. Searching and sorting techniques. ...

Description

UNIT I

Introduction , algorithmic notation , space and time analysis of the algorithm , information and its storage representation , representation and its manipulation of string , pattern matching , searching and sorting techniques.

Introduction: DATA STRUCTURES: Data is a set of elementary items. The possible ways in which the data items are logically related is defined by data structure . That is , organized collection of data is called a data structure. The programs have to follow a certain rules to access and process the structure data.And so , Data structure = Organised data + allowed Operation. These are standard data structures which are often used to form the basis for computer data structures. Arrays are the basic building blocks for more complex data structures. Classifications: Data structures

Linear

Non Linear

Linear Data Structures: Items are arranged in Linear sequence like an array. Ex. Arrays ,Linked list ,Stacks ,Queues. Non Linear data Structures: Data Items are not in sequence. Ex. Tree, Graph 1.ALGORITHMIC NOTATION: In the section full description of algorithmic notation is given: Algorithm: Greatest.

This algorithm finds the largest algebraic element of vector A which

contains N elements and places the result in MAX. I is used to subscript A.

1.[Is the vector empty?] 1

UNIT I

if N...