EBoard 18: Recursion practice
This class will be recorded! Its use is limited to members of the
class. Please do not share with others.
Approximate overview
- Administrative stuff [~15 min]
- Q&A [~15 min]
- Quiz [~10 min]
- Lab [~50 min]
Administrative stuff
Notes and News
- Over the past two days, we walked through a problem “live”. I realize that I
could have asked you to do that individually or in groups, but …
- I think there’s a benefit to you seeing that others may be as
confused as you.
- Doing development live lets me model the development cycle I prefer
you use.
- The semi-Socratic method involves questions and answers;
that’s hard to model in text.
- I can ask side questions like “How would Bill & Ted pronounce
‘Socratic’?”
- Or do any of you even know who Bill & Ted are? Yes.
- WHEN YOU LEAVE THE LAB SESSION (at 4:30, 4:50, 5:00, 5:30, 7:30), MAKE
SURE TO SHARE YOUR PORTION OF THE LAB WITH YOUR PARTNER!
- You should know the drill on evening tutoring. Please use the evening
tutors. Please consider visiting them in person (if you are on campus).
- Tutors can also work with you on learning things, such as tracing.
- Remember: Tracing is faster if you do cut and paste.
- Reminder: We talked about “If you’re stuck on a problem, try another” as
a technique for homework. At times, it can also be an appropriate
technique for lab.
- Changes to schedule, inspired by change to SoLA
- Change to SoLA: Numeric recursion moves to LAP 3, regular expressions
move to LAP 2.
- Change to schedule: Numeric recursion moves to Friday, newish lab
today. (An opportunity to write recursive procedures.)
- If you’ve done the numeric recursion reading already, you have
nothing extra to read for Friday.
- I’m still trying to shift everything around on the Web site.
- A note about regular expressions
- Regular expressions take a very different approach to describing
computational problems: They describe what you want to find, but
not how. (There’s a lot of fancy behind-the-scenes work to
translate a regular expression into pattern-matching code.)
Upcoming activities and other token-earning things
Events
- Mentor session TONIGHT at 7 pm. Practice for SoLA 2!
- Write it up to get a token.
- CS major declaration information session TOMORROW at 5pm.
- This will be recorded.
- Probably more relevant to second-years than first-years.
- 4+1 BA/MS in CS Program w/UIowa info session Friday at noon.
in CS Team Events channel.
- Restorative Justice Circles info session Friday at noon
- Or any of the circles themselves.
- CS Table Monday, 1 March 2021 at noon. Chapter 1 of the book.
- WGMC presents Ethics and Social Justice in CS.
6pm, Wednesday, 3 March 2021.
- Journalism Ethics Workshop, 7:00-8:30 pm, Thursday, March 4 and
Tuesday, March 9
- Support a local bakery (such as GrinCity)
- If you do go to GrinCity, you can walk by my house (1120 Main St.)
and see where I live.
Upcoming work
I’m not sure if all of these links are correct. Let me know if any are not.
- Mini-project 4 is due on Monday.
- Reading response for Friday
- Lab writeup
- Quiz today: Reading recursion
- No Quiz Friday!
- SoLA 2 will be tomorrow.
- Note: We replaced “Numeric Recursion” with “Regular Expressions”
- Review session TONIGHT
- Class Thursday: Sam answers questions about sample SoLA questions
and the exam topics.
- The Sample SoLA lives again.
Q&A
Will we have to write regular expressions?
Maybe.
For example, a regular expression for “words that contain the letters
e and a in sequence, but not necessarily next to each other. For
example, in the prior sentence it should match not only ‘each’ but
also ‘necessarily’.”
Will you tell a shaggy dog story about saving files on the computer?
Yes, I apologize.
Will we have two days for the SoLA
Of course.
Quiz
Lab