ALEX Classroom Resources

ALEX Classroom Resources  
   View Standards     Standard(s): [DLIT] (3) 26 :
20) Compare and contrast human and computer performance on similar tasks to understand which is better suited to the task.

Examples: Sorting alphabetically, finding a path across a cluttered room.

[DLIT] (4) 22 :
16) Gather and organize data to answer a question using a variety of computing and data visualization methods.

Examples: Sorting, totaling, averaging, charts, and graphs.

[DLIT] (5) 8 :
2) Create an algorithm to solve a problem while detecting and debugging logical errors within the algorithm.

Examples: Program the movement of a character, robot, or person through a maze.
Define a variable that can be changed or updated.

[DLIT] (5) 9 :
3) Create an algorithm that is defined by simple pseudocode.

[DLIT] (6) 11 :
5) Identify algorithms that make use of sequencing, selection or iteration.

Examples: Sequencing is doing steps in order (put on socks, put on shoes, tie laces); selection uses a Boolean condition to determine which of two parts of an algorithm are used (hair is dirty? True, wash hair; false, do not); iteration is the repetition of part of an algorithm until a condition is met (if you're happy and you know it clap your hands, when you're no longer happy you stop clapping).

[DLIT] (7) 9 :
3) Create algorithms that demonstrate sequencing, selection or iteration.

Examples: Debit card transactions are approved until the account balance is insufficient to fund the transaction = iteration, do until.

Subject: Digital Literacy and Computer Science (3 - 7)
Title: Sorting Algorithms
URL: https://classic.csunplugged.org/sorting-algorithms/
Description:

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.



   View Standards     Standard(s): [DLIT] (3) 26 :
20) Compare and contrast human and computer performance on similar tasks to understand which is better suited to the task.

Examples: Sorting alphabetically, finding a path across a cluttered room.

[DLIT] (4) 22 :
16) Gather and organize data to answer a question using a variety of computing and data visualization methods.

Examples: Sorting, totaling, averaging, charts, and graphs.

[DLIT] (7) 7 :
1) Create a function to simplify a task.

Example: Get a writing utensil, get paper, jot notes can collectively be named "note taking".

[DLIT] (7) 9 :
3) Create algorithms that demonstrate sequencing, selection or iteration.

Examples: Debit card transactions are approved until the account balance is insufficient to fund the transaction = iteration, do until.

Subject: Digital Literacy and Computer Science (3 - 7)
Title: Computer Science Discoveries Unit 1 Chapter 2 Lesson 6: Processing
URL: https://studio.code.org/s/csd1-2018/stage/6/puzzle/1
Description:

This lesson dives deeper into the concept of processing that was introduced as part of the definition of a computer. Pairs work together to put a deck of cards in order, a form of processing information. In the end, the class discusses what processing means within the context of solving information problems.

Note: You will need to create a free account on code.org before you can view this resource.



ALEX Classroom Resources: 2

Go To Top of page