Scribd
Upload
3 views2 pages

Data Structure and Algorithms Notes

The document provides an overview of data structures and algorithms, defining data structures as methods for organizing and managing data efficiently, and algorithms as finite sequences of instructions to solve problems. It classifies data structures into linear (e.g., arrays, stacks) and non-linear (e.g., trees, graphs), with further distinctions between static and dynamic types. Additionally, it outlines operations performed on data structures, including creation, insertion, deletion, searching, sorting, updating, and traversing.

Uploaded by

bhumikamuniraju
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views2 pages

Data Structure and Algorithms Notes

The document provides an overview of data structures and algorithms, defining data structures as methods for organizing and managing data efficiently, and algorithms as finite sequences of instructions to solve problems. It classifies data structures into linear (e.g., arrays, stacks) and non-linear (e.g., trees, graphs), with further distinctions between static and dynamic types. Additionally, it outlines operations performed on data structures, including creation, insertion, deletion, searching, sorting, updating, and traversing.

Uploaded by

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

DATA STRUCTURE AND ALGORITHMS

*Introduction to data structure:


1)What is Data Structure?
The way of organizing the data, managing data for efficient uses.
2)What is Algorithm
Finite sequence of step/instruction to solve a problem.

3)Purpose Data Structure?


-> The main aim of data structure is to increase the efficiency of program
And decrease the storage requirement.
-> Manage large amount of data

4)Classification of Data Structure?


 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.
 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.
 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: LinkedList Queue, Stack, etc.

 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.

Operations on DS:
[Link]
[Link]
[Link]
[Link]-->Linear search, Binary Search
[Link]-->Bubble sort, insertion sort, selection sort, quick sort
[Link]
[Link]

You might also like