Please enable JavaScript to use CodeHS

Standards Mapping

for Nevada 9-12

31

Standards in this Framework

14

Standards Mapped

45%

Mapped to Course

Standard Lessons
9-12.AP.A.1
Create prototypes that use algorithms to solve computational problems by leveraging prior student knowledge and personal interests.
  1. 6.1 Writing BlackJack
  2. 9.1 AP Practice Test 1
  3. 10.1 Final Project
  4. 11.1 Pokemon Simulation
  5. 12.1 Mad Libs
  6. 14.1 Quiz Creation
9-12.AP.V.1
Demonstrate the use of both linked lists and arrays to simplify solutions, generalizing computational problems instead of repeatedly using simple variables.
  1. 5.1 What are Data Structures?
  2. 5.2 Introduction to Arrays
  3. 5.3 Using Arrays
  4. 5.5 ArrayList Methods
  5. 5.6 Arrays vs ArrayLists
  6. 5.8 The List Interface
  7. 5.9 2D Arrays (Matrices or Grids)
9-12.AP.C.1
Justify the selection of specific control structures when tradeoffs involve implementation, readability, and program performance, and explain the benefits and drawbacks of choices made.
  1. 1.9 For Loops
  2. 1.10 While Loops in Karel
  3. 1.13 Control Structures Example
  4. 2.9 For Loops
  5. 2.10 While Loops
  6. 2.11 If Statements
  7. 2.12 Loop-and-a-Half
9-12.AP.C.2
Design and iteratively develop computational artifacts for practical intent, personal expression, or to address a societal issue by using events to initiate instructions.
  1. 6.1 Writing BlackJack
9-12.AP.M.1
Decompose problems into smaller components through systematic analysis, using constructs such as procedures, modules, and/or objects.
  1. 4.1 Introduction to Classes and Objects
  2. 4.2 Classes vs. Objects
  3. 4.4 Writing Classes
  4. 4.5 Writing Classes and Instance Methods
  5. 4.6 Getter and Setter Methods
  6. 4.13 Inheritance
  7. 4.14 Class Design and Abstract Classes
  8. 4.15 Polymorphism
  9. 4.17 Interfaces
9-12.AP.M.2
Create artifacts by using procedures within a program, combinations of data and procedures, or independent but interrelated programs.
  1. 4.15 Polymorphism
  2. 4.17 Interfaces
  3. 6.1 Writing BlackJack
  4. 9.1 AP Practice Test 1
  5. 10.1 Final Project
  6. 11.1 Pokemon Simulation
  7. 12.1 Mad Libs
9-12.AP.PD.1
Systematically design and develop programs for broad audiences by incorporating feedback from users.
9-12.AP.PD.2
Evaluate licenses that limit or restrict use of computational artifacts when using resources such as libraries.
9-12.AP.PD.3
Evaluate and refine computational artifacts to make them more usable by all and accessible to people with disabilities.
9-12.AP.PD.4
Design and develop computational artifacts working in team roles using collaborative tools.
9-12.AP.PD.5
Document design decisions using text, graphics, presentations, and/or demonstrations in the development of complex programs.
  1. 1.6 Top Down Design and Decomposition in Karel
  2. 1.7 Commenting Your Code
9-12.CS.D.1
Explain how abstractions hide the underlying implementation details of computing systems embedded in everyday objects.
  1. 4.14 Class Design and Abstract Classes
9-12.CS.HS.1
Compare levels of abstraction and interactions between application software, system software, and hardware layers.
  1. 5.12 Binary
9-12.CS.T.1
Develop guidelines that convey systematic troubleshooting strategies that others can use to identify and fix errors.
  1. 1.6 Top Down Design and Decomposition in Karel
  2. 1.7 Commenting Your Code
  3. 1.14 More Karel Examples and Testing
9-12.DA.S.1
Translate between different bit representations of real-world phenomena, such as characters, numbers, and images (e.g., convert hexadecimal colors to decimal percentages, ASCII/Unicode representation).
  1. 5.12 Binary
9-12.DA.S.2
Evaluate the tradeoffs in how data elements are organized and where data is stored.
  1. 5.1 What are Data Structures?
  2. 5.2 Introduction to Arrays
  3. 5.3 Using Arrays
  4. 5.5 ArrayList Methods
  5. 5.6 Arrays vs ArrayLists
  6. 5.8 The List Interface
  7. 5.9 2D Arrays (Matrices or Grids)
  8. 5.11 HashMaps
  9. 8.2 Linear Search
  10. 8.3 Binary Search
  11. 8.4 Selection Sort
  12. 8.5 Insertion Sort
  13. 8.7 Mergesort
9-12.DA.CVT.1
Create interactive data visualizations or alternative representations using software tools to help others better understand real-world phenomena.
  1. 6.1 Writing BlackJack
  2. 8.5 Insertion Sort
9-12.DA.IM.1
Create computational models that represent the relationships among different elements of data collected from a phenomenon, process, or model.
  1. 8.6 Advanced: Recursion
9-12.IC.C.1
Evaluate the ways computing impacts personal, ethical, social, economic, and cultural practices.
9-12.IC.C.2
Test and refine computational artifacts to reduce bias and equity deficits.
9-12.IC.C.3
Demonstrate ways a given algorithm applies to problems across disciplines.
9-12.IC.C.4
Explain the potential impacts of artificial intelligence on society.
9-12.IC.SI.1
Use tools and methods for collaboration on a project to increase connectivity of people in different cultures and career fields.
9-12.IC.SLE.1
Explain the beneficial and harmful effects that intellectual property laws can have on innovation.
9-12.IC.SLE.2
Explain the privacy concerns related to the collection and generation of data through automated processes that may not be evident to users.
9-12.IC.SLE.3
Evaluate the social and economic implications of privacy in the context of safety, law, or ethics.
9-12.NI.NCO.1
Evaluate the scalability and reliability of networks, by describing the relationship between routers, switches, servers, topology, and addressing.
9-12.NI.C.1
Give examples to illustrate how sensitive data can be affected by malware and other attacks.
9-12.NI.C.2
Recommend security measures to address various scenarios based on factors such as efficiency, feasibility, and ethical impacts.
9-12.NI.C.3
Compare various security measures, considering tradeoffs between the usability and security of a computing system.
9-12.NI.C.4
Explain tradeoffs when selecting and implementing cybersecurity recommendations.