Scribd
Upload
24 views12 pages

Data-Structures-Lecture 1

This document discusses data structures and their classification. It defines data structures as organized data to be used effectively by computers. Data structures are divided into primitive and non-primitive types. Primitive structures like integers are basic types directly used by machines, while non-primitive structures like lists and trees are built from primitive types. Non-primitive structures emphasize organizing related data and consider operations to be performed.

Uploaded by

Zakir Hossen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
24 views12 pages

Data-Structures-Lecture 1

This document discusses data structures and their classification. It defines data structures as organized data to be used effectively by computers. Data structures are divided into primitive and non-primitive types. Primitive structures like integers are basic types directly used by machines, while non-primitive structures like lists and trees are built from primitive types. Non-primitive structures emphasize organizing related data and consider operations to be performed.

Uploaded by

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

Data Structures

Class Lecture-1

08/15/20 1
Definition

• A data structure is a particular way of


organizing data in a computer so that it can
be used effectively.

08/15/20 2
Introduction

• Data structure affects the design of both


structural & functional aspects of a program.

• You know that a algorithm is a step by step


procedure to solve a particular function.

• Program=algorithm + Data Structure

08/15/20 3
Classification of Data Structure
• Data structure are normally divided into two
broad categories:
– Primitive Data Structure
– Non-Primitive Data Structure

4
Classification of Data Structure

Data structure

Primitive DS Non-Primitive DS

Integer Float Character Pointer

5
Classification of Data Structure

Non-Primitive DS

Linear List Non-Linear List

Array Queue Graph Trees

Link List Stack


6
Primitive Data Structure
• There are basic structures and directly
operated upon by the machine instructions.
• In general, there are different representation on
different computers.
• Integer, Floating-point number, Character
constants, string constants, pointers etc, fall in
this category.

7
Non-Primitive Data Structure
• There are more sophisticated data structures.
• These are derived from the primitive data
structures.
• The non-primitive data structures emphasize
on structuring of a group of homogeneous
(same type) or heterogeneous (different type)
data items.

8
Non-Primitive Data Structure
• Lists, Stack, Queue, Tree, Graph are example
of non-primitive data structures.
• The design of an efficient data structure must
take operations to be performed on the data
structure.

9
Different between them
• A primitive data structure is generally a basic
structure that is usually built into the language,
such as an integer, a float.
• A non-primitive data structure is built out of
primitive data structures linked together in
meaningful ways, such as a or a linked-list,
binary search tree, AVL Tree, graph etc.

10
Basic Operations
• Insert − Algorithm to insert item in a data
structure.

• Update − Algorithm to update an existing item


in a data structure.

• Delete − Algorithm to delete an existing item


from a data structure.
11
• Traversing- Traversal is the process of visiting
each and every node of a list in systematic
manner.
• Searching- It finds the presence of a desired data
item.
• Sorting- Sorting is the process of arranging all
data items in a data structure in a particular order.
• Merging- Combining data items of two different
sorted list into a single sorted list.
12

You might also like