NAME AAMIR MUHAMMAD JUNAID

ROLL NO 216141

DEPARTMENT: COMPUTER SCIENCE

SEMESTER 3rd

SUBJECT DATA STRUCTURE AND ALGORITHM

DATE 12/10/2022

SUBMITTED TO Dr. MUZAMMIL HUSSAIN

Data Structure
Data structure can be defined as the group of data elements which provides an efficient way of storing
and organizing data in the computer memory so that can be used efficiently. There two types of data
structures.

 Linear Data Structure

 Non-Linear Data Structure

Linear Data Structure:

Data structure where data elements are arranged sequentially or linearly where each and
every element is attached to its previous and next adjacent is called a linear data structure.
In linear data structure, single level is involved. Therefore, we can traverse all the elements in
single run only. Linear data structures are easy to implement because computer memory is
arranged in a linear way. Its examples are array, stack, queue, linked list, etc.

1. Array
The array is a type of data structure that stores elements of the same type. These are the
most basic and fundamental data structures. Data stored in each position of an array is given
a positive value called the index of the element. The index helps in identifying the location of
the elements in an array.
If supposedly we have to store some data i.e. the price of ten cars, then we can create a
structure of an array and store all the integers together. This doesn’t need creating ten
separate integer variables. Therefore, the lines in a code are reduced and memory is saved.
The index value starts with 0 for the first element in the case of an array.
EXAMPLE
 2. Stack
The data structure follows the rule of LIFO (Last In-First Out) where the data last added
element is removed first. Push operation is used for adding an element of data on a stack and
the pop operation is used for deleting the data from the stack. This can be explained by the
example of books stacked together. In order to access the last book, all the books placed on
top of the last book have to be safely removed.
EXAMPLE

Advantage
Stack is easy to learn and implement for beginners. Stacks are used to solving problems that
work on recursion. It allows you to control how memory is allocated and deallocated.

Disadvantages of Stack:
 Stack memory is of limited size.
 The total of size of the stack must be defined before.
 If too many objects are created then it can lead to stack overflow.
 Random accessing is not possible in stack.
 If the stack falls outside the memory it can lead to abnormal termination

3. Queue
This structure is almost similar to the stack as the data is stored sequentially. The difference is
that the queue data structure follows FIFO which is the rule of First In-First Out where the first
added element is to exit the queue first. Front and rear are the two terms to be used in a
queue.
Enqueue is the insertion operation and dequeue is the deletion operation. The former is
performed at the end of the queue and the latter is performed at the start end. The data
structure might be explained with the example of people queuing up to ride a bus. The first
person in the line will get the chance to exit the queue while the last person will be the last to
exit.
EXAMPLE
 Advantages of Queue:
 A large amount of data can be managed efficiently with ease.
 Operations such as insertion and deletion can be performed with ease as it follows the
first in first out rule.
 Queues are useful when a particular service is used by multiple consumers.
Disadvantages of Queue:
 The operations such as insertion and deletion of elements from the middle are time
consuming.
 Limited Space.
 In a classical queue, a new element can only be inserted when the existing elements
are deleted from the queue.
 Searching an element takes O(N) time

4.Linked List
Linked lists are the types where the data is stored in the form of nodes which consist of an
element of data and a pointer. The use of the pointer is that it points or directs to the node
which is next to the element in the sequence. The data stored in a linked list might be of any
form, strings, numbers, or characters. Both sorted and unsorted data can be stored in a linked
list along with unique or duplicate elements.

Advantage
The advantages of linked lists include: Overflow can never occur unless the memory is
actually full. Insertions and deletions are easier than for contiguous (array) lists. With large
records, moving pointers is easier and faster than moving the items themselves.

Disadvantages of Linked Lists:

Use of pointers is more in linked lists hence, complex and requires more memory.
Searching an element is costly and requires O(n) time complexity. Traversing is more time
consuming and reverse traversing is not possible in singly linked lists.

Non-linear Data Structure:

Data structures where data elements are not arranged sequentially or linearly are called non-
linear data structures. In a non-linear data structure, single level is not involved. Therefore,
we can’t traverse all the elements in single run only. Non-linear data structures are not easy to
implement in comparison to linear data structure. It utilizes computer memory efficiently in
comparison to a linear data structure. Its examples are trees and graphs.

1. Trees
A tree data structure consists of various nodes linked together. The structure of a tree is
hierarchical that forms a relationship like that of the parent and a child. The structure of the
tree is formed in a way that there is one connection for every parent-child node relationship.
Only one path should exist between the root to a node in the tree. Various types of trees are
present based on their structures like AVL tree, binary tree, binary search tree, etc.
EXAMPLE

Advantages Of Tree Data Structure

Provides a hierarchical way of storing data. Reflects structural relationship in a data set.
Allows insertion, deletion and searching operations that yield results faster than an array or
linked list. Provides a flexible way to hold and move data.

Disadvantage:
A small change in the data can cause a large change in the structure of the decision tree
causing instability. For a Decision tree sometimes calculation can go far more complex
compared to other algorithms. Decision tree often involves higher time to train the model

2. Graph
Graphs are those types of non-linear data structures which consist of a definite quantity of
vertices and edges. The vertices or the nodes are involved in storing data and the edges show
the vertices relationship. The difference between a graph to a tree is that in a graph there are
no specific rules for the connection of nodes. Real-life problems like social networks,
telephone networks, etc. can be represented through the graphs.
 EXAMPLE

Advantage
The main advantage of graph data structure is that it allows you to apply all the computer
science algorithms related to graphs. Once you figured out how to represent your domain
logic as graph you can apply all the power of graph algorithms on solving your problem.

Disadvantages of Graph:
 Graphs use lots of pointers which can be complex to handle.
 It can have large memory complexity.
 If the graph is represented with an adjacency matrix then it does not allow parallel edges and
multiplication of the graph is also difficult