DATA STRUCTURES
Data
Management
- It includes activities like data collection organisation of data in appropriate structures, accessing the data, etc.
Data
Structures
- It is a group of data elements that are put together in one name to define a way of storing and organising data in computer memory so that it can be used efficiently.
Example: - Array, Stack, Queues, Linked Lists, Tree,
Graph, Hash Tables.
Primitive
and Non Primitive Data Types
Primitive
|
Non
Primitive
|
The
primitive data types are the basic data types that are directly operated upon
by machine level instructions and are available in most of the programming
languages. The primitive data types are used to represent single values.
|
The
data types that are derived from primitive data types are known as
non-Primitive data types. These data types are used to store group of values.
|
The
primitive data types are:
Integer,
Float and Double, Character, String, Boolean etc
|
The
non-primitive data types are:
Arrays,
Structure, Union, Linked list, Stacks, Queue etc
|
Linear and
Non Linear Data Structures
Linear
Data Structures
|
Non Linear
Data Structures
|
In
linear data structure the elements are stored in sequential order.
|
Elements
are stored based on the hierarchical relationship among the data.
|
The
linear data structures are:
Array,
Linked List, Stack, Queue
|
The
following are some of the Non-Linear data structure:
Trees,
Graphs
|
No comments
Post a Comment