0% found this document useful (0 votes)
8 views

Principles of Data Structure

Uploaded by

Riya Rani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views

Principles of Data Structure

Uploaded by

Riya Rani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

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.

INFORMATION is processed, organised, interpreted


and structured form of data.
The comprehensible output derived from raw data
helps in forming decision, stratergies and action.
It is essentially data made valuable and accessible- an
integral component of decision making.
Examples- understanding that changes made to
website when there is increase or decrease in the
number of users in a month.
Finding areas for improvement to customers service
based on a collection of servey responses.
DATA STRUCTURE is a way to organise and store data in
a computer so that it can be efficiently accessed,
modified and manipulated.
It is the fundamental concept in computer science and
used in wide range of application, from simple
script to complex operating systems.
Examples- array, linked list, stack, queue, tree, graph

Primitive Data Structure are basic building block of


data structure. They are the simplest that can be
used to store and manipulate data. It hold a single
value. Int, float, char, double, pointer

Non-Primitive Data Structure are the complex data


structure composed of multiple values or
elements. They are used to manipulate data in a
more organised and structured way.
LINEAR (all elements are arranged either in a row or
column)
Static- Array (has fixed shape and size, elements
are store in a contiguous memory locations. The
size and structure are determined at compile time
and they can’t be changed at runtime.)
Dynamic- Linked list, Stack, Queue
(can change it’s shape and size at runtime, they can
grow or shrink dynamically as elements are
removed or inserted in memory according to their
needs)

NON-LINEAR
(it doesn’t perform a sequence in each item, elements
are connected in a hierarchical, hybrid, multilevel
manner.)
Tree, Graph

OPERATIONS PERFORMED IN DATA STRUCTRE ARE-


Sorting
Searching
Insertion
Deletion
Updation
Transversing
ALGORITHIM is a step by step procedure or formula for
solving a problem or accomplishing a task. It’s a
sequence of well- defined instructions or rules that
specify how to solve a problem in a finite number
of steps.
Characteristics of algorithm:
Finite – it should terminate after a finite number of
steps
Unambiguous – every step should clearly specify next
step
I/P and O/P – it takes input from system and display
output on screen
Effectiveness – it should solve the problem correctly for
all it’s input within a reasonable amount of time

You might also like