Scribd
Upload
6 views

Basics of Data Structure.

Uploaded by

zaiyedtabn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views

Basics of Data Structure.

Uploaded by

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

INTRODUCTION:

1. Data structure affects the design of both structural & functional aspects
of a program. Program=algorithm + Data Structure.

2. You know that a algorithm is a step by step procedure to solve a


particular function.
DIFFERENT TYPES OF
DATA STRUCTURES:
> There are basically two types of data structure :

1.Linear Data Structure, Stack, Queue, Linked List.

2.Non-Linear Data Structure,Tree And Graph.


STACK:
▸ Stack is a linear data structure which works on LIFO order. So that
Last In First Out.

▸ In stack element is always added at top of stack and also removed from
top of the stack.

▸ Stack is useful in recursive function, function calling, mathematical


expression calculation, reversing the string etc.
QUEUE:
▸ Queue is also a linear data structure which works on FIFO order. So
that First In First Out.

▸ In queue element is always added at rear of queue and removed from


front of queue.

▸ Queue applications are in CPU scheduling, Disk Scheduling, IO


Buffers, pipes, file IO.
LINKED LIST:
▸ A linked list is a linear collection of data elements, in which linear
order is not given by their physicalplacement in memory.

▸ Elements may be added in front, end of list as well as middle of list.

▸ Linked List may be use for dyanamic implementation of stack and


queue.
TREE:
▸ A tree is a non linear data structure. A root value and subtrees of children with a parent
node, represented as a set of linked nodes.
▸ Nodes can be added at any different node.

▸ Tree applications includes:

1. Manipulate hierarchical data.

2. Make information easy to search (see tree traversal).

3. Manipulate sorted lists of data.

4. As a workflow for compositing digital images for visual effects.

5. Router algorithms
GRAPH:
▸ A graph is a non linear data structure. A set of items connected by edges. Each item is called
a vertex or node. Formally, a graph is a set of vertices and a binary relation between vertices,
adjacency.
▸ Graph applications:

1. finding shortest routes.

2. social network connections.

3. internet routing.
CONCLUSION:
In conclusion, data structures are a great tool to computer science and the professionals who
utilize them. Data structures have their advantages and disadvantages like everything in our lives.
Only advance users can make changes to data structures, and any problem involving data
structure will need a professional to rectify. Luckily, there are more advantages than there are
disadvantages. Data structures allow information storage, it provides the means for management
of large data like databases, work together and are necessary for efficient algorithms, safe
storage of data, allows easier processing of data, and the use of the internet to access data
anytime. With those odds, this makes it easy to accept that without these applications in our lives,
life would be that much harder when dealing with computer science and even
our day to day tasks.
REFERENCE:
1. GOOGLE.COM.

You might also like