for Ohio 9-12 Advanced — AP Computer Science A (Mocha)
Total Standards: 31Mapped: 13Completion: 41%
CS.D.9-12.A.a
Evaluate the function of various devices to formulate a human interaction solution.
16.1 Magpie Lab
CS.D.9-12.A.b
Integrate multifunctional computing devices to solve a problem.
CS.D.9-12.A.c
Identify the functionality of various categories of hardware components and the communication between them, and use that information to build a system virtually or physically for a specific task.
CS.HS.9-12.A.a
Categorize types of operating systems and how they will be used.
CS.T.9-12.A.a
Evaluate and revise a systematic process to identify the source of a problem and the steps to correct it within individual and connected devices.
NI.N.9-12.A.a
Construct a networking devices map solution for a realworld scenario to establish communication between distant devices.
NI.N.9-12.A.b
Develop a solution to a real-world scenario using networking protocols to establish network communication.
NI.N.9-12.A.c
Improve scalability and reliability of networks to describe the relationships and effects of how the different types of networks work together.
NI.C.9-12.A.a
Identify cybersecurity ethics and law
NI.C.9-12.A.b
Implement a devised solution to counter a security threat.
DA.DCS.9-12.A.a
Create multidimensional data collections that can be utilized through various methods to solve complex data problems.
5.1 What are Data Structures?
DA.DCS.9-12.A.b
Investigate data storage and collection tools to analyze tradeoffs and limitations.
5.1 What are Data Structures?
5.6 Arrays vs ArrayLists
5.9 2D Arrays (Matrices or Grids)
5.11 HashMaps
DA.VC.9-12.A.a
Create visualization or multisensory artifacts to communicate insights and knowledge gained from complex data analysis that answers real-world questions.
DA.IM.9-12.A.a
Create a model that simulates a complex system and uses extracted data to hypothesize, test and refine the model to discover connections or trends.
8.6 Advanced: Recursion
ATP.A.9-12.A.a
Define and explain recursive algorithms to understand how and when to apply them.
8.6 Advanced: Recursion
ATP.A.9-12.A.b
Use recursion to effectively solve problems.
8.6 Advanced: Recursion
ATP.A.9-12.A.c
Define and explain sorting and searching algorithms to understand how and when to apply them.
8.2 Linear Search
8.3 Binary Search
8.4 Selection Sort
8.5 Insertion Sort
8.7 Mergesort
ATP.A.9-12.A.d
Use sorting and searching to analyze and organize data.
8.2 Linear Search
8.3 Binary Search
8.4 Selection Sort
8.5 Insertion Sort
8.7 Mergesort
ATP.VDR.9-12.A.a
Utilize different data storage structures to store larger and more complex data than variables can contain.
5.1 What are Data Structures?
5.6 Arrays vs ArrayLists
5.9 2D Arrays (Matrices or Grids)
5.11 HashMaps
ATP.VDR.9-12.A.b
Identify the appropriate data structures or variables to use to design a solution to a complex problem.
5.1 What are Data Structures?
5.6 Arrays vs ArrayLists
5.9 2D Arrays (Matrices or Grids)
5.11 HashMaps
ATP.CS.9-12.A.a
Write programs that use library methods and control structures and methods to solve a problem.
5.6 Arrays vs ArrayLists
5.8 The List Interface
ATP.CS.9-12.A.b
Refactor a program to be smaller and more efficient.
ATP.M.9-12.A.a
Construct solutions to problems using student-created components (e.g., procedures, modules, objects).
3.2 Methods and Parameters
3.3 Methods and Return Values
3.4 Javadocs and More Methods
ATP.M.9-12.A.b
Design or redesign a solution to a large-scale computational problem by identifying generalizable patterns.
