Scribd
Upload
15 views18 pages

CC 104 Lec 1

Data structures and algorithms chapter 1

Uploaded by

Emmanuel J. Domingo
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
15 views18 pages

CC 104 Lec 1

Data structures and algorithms chapter 1

Uploaded by

Emmanuel J. Domingo
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/ 18

CC104

DATA
STRUCTURE
AND
THINGS YOU SHOULD
• what is a programming language?
KNOW
• how the instructions can be coded?
• how these instructions will be understood by the CPU of computer so that
they can be executed?
• Choose any language and try to get basics such as
⚬ Data types & how memory is allocated to them
⚬ Basic arithmetic like add, subtract etc.,
⚬ Basic flows such as if, switch , loops etc.
⚬ how control flows from one part of a program to another
⚬ how to compile & run a program
⚬ environments that support this programming language
• Basic Discrete Math's: Logic, Probability, Combination, Algebra, Geometry
Topology
WHY LEARN DSA?
To get an output you need two main
things:
• Data
To • process the data using procedure you can
Procedure
do:
• Smart way
If • the
Hard way of the problem is big you must
scope
consider:
• How much Space it need?
INTRODUCTION
Data Structures

is about how data can be


stored in different
structures.
DATA STRUCTURES
are a specialized means of organizing and
storing data in computers in such a way
that we can perform operations on the
stored data more efficiently.

Data structures have a wide and diverse


scope of usage across the fields of
Computer Science and Software
Engineering.
DATA STRUCTURE TYPE
• Array
• Link List
• Stacks
• Queues
• Hash Tables
• Trees
• Graphs
An array data structure is a fundamental concept in computer
science that stores a collection of elements in a contiguous
block of memory. It allows for efficient access to elements using
indices and is widely used in programming for organizing and
manipulating data.
Linked List. It is this type of data
system where individual objects are
stored sequentially.
A stack is a basic linear data structure—a
logical entity pictured as a physical stack
or pile of objects.
Queues store item collections sequentially
like stacks, but the operation order must
be “first in, first out” only.
Hash Table. Hashing converts key value
ranges into index ranges within an array.
Trees store item collections in an abstract
hierarchy. They are multilevel data
structures that use nodes.
Graph data structure consists finite
number of nodes known as vertices and
the edges connecting them.
WHERE IS DATA
STRUCTURES AND
ALGORITHMS NEEDED?
• For managing large amounts of data, such as in a social
network or a search engine.
• For scheduling tasks, to decide which task a computer
should do first.
• For planning routes, like in a GPS system to find the
shortest path from A to B.
• For optimizing processes, such as arranging tasks so they
can be completed as quickly as possible.
• For solving complex problems: From finding the best way
to pack a truck to making a computer 'learn' from data.
THANK
YOU
for your attention

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy