Updating search results...

Search Resources

8 Results

View
Selected filters:
  • VA.PRG.AP.3 - The student will use the iterative design process to create, test, and...
  • VA.PRG.AP.3 - The student will use the iterative design process to create, test, and...
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
Designing Interactive Narratives with Python
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

These modules are designed to help you get familiar with Python while exploring interactive narrative design, where we put together stories that leave space for the reader to explore, make choices, and engage with the events of the story in a participatory way. Each module in this course follows the same format:Backstory: Unpack the context around the module, set up catalyzing questions to guide the inquiry throughout the module, and establish goals and objectives for your engagement with the moduleGuided Inquiry: Step through a sequence of tutorials and hands-on activities designed to help you learn the basic ideas presented in the modulesPrompt: A tightly-bounded, focused activity designed to facilitate sustained engagement with the ideas presented in the moduleCatalyzing Questions: A series of questions intended to provoke reflection & to put the module’s content in contextEach module is intended to support between 30 and 60 minutes of focused, sustained engagement. You may find it suits you to leave the module in the middle and return to your work; that’s totally fine. Work at your own pace, and don’t hesitate to reach out to your facilitators if you run into any problems.

Subject:
Algorithms and Programming
Computer Science
Material Type:
Unit of Study
Author:
CodeVA Curriculum
Date Added:
12/05/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
Python Number Guessing Game
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

 This lesson introduces 9-12 grade students to the Python random library. The program will choose a random number using functions from the Python random library in a set number range. The program will prompt the player to choose a number in the given range and keep track of the number of guesses the player makes. If the player guesses higher than the chosen number, it will give the player a message that their guess is too high. If the player guesses lower than the chosen number, it will give the player a message their guess is too low. The program will continue to prompt the player for guesses until they guess the correct number. 

Subject:
Algorithms and Programming
Data and Analysis
Material Type:
Activity/Lab
Assessment
Homework/Assignment
Author:
Ronald Sparks
Date Added:
05/09/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