Skip to content

Commit d7c5f38

Browse files
committed
PPT alignment
1 parent 5fe61e2 commit d7c5f38

26 files changed

+42
-62
lines changed

do_now_43.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
1. Create a list with 10 inspirational quotes. You may use the internet for ideas.
44

5-
2. Use the following block to pick a random quote of the day:
5+
2. Use the item block below to pick a random quote of the day.
66

77
![item](images/item.png)
88

do_now_44.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,6 @@
22

33
## In your notebook
44

5-
1. Describe what it means to "traverse a list".
5+
1. Describe what it means to _traverse a list_.
66

77
2. List 2 different blocks you can use to traverse list and how you would use them.

do_now_45.md

+3-2
Original file line numberDiff line numberDiff line change
@@ -8,8 +8,9 @@ You will need to add the "words, sentences" library to your project to use the *
88
2. Click "Libraries..."
99
3. Select "Words, sentences"
1010
4. Click "Import"
11-
The "list->sentence" block will be one of the blocks added to the operators pallette.
1211

13-
![List Do Now](images/list_do_now.png)
12+
* The "list->sentence" block will be one of the blocks added to the operators palette.
13+
14+
![List Do Now](images/list_do_now.png)
1415

1516
5. Save your project as _DoNow4.5_.

docs/do_now_43.md.html

+1-1
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010

1111
1. Create a list with 10 inspirational quotes. You may use the internet for ideas.
1212

13-
2. Use the following block to pick a random quote of the day:
13+
2. Use the item block below to pick a random quote of the day.
1414

1515
![item](images/item.png)
1616

docs/do_now_44.md.html

+1-1
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010

1111
## In your notebook
1212

13-
1. Describe what it means to "traverse a list".
13+
1. Describe what it means to _traverse a list_.
1414

1515
2. List 2 different blocks you can use to traverse list and how you would use them.
1616

docs/do_now_45.md.html

+3-2
Original file line numberDiff line numberDiff line change
@@ -16,9 +16,10 @@
1616
2. Click "Libraries..."
1717
3. Select "Words, sentences"
1818
4. Click "Import"
19-
The "list->sentence" block will be one of the blocks added to the operators pallette.
2019

21-
![List Do Now](images/list_do_now.png)
20+
* The "list->sentence" block will be one of the blocks added to the operators palette.
21+
22+
![List Do Now](images/list_do_now.png)
2223

2324
5. Save your project as _DoNow4.5_.
2425

docs/lab_44.md.html

+2-2
Original file line numberDiff line numberDiff line change
@@ -12,10 +12,10 @@
1212

1313
## Part 1: Numbers
1414

15-
Write 5 custom **reporter** blocks that takes a list as an argument. You can assume that all items in the list passed as the argument will be numbers.
15+
Write 5 custom **reporter** blocks that takes a list as an argument. You can assume that all items in the list will be numbers.
1616

1717
1. Sum of all the numbers in the list.
18-
2. average of all of the numbers in the list.
18+
2. average of all the numbers in the list.
1919
3. True if the list contains one negative number and false if all the numbers are non-negative.
2020
4. True if each value in the list is greater than or equal to the one before it.
2121
5. The largest number in the list.

docs/lab_45.md.html

+2-2
Original file line numberDiff line numberDiff line change
@@ -12,11 +12,11 @@
1212

1313
## Part 1: You there
1414

15-
1. Write your own version of the **contains** block, which takes a list and a value as arguments. Then reports true if the value is in the list and reports false otherwise. You should not use the existing **contains** block in your implementation.
15+
1. Write your own version of the **contains** block, which takes a list and a value as arguments. Then reports true if the value is in the list and reports false otherwise. You should not use the existing **contains** block in your implementation.
1616

1717
## Part 2: Where
1818

19-
1. Write a custom block called **index of** that takes a list and a value as arguments and reports the index of the value found in the list. If the value is not in the list, report -1.
19+
1. Write a custom block called **index of** that takes a list and a value as arguments and reports the index of the value found in the list. If the value is not in the list, report -1.
2020

2121
## Part 3: Tell Me More
2222

docs/lesson_41.md.html

+7-6
Original file line numberDiff line numberDiff line change
@@ -37,19 +37,20 @@
3737

3838
### Introductory discussion
3939

40-
Describe the solar system and hook your students in with a way to collect and store new information and discoveries.
40+
Describe the solar system and hook your students by explaining a way to collect and store new information and discoveries.
4141

4242
### Activity
4343

44-
In small groups, students will write an algorithm for adding new Solar System discoveries to a collection of older ones. The process should be complete and detailed so that a person can unambiguously follow the steps.
44+
In small groups,
4545

46-
The process itself will seem relatively simple. Ensure students think not only about the steps to be taken but the necessary materials and resources.
46+
1. have students write an algorithm for adding new Solar System discoveries to a collection of older ones. The process should be complete and detailed so that a person can unambiguously follow the steps.
4747

48-
Ensure that the algorithm would work for any discovery of any name size and does not make assumptions. e.g SUPER MEGA COOL ASTEROID, etc.
48+
2. The process itself will seem relatively simple. Ensure students think not only about the steps to be taken but the necessary materials and resources.
4949

50-
Pay particular attention to when the various materials are needed.
50+
3. Ensure that the algorithm would work for any discovery of any name size and does not make assumptions. e.g SUPER MEGA COOL ASTEROID, etc.
5151

52-
The key here is that the student will need to constantly be referencing this same pool of discoveries e.g. Pool, Pool + 1 discovery, Pool + 1 discovery + another etc. etc.
52+
* Pay particular attention to when the various materials are needed.
53+
* The key here is that the student will need to constantly be referencing this same pool of discoveries e.g. Pool, Pool + 1 discovery, Pool + 1 discovery + another etc. etc.
5354

5455
Instruct students to think about how they would write a script to complete this task. They need not write actual script, but should write pseudocode to attempt to solve the problem.
5556

docs/lesson_43.md.html

+2-4
Original file line numberDiff line numberDiff line change
@@ -40,11 +40,9 @@
4040

4141
* Provide only a few minutes to work through this-- students need not write full, formal algorithms, but simply describe an approach.
4242

43-
* Have groups share with each other and work together to come up with a single approach, hopefully settling on asking each student if s/he has a July birthday and counting the number of yeses (or something similar).
43+
Have groups share with each other and work together to come up with a single approach, hopefully settling on asking each student if s/he has a July birthday and counting the number of yeses (or something similar).
4444

45-
Define _traversal_ as the process of accessing each element of a list in order and performing some operation.
46-
47-
* Explain that the operation can be anything, and may not actually be performed on every element.
45+
Define _traversal_ as the process of accessing each element of a list in order and performing some operation. Explain that the operation can be anything, and may not actually be performed on every element.
4846

4947
Provide a few examples of possible operations (say each person's name, count the number of females, add up the total number of siblings, find the average GPA, etc.)
5048

docs/lesson_45.md.html

+3-13
Original file line numberDiff line numberDiff line change
@@ -35,23 +35,13 @@
3535

3636
### Lecture
3737

38-
Ask students to consider how to determine if a particular person is in the room or not.
39-
40-
At first, you will likely get answers like "call out the person's name" or "look around." Press the students to come up with a method that will always work, including when the person is not present. If necessary, ask them to pretend they are a computer.
41-
42-
Point out that solutions like "look around" are too high-level, and in reality, there is a lot more going on (such as looking at each person individually).
38+
Ask students to consider how to determine if a particular person is in the room or not. At first, you will likely get answers like "call out the person's name" or "look around." Press the students to come up with a method that will always work, including when the person is not present. If necessary, ask them to pretend they are a computer. Point out that solutions like "look around" are too high-level, and in reality, there is a lot more going on (such as looking at each person individually).
4339

4440
Guide students to the process of checking if each person is the one they are seeking, in some deterministic order, until they have either found the person or checked everyone. Emphasize that the absence of the person is only confirmed when everyone has been checked, but that the presence is known as soon as the person is found.
4541

46-
Ensure students recognize that this process is a traversal of the people in the room.
47-
48-
Explain that the process of traversing a list looking for a particular item is known as a "sequential search."
49-
50-
Ask students to think about the efficiency of this algorithm. Emphasize best, worst, and average cases (both what those cases are and how long they take).
51-
52-
Students should have a basic understanding of the fact that the speed of the search is dependent on the size of the list.
42+
Ensure students recognize that this process is a traversal of the people in the room. Explain that the process of traversing a list looking for a particular item is known as a "sequential search."
5343

54-
* If students seem prepared, ask them to speculate under what circumstances you might be able to do better (eventually leading to binary search).
44+
Ask students to think about the efficiency of this algorithm. Emphasize best, worst, and average cases (both what those cases are and how long they take). Students should have a basic understanding of the fact that the speed of the search is dependent on the size of the list. If students seem prepared, ask them to speculate under what circumstances you might be able to do better (eventually leading to binary search).
5545

5646
Show the script for a basic sequential search:
5747
![basic sequential search](images/basic_sequential_search.jpg)

docs/slidedecks/TEALS SNAP 4.1.pptx

85 KB
Binary file not shown.

docs/slidedecks/TEALS SNAP 4.2.pptx

9 Bytes
Binary file not shown.

docs/slidedecks/TEALS SNAP 4.3.pptx

19 Bytes
Binary file not shown.

docs/slidedecks/TEALS SNAP 4.4.pptx

-1.99 KB
Binary file not shown.

docs/slidedecks/TEALS SNAP 4.5.pptx

-12 Bytes
Binary file not shown.

lab_44.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -4,10 +4,10 @@ In this lab, you will continue practicing processing lists, this time using list
44

55
## Part 1: Numbers
66

7-
Write 5 custom **reporter** blocks that takes a list as an argument. You can assume that all items in the list passed as the argument will be numbers.
7+
Write 5 custom **reporter** blocks that takes a list as an argument. You can assume that all items in the list will be numbers.
88

99
1. Sum of all the numbers in the list.
10-
2. average of all of the numbers in the list.
10+
2. average of all the numbers in the list.
1111
3. True if the list contains one negative number and false if all the numbers are non-negative.
1212
4. True if each value in the list is greater than or equal to the one before it.
1313
5. The largest number in the list.

lab_45.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -4,11 +4,11 @@ In this lab, you will implement several custom blocks performing variants of seq
44

55
## Part 1: You there
66

7-
1. Write your own version of the **contains** block, which takes a list and a value as arguments. Then reports true if the value is in the list and reports false otherwise. You should not use the existing **contains** block in your implementation.
7+
1. Write your own version of the **contains** block, which takes a list and a value as arguments. Then reports true if the value is in the list and reports false otherwise. You should not use the existing **contains** block in your implementation.
88

99
## Part 2: Where
1010

11-
1. Write a custom block called **index of** that takes a list and a value as arguments and reports the index of the value found in the list. If the value is not in the list, report -1.
11+
1. Write a custom block called **index of** that takes a list and a value as arguments and reports the index of the value found in the list. If the value is not in the list, report -1.
1212

1313
## Part 3: Tell Me More
1414

lesson_41.md

+7-6
Original file line numberDiff line numberDiff line change
@@ -29,19 +29,20 @@ Students will be able to...
2929

3030
### Introductory discussion
3131

32-
Describe the solar system and hook your students in with a way to collect and store new information and discoveries.
32+
Describe the solar system and hook your students by explaining a way to collect and store new information and discoveries.
3333

3434
### Activity
3535

36-
In small groups, students will write an algorithm for adding new Solar System discoveries to a collection of older ones. The process should be complete and detailed so that a person can unambiguously follow the steps.
36+
In small groups,
3737

38-
The process itself will seem relatively simple. Ensure students think not only about the steps to be taken but the necessary materials and resources.
38+
1. have students write an algorithm for adding new Solar System discoveries to a collection of older ones. The process should be complete and detailed so that a person can unambiguously follow the steps.
3939

40-
Ensure that the algorithm would work for any discovery of any name size and does not make assumptions. e.g SUPER MEGA COOL ASTEROID, etc.
40+
2. The process itself will seem relatively simple. Ensure students think not only about the steps to be taken but the necessary materials and resources.
4141

42-
Pay particular attention to when the various materials are needed.
42+
3. Ensure that the algorithm would work for any discovery of any name size and does not make assumptions. e.g SUPER MEGA COOL ASTEROID, etc.
4343

44-
The key here is that the student will need to constantly be referencing this same pool of discoveries e.g. Pool, Pool + 1 discovery, Pool + 1 discovery + another etc. etc.
44+
* Pay particular attention to when the various materials are needed.
45+
* The key here is that the student will need to constantly be referencing this same pool of discoveries e.g. Pool, Pool + 1 discovery, Pool + 1 discovery + another etc. etc.
4546

4647
Instruct students to think about how they would write a script to complete this task. They need not write actual script, but should write pseudocode to attempt to solve the problem.
4748

lesson_43.md

+2-4
Original file line numberDiff line numberDiff line change
@@ -32,11 +32,9 @@ In small diverse groups, ask students to consider how to count the number of stu
3232

3333
* Provide only a few minutes to work through this-- students need not write full, formal algorithms, but simply describe an approach.
3434

35-
* Have groups share with each other and work together to come up with a single approach, hopefully settling on asking each student if s/he has a July birthday and counting the number of yeses (or something similar).
35+
Have groups share with each other and work together to come up with a single approach, hopefully settling on asking each student if s/he has a July birthday and counting the number of yeses (or something similar).
3636

37-
Define _traversal_ as the process of accessing each element of a list in order and performing some operation.
38-
39-
* Explain that the operation can be anything, and may not actually be performed on every element.
37+
Define _traversal_ as the process of accessing each element of a list in order and performing some operation. Explain that the operation can be anything, and may not actually be performed on every element.
4038

4139
Provide a few examples of possible operations (say each person's name, count the number of females, add up the total number of siblings, find the average GPA, etc.)
4240

lesson_45.md

+3-13
Original file line numberDiff line numberDiff line change
@@ -27,23 +27,13 @@ Students will be able to...
2727

2828
### Lecture
2929

30-
Ask students to consider how to determine if a particular person is in the room or not.
31-
32-
At first, you will likely get answers like "call out the person's name" or "look around." Press the students to come up with a method that will always work, including when the person is not present. If necessary, ask them to pretend they are a computer.
33-
34-
Point out that solutions like "look around" are too high-level, and in reality, there is a lot more going on (such as looking at each person individually).
30+
Ask students to consider how to determine if a particular person is in the room or not. At first, you will likely get answers like "call out the person's name" or "look around." Press the students to come up with a method that will always work, including when the person is not present. If necessary, ask them to pretend they are a computer. Point out that solutions like "look around" are too high-level, and in reality, there is a lot more going on (such as looking at each person individually).
3531

3632
Guide students to the process of checking if each person is the one they are seeking, in some deterministic order, until they have either found the person or checked everyone. Emphasize that the absence of the person is only confirmed when everyone has been checked, but that the presence is known as soon as the person is found.
3733

38-
Ensure students recognize that this process is a traversal of the people in the room.
39-
40-
Explain that the process of traversing a list looking for a particular item is known as a "sequential search."
41-
42-
Ask students to think about the efficiency of this algorithm. Emphasize best, worst, and average cases (both what those cases are and how long they take).
43-
44-
Students should have a basic understanding of the fact that the speed of the search is dependent on the size of the list.
34+
Ensure students recognize that this process is a traversal of the people in the room. Explain that the process of traversing a list looking for a particular item is known as a "sequential search."
4535

46-
* If students seem prepared, ask them to speculate under what circumstances you might be able to do better (eventually leading to binary search).
36+
Ask students to think about the efficiency of this algorithm. Emphasize best, worst, and average cases (both what those cases are and how long they take). Students should have a basic understanding of the fact that the speed of the search is dependent on the size of the list. If students seem prepared, ask them to speculate under what circumstances you might be able to do better (eventually leading to binary search).
4737

4838
Show the script for a basic sequential search:
4939
![basic sequential search](images/basic_sequential_search.jpg)

slidedecks/TEALS SNAP 4.1.pptx

85 KB
Binary file not shown.

slidedecks/TEALS SNAP 4.2.pptx

9 Bytes
Binary file not shown.

slidedecks/TEALS SNAP 4.3.pptx

19 Bytes
Binary file not shown.

slidedecks/TEALS SNAP 4.4.pptx

-1.99 KB
Binary file not shown.

slidedecks/TEALS SNAP 4.5.pptx

-12 Bytes
Binary file not shown.

0 commit comments

Comments
 (0)