KEMBAR78
DSA Intro | PDF | Data Structure | Operating System
0% found this document useful (0 votes)
10 views8 pages

DSA Intro

Data structure

Uploaded by

Park JIMIN
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
0% found this document useful (0 votes)
10 views8 pages

DSA Intro

Data structure

Uploaded by

Park JIMIN
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/ 8

DATA STRUCTURE

INTRODUCTION
Basic Terms related to Data Structure:

Data
The term data is defined as Value or Set of values.
You can store value as variable or constant etc.

Information
Meaningful Value or Data is called as Information.

Record
Collection of data Element.
Eg- Roll No, Name,Marks this are all individual data items.
When we store it collectively, we called it as Record.
Data Structure-
Definition 1-
Organized collection of data in particular formay called data Structure.

Definition 2-
Data Structure is a Technique or Method of study, How the data are interrelated
to each other Logically or Mathematically.

Definition 3-
Its way of Arrangement of Data in Main Memory for Efficient usage of Memory.
NEED OF DATA STRUCTURE
It is Essential for:

1.Efficient Data Management


Organize data for easy access,storage and modification.

2.Faster Processing
Improve Algorithm Performance.(eg-Searching,Sorting etc)

3.Memory Optimization
Use memory efficiently with the right data structure.

4.Reusability
Provide reusable components for various appliations.

InShort,data structure make programs more efficient, organizes and scalable.


TYPES OF DATA STRUCTURE
Primitive Non-Primitive
-Supported by any programming language.
Non-linear
Linear DS
-Eg- Integer(int), Float/Double,char,Boolean,String DS

-Arrays
-Trees
-Stacks
-Graphs
-Queues
-Sets Static Dynamic
-Linked list
-Tables

Eg-Array Eg-Linked
list
Non-Primitive- It is more complex and used to store multiple
values or complex data.

Linear Data Structure-


Organize their data elements in a linear fashion,where data elements are attached
one after the other.
Eg-array, stack

Non-Linear Data Structure-


Not organize their data elements in a Linear or sequential Fashion.
Eg- Trees, Graph

Static Data Structure-


Data structure created with fixed sized data structure like array.

Dynamic Data Structure-


Data structure created with variable size data structure like linked list.
APPLICATIONS OF DATA STRUCTURE
1.Operating Systems
Use- Building kernels.
Ex- Linux is written in C, UNIX was originally developed in C.

2.Embedded Systems
Use- Programming micro controllers and Hardware Devices.
Ex- Smart TVs, IoT devices, Robotics.

3.Game Development
Use- Creating game engines.
Ex- Core of many Games.

4.Compilers and Interpreters


Use- Writing compilers,interpreters
Ex-

5.Device Drivers
Use-Communication between OS and hardware devices
Ex- Printers, Keyboard,Mouse
OPERATIONS ON DATA STRUCTURE
1.Traversing
Used to access each data item exactly once.

2.Searching
Used to find out the Location of the data item, If it exits in the given
Collection of data items.

3.Inserting
Used to add a new data item in the given collection of data items.

4.Deleting
Used to delete an existing data item from given collection.

5.Sorting
Used to aarange the data items in some order. Like ascending or
descending order.

6.Merging
Used to combine the data items of two sorted files into single file in sorted

You might also like