Medi-Caps University, Indore: Computer Science

Medi-Caps University, Indore
Computer Science
Academic Year 2020-21
Bachelor of Computer Application (BCA)
Theory Assignment - I
on
Data Structure
CA3CO07
Submitted to: Submitted by:

Ms. Shruti Pustake Name: Pradhyumn Singh Ginnare
Department of Computer Application Roll No. : SC20CS301042
Medi-Caps University, Indore Class & Sem: BCA 2nd Sem
Q.1 Define the term data structure. Also, Classify the data structure.
Answer: Data Structure can be defined as the group of data elements
which provides an efficient way of storing and organising data in the
computer so that it can be used efficiently. Some examples of Data
Structures are arrays, Linked List, Stack, Queue, etc.
Data Structure Classification
Linear Data Structures: A data structure is called linear if all of its

elements are arranged in the linear order. In linear data structures, the
elements are stored in non-hierarchical way where each element has
the successors and predecessors except the first and last element.
Types of Linear Data Structures are given below:
Arrays: An array is a collection of similar type of data items and each

data item is called an element of the array. The data type of the
element may be any valid data type like char, int, float or double.
The elements of array share the same variable name but each one
carries a different index number known as subscript. The array can be
one dimensional, two dimensional or multidimensional.
The individual elements of the array age are:
age[0], age[1], age[2], age[3],......... age[98], age[99].
Linked List: Linked list is a linear data structure which is used to

maintain a list in the memory. It can be seen as the collection of nodes
stored at non-contiguous memory locations. Each node of the list
contains a pointer to its adjacent node.
Stack: Stack is a linear list in which insertion and deletions are allowed
only at one end, called top.
A stack is an abstract data type (ADT), can be implemented in most of

the programming languages. It is named as stack because it behaves
like a real-world stack, for example: - piles of plates or deck of cards
etc.
Queue: Queue is a linear list in which elements can be inserted only at

one end called rear and deleted only at the other end called front.
It is an abstract data structure, similar to stack. Queue is opened at

both end therefore it follows First-In-First-Out (FIFO) methodology for
storing the data items.
Non Linear Data Structures: This data structure does not form a
sequence i.e. each item or element is connected with two or more
other items in a non-linear arrangement. The data elements are not
arranged in sequential structure.
Types of Non Linear Data Structures are given below:
Trees: Trees are multilevel data structures with a hierarchical

relationship among its elements known as nodes. The bottommost
nodes in the herierchy are called leaf node while the topmost node is
called root node. Each node contains pointers to point adjacent nodes.
Tree data structure is based on the parent-child relationship among

the nodes. Each node in the tree can have more than one children
except the leaf nodes whereas each node can have atmost one parent
except the root node. Trees can be classfied into many categories
which will be discussed later in this tutorial.
Graphs: Graphs can be defined as the pictorial representation of the

set of elements (represented by vertices) connected by the links known
as edges. A graph is different from tree in the sense that a graph can
have cycle while the tree can not have the one.
Q.2 Explain the term:-

1) Linear and Non-linear.
Answer: Linear Data Structures
A Linear data structure have data elements arranged in sequential
manner and each member element is connected to its previous and
next element. This connection helps to traverse a linear data structure
in a single level and in single run. Such data structures are easy to
implement as computer memory is also sequential. Examples of linear
data structures are List, Queue, Stack, Array etc.
Non-linear Data Structures
A non-linear data structure has no set sequence of connecting all its
elements and each element can have multiple paths to connect to
other elements. Such data structures supports multi-level storage and
often cannot be traversed in single run. Such data structures are not
easy to implement but are more efficient in utilizing computer
memory. Examples of non-linear data structures are Tree, BST, Graphs
etc.
Following are the important differences between Linear Data
Structures and Non-linear Data Structures.
Sr. Key Linear Data Non-linear Data

No. Structures Structures
Data Element In linear data In non-linear data

Arrangement structure, data structure, data
elements are elements are
sequentially hierarchically
1 connected and connected and are
each element is present at various
traversable levels.
through a single
run.
Levels In linear data In non-linear data

structure, all data structure, data
2 elements are elements are present
present at a single at multiple levels.
level.
Implementation Linear data Non-linear data

complexity structures are structures are difficult
easier to to understand and
3
implement. implement as
compared to linear
data structures.
4 Traversal Linear data Non-linear data

structures can be structures are not easy
Sr. Key Linear Data Non-linear Data
No. Structures Structures
traversed to traverse and needs

completely in a multiple runs to be
single run. traversed completely.
Memory Linear data Non-linear data

utilization structures are not structures uses
very memory memory very
5
friendly and are efficiently.
not utilizing
memory efficiently.
Time Time complexity of Time complexity of

Complexity linear data non-linear data
6 structure often structure often remain
increases with with increase in size.
increase in size.
Examples Array, List, Queue, Graph, Map, Tree.

7
Stack.
2) Static and Dynamic.

Answer: Static Data structure
In Static data structure the size of the structure is fixed. The content
of the data structure can be modified but without changing the
memory space allocated to it.
Example of Static Data Structures: Array
Dynamic Data Structure
In Dynamic data structure the size of the structure in not fixed and
can be modified during the operations performed on it. Dynamic data
structures are designed to facilitate change of data structures in the
run time.
Example of Dynamic Data Structures: Linked List
Q.3 Explain the operations that can be performed on a data

structure.
Answer: Operations on Data Structures
The basic operations that are performed on data structures are as
follows:
Insertion:Insertion means addition of a new data element in a data
structure.
Deletion: Deletion means removal of a data element from a data
structure if it is found.
Searching: Searching involves searching for the specified data
element in a data structure.
Traversal: Traversal of a data structure means processing all the data
elements present in it.
Sorting: Arranging data elements of a data structure in a specified
order is called sorting.
Merging: Combining elements of two similar data structures to form
a new data structure of the same type, is called merging.

Medi-Caps University, Indore: Computer Science

Uploaded by

Copyright:

Available Formats

Medi-Caps University, Indore: Computer Science

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Medi-Caps University, Indore: Computer Science

Uploaded by

Copyright:

Available Formats

Medi-Caps University, Indore

Academic Year 2020-21

Bachelor of Computer Application (BCA)

Submitted to: Submitted by:

Linear Data Structures: A data structure is called linear if all of its

Types of Linear Data Structures are given below:

Arrays: An array is a collection of similar type of data items and each

The individual elements of the array age are:

age[0], age[1], age[2], age[3],......... age[98], age[99].

Linked List: Linked list is a linear data structure which is used to

A stack is an abstract data type (ADT), can be implemented in most of

Queue: Queue is a linear list in which elements can be inserted only at

It is an abstract data structure, similar to stack. Queue is opened at

Types of Non Linear Data Structures are given below:

Trees: Trees are multilevel data structures with a hierarchical

Tree data structure is based on the parent-child relationship among

Graphs: Graphs can be defined as the pictorial representation of the

Q.2 Explain the term:-

Sr. Key Linear Data Non-linear Data

Data Element In linear data In non-linear data

Levels In linear data In non-linear data

Implementation Linear data Non-linear data

4 Traversal Linear data Non-linear data

traversed to traverse and needs

Memory Linear data Non-linear data

Time Time complexity of Time complexity of

Examples Array, List, Queue, Graph, Map, Tree.

2) Static and Dynamic.

Example of Dynamic Data Structures: Linked List

Q.3 Explain the operations that can be performed on a data

You might also like