-
Notifications
You must be signed in to change notification settings - Fork 59
Class 06 (More on Functions)
KJ Monahan edited this page Jun 6, 2024
·
1 revision
In the prep work for this lesson, the students learned:
- What an anonymous function is and how to write one.
- What recursion is and how a function can call itself.
- The definitions of "base case" and "recursive case"
- More info to come... when in doubt, check with the class Candidate Engagement Manager for announcements!
- The second graded assignment is open for you to start working on. Even if you can't solve everything right away, it is important to start working on it since you only have 2 weeks to do it!
- Welcome to Day 8!
- Graded Assignment 1 is due at the end of class today
- Conversation Starters:
- What type of error occurs when attempting to use a value that is NOT a function as if it were one?
- Explain the difference between named and anonymous functions, including an example of how an anonymous function can be used.
- Reinforce examples of when and why someone may use an anonymous function. Live coding examples are particularly helpful in explaing anonymous functions.
- Reinforce examples of when and why someone may choose the recursive solution. While recursion is in the chapter, it should NOT receive a large amount of emphasis. At this point in the students' learning journey recursion pushes against the boundary between an engaging challenge and a discouraging frustration.
- Q & A about the chapter exercises.
- Remind learners about how important it is to write a sorting function yourself. The last section of the studio instructions has a lot of really good points about how sorting functions serve as the basis for many technical interview questions.
- If learners are stuck, remind them to use pseudo-coding and to think through the steps they need to follow to sort something (i.e. designing their algorithm) before trying to write code.
- If learners finish early, encourage them to attempt the bonus mission.