Introduction to Data

Structures

https://www.essaycorp.com/data-structure-assignment-help.html

TABLE OF CONTENTS
WHAT IS DATA STRUCTURE ?
DATA STRUCTURE OPERATIONS
TYPES OF DATA STRUCTURES
LINEAR DATA STRUCTURES
ARRAY
STACK
QUEUE
LINKED LISTS
NON-LINEAR DATA STRUCTURES
TREE
GRAPH

WHAT IS DATA STRUCTURE ?

A data structure is a specialized method of
organizing and storing data. Data structures are
the programmatic way of storing data so that
data can be used efficiently.

WHAT IS DATA STRUCTURE ?

Computer programmers decide which data
structures to use based on the nature of the
data and the processes that need to be
performed on that data.

DATA STRUCTURE OPERATIONS

The various Data Structure Operations are:
TRAVERSING Access each record exactly
once, so that certain item in the record may be
processed.
SEARCHING Finding the location of the record
with a given key value.
INSERTION Add a new record to the structure.
DELETION Removing a record from the
structure.

TYPES OF DATA STRUCTURE

Data structure is of two types:
LINEAR DATA STRUCTUES
NON-LINEAR DATA STRUCTURES

LINEAR DATA STRUCTURES

ARRAY
STACK
QUEUE
LINKED LISTS

NON-LINEAR DATA STRUCTURES

TREES
GRAPHS

LINEAR DATA STRUCTURES

ARRAYS
An Array is an aggregate Data Structure
that is designed to store a group of objects
of the same or different types.
Arrays can hold primitives as well as
references.
Array is the most efficient Data Structure
for storing a accessing a sequence of
objects.

STACK
Stack is an ordered list of similar data types.
Stack is a LIFO structure (Last In First Out).
Both insertion and deletion are allowed at
only one end of stack called Top.
Push() function is used to insert new
elements into stack.
Pop() is used to delete an element from the
stack.

QUEUE
Queue is also an ordered list of similar data
types.
Queue is a FIFO structure (First In First Out).
Element inserted first will also be removed
first.
Enqueue() is used to add an element into
queue.
Dequeue() is used to remove an element
from queue.

LINKED LISTS

A linked list is a linear data structure.

Each element of a list is called a Node.
Linked List is comprising of two items :
Data
Reference to the next node
The entry point into a linked list is called the
head of the list.

NON-LINEAR DATA STRUCTURE

TREES
A tree is a non-linear data structure .
It is organized like an upside down tree.
A tree is made up of nodes, vertices and
edges without any cycle.
Each spot on the tree is called a node.
The single node at the top is called root
node.
Tree without nodes is called a null or empty
tree.

GRAPHS
A graph is a finite set of vertices, nodes or
points.
It is a set of unordered pairs of vertices for an
undirected graph or a set of ordered pairs for
a directed graph.

Thanks for your visit.

https://www.essaycorp.com/data-structure-assignment-help.html