Please enable JavaScript to use CodeHS

Standards Mapping

for Maryland 11-12

31

Standards in this Framework

11

Standards Mapped

35%

Mapped to Course

Standard Lessons
12.CS.HS.01 I
Identify, categorize, and illustrate the roles of operating systems to include memory management, data storage/retrieval, process management, and access control.
12.NI.NCO.01
Evaluate the scalability and reliability of networks by identifying and describing the relationship between routers, switches, servers, topology, protocols, and addressing.
12.NI.C.01
Compare and refine ways software developers protect devices and information from unauthorized access including complex encryption algorithms such as public key encryption.
12.DA.CVT.01
Use data analysis tools and techniques to identify patterns in data representing complex systems.
12.DA.CVT.02
Use a variety of robust data collection techniques and tools to generate data sets that support a claim or communicate information.
12.DA.IM.01
Evaluate the ability of models and simulations to test and support refinement of hypotheses.
12.AP.A.01
Describe how artificial intelligence drives many software and physical systems (e.g., autonomous robots, computer vision, pattern recognition, test analysis).
12.AP.A.02
Design and implement an algorithm to play a game against a human opponent or solve a problem.
  1. 6.1 Writing BlackJack
  2. 11.1 Pokemon Simulation
12.AP.A.03
Design and implement encryption algorithms to securely store and retrieve information.
12.AP.A.04
Analyze and refine classic algorithms to solve problems.
  1. 8.2 Linear Search
  2. 8.3 Binary Search
  3. 8.4 Selection Sort
  4. 8.5 Insertion Sort
  5. 8.7 Mergesort
12.AP.A.05
Evaluate algorithms (e.g., searching, sorting) in terms of their efficiency, correctness, and clarity.
  1. 8.2 Linear Search
  2. 8.3 Binary Search
  3. 8.5 Insertion Sort
  4. 8.7 Mergesort
12.AP.V.01
Compare and contrast foundational data structures and their primary functions.
  1. 5.1 What are Data Structures?
  2. 5.2 Introduction to Arrays
  3. 5.6 Arrays vs ArrayLists
  4. 5.9 2D Arrays (Matrices or Grids)
  5. 5.11 HashMaps
12.AP.C.01
Illustrate the flow of execution of a recursive algorithm.
  1. 8.6 Advanced: Recursion
12.AP.M.01
Construct solutions to problems using student-created components, such as procedures, modules, and objects to implement abstractions.
  1. 4.14 Class Design and Abstract Classes
  2. 4.17 Interfaces
  3. 6.1 Writing BlackJack
  4. 11.1 Pokemon Simulation
12.AP.M.02
Analyze a large-scaled computational problem and identify generalizable patterns that can be applied to a solution.
  1. 8.1 What is an Algorithm?
  2. 8.4 Selection Sort
  3. 8.5 Insertion Sort
  4. 8.7 Mergesort
12.AP.M.03
Create programming solutions using libraries and APIs through the application of code reuse.
  1. 1.1 Introduction to Programming With Karel
  2. 1.8 Super Karel
  3. 1.16 Karel Challenges
  4. 4.3 Using a Class as a Client
12.AP.PD.01
Utilize a software life cycle process, that considers security, to plan and develop programs for all types of users.
12.AP.PD.02
Explain security issues that might lead to compromised computer programs.
12.AP.PD.03
Develop different programs for various computing platforms (e.g., desktop, web, mobile).
  1. 13.1 Java Outside of CodeHS
12.AP.PD.04
Design software collaboratively using integrated development environments (IDEs), with version control and collaboration systems.
12.AP.PD.05
Develop and use a series of test cases to verify that a program performs according to its design specifications.
  1. 1.14 More Karel Examples and Testing
  2. 6.1 Writing BlackJack
  3. 10.1 Final Project
12.AP.PD.06
Modify an existing program to add additional functionality and discuss intended and unintended implications (e.g., breaking other functionality).
  1. 4.6 Getter and Setter Methods
  2. 4.9 Method Overloading
  3. 4.14 Class Design and Abstract Classes
  4. 4.15 Polymorphism
12.AP.PD.07
Compare multiple programming languages or libraries and discuss how their features make them suitable for solving different types of problems.
12.AP.PD.08
Evaluate key qualities of a program through a process such as code review.
12.IC.C.01
Evaluate the positive and negative implications computational artifacts have on society.
12.IC.C.02
Evaluate the impact of equity, access, and influence on the distribution of computing resources in the global society.
12.IC.C.04
Predict evolutionary trends of computational innovations that have revolutionized aspects of global society.
12.IC.C.05
Predict how computational innovations may revolutionize aspects of global society.
12.IC.SI.01
Select and justify the tools and methods used for collaboration on a project to increase diverse ideas and solutions.
12.IC.SLE.01
Debate the laws and regulations that govern and impact the development of computing innovations and policies.
12.IC.SLE.02
Investigate reasons new technologies require evaluation of existing laws and regulations and the creation of new legislation.