COURSE TITLE: BUSINESS PROGRAMMNG
TOPIC: Data Structures & Algorithm
Data structures are the fundamental building blocks of computer
programming. They define how data is organized, stored, and
manipulated within a program. Understanding data structures is very
important for developing efficient and effective algorithm
What is Data Structure?
A data structure is a storage that is used to store and organize data. It
is a way of arranging data on a computer so that it can be accessed
and updated efficiently.
A data structure is not only used for organizing the data. It is also
used for processing, retrieving, and storing data. There are different
basic and advanced types of data structures that are used in almost
every program or software system that has been developed. So we
must have good knowledge about data structures.
What is an Algorithm?
An algorithm is a finite sequence of well-defined instructions that
can be used to solve a computational problem. It provides a step-by-
step procedure that convert an input into a desired output.
Algorithms typically follow a logical structure:
Input: The algorithm receives input data.
Processing: The algorithm performs a series of operations on
the input data.
Output: The algorithm produces the desired output.
Classification of Data Structure
Classification of Data Structure
1. Linear Data Structure: Data structure in which data elements
are arranged sequentially or linearly, where each element is
attached to its previous and next adjacent elements, is called a
linear data structure.
Example: Array, Stack, Queue, Linked List, etc.
2. Static Data Structure: Static data structure has a fixed
memory size. It is easier to access the elements in a static data
structure.
Example: array.
3. Dynamic Data Structure: In dynamic data structure, the size
is not fixed. It can be randomly updated during the runtime which
may be considered efficient concerning the memory (space)
complexity of the code.
Example: Queue, Stack, etc.
4. Non-Linear Data Structure: Data structures where data
elements are not placed sequentially or linearly are called non-
linear data structures. In a non-linear data structure, we can’t
traverse all the elements in a single run only.
Examples: Trees and Graphs.
1. Array:
Array is a linear data structure that stores a collection of elements of
the same data type. Elements are allocated contiguous memory,
allowing for constant-time access. Each element has a
unique index number.
2. Matrix/Grid
Matrix is a two-dimensional array of elements, arranged
in rows and columns. It is represented as a rectangular grid, with
each element at the intersection of a row and column.
3. String
String is a sequence of characters, typically used to represent text. It
is considered a data type that allows for the manipulation and
processing of textual data in computer programs.
4. Stack
Stack is a linear data structure that follows the Last In, First Out
(LIFO) principle. Stacks play an important role in managing function
calls, memory, and are widely used in algorithms, web development,
and systems like compilers and browsers.
5. Queue
Queue is a linear data structure that follows the First In, First Out
(FIFO) principle. Queues play an important role in managing tasks or
data in order, scheduling and message handling systems.
6. Linked List
Linked list is a linear data structure that stores data in nodes, which
are connected by pointers. Unlike arrays, nodes of linked lists are not
stored in contiguous memory locations and can only be accessed
sequentially, starting from the head of list.
7. Hash
Hashing is a technique that generates a fixed-size output (hash value)
from an input of variable size using mathematical formulas
called hash functions. Hashing is commonly used in data structures
for efficient searching, insertion and deletion and plays a key role in
software applications like secure data retrieval, password
storage, cryptography, digital signatures, etc.
8. Tree
Tree is a non-linear, hierarchical data structure consisting of nodes
connected by edges, with a top node called the root and nodes having
child nodes. It is widely used in file systems, databases, decision-
making algorithms, etc.
9. Binary Tree
Binary Tree is a non-linear and hierarchical data structure where
each node has at most two children referred to as the left child and
the right child.
10. Binary Search Tree
Binary Search Tree is a type of binary tree in which each
node's left subtree contains only values smaller than the node, and
each node's right subtree contains only values greater than the node.
This property applies recursively, meaning that for every node, its left
and right subtrees must also satisfy the conditions of a valid Binary
Search Tree.
11. Heap
Heap is a complete binary tree data structure that satisfies the heap
property. Heaps are usually used to implement priority queues,
where the smallest or largest element is always at the root of the tree.
12. Graph
Graph is a non-linear data structure consisting of a finite set
of vertices(or nodes) and a set of edges(or links)that connect a pair of
nodes. Graphs are widely used to represent relationships between
entities.
