Data Structure and Algorithms book by Narsimha Karumanchi

Introduction PPT On the basis of Data structure And Algorithms

In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.

“Introduction to Algorithms” ( Third Edition) by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein

Algorithm
Informally, an algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as
output. An algorithm is thus a sequence of computational steps that transform the input into the output. We can also view an algorithm as a tool for solving a well-specified computational problem. The statement of the problem specifies in general terms the desired input/output relationship. The algorithm describes a specific computational proce-dure for achieving that input/output relationship.
For example, we might need to sort a sequence of numbers into nondecreasing order. This problem arises frequently in practice and provides fertile ground for introducing many standard design techniques and analysis tools.

Data Structure And Algorithms Handwritten Notes

What are the applications of data structures?

Data structures are the means of storing data in a very effective manner. Each structure has different ways in which data is inserted, deleted, or queried.

Data structures can be linear or non-linear, based on the way their data is accessed. Linear are those in which data is stored in a sequential manner, and can be accessed in a sequence too. Non-linear are those which hold the data together without focusing on its sequence. The data cannot be arranged or accessed in a sequence.

Following are common DS with their respective applications:

Arrays : Implementation of other data structures, Execution of matrices and vectors, Dynamic memory allocation, Pointer container, Control tables.

Stack: Evaluation of expressions, Backtracking, Runtime memory management, Arrangement of books in a library.

Queue: Here, the data sent need not be received at the same rate at which it was sent. A certain system resource is to be shared between different processes.

Linked-List: Representation of sparse matrices, Non-contiguous data storage, Implementation of non-binary tree or other data structures, Dynamic memory management, Equalizing parenthesis, Symbol tables.

Set: Mapping of data, Common data storage.

Graph: Computer networking, Problem solutions involving 'Depth-First' search or 'Breadth-First' search algorithms, Representation of matrices, Study of molecular interactions in Chemistry.

Tree: Representation of data lists, Quickly accessible data storage, Representation of hierarchal data, Routing of algorithms.

Hash-table: Unique data representation, Implementation of caches, Array association, Locating entries in a table, Representation of objects, Database indexing.

File: Implementation of computer programs, Data comparison, Storage of data having varying data types.

To All My Subscribers Please Share The Channel As Possible as you can🙏🙏

Data Structure and Algorithm
https://t.me/datastructureandalgorithums

https://www.udacity.com/course/data-structures-and-algorithms-in-python--ud513?irclickid=Rok2s-RZ9xyLWntwUx0Mo3QuUkESKpW3LzSATY0&irgwc=1&utm_source=affiliate&utm_medium=ads_r&aff=2327655&utm_term=&utm_campaign=98BE6E0C9C7D11E_98BE6E0C9C7D11E_sub2&utm_content=sub3&adid=786224

Free Course On Intro to Data Structures and Algorithms
byGrow With Google

Share To Your Friends And colleague !!

@datastructureandalgorithums

You have ask any questions join the DSA Forum:-
https://t.me/joinchat/YbOwd6KU6yczNzhl

By Michael T. Goodrich - Data Structures and Algorithms in Java: (fourth) Edition

Advantages of Data Structure
1) It can hold variable of diffrent data type
2) Data Structure allows information storage on hard disks
3) Are necessary for design of efficient algorithms.
4) Allows Safe Storage information on a computer.
5)Data structure usage provides convenience while retrieving the data from storage device.
6)Data structure provides effective and efficient processing of small as well as large amount of data.
7)It is used to implement other data structures like linked lists, stacks, queues, trees, graphs etc.
8)It allows us to re-use the data layout across programs.
9)We can create objects containing different types of attributes.
10)Data structures are used in all areas of computer science such as Artificial Intelligence, graphics, Operating system etc.

Syntax of Data Structure

struct structure_name
{
data_type member1;
data_type member2;
.
.
data_type memeber;
};