CHAPTER 3: DATA STRUCTURES AND ALGORITHMS

LESSON 2: DATA STRUCTURES

LESSON 3: ALGORITHMIC COMPLEXITY, QUEUES AND SORTING
(Week 6&7)

I. Content Standard:

II. Performance Standard:

 Determine the different programming strategies used in application design and development.
 Explain objects and abstract data types and their significances as part of application design and development.
 Compare the pre- and post- conditions
 Describe the C conventions and their uses
 Explain algorithmic complexities and dynamic algorithms and their uses
 Explain the use of queues and sorting in handling data
 Value the importance or error handling in designing and developing application code, knowing when how to treat issues in code when they appear.

III. Gradual Release of Responsibility

Day 1&2 Day 3&4 Day 5&6 Day7&8 Day 9&10

Continuation of data Structures Continuation Hands- on  Explain algorithmic complexities and dynamic algorithms and their uses
and Hands- on Encoding Encoding  Explain the use of queues and sorting in handling data
 Value the importance or error handling in designing and developing application code,
knowing when how to treat issues in code when they appear.

IV. Daily Lesson Log

Continuation of data Continuation Hands- on  Explain algorithmic complexities and dynamic algorithms and their uses
Structures and Hands- on Encoding  Explain the use of queues and sorting in handling data
Learning Encoding  Value the importance or error handling in designing and developing application code,
Competencies knowing when how to treat issues in code when they appear.

A1. RECAP A4. RECAP A8. RECAP A12. RECAP A14. PROGRAMMING
(Big Group Activity) Big Group Activity) 10 Big Group Activity) Big Group Activity) 5minutes ACTIVITY
10minutes minutes 10minutes (100 minutes)
Note:
 Note: Note: Note: Teacher will review the “SOURCE CODING”
In 5 minutes, Teacher will let Teacher will review some Teacher will review different Complexities.
the students explain their concept about Programming about arrays, stacks and Note:
known sample source codes Strategies. recursion of A13. CONTINUATION OF 1. Students are going
Learning and its functions. Programming Strategies. DISCUSSION to make their own
Activities A5. CONTINUATION OF (Big Group Activity) source code.
A2. DISCUSSION PROGRAMMING ACTIVITY A9. SMALL GROUP 40 minutes 2. They will select
(Big Group Activity) ( 90 minutes) ACTIVITY which type of sorting
80 minutes (30 minutes) Note: they are going to
“SOURCE CODING” 1. Teacher will continue make.
Note: Note: the concept about
1. Teacher will continue the A6. CHECKING of ACTIVITY 1. Students will find a pair. data structures. A15. CHECKING of ACTIVITY
concept about data (20 minutes) 2. They are going to make 2. Sorting (20 minutes)
structures. a report about 1. Bubble sort
2. Teacher will give example Algorithmic complexity, 2. Selection Sort
of each type. algorithm efficiency: 1. 3. Insertion Sorts
3. Teacher will discuss Time complexity 2.
Multi- Dimensional arrays. Space complexity 3. Analysis
4. Cloning Two- 4. Heap Sort
Dimensional Arrays A10. DISCUSSION 5. Quick sort
5. Stacks (Big Group Activity)
a.Stack Frames 80 minutes A14. FEEDBACKING
6. Recursion ( 15 minutes )
Recursive Functions Note:
1. Teacher will discuss Note:
A14. PROGRAMMING the concept about Students are free to ask
ACTIVITY Asymptotic Notation. further questions to the
(30 minutes) 1. Big O teacher if there are instances
2. Big Omega that it is too hard to
3. Discuss about comprehend on the subject
Note: Queues matter especially in
1. Start of Source 1. Performance programming.
Coding 2. Priority
Queues