Mr. Degonda’s Plan for the week of Sept 30th, 2013
(All computer classes in Library)
*Lesson plans subject to change due to MAPS testing.
Pre-K
Tuesday
Standard:
1a, 1b
First
Monday
Standard:
1a, 1b, 6a
Goal: Demonstrate knowledge of computer
parts.
Access Knowledge: Naming the computer,
monitor, and mouse.
New Information: Showing where parts are
by coloring
Apply Knowledge: Students will listen to
computer parts spoken outload and color the
corresponding computer part on their coloring
worksheet.
Generalization: Observation
Goal: Demonstrate how data in computers is
stored and processed using 0’s and 1’s
Access Knowledge: Counting, Matching, and
Sequencing
New Information: Data in Computers is
stored and processed in 0’s and 1’s
Apply Knowledge:
How can we represent words and numbers
using just these two symbols?
Activity: Count the Dot’s- Binary Numbers
Worksheet: Working with binary
Generalization: Greater than 80% on
worksheet activities
Kinder
Wednesday
Standard:
1a, 1b
Goal: Demonstrate knowledge of
computer parts.
Access Knowledge: Naming the
computer, monitor, battery, and mouse
(left and right buttons).
New Information: Showing where
parts are by coloring
Apply Knowledge: Students will listen
to computer parts spoken outload and
color the corresponding computer part
on their coloring worksheet.
Generalization: Observation
NO CLASS FRIDAY
Second
Friday
Fourth
Friday
Third
Wednesday
Standard:
1a, 6a, 6b
Goal: Demonstrate through activity
worksheets how data in computers is stored
and processed using 0’s and 1’s
Access Knowledge: Counting, Matching, and
Sequencing
New Information: Data in Computers is
stored and processed in 0’s and 1’s
Apply Knowledge:
How can we represent words and numbers
using just these two symbols?
Activity: Count the Dot’s- Binary Numbers
Worksheet: Working with binary
Worksheet Activity: Sending Secret
NO CLASS FRIDAY
Fourth
Friday
Messages
Generalization: Greater than 80% on
worksheet activities
NO CLASS FRIDAY
Fifth
Friday
Sixth
Wednesday
Standard:
1a, 2b, 6a, 6b, 3a
Seventh
Monday &
Thursday
Standard:
6a, 6b, 2a,
2b, 3la, 3b
3c, 3d, 5c,
5d
Goal: Demonstrate an understanding of
searching algorithms (linear, binary, and
hashing)
Access Knowledge: Logical Reasoning
New Information: Linear searching, binary
searching, and hashing
Apply Knowledge: Computers are often
required to find information in large
collections of data. They need
to develop quick and efficient ways of doing
this. This activity demonstrates three different
search methods: linear searching, binary
searching and hashing.
Activity: Battleships—Searching Algorithms
Generalization: Observation and completion
of battleship game worksheets
Goal: Demonstrate an understanding of
searching algorithms (linear, binary,
and hashing)
Access Knowledge: Logical Reasoning
New Information: Linear searching,
binary searching, and hashing
Apply Knowledge: Computers are
often required to find information in
large collections of data. They need
to develop quick and efficient ways of
doing this. This activity demonstrates
three different search methods: linear
searching, binary searching and
hashing.
Activity: Battleships—Searching
Algorithms
Generalization: Observation and
completion of battleship game
worksheets
Goal: Demonstrate how to efficiently sort list and understand
different methods a computer uses to sorts lists.
Access Knowledge: Using balance scales, ordering, and
comparing
New Information: How computers operate to sort data.
Apply Knowledge: Computers are often used to put lists into
some sort of order, for example names into alphabetical
order, appointments or e-mail by date, or items in numerical
order. Sorting lists helps us find things quickly, and also
makes extreme values easy to see. If you sort the marks for a
class test into numeric order, the lowest and highest marks
become obvious.
If you use the wrong method, it can take a long time to sort a
large list into order, even on a fast computer. Fortunately,
several fast methods are known for sorting. In this activity
children will discover different methods for sorting, and see
how a clever method can perform the task much more quickly
than a simple one.
Generalization: Worksheet - Sorting weights, Divide and
conquer.
Eighth
Tuesday &
Thursday
Standard:
6a, 6b, 2a,
2b, 3a, 3b
3c, 3d, 5c,
5d
Goal: Demonstrate an understanding of
searching algorithms (linear, binary, and
hashing)
Access Knowledge: Logical Reasoning
New Information: Linear searching, binary
searching, and hashing
Apply Knowledge: Computers are often
required to find information in large
collections of data. They need
to develop quick and efficient ways of doing
this. This activity demonstrates three different
search methods: linear searching, binary
searching and hashing.
Activity: Battleships—Searching Algorithms
Generalization: Observation and completion
of battleship game worksheets
Goal: Demonstrate how to efficiently sort list and understand
different methods a computer uses to sorts lists.
Access Knowledge: Using balance scales, ordering, and
comparing
New Information: How computers operate to sort data.
Apply Knowledge: Computers are often used to put lists into
some sort of order, for example names into alphabetical
order, appointments or e-mail by date, or items in numerical
order. Sorting lists helps us find things quickly, and also
makes extreme values easy to see. If you sort the marks for a
class test into numeric order, the lowest and highest marks
become obvious.
If you use the wrong method, it can take a long time to sort a
large list into order, even on a fast computer. Fortunately,
several fast methods are known for sorting. In this activity
children will discover different methods for sorting, and see
how a clever method can perform the task much more quickly
than a simple one.
Generalization: Worksheet - Sorting weights, Divide and
conquer.
Ninth
Monday &
Wednesday
Standard:
6a, 6b, 6c
Goal: Demonstrate an understanding of
searching algorithms (linear, binary, and
hashing)
Access Knowledge: Logical Reasoning
New Information: Linear searching, binary
searching, and hashing
Apply Knowledge: Computers are often
required to find information in large
collections of data. They need
to develop quick and efficient ways of doing
this. This activity demonstrates three different
search methods: linear searching, binary
searching and hashing.
Activity: Battleships—Searching Algorithms
Generalization: Observation and completion
of battleship game worksheets
Goal: Demonstrate how to efficiently sort list and understand
different methods a computer uses to sorts lists.
Access Knowledge: Using balance scales, ordering, and
comparing
New Information: How computers operate to sort data.
Apply Knowledge: Computers are often used to put lists into
some sort of order, for example names into alphabetical
order, appointments or e-mail by date, or items in numerical
order. Sorting lists helps us find things quickly, and also
makes extreme values easy to see. If you sort the marks for a
class test into numeric order, the lowest and highest marks
become obvious.
If you use the wrong method, it can take a long time to sort a
large list into order, even on a fast computer. Fortunately,
several fast methods are known for sorting. In this activity
children will discover different methods for sorting, and see
how a clever method can perform the task much more quickly
than a simple one.
Generalization: Worksheet - Sorting weights, Divide and
conquer.
Tenth
Wednesday
& Thursday
Standard:
3b, 3c, 3d,
4c, 6a, 6b
Goal: Demonstrate an understanding of
searching algorithms (linear, binary, and
hashing)
Access Knowledge: Logical Reasoning
New Information: Linear searching, binary
searching, and hashing
Apply Knowledge: Computers are often
required to find information in large
collections of data. They need
to develop quick and efficient ways of doing
this. This activity demonstrates three different
search methods: linear searching, binary
searching and hashing.
Activity: Battleships—Searching Algorithms
Generalization: Observation and completion
of battleship game worksheets
Goal: Demonstrate how to efficiently sort list and understand
different methods a computer uses to sorts lists.
Access Knowledge: Using balance scales, ordering, and
comparing
New Information: How computers operate to sort data.
Apply Knowledge: Computers are often used to put lists into
some sort of order, for example names into alphabetical
order, appointments or e-mail by date, or items in numerical
order. Sorting lists helps us find things quickly, and also
makes extreme values easy to see. If you sort the marks for a
class test into numeric order, the lowest and highest marks
become obvious.
If you use the wrong method, it can take a long time to sort a
large list into order, even on a fast computer. Fortunately,
several fast methods are known for sorting. In this activity
children will discover different methods for sorting, and see
how a clever method can perform the task much more quickly
than a simple one.
Generalization: Worksheet - Sorting weights, Divide and
conquer.
Eleventh
Tuesday &
Thursday
Standard:
1a, 1b, 3d,
6b
Goal: Demonstrate an understanding of
searching algorithms (linear, binary, and
hashing)
Access Knowledge: Logical Reasoning
New Information: Linear searching, binary
searching, and hashing
Apply Knowledge: Computers are often
required to find information in large
collections of data. They need
to develop quick and efficient ways of doing
this. This activity demonstrates three different
search methods: linear searching, binary
searching and hashing.
Activity: Battleships—Searching Algorithms
Generalization: Observation and completion
of battleship game worksheets
Goal: Demonstrate how to efficiently sort list and understand
different methods a computer uses to sorts lists.
Access Knowledge: Using balance scales, ordering, and
comparing
New Information: How computers operate to sort data.
Apply Knowledge: Computers are often used to put lists into
some sort of order, for example names into alphabetical
order, appointments or e-mail by date, or items in numerical
order. Sorting lists helps us find things quickly, and also
makes extreme values easy to see. If you sort the marks for a
class test into numeric order, the lowest and highest marks
become obvious.
If you use the wrong method, it can take a long time to sort a
large list into order, even on a fast computer. Fortunately,
several fast methods are known for sorting. In this activity
children will discover different methods for sorting, and see
how a clever method can perform the task much more quickly
than a simple one.
Generalization: Worksheet - Sorting weights, Divide and
conquer.
Twelfth
Monday &
Standard:
1a, 1b, 3d,
6b
Goal: Demonstrate an understanding of
searching algorithms (linear, binary, and
hashing)
Access Knowledge: Logical Reasoning
New Information: Linear searching, binary
searching, and hashing
Apply Knowledge: Computers are often
required to find information in large
collections of data. They need
to develop quick and efficient ways of doing
this. This activity demonstrates three different
NO CLASS FRIDAY
search methods: linear searching, binary
searching and hashing.
Activity: Battleships—Searching Algorithms
Generalization: Observation and completion
of battleship game worksheets