Unit 1: Introduction to Data Structures
Unit 1
INTRODUCTION TO DATA STRUCTURES
Introduction
Data structures and algorithms as used in computer
programming are ways in which data is arranged in your
computer's memory (or stored on disk). Algorithms are the
procedures a software program uses to manipulate the data in
these structures.
This unit is designed to discuss the basic concepts and
terminologies in data structure as well as its hierarchy, structures
and uses. In this way, you come to understand better the
importance of studying data structures as well as its importance
in structured programming.
Unit Learning Outcomes
At the end of the unit, you will be able to:
a. define what a data structure is;
b. cite the importance of studying data structures;
c. cite the importance of data structures in structured
programming;
d. enumerate the different types and sub-types of data
structures; and
e. demonstrate appreciation on the significance of data
structure in programming.
Topic 1: Data Structures: An Introduction
Time Allotment: 3 Hours
Learning Objectives
At the end of the session, you will be able to:
a. define and understand data structures;
b. differentiate primitive data type and non-primitive data
type;
1
Unit 1: Introduction to Data Structures
c. differentiate Linear and Non Linear Data Structure;
d. enumerate Data Structure Operations; and
e. appreciate the uses and importance of Data Structure in
programming.
Activating Prior Knowledge
What is DATA STRUCTURE?
K W L
(What You Know) (What You want to (What You Learned and
Learn) still Want to Learn)
Presentation of Contents
What is Data Structure?
• In computer science, a data structure is a data
organization, management, and storage format that
enables efficient access and modification. More precisely,
a data structure is a collection of data values, the
relationships among them, and the functions or operations
that can be applied to the data.
• It is a way in which data are stored for efficient search and
retrieval. Efficiency in this context refers to the ability to find
and manipulate data quickly and with the minimum
consumption of computer and network resources.
2
Unit 1: Introduction to Data Structures
➢ A primitive data type is one that fits the base architecture
of the underlying computer such as int, float, and pointer,
and all of the variations, thereof such as char, short, long,
unsigned, float, double, are primitive data type.
➢ Primitive data are only single values, they have no special
capabilities. Primitive data type are predefined data type.
✓ A non-primitive data type is something else such as an
array structure or class.
✓ Non primitive data type are based on class. it is also called
reference data type
✓ The non-primitive data types are used to store a group of
values.
3
Unit 1: Introduction to Data Structures
Two Types of Non-Primitive Data Structures
Linear Data Structure
• A data structure is said to be linear if its elements form a
sequence or a linear list.
• A linear data structure traverses the data elements
sequentially, in which only one data element can directly
be reached.
Non-Linear Data Structures
• Every data item is attached to several other data items in
a way that is specific for reflecting relationships. The data
items are not arranged in a sequential structure.
Difference Between Linear and Non Linear Data Structure
Linear Data Structure Non-Linear Data Structure
Every item is related to its previous Every item is attached with
and next item. many other items.
Data is arranged in linear Data is not arranged in
sequence. sequence.
Data items can be traversed in a Data cannot be traversed in a
single run. single run.
Implementation is Easy. Implementation is Difficult.
Operations on Data Structures
➢ Traversal: travel through the data structure
➢ Search: traversal through the data structure for a given
element
➢ Insertion: adding new elements to the data structure
➢ Deletion: Removing an element from the data structure
➢ Sorting: arranging the elements in some type of order
➢ Merging: Combining two similar data structures into one
Uses of data structures
• In general, data structures are used to implement the
physical forms of abstract data types(ADT)
• In computer science, an abstract data type is a
mathematical model for data types, where a data type is
defined by its behavior from the point of view of a user of
4
Unit 1: Introduction to Data Structures
the data, specifically in terms of possible values, possible
operations on data of this type, and the behavior of these
operations.
Importance of data structures
Data structures are essential for managing large amounts
of data, such as information kept in databases or indexing
services, efficiently. Proper maintenance of data systems requires
the identification of memory allocation, data interrelationships
and data processes, all of which data structures help with.
REFLECTION
Answer briefly the given questions based on your own
understanding. Write your answer on the space provided.
After knowing the importance and uses of Data Structure, what
do you think is the essence of studying Data Structure as an
Information Technology/Computer Science Student? What
benefit can you derive from it especially in computer
programming?
5
Unit 1: Introduction to Data Structures
Summary of the Unit
Data structure is a data organization, management, and storage
format that enables efficient access and modification. More
precisely, a data structure is a collection of data values, the
relationships among them, and the functions or operations that
can be applied to the data.
A primitive data type is one that fits the base architecture
of the underlying computer such as int, float, and pointer, and
all of the variations, thereof such as char, short, long, unsigned,
float, double, are primitive data type. A non-primitive data type
is something else such as an array structure or class.
Linear Data Structure is a data structure that is said to be
linear if its elements form a sequence or a linear list. The data
elements sequentially, in which only one data element can
directly be reached.
Non-Linear Data Structures is when every data item is
attached to several other data items in a way that is specific for
reflecting relationships. The data items are not arranged in a
sequential structure.
In general, data structures are used to implement the
physical forms of abstract data and are essential for managing
large amounts of data, such as information kept in databases
or indexing services, efficiently.
References
Data Structures and Algorithms in C# Michael T. Goodrich
Department of Computer Science University of California,
Irvine 1 Roberto Tamassia Department of Computer Science
Brown University 0-471-73884-0 Fourth Edition
Retrieved from https://www.geeksforgeeks.org/introduction-
to-data-structures-10-most-commonly-used-data-structures/
Retrieved from https://www.w3schools.in/data-structures-
tutorial/intro/
