Updating search results...

Search Resources

11 Results

View
Selected filters:
  • VA.CS.CSF.20 - The student will apply simple algorithms to a collection of data.
  • VA.CS.CSF.20 - The student will apply simple algorithms to a collection of data.
Brute Force vs Divide and Conquer Sorting
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

 This activity will allow students to compare Brute Force and Divide and Conquer sorting algorithms.This activity will show the sorting process of a Brute Force algorithm and a Divide and Conquer algorithm that is used by a computer when sorting data.

Subject:
Algorithms and Programming
Material Type:
Activity/Lab
Author:
Ronald Sparks
Date Added:
04/18/2022
Caesar Cipher - Unplugged
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This unplugged lesson will allow students to encrypt and decrypt message using the Caesar Cipher letter shift method of encryption. Cover the process of how this method works by doing an example and explaining the process of shifting the plaintext by the letter shift value to create the encrypted cipher text.

Subject:
Computer Science
Cybersecurity
Data and Analysis
Material Type:
Activity/Lab
Assessment
Homework/Assignment
Author:
Ronald Sparks
Date Added:
05/23/2022
Caesar Cipher in Python
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This lesson is designed to teach students basic encryption using the Caesar cipher method. This is a simple letter shift cipher that takes a plaintext message and encrypts it into cipher text by shifting each letter of the message by a value between 1 and 25 (1 less than the total number of letters in the English alphabet). This technique was used by Julius Caesar to encrypt messages by shifting each letter of the message by 3 letters. The message would be decrypted by taking each letter and shifting back 3 letters to reveal the plaintext message.

Subject:
Algorithms and Programming
Computer Science
Cybersecurity
Material Type:
Activity/Lab
Assessment
Homework/Assignment
Author:
Ronald Sparks
Date Added:
05/23/2022
ECS 2.10-12 Encoding & Decoding Binary
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

In this lesson, students will learn about using binary encoding to represent numbers and text. They’ll use several different encoding techniques, and then develop and test their own protocol for encoding other kinds of information into binary.

Subject:
Computer Science
Computing Systems
Data and Analysis
Material Type:
Lesson Plan
Author:
CodeVA Curriculum
Date Added:
12/05/2022
ECS 2.17 Minimum Spanning Trees
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Students will use minimum spanning trees to analyze a problem and provide insights into addressing the problem. The lesson provides detailed support around analyzing transportation infrastructure in their community and assessing its impact on the lives of different people who use it. Students create minimum spanning trees based on data, solve the trees to generate insights about the data, and communicate those insights along with policy recommendations based on their analysis.

Subject:
Algorithms and Programming
Computer Science
Material Type:
Lesson Plan
Author:
CodeVA Curriculum
Date Added:
12/05/2022
How the Enigma Machine worked
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This resource has a YouTube video link and a website link on how the German Enigma Machine worked to encrypt messages during World War II.

Subject:
Algorithms and Programming
Computer Science
Cybersecurity
Data and Analysis
Impacts of Computing
Material Type:
Activity/Lab
Homework/Assignment
Author:
Ronald Sparks
Date Added:
06/14/2022
The Josephus problem
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

The Josephus problem is based around Josephus Flavius; a Jewish soldier and historian who inspired an interesting set of mathematical problems. This resource is a PDF activity based on the Josephus problem.

Subject:
Algorithms and Programming
Computer Science
Impacts of Computing
Material Type:
Activity/Lab
Homework/Assignment
Author:
Ronald Sparks
Date Added:
06/13/2022
Merge Sort - Unplugged
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This activity will show the sorting process using the Merge Sort Divide and Conquer algorithm that is used by a computer when sorting data without using a computer.

Subject:
Algorithms and Programming
Computer Science
Data and Analysis
Material Type:
Activity/Lab
Assessment
Homework/Assignment
Author:
Ronald Sparks
Date Added:
05/19/2022
Quick Sort - Unplugged
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This activity will show the sorting process using the Quick Sort Divide and Conquer algorithm that is used by a computer when sorting data without using a computer.

Subject:
Algorithms and Programming
Computer Science
Data and Analysis
Material Type:
Activity/Lab
Assessment
Data Set
Homework/Assignment
Author:
Ronald Sparks
Date Added:
05/20/2022