Onboarding¶
I predict few learners, max 5 in total, with most arriving before 9:30. I predict 1 teacher is enough. Let's see...
t |
n |
Events |
---|---|---|
8:52 | 1 | A joined, no talk |
8:53 | 0 | A left |
9:54 | 0 | . |
9:02 | 0 | . |
9:03 | 1 | B joined, talk with B |
9:04 | 2 | C joined |
9:05 | 1 | B left to work in silence and will come back with questions |
9:06 | 1 | C in breakout room with BC |
9:07 | 1 | . |
9:14 | 1 | . |
9:15 | 1 | B back for a question |
9:16 | 1 | C done and left |
9:17 | 1 | B leaves room to work in silence |
9:18 | 0 | . |
9:21 | 0 | . |
9:22 | 1 | D comes in, leaves |
9:23 | 0 | . |
9:39 | 0 | . |
9:40 | 1 | E joins, technical problems to get to talk |
9:45 | 0 | E was already good to go and leaves |
9:46 | 0 | . |
9:59 | 0 | . |
10:00 | 0 | . |
- Names of learners are pseudonimized to A, B, C, etc.
- Names of teachers are the standard abbreviations: BC, LE, RB
t
: timen
: number of learners- max amount of learners: 2
- amount of teachers that would have sufficed: 1
- Use
r
as number of registrations whereR
is 20 - Prediction that would be correct:
- Amount of learners to expect:
r / 5
- Amount of learners to have questions:
r / 10
- Amount of learners to pop in and out:
r / 10
- Amount of learners expected after 9:30:
r / 20
- Amount of teachers needed:
r / 20
- Amount of learners to expect:
There were multiple learners that did not understand what was expected of them.
-