Scribd
Upload
30 views

L2 - CD 303 Classification of Data Structure

This document discusses the classification of data structures. It defines primitive data structures as basic structures that are directly operated on by machine instructions, such as integers, floats, characters, and pointers. Non-primitive data structures are more sophisticated structures derived from primitive ones that emphasize structuring groups of homogeneous or heterogeneous data items, such as lists, files, stacks, queues, graphs, and trees. Various data structure types are then defined, with examples and explanations of integers, floats, characters, pointers, lists, files, stacks, queues, graphs, and trees.

Uploaded by

Aryaman Bhatnagar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
30 views

L2 - CD 303 Classification of Data Structure

This document discusses the classification of data structures. It defines primitive data structures as basic structures that are directly operated on by machine instructions, such as integers, floats, characters, and pointers. Non-primitive data structures are more sophisticated structures derived from primitive ones that emphasize structuring groups of homogeneous or heterogeneous data items, such as lists, files, stacks, queues, graphs, and trees. Various data structure types are then defined, with examples and explanations of integers, floats, characters, pointers, lists, files, stacks, queues, graphs, and trees.

Uploaded by

Aryaman Bhatnagar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Topic- Classification of Data Structure

Subject Name/Code- Data Structure/CD 303


CSE- Data Science

Classification of Data Structure:


1. Primitive Data Structures
2. Non-Primitive Data Structures

What is Primitive Data Structures?


These are basic structures and are directly operated upon by the machine
instructions.

These to general have different representations on different computers, Integer,


Floating point numbers, character-constants, string constants, pointers, etc.
Example of Primitive Data Structures with explanation
 Float
 Integer
 Character
 Pointer

What is Non-Primitive Data Structures?


Generally, language provides a way of defining our own data type. such data
types are kept under the non-primitive data structure category.

therefore, these are the more sophisticated data structure. These are derived from
the primitive data structure.
The non-primitive data structures emphasize the structuring of a group
of homogeneous or heterogeneous data items.
What is Float?

When you listen to float in the data structure, the first thing which comes in
mind, what is mean of float?

What is an Integer?

An integer defined as a whole number, not a fraction number, the integer number
can be positive, negative or zero number. such as 10, 11, 0, -7, -67 and 5148 are
all integers. integer number can’t have decimal places.

What is Character?

Character in the data structure represents letter and symbol such as a, B, f, R, “.”
, “-” and whitespace. therefore, it can store the basic character set.

What is Pointer?

A pointer represents a storage location in memory (RAM). in the RAM contains


many cells and the values are stored in these cells. each cell in memory is 1 byte
and the memory address is always an unsigned integer, therefore, each cell has a
unique address to identify it.
What are Lists?

A Lists is defined as it is a collection of a variable number of data items. lists or


sequence is an abstract data type, which always represents a countable number of
ordered values, Every list element contains at least two fields, one field is used
for storing the data and another filed is used for storing the address of the next
element.

What is Files?

Files contain information, and this information stored permanently in the Hard
Disk and Floppy Disk, this disk also knows as a secondary storage device. you
can store a little byte of data and a large amount of data in secondary devices.

What is Stacks?

A stack is a basic data structure, it’s defined as an ordered collection of elements


represented by a real physical stack or pile. liner data structure features insertion
and deletion of items take place at one end called top of the stack.
What are Queues?

Queue defined (FIFO) First In First Out type of data structure. Queues are also
the part of non-primitive linear data structure, therefore in Queues process, we
can insert an element in a queue from the REAR end and delete an element from
the FRONT end only.

What are the Graphs?


There are different types of graphs :
Connected Graph
Non-Connected Graph
Directed Graph
Non-Directed Graph
therefore, graphs are the non-linear and non-primitive type of data structure.
What are the trees?

In the classification of data structure, Trees also come in the non-primitive and
non-linear category data structure, using tree we can represent a hierarchical
relationship between the data elements.

You might also like