You are on page 1of 8

Work Plan

Courseware: DIGITITANS
Implementation: 4th Quarter/ Semester

Weeks Activities MELC or Outcomes Lessons Materials


Week 14 Learning Packet 14 1. Identify the basic flowchart Section 5:Programming in DigiTitans 6
symbols. Principle (pages 121-127)
2. Express algorithms using Lesson 18: Mapping the + interactives
flowcharts. Solution + worksheets
3. Appreciate the importance Lesson 19: Not Quite Programs
of control and program Yet
structures.
DIGITITANS 6
Learning packet 14

Remember Find Use


A map is a visual representation of a place. Read your DigiTitans 6 workbook to learn Access TekTeach LMS.
It is used for navigation. It tells you how to about:
get from Point A to Point B by showing the Answer the Lesson Quiz for Lesson 18-19.
routes that you can take to get there. Section 5:Programming in Principle
Lesson 18: Mapping the Solution
After doing this learning packet, you will Lesson 19: Not Quite Programs Yet
be able to:
Accomplish the Progress Check #1 and 2.
1. Identify the basic flowchart symbols. After reading, accomplish the Mental Model
2. Express algorithms using flowcharts. Worksheets #1 and 2.
3. Appreciate the importance of control and
program structures.

To check what you already know about the


lessons, please answer the Knowledge
Activation Exam# 1 and 2.

Let the student study the lesson. He/She may ask for assistance and thorough discussion of
Teacher Support: concepts via messenger private message. The teacher may conduct a follow-up session if
needed.
Supervise your child as they answer Knowledge Activation Exam. Guide your child as
they read the lesson and accomplish the Mental Model Worksheets. Extra parental
Parent Support: supervision as they explore the computer at your home. Let your children accomplish the
Progress Check on their own.
DIGITITANS 6
Learning packet 14
Mapping the Solution
Activation of Prior Knowledge Exam
(1)
Instruction: Identification. Provide the terms being asked. Choose your answer on the box provided.

Program logic formulation

Graph search algorithm

Divide-and-conquer algorithm

Greedy algorithm

Recursive algorithm

1. It refers to algorithm gives rules for finding solutions to problems such as finding the shortest path
between two points.______________________

2. It refers to a big problem is divided into parts to be solved separately.______________________

3. It refers to works by using a decision that is the best for the current situation.__________________________

4. It refers to algorithm that “calls” itself up repeatedly until a certain state is reached.____________________

5. It is the logical solution to a problem._______________


DIGITITANS 6
Learning packet 14
Step-by-Step Solution
(2)
Instruction: True or False: Write T if the statement is correct and F if its not.

_________1. A flowchart is a graphic representation of an algorithm.

_________2. The process is infinite, the starting and the ending processes are well defined, and the inputs
and the outputs are also clearly stated.

_________3. A decision point is needed to enable the process to go on in cases where two or more choices
are present.

_________4. Decision Symbol is denotes an operation or computation that must be performed.

_________5. The basic elements of a flowchart are the start point, the end point, the input, the output, the
possible paths, and the decisions.
DIGITITANS 6
Learning packet 14
Mapping the Solution
MENTAL MODEL WORKSHEET
(1)
Instruction: Supply the diagram with the needed information.
DIGITITANS 6
Learning packet 14
Not Quite Programs Yet
(2)
Instruction: Fill in the diagram with control structures.

Control Structures
DIGITITANS 6
Learning packet 14
Mapping the Solution
PROGRESS WORKSHEET
(1)
Instruction: Illustrate the 8 basic flowchart symbols.
DIGITITANS 6
Learning packet 14
Not Quite Programs Yet
(2)
Instruction: Answer the following questions below.

1-3 List down the 3 different parts that a program

Answer:

4. Write an example of sequence.

Answer:

5. Write an example Repetition/Iteration (loops).

Answer:

You might also like