Scribd
Upload
40 views

Data Structure: Dr. Subhash Chandra

The document defines data structures as representations of logical relationships between data elements. It classifies data structures into primitive and non-primitive categories. Primitive data structures are basic types directly supported by hardware, while non-primitive structures are more complex structures derived from primitive types, such as lists, stacks, queues, trees and graphs. The document discusses how different data structures suit different algorithms and operations like creation, selection, updating, searching, sorting, merging and deletion.

Uploaded by

Amaar Anvit
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
40 views

Data Structure: Dr. Subhash Chandra

The document defines data structures as representations of logical relationships between data elements. It classifies data structures into primitive and non-primitive categories. Primitive data structures are basic types directly supported by hardware, while non-primitive structures are more complex structures derived from primitive types, such as lists, stacks, queues, trees and graphs. The document discusses how different data structures suit different algorithms and operations like creation, selection, updating, searching, sorting, merging and deletion.

Uploaded by

Amaar Anvit
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/ 9

Data Structure

Dr. Subhash Chandra

Department of Computer Science & Engineering


National Institute of Technology Jamshedpur

August 31, 2020

Dr. Subhash Chandra (NIT Jamshedpur) DS August 31, 2020 1/9


Definition

Data structure is representation of the logical relationship existing


between individual elements of data.
In other words, a data structure is a way of organizing all data items
that considers not only the elements stored but also their relationship
to each other.

Dr. Subhash Chandra (NIT Jamshedpur) DS August 31, 2020 2/9


Introduction

Data structure affects the design of both structural & functional


aspects of a program.
Program = algorithm + Data Structure
A algorithm is a step by step procedure to solve a particular function.
That means, algorithm is a set of instruction written to carry out
certain tasks & the data structure is the way of organizing the data
with their logical relationship retained.
To develop a program of an algorithm, we should select an
appropriate data structure for that algorithm.
Therefore algorithm and its associated data structures from a
program.

Dr. Subhash Chandra (NIT Jamshedpur) DS August 31, 2020 3/9


Classification of Data Structure

Data structure are normally divided into two broad categories:


Primitive Data Structure
Non-Primitive Data Structure

Dr. Subhash Chandra (NIT Jamshedpur) DS August 31, 2020 4/9


Classification of Data Structure

Non-Primitive Data Structure

Dr. Subhash Chandra (NIT Jamshedpur) DS August 31, 2020 5/9


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.

Dr. Subhash Chandra (NIT Jamshedpur) DS August 31, 2020 6/9


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.
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.

Dr. Subhash Chandra (NIT Jamshedpur) DS August 31, 2020 7/9


Non-Primitive Data Structure

The most commonly used operation on data structure are broadly


categorized into following types:
Create
Selection
Updating
Searching
Sorting
Merging
Delete

Dr. Subhash Chandra (NIT Jamshedpur) DS August 31, 2020 8/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.

Dr. Subhash Chandra (NIT Jamshedpur) DS August 31, 2020 9/9

You might also like