University of Computer Studies

Chapter 1:Introduction to Data Structure

Data Structures and Algorithms

University of Computer Studies, FCS 1
Learning Objectives FCS

• To learn about data, data type and data structure

• To understand how to work type of data structure

• To discuss the algorithm

University of Computer Studies, FCS 2

Data Structure Concepts FCS

Data Types
 Data type
 Types of Data Structure

Primitive Abstract
Data Type Data Type

Figure 1 Data types

University of Computer Studies, FCS 3

Data Type FCS

 Data type is an attribute of data

•Integer (Example: 78,-34)
•Floating-point (Example: 28.78,-34.53)
•Characters (Example: ‘a’, ‘X’)
•Booleans (Example: true, false)
 A data type constrains the values that an expression
• the operations that can be done on the
data
 A data type provides a set of values from which
an expression
• (i.e. variable, function, etc.)
University of Computer Studies, FCS 4
Data and Data Structure FCS

 Data
• raw collection of facts.
 Data Structure
•a particular way of organizing, processing, retrieving and storing data for
particular types of operation.
•organizing and storing data in memory that considers not only the elements
stored but also their relationship to each other.
•A data structure is a way of arranging data in a computer's memory or other
disk storage.

University of Computer Studies, FCS 5

Data Structure FCS

 Data structure affects the design of both structural &

Algorithm Data Structure
functional aspects of a program.

Program
Figure 2 Program
University of Computer Studies, FCS 6
Type of Data Structures FCS

 Linear Data  Non-Linear Data

Structure Structure
• Stack • Graph
• Queue • Tree
o Quad Tree
• Array
o Binary Tree
• Linked List
o Binary Search Tree
o Single Linked List
o AVL Tree
o Doubly Linked List
o Heap Trees

Figure 3 Linear data Structure and Non-linear data

structure
University of Computer Studies, FCS
7
Algorithm FCS

Algorithm is a step-by-step procedure for solving a problem or

accomplishing some result.
An algorithm is a finite list of instructions, most often used in solving

problems or performing tasks.

University of Computer Studies, FCS 8

Data Structure Knowledges FCS

 Big Oh notation
• For run time complexity analysis

 An imperative programming language

All examples are given in a pseudo-imperative coding format
• C++,C#,Java
 Object oriented concepts
• Inheritance
• Encapsulation
• Polymorphism

University of Computer Studies, FCS 9

Lecture Summary FCS

One of the most important and essential tasks of

 Data, Data type
 Data structures
 Algorithms

University of Computer Studies, FCS 10

Learning Outcome FCS

After completing this course satisfactorily, a student will be able to:

 Data
 Data Type
 Data structures and
 Algorithms

University of Computer Studies, FCS 11

References FCS

1. Lecture Notes for Data Structures and Algorithms” by John Bullinaria, School of Computer Science,
University of Birmingham, Birmingham, UK, Version of 27 March 2019.
2. Lecture Notes for Data Structures and Algorithms (Version of 27 March 2019) by John Bullinaria,
School of Computer Science University of Birmingham , UK
3. https://en.wikipedia.org/wiki/Data_type [Slide 4]
4. https://virtualizationreview.com/articles/2017/10/17/netapp-keynote-stresses-move-from-storage-to-
data.aspx [Slide 6]
5. https://towardsdatascience.com/8-common-data-structures-every-programmer-must-know-
171acf6a1a42 [Slide 6]
6. https://robogarden.ca/blog/how-to-learn-algorithms [Slide 9]

12
University of Computer Studies, FCS