Scribd
Upload
10 views2 pages

Unit-3 Introduction - Data Structure

Data structures are logical or mathematical models for organizing data in computer memory, categorized into primitive and non-primitive types. Primitive data structures include basic data types like integers and characters, while non-primitive structures, such as arrays and linked lists, are built from primitive types. Non-linear data structures, like graphs and trees, store elements in a non-contiguous manner, contrasting with linear structures that store elements sequentially.

Uploaded by

espinozaden45
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
10 views2 pages

Unit-3 Introduction - Data Structure

Data structures are logical or mathematical models for organizing data in computer memory, categorized into primitive and non-primitive types. Primitive data structures include basic data types like integers and characters, while non-primitive structures, such as arrays and linked lists, are built from primitive types. Non-linear data structures, like graphs and trees, store elements in a non-contiguous manner, contrasting with linear structures that store elements sequentially.

Uploaded by

espinozaden45
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/ 2

DS - (304) UNIT-1: Data Structure By : STP

What is Data Structure?

Data may be organized in different ways in computer memory. The logical or


mathematical model of particular organization of data in computer memory is called
data structure.
Or

“Data structure is collection of one or more variable possibly of different type,


organized into a single record with single name for easy reference and
manipulation.”

Data Structure

Primitive Non Primitive

int, float, char,


pointer etc.
Linear Non Linear

Array Stack Queue Linked Graph Tree Table Sets


List

There are two types of data structure:

1) Primitive data structure:

The most elementary data type or structure is called primitive data structure. They
are directly operated by machine level instruction. There storage representation is
defined at machine level. It may be different for each machine.

Example: integer, float, character, double, pointer. With primitive data structure
some common operation are creating data structure, destroying the data structure
and assignment.

They are smallest unit of data and therefore cannot be further decomposed.

2) Non-primitive Data structure:

The data structure that is made up by primitive data structure is called non primitive
data structure. They are not directly operated by machine language instruction.

Page 1 of 2
DS - (304) UNIT-1: Data Structure By : STP

Example: array, structure, file linked list etc.

There are two non primitive data structure:

1) Linear data structure:-

These data structures have both sequential storage allocation, as well as linked
allocation. This means that the elements are store sequentially one after another.
That means they are stored both physical & logically.

Array: An ordered set of a fixed number of objects. No insertion deletion possible


but searching & sorting is faster.

Stack: An important subset of a list, which allows insertion & deletion at only one
end, known as stack.

Queue: The data structure which permits the insertion at one end and deletion at
another end, known as queue.

Linked List: A simple way to represent linear list to expand each node with a link or
point to next node, is called linked list.

Start 1 2 3 End

2) Non linear data structure:-

The data structure in which the elements are not stored in contiguous fashion is
called non-linear data structure. In this case, the elements are stored randomly in
computer’s memory.

Graph: A tree is actually an instance of more general category called graph. A tree
can be vied as restricted graph.

Tree: A tree consist of nodes connected by edge, the node represent by circle and
edge as lives connecting to circle.

Page 2 of 2

You might also like