Scribd
Upload
44 views5 pages

Introduction To Data Structures and Algorithms

The document introduces data structures and algorithms, explaining that data structures organize data to perform operations effectively while algorithms provide instructions to solve problems. It describes primitive data structures like integers and non-primitive structures including linked lists, trees, graphs, and stacks.

Uploaded by

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

Introduction To Data Structures and Algorithms

The document introduces data structures and algorithms, explaining that data structures organize data to perform operations effectively while algorithms provide instructions to solve problems. It describes primitive data structures like integers and non-primitive structures including linked lists, trees, graphs, and stacks.

Uploaded by

Bharatam Gyanam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

INTRODUCTION TO

DATA STRUCTURES
AND ALGORITHMS
Presented by: Bharatam Gyanam
INTRODUCTION
The data structure is a method of collecting and
organizing data so that we can perform
operations on it effectively. Data Structure is the
process of rendering data elements in terms of
some relationship in order to improve
organization and storage. For example, we have
some information about a programmer named
"Happy" who is 23 years old. In this case, "Happy"
is of the String data type, and 23 is of the integer
data type.
WHAT IS AN
ALGORITHM
An algorithm is a finite set of instructions or logic
written to perform a specific predefined task. The
core logic (solution) of a problem, which can be
expressed either as an informal high-level description
as pseudocode or using a flowchart, is expressed as
an algorithm.

1. Input- The algorithm should receive 0 or more


inputs from outside sources.
2. Output- At least one output should be obtained.
TYPES OF DATA
STRUCTURES
PRIMITIVE DATA NON-PRIMITIVE DATA
STRUCTURES STRUCTURES
The List of Non-Primitive Data Structures
Integers, floats, Booleans, Chars, and so are stated below:
on are all data structures. They are 1. Linked List
referred to as Primitive Data Structures. 2. Tree
3. Graph
4. Stack
CONTACT US
www.bharatamgyanam.com

contact@bharatamgyanam.com

LINK TO BLOG

You might also like