Principles of Data Structure
Principles of Data Structure
UNIT-I
Introduction: Basic Terminology, Elementary Data
Organization, Structure Operations, Complexity
and Time-Space Trade-off.
Arrays: Definition, Representation and Analysis, Single
and Multi-Dimension Array, Address Calculation,
Application of Arrays, Character, String in C,
Character String Operation, Arrays Parameters,
Ordered List, Sparse Matrices and Vectors
Stacks: Array Representation and Implementation of
Stack, Operations on Stacks: Push &Pop, Array
Representation of Stack, Linked Representation of
Stack, Operations Associated with Stacks,
Application of Stack, Conversion of Infix to Prefix
and Postfix Expressions, Evaluation of Postfix
Expressions using Stack, Application of Recursion
in Problem like Tower of Hanoi.
DATA is collection of raw facts, numbers, symbols, text
and images.
They are simple and unorganised.
These elements remain just data when collected and
observed without interpretation.
When these elements are analysed and contextualised,
they transform into something more meaningful.
Examples- number of visiters to a website in a month.
Inventory levels on a warehouse on a specific data.
NON-LINEAR
(it doesn’t perform a sequence in each item, elements
are connected in a hierarchical, hybrid, multilevel
manner.)
Tree, Graph