Please enable JavaScript to use CodeHS

Standards Mapping

for Kentucky Computational Thinking

12

Standards in this Framework

8

Standards Mapped

66%

Mapped to Course

Standard Lessons
1
Demonstrate an understanding of elementary logic, truth tables, and Boolean algebra.
  1. 4.1 Booleans
  2. 15.1 Short Circuit Evaluation
  3. 15.2 De Morgan's Laws
2
Demonstrate programming style best practices.
  1. 2.6 Comments
  2. 2.7 Naming Guidelines
  3. 2.10 Top Down Design
  4. 3.6 Comments
  5. 23.6 Top Down Design and Decomposition in Karel
  6. 23.7 Commenting Your Code
  7. 23.15 Debugging Strategies
3
Illustrate the flow of a program.
4
Illustrate concepts using one or more programming languages
  1. 2.1 Intro to Python with Tracy the Turtle
5
Explain the implications of file processing.
6
Describe the steps addressed in the design of a program to solve the state problem.
  1. 18.1 Let's Build Mastermind
7
Explain how algorithms are used to produce artificial intelligences(AI)
8
Describe the principles of object-oriented programming.
  1. 12.1 Classes and Objects
  2. 12.2 Methods
  3. 12.3 Built-In Methods
  4. 12.4 Operator Overloading
  5. 12.5 Class Variables vs. Instance Variables
  6. 12.6 Inheritance
  7. 12.7 Hidden Attributes
  8. 12.8 Namespaces
  9. 12.9 Modules
9
Develop algorithms with increasing degree of complexity using structured programming techniques such as: sequence, selection, and repetition.
  1. 2.4 For Loops
  2. 2.8 Functions
  3. 2.14 Using i in For Loops
  4. 2.15 Extended Loop Control
  5. 2.16 If Statements
  6. 2.17 If/ Else Statements
  7. 2.18 While Loops
  8. 4.2 If Statements
  9. 5.1 While Loops
  10. 5.2 For Loops
  11. 5.4 Nested Control Structures
  12. 8.3 For Loops and Lists
  13. 15.1 Short Circuit Evaluation
  14. 15.2 De Morgan's Laws
  15. 23.10 For Loops
  16. 23.11 If Statements
  17. 23.12 If/Else Statements
  18. 23.13 While Loops in Karel
10
Use fundamental data types and data structures such as: integers, reals, characters, strings, Booleans, one - and two - dimensional arrays.
  1. 3.2 Variables and Types
  2. 4.1 Booleans
  3. 4.5 Floating Point Numbers and Rounding
  4. 7.1 Indexing
  5. 7.2 Slicing
  6. 7.3 Immutability
  7. 7.4 Strings and For Loops
  8. 7.6 String Methods
  9. 8.1 Tuples
  10. 8.2 Lists
  11. 8.4 List Methods
  12. 9.1 2d Lists
  13. 9.2 List Comprehensions
  14. 9.4 Dictionaries
11
Analyze the binary representation of data.
12
Use modular programming.
  1. 6.1 Functions
  2. 6.2 Functions and Parameters
  3. 6.3 Namespaces in Functions
  4. 6.4 Functions and Return Values
  5. 12.1 Classes and Objects
  6. 12.2 Methods
  7. 12.3 Built-In Methods
  8. 12.4 Operator Overloading
  9. 12.5 Class Variables vs. Instance Variables
  10. 12.6 Inheritance
  11. 12.7 Hidden Attributes
  12. 12.9 Modules