Activity 1: How do you understand the following terminologies and give real-life examples in

which they are being used.

• Data Structures- is a method or format that we use for organizing data in a computer
program

 Data Structure can be defined as the group of data elements which

provides an efficient way of storing and organizing data in the computer
so that it can be used efficiently.( Javatpoint (n.d.) Retrieved from
https://www.javatpoint.com/data-structure-introduction)
 Data Structure is a way of collecting and organizing data in such a way
that we can perform operations on these data in an effective way.
(Studytonight (n.d) Retrieved from https://www.studytonight.com/data-
structures/introduction-to-data-structures )
 Example: When you organized your clothes on cabinet.

• Algorithms- a step by step process to be followed to achieve the desired outcome.

 An algorithm is a set of instructions designed to perform a specific task.

(TechTerms (n.d.) Retrieved from
https://techterms.com/definition/algorithm )
 An algorithm is a well-defined procedure that allows a computer to solve
a problem.( Study.com (n.d.) Retrieved from
https://study.com/academy/lesson/what-is-a-computer-algorithm-
design-examples-optimization.html )
 Example: When you follow Recipe for cooking a food.

• Collections- an objects that groups a multiple similar data types in one unit.
  In programming, a collection is a class used to represent a set of similar
data type items as a single unit. ( Technopedia (n.d.) Retrieved from
https://www.techopedia.com/definition/25317/collection )
 A collection — sometimes called a container — is simply an object that
groups multiple elements into a single unit. Collections are used to store,
retrieve, manipulate, and communicate aggregate data.
(Bookbird (n.d.) Retrieved from
https://www.bookbird.co.uk/articles.php?cat=199#cat=199&page=1 )
 Example: When you collect asets of make up that has a same brand.

• Arrays- it can use stores multiple values in one variable.

 An array is used to store a collection of data, but it is often more useful to

think of an array as a collection of variables of the same type. ( Tutorials
Point (n.d.) Retrieved from
https://www.tutorialspoint.com/java/java_arrays.htm )
 An array is a group of like-typed variables that are referred to by a
common name. ( GeeksforGeeks (n.d.) Retrieved from
https://www.geeksforgeeks.org/arrays-in-java/ ).
 Example: When you store your files in a Flash Drive

• Lists- is a tool that can be used to store multiple values at once.

 A list is a sequence of several variables, grouped together under a single

name( CsCircles (n.d.) Retrieved from
https://cscircles.cemc.uwaterloo.ca/13-lists/ ).
 To display data in an ordered format (Webopedia (n.d.) Retrieved from
https://www.webopedia.com/TERM/L/list.html ).
 Example: Receipt

• Linked-List- is a tool that can be used to connect each other via link.
  A linked list is a linear data structure, in which the elements are not
stored at contiguous memory locations. ( Geeksforgeeks ( n.d.) Retrieved
from https://www.geeksforgeeks.org/data-structures/linked-list/ ).
 A linked list is a sequence of data structures, which are connected
together via links ( Tutorials Point (n.d.) Retrieved from
https://www.tutorialspoint.com/data_structures_algorithms/linked_list_
program_in_c.htm ).
 Example: Train.

• Stacks- an object that being arrange properly. It follows LIFO or FILO policy.

 Stack is a data structure used to store a collection of objects. ( Techterms (n.d.)

Retrieved from https://techterms.com/definition/stack)
 Stack is a linear data structure which follows a particular order in which the
operations are performed. The order may be LIFO(Last In First Out) or FILO(First
In Last Out) ( GeeksforGeeks (n.d.) Retrieved from
https://www.geeksforgeeks.org/stack-data-structure )
 Example: When you arrange your book in a pile.

• Queues- an object that are being arrange properly just like stacks. It follows FIFO policy.

 Queue is a linear structure which follows a particular order in which the

operations are performed. The order is First In First Out (FIFO) (GeeksforGeeks
(n.d.) Retrieved from https://www.geeksforgeeks.org/queue-data-structure/ )
 Queue is also an abstract data type or a linear data structure, just like stack data
structure, in which the first element is inserted from one end called
the REAR(also called tail), and the removal of existing element takes place from
the other end called as FRONT(also called head). ( StudyTonight (n.d.) Retrieved
from https://www.studytonight.com/data-structures/queue-data-structure)
 Example: When you ordered a food on a fast food then you stand in a line up.

• Trees- it is an abstract data types that is similar to hierarchy tree.

  Tree is an important data structure of computer science which is useful for
storing hierarchically ordered data( BlogsDope (n.d.) Retrieved from
https://www.codesdope.com/blog/article/trees-in-computer-science/ ).
 Trees are well-known as a non-linear data structure. They don’t store data in a
linear way. They organize data hierarchically.(FreeCodeCamp (n.d.) Retrieved
from https://www.freecodecamp.org/news/all-you-need-to-know-about-tree-
data-structures-bceacb85490c/ ).
 Example: When you create a Family Tree.

• Graphs- abstract data structure that can be indirect or direct graph.

 A Graph is a non-linear data structure consisting of nodes and edges(

GeeksforGeeks (n.d.) Retrieved from https://www.geeksforgeeks.org/graph-
data-structure-and-algorithms/ )
 A graph is a non-linear data structure, which consists of vertices(or nodes)
connected by edges(or arcs) where edges may be directed or undirected.
(GeeksforGeeks (n.d.) Retrieved from
https://www.geeksforgeeks.org/applications-of-graph-data-structure/ ).
 Example: Google maps.

• Maps- a storage type that find values from other values.

 A map refers to the documentation that describes its overall structure.

(ComputerHope (n.d.) Retrieved from
https://www.computerhope.com/jargon/m/map.htm#:~:text=When%20referrin
g%20to%20programming%2C%20or,computer%2C%20share%2C%20or%20print
er ).
 A type of container that maps values of one type to values of another type (
StackOverflow (n.d.) Retrieved from
https://stackoverflow.com/questions/1828671/origin-of-map-in-computer-
science/1828713 )
 Example: Directions.
• Sets- abstract data types that can store multiple values in any order.

 A set is a well-defined collection of distinct objects( Cs (n.d.) Retrieved from

https://everythingcomputerscience.com/discrete_mathematics/Sets.html )
 A set is an abstract data type that can store certain values, without any particular
order, and no repeated values. It is a computer implementation of the
mathematical concept of a finite set (Wiki (n.d.) Retrieved from
https://computersciencewiki.org/index.php/Sets )
 Example: Set of earrings.