Scribd
Upload
41 views

1.01 Introduction To Fundamentals of Data Structures

This document provides an introduction to data structures and their fundamentals. It defines data as facts and figures stored in a particular format. Data items can be elementary, like student ID, or grouped, like name and address. A data structure is a specific way to organize data in computer memory for efficient use. There are two main types of data structures - linear and non-linear. Linear structures like arrays and linked lists order elements, while non-linear structures like trees and graphs represent hierarchical or paired relationships between elements. Characteristics of data structures include the data types they use and how operators and functions expect arguments and return results of fixed types.

Uploaded by

Elamparithi Maniezhilan
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
41 views

1.01 Introduction To Fundamentals of Data Structures

This document provides an introduction to data structures and their fundamentals. It defines data as facts and figures stored in a particular format. Data items can be elementary, like student ID, or grouped, like name and address. A data structure is a specific way to organize data in computer memory for efficient use. There are two main types of data structures - linear and non-linear. Linear structures like arrays and linked lists order elements, while non-linear structures like trees and graphs represent hierarchical or paired relationships between elements. Characteristics of data structures include the data types they use and how operators and functions expect arguments and return results of fixed types.

Uploaded by

Elamparithi Maniezhilan
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

Class: II MCA Course: Advanced Data Structures and Algorithms

1.01 Introduction to Fundamentals of Data Structures:


In the modern world, Data and its information is an essential part, and various implementations are
being made to store in different ways. Data are just a collection of facts and figures, or you can say
data are values or a set of values that are in a particular format. A data item refers to a single set of
values. Data items are then further categorized into sub-items which are the group of items which
are not being called a plain elementary form of items. Let us take an example where the name of
the student may be divided into three sub-items namely: first name, middle name and last name.
But the ID that is assigned to a student would normally be considered as a single item

In the example mentioned above such as ID, Age, Gender, First, Middle, Last, Street, Area, etc. are
elementary data items, whereas (Name, Address) is group data items.

What is Data Structure?

In computer terms, a data structure is a Specific way to store and organize data in a computer's
memory so that these data can be used efficiently later. Data may be arranged in many different
ways such as the logical or mathematical model for a particular organization of data is termed as a
data structure. The variety of a specific data model depends on the two factors -

 Firstly, it must be loaded enough in structure to reflect the actual relationships of the data
with the real world object.
 Secondly, the formation should be simple enough so that anyone can efficiently process
the data each time it is necessary.

Categories of Data structures


The data structure can be subdivided into major types:
 Linear Data Structure
 Non-linear Data Structure

1 | Page Notes of Lessons


Class: II MCA Course: Advanced Data Structures and Algorithms

Linear Data Structures:


A data structure is said to be linear if its elements combine to form any specific order. There are
two techniques of representing such linear structure within memory.

The first way is to provide the linear relationships among all the elements represented using linear
memory location. These linear structures are termed as arrays.

The second technique is to provide a linear relationship among all the elements represented by
using the concept of pointers or links. These linear structures are termed as linked lists.

The common examples of the linear data structure are:

 Arrays
 Queues
 Stacks
 Linked lists

This structure is mostly used for representing data that contains a hierarchical relationship among
various elements.

Examples of Non-Linear Data Structures are listed below:

 Graphs
 the family of trees and
 table of contents

Tree: In this case, data often contain a hierarchical relationship among various elements. The data
structure that reflects this relationship is termed as a rooted tree graph or a tree.

Graph: In this case, data sometimes hold a relationship between the pairs of elements which is not
necessarily following the hierarchical structure. Such a data structure is termed as a Graph.

Characteristics of Data Structures


 The data type chooses the set of values to which a constant will belong and which may be
assumed by a variable or an expression within a program or which may be produced by an
operator or a function.
 The type of a value indicated by a constant or a variable or expression may be resulting from
its form or its declaration without the need of executing the computational process.
 Each operator and function expects some arguments of a fixed type which is represented by
assigning a data type to those specific sets of arguments and yields a result of a fixed type. If
an operator declares arguments of several types such as the '+' will be used for addition of both
integers and real numbers, then the type of the answer can be determined from specific
language rules.

2 | Page Notes of Lessons

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy