This page serves to plan the agenda for the session, then logs the finalized minutes, as well as information necessary for final summary, upon the completion.
START A BIT > Learning Packages > LP2445: List, Looping and Debugging, 24w45 > This page
Project: PJ017: Debug The List Changes And Find The Max, Task 2
Project: PJ018: Shake to Fill the LED Screen, with Replay Function
List operations and for-looping in practice
Use separated 2 lists to store (x, y) coordinates
Good learning experience with more discussions and let the students present their understanding of the key knowledge
Very active mutual support when doing the project
Good with less contents for this session, less ambition, easier feeling with solid steps
Working well with the new WoW to collect the students work via Google Classroom.
The optional plan of PJ018 didn't happen, less is more, we intent to take this learning slower
A few students still seemed with difficulty to well understand the List and Looping concept, it seemed not because of the interpretation or materials, but more due to the lack of focus and attention from those students, they didn't have good enough habit to take the learning seriously with patience.
Maybe a good idea to plan some "tests" (google forms, kahoot, etc) to exam how much the students understand the key knowledge, and raise more discussion about the code snippets
This is a log as information for today, no need to pay now. We will sum up all the costs to share after finishing the whole Learning Package.
8 students participated
The variable costs to share: 169.70Kr
27.9+29.9+20.95+20.95Kr: Fika snack
70 Kr: Tutor parking 9:44-12:04
The fixed consuming materials costs: 20 Kr/student/session
20 Kr per student: Compensate the consuming cost of tools and materials for projects (like printed paper, stationery, cables, batteries, fragile components, etc.)
So, every participant pays: 169.70/8 + 20 = 41.21 Kr
10:00-10:30:
Recap List basic
Review PJ017 what we did last session
Introduce KB025: Designing Pattern: Assumption-Evaluation-Conclusion , and practice the PJ017 Task 1 with a little extra requirement, to find the min-value and max-value at the same time
10:30-11:30:
Discuss about the solution method of Task 2 for PJ017
Make the Task 2 in practice, and sharing, discussion
We skipped the optional plan for PJ018.
10:05-10:40:
Recap List basic concept, PJ017: Debug The List Changes And Find The Max task 1
Ask the students to present their understanding of the algorithm/method of task 1
Discuss about Task 2 algorithm, ask the students to present their understanding
10:40-11:30:
Enhance the understanding of Task 1: Please add extra feature to find min-value at the same time
Task 2: Check duplication before adding
Optional: If the learning goes smooth, let's start PJ018: Shake to Fill the LED Screen, with Replay Function with Task 1