Scribd
Upload
4 views7 pages

Data Structures and Algorithms

The document provides an overview of data structures and algorithms, highlighting their importance in computer programming for organizing, storing, and manipulating data. It categorizes data structures into linear and non-linear types and discusses their significance in efficient data management and algorithm development. Additionally, it outlines the criteria for evaluating algorithms based on correctness and efficiency.

Uploaded by

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

Data Structures and Algorithms

The document provides an overview of data structures and algorithms, highlighting their importance in computer programming for organizing, storing, and manipulating data. It categorizes data structures into linear and non-linear types and discusses their significance in efficient data management and algorithm development. Additionally, it outlines the criteria for evaluating algorithms based on correctness and efficiency.

Uploaded by

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

Data Structures and

Algorithms
By Harshitha R
Agenda

▪ Introduction
▪ Types of Data Structures
▪ Why Data Structures
▪ Algorithms
Introduction

▪ Fundamental building blocks of Computer


Programming.
▪ Defines how data should be organized, stored and
manipulated.
▪ Helps in developing efficient and effective algorithms
Types of Data Structures

Basically there are two categories of Data Structures

I. Linear Data Structure


1. Static Data Structure
a. Array
2. Dynamic Data Structure
a. Queue
b. Stack
c. Linked List
II. Non Linear Data Structure
1. Trees
2. Graphs
3. Heaps
4. Hash Maps
Why Data Structure Matters

▪ Efficient Data Management


▪ Performance Optimization
▪ Memory Utilization
▪ Problem Solving
▪ Algorithm Development
▪ Support ADT’s
Algorithms

 Step by Step unambiguous instructions to solve a given


problem.

 There are two main criteria for judging the merits of


algorithms:
 Correctness
 Efficiency

 Types of Analysis
 Worst Case [ Omega]
 Best Case [Big O]
 Average Case [Theta]
Thank You

You might also like