# ALEX Classroom Resource

## Searching Algorithms

Classroom Resource Information

Title:

Searching Algorithms

URL:

https://classic.csunplugged.org/searching-algorithms/

Content Source:

Other
CS Unplugged
Type: Learning Activity

Overview:

Searching for a keyword or value is the basis of many computing applications, whether on an internet search engine or looking up a bank account balance.

This activity explores the main algorithms that are used as the basis for searching on computers, using different variations on the game of battleships.

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.
Content Standard(s):
 Digital Literacy and Computer Science DLIT (2018) Grade: 5 19) Conduct advanced keyword searches to produce valid, appropriate results and evaluate results for accuracy, relevance, and appropriateness. Examples: Search techniques, check for credibility and validity. Unpacked Content Evidence Of Student Attainment:Students will: conduct advanced keyword searches. produce valid, appropriate search results. evaluate search results for accuracy, relevance, and appropriateness.Teacher Vocabulary:keyword search valid true accuracy/accurate relevance/relevant site/domain file typeKnowledge:Students know: how to conduct advanced keyword searches. how to evaluate the accuracy of information. that not all information online is valid or true. different sites or domains publish for different audiences.Skills:Students are able to: conduct advanced keyword searches using domain type such as '.edu', '.com', '.org', '.gov', file types, usage rights. explain how they know information located online is valid or true.Understanding:Students understand that: using advanced keywords while searching will deliver better results. not all information online is valid or true. Digital Literacy and Computer Science DLIT (2018) Grade: 6 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). Unpacked Content Evidence Of Student Attainment:Students will: find algorithms that demonstrate the three basic programming structures.Teacher Vocabulary:algorithm sequence selection iterationKnowledge:Students know: differences between the three basic programming structures.Skills:Students are able to: explain the differences in sequencing, selection, and iteration.Understanding:Students understand that: differences exist in sequencing, selection, and iteration. Digital Literacy and Computer Science DLIT (2018) Grade: 7 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. Unpacked Content Evidence Of Student Attainment:Students will: create an algorithm using one of the three basic programming structures: sequencing, selections, or iterations.Teacher Vocabulary:algorithm sequence selection iterationKnowledge:Students know: how to use the programming structures to create algorithms and how many algorithms make use of all three programming structures.Skills:Students are able to: create and recognize various programming structures found in algorithms.Understanding:Students understand that: each structure sequencing, selections, and iterations have a purpose.
Tags: algorithm, binary searching, hashing, linear searching, search