CLARENDON COLLEGE, INC

Roxas, Oriental Mindoro

Tel fax: (043)289 -7056/ admin@clarendonph.com

JUNIOR HIGH SCHOOL DEPARTMENT

Subject ICT 10
Grade Grade 10
Lecturer Ederlyn Claud Sarmiento
Module No. & Title Data Structures and Algorithms(LECTURE1: Programming strategies)
Reference Material Programming MAPUA INFORMATION TECHNOLOGY CENTER
Copyright (c) 2018 by Vibal Group, inc. and Mapua Information Technology
Center.
Duration
Lecture Materials Format 1. Printed/ PDF lesson
2. Videos

Objectives:
After this chapter, you should be able to:
 Explain Data Analysis and Data Structure
 Compare the Data structures, abstract data types and design patterns
 Describe Operation on Data Structures
 Explain algorithmic complexities and dynamic algorithms and their uses.
 Explain the use of queues and sorting in handling data.
 Value the importance of Data analysis and Data structure
Description:
Data Structures and Algorithms:
Study Chapter3, page 63-93 of the textbook

Watch the provided video:

What is Data Structure? Why we need them? Real World Example
https://youtu.be/NzUVn8Y9deQ
DATA STRUCTURES AND ALGORITHMS | WHAT ARE DATA STRUCTURES?
https://youtu.be/lf641ItPkM4

LECTURE: Data Analysis and Data Structures

Data analysis is defined as a process of cleaning, transforming, and modelling data to discover useful information
for business decision-making. The purpose of Data Analysis is to extract useful information from data and taking the
decision based upon the data analysis.
Data structures are a way of organizing information that best describes the business and is most often used as part
of various algorithms or processes that provides useful information, which allows stakeholders to make informed
decisions. These are generally divided into two main groups, the built-in data structures and user-defined data
structures.

Introduction to Data Structure

Computer is an electronic machine which is used for data processing and manipulation.
When programmer collects such type of data for processing, he would require to store all of them in computer’s main
memory.
In order to make computer works, we need to know the following:
 Representation of data in computer.
 Accessing of data.
 How to solve problem step by step.
For doing this task we use data structure
Data Structure
 Data structure is a representation of the logical relationship existing between individual elements of data.
 Data Structure is a way of organizing all data items that considers not only the elements stored but also their
relationship to each other.
 We can also define data structure as a mathematical or logical model of a particular organization of data items.
 The representation of particular data structure in the main memory of a computer is called as storage structure.
 The storage structure representation in auxiliary memory is called as file structure. It is defined as the way of
storing and manipulating data in organized form so that it can be used efficiently.
 Data Structure mainly specifies the following four things
  Organization of Data
 Accessing methods
 Degree of associativity
 Processing alternatives for information
 Algorithm + Data Structure = Program
 Data structure study covers the following points
 Amount of memory require to store.
 Amount of time require to process.
 Representation of data in memory.
 Operations performed on that data.

Operation on Data Structures

Design of efficient data structure must take operations to be performed on the data structures into account. The most
commonly used operations on data structure are broadly categorized into following types
1. Create
The create operation results in reserving memory for program elements. This can be done by declaration statement.
Creation of data structure may take place either during compile-time or run-time. malloc() function of C language is used
for creation.
2. Destroy
Destroy operation destroys memory space allocated for specified data structure. free() function of C language is used to
destroy data structure.
3. Selection
Selection operation deals with accessing a particular data within a data structure.
4. Updation
It updates or modifies the data in the data structure.
5. Searching
It finds the presence of desired data item in the list of data items, ¡t may also find the locations or all elements that satisfy
certain conditions.
6. Sorting
Sorting is a process of arranging all data items in a data structure in a particular order, say for example, either in ascending
order or in descending order.
7. Merging
Merging is a process of combining the data items of two different sorted list into a single sorted list.
8. Splitting
Splitting is a process of partitioning single list to multiple list.
9. Traversal
Traversal is a process of visiting each and every node of a list in systematic manner.

Data structures, abstract data types, design patterns

For many problems, the ability to formulate an efficient algorithm depends on being able to organize the data in
an appropriate manner. The term data structure is used to denote a particular way of organizing data for particular types of
operation. These notes will look at numerous data structures ranging from familiar arrays and lists to more complex
structures such as trees, heaps and graphs, and we will see how their Choice affects the efficiency of the algorithms based
upon them. Often we want to talk about data structures without having to worry about all the implementational details
associated with particular programming languages, or how the data is stored in computer memory. We can do this by
formulating abstract mathematical models of particular classes of data structures or data types which have common
features. These are called abstract data types, and are defined only by the operations that may be performed on them.
Typically, we specify how they are built out of more primitive data types (e.g., integers or strings), how to extract that
data from them, and some basic checks to control the flow of processing in algorithms. The idea that the implementational
details are hidden from the user and protected from outside access is known as encapsulation. We shall see many
examples of abstract data types throughout these notes.
At an even higher level of abstraction are design patterns which describe the design of algorithms, rather the
design of data structures. These embody and generalize important design concepts that appear repeatedly in many problem
contexts. They provide a general structure for algorithms, leaving the details to be added as required for particular
problems. These can speed up the development of algorithms by providing familiar proven algorithm structures that can
be applied straightforwardly to new problems. We shall see a number of familiar design patterns throughout these notes.

Textbooks and web-resources

To fully understand data structures and algorithms you will almost certainly need to complement the introductory
material in these notes with textbooks or other sources of information. The lectures associated with these notes are
designed to help you understand them and fill in some of the gaps they contain, but that is unlikely to be enough because
often you will need to see more than one explanation of something before it can be fully understood.

ARRAYS
An Array is a type of user defined data structure that can be simple or multi-dimensional in form, which holds multiple
types of information that is related in some form or another. Study the example on page 70 of the book.
DATA
In computing, data are information that have been translated into a form that is efficient for movement or processing.
Relative to today's computers and transmission media, data are information converted into binary digital form. “Raw data”
is a term used to describe data in its most basic digital format.

https://www.datapine.com/blog/wp-content/uploads/2021/03/types-data-analysis-methods.png

Reminders:
Output/s to be submitted ACTIVITY WORKSHEET FOR ICT10
Deadline of Submission of Activities/Assessment
Mode of Submission Submit the activity worksheet at Clarendon College.

Prepared by: Checked by:

EDERLYN SARMIENTO HAZEL P. PALAPUS, Meng.

Teacher Principal
 ACTIVITY WORKSHEET FOR ICT10
Name: ____________________________ Teacher: Ederlyn Sarmiento
Grade & Section: ___________________ Week No:

Performance task: 20 points

Activity 1: Survey Design and Data Collection
1. Choose one of the following topics to investigate:
A. How do students cope up with the pandemic?
B. What are students’ opinions about the education they are receiving at the school?
2. The survey should have a title and a brief description of the topic.
3. Design a survey.
a. The survey should have 8 questions.
b. You should not ask questions that provide only a YES/NO response.
c. Provide your participants with open-ended questions, to ensure that you collect enough relevant & specific info.
d. Two questions should be categorical (e.g. What is your gender? What is your grade?)
e. Two questions should ask students to provide a numerical answer that would yield continuous data. (e.g., How
much do you spend each week in online class?)
d. Four questions should involve some type of rating scale. The scale should have five levels and therefore
correspond to 1, 2, 3, 4, 5. (e.g. strongly disagree, disagree, neutral, agree, strongly agree).
e. You should have a coding system for each question so that answers correspond with numbers.
f at least 10 people respondents.
g. Once surveys are completed, you will enter the data into a table in Microsoft Word or Microsoft Excel.

RUBRIC
Element 0 1 2
1 Title and description No title or description Title and description are Title and description provided
provided incomplete
2 Description of sample No description of sample Description of sample not Sample is described accurately
accurate
3 Description of how bias No description provided Insufficient description. Bias control accurately described and
was controlled good reasoning provided
4 Survey questions (10 total) No performance tasks NA Includes eight total questions.
5 Two categorical questions. No categorical question Only 1 categorical question Includes 2 clear, categorical questions
6 Two open-ended, numeric No open-ended, numeric Only 1 open- ended numeric Includes 2 clear, open-ended numeric
response questions. response questions response question. response questions.
7 10 survey responses Five or less responses Between 5 and 9 responses Student obtained 10 responses.
8 Data entry is organized Data inaccurate and Data either inaccurate or Data accurate and organized
and accurate disorganized disorganized
9 Neatness of materials Materials are not neat Materials are lacking in neatness Materials are neat and easy to read.
10 The components of the No organization Some organization Materials are well- organized when
project are organized. handed in.

Written work: 10 points

Directions: Answer the following questions:
1. What is data structure?

2. What is encapsulation?

3. What is primitive data type in data structure?

4. What are the basic operations in array?

5. Why is data analysis important?

Parent’s name & signature Date