Please enable JavaScript to use CodeHS

Standards Mapping

for GACE 2025

Clear selection Print / Download

57

Standards in this Framework

57

Standards Mapped

100%

Mapped to Course

Standard Lessons
311.1A
Demonstrate knowledge of iterative computation to solve problems.
  1. 13.13 For Loops
  2. 13.14 While Loops
  3. 17.7 Recursion
311.1B
Apply knowledge of decomposing a problem into simpler computational parts.
  1. 2.6 Top Down Design and Decomposition in Karel
  2. 17.1 What is an Algorithm?
311.1C
Apply characteristics of algorithmic thinking, including the use of flowcharts and pseudocode.
  1. 13.2 Organizational Techniques
311.1D
Demonstrate knowledge of the use of sequence, selection, iteration, and recursive thinking in algorithm design.
  1. 13.11 Comparison Operators
  2. 13.12 If Statements
  3. 13.13 For Loops
  4. 13.16 Loop-and-a-Half
311.1E
Demonstrate knowledge of the concept of abstraction for managing computational complexity.
  1. 9.8 Industry Resources
  2. 17.1 What is an Algorithm?
311.1F
Demonstrate knowledge of how computational and algorithmic components fit together in a problem-solving process.
  1. 13.2 Organizational Techniques
311.1G
Demonstrate knowledge of industry resources and career technical education concepts related to computational thinking and the development of algorithms.
  1. 17.1 What is an Algorithm?
311.2A
Demonstrate knowledge of the practical application of algorithms.
  1. 17.1 What is an Algorithm?
311.2B
Interpret flow of control in an algorithm.
  1. 13.2 Organizational Techniques
311.2C
Predict output of a given algorithm, including through algorithmic tracing.
  1. 13.2 Organizational Techniques
  2. 13.6 Arithmetic Expressions
311.2D
Select an algorithm to solve a given problem.
  1. 17.1 What is an Algorithm?
311.2E
Evaluate an algorithm in terms of clarity (e.g., ambiguity, specificity).
  1. 12.1 Basic Debugging in Java
  2. 12.3 Debugging Techniques
  3. 12.4 Common Java Errors
311.2F
Evaluate algorithms in terms of complexity and efficiency, including a basic interpretation of big-O notation.
  1. 17.4 Selection Sort
  2. 17.5 Insertion Sort
  3. 17.8 Mergesort
  4. 17.9 Algorithmic Complexity
311.2G
Demonstrate knowledge of industry resources and career technical education concepts related to characteristics of algorithms.Apply knowledge of the characteristics and uses of searching (i.e., linear/sequential and binary) and sorting algorithms (e.g., bubble, selection).
  1. 17.2 Linear Search
  2. 17.3 Binary Search
  3. 17.4 Selection Sort
  4. 17.6 Searching and Sorting Algorithms
311.2H
Demonstrate knowledge of industry resources and career technical education concepts related to characteristics of algorithms.
  1. 3.6 Ethical and Social Implications of Computing
  2. 17.12 Algorithm Characteristics
311.3A
Demonstrate knowledge of tools and techniques for locating, extracting, transforming, loading, and storing data sets (e.g., crawlers, data preparation tools, databases).
  1. 5.1 Getting Started with Data
  2. 5.4 Data Collection & Limitations
311.3B
Identify data and use a variety of tools (e.g., database, spreadsheet, algorithms) and techniques (e.g., search, filter, transform, visualize) to analyze data and metadata and identify patterns.
  1. 5.3 Using Spreadsheets with Data
  2. 5.7 Analyzing Data
311.3C
Demonstrate knowledge of the use of representations, models, and simulations to describe processes and evaluate hypotheses.
  1. 5.3 Using Spreadsheets with Data
311.3D
Apply knowledge of computer models and data analysis techniques for simulating, analyzing, and evaluating solutions to real-world problems, including the use of artificial intelligence (AI).
  1. 3.5 Future of Computing
  2. 5.6 AI and Data
311.3E
Demonstrate knowledge of industry resources and career technical education concepts related to data analysis, modeling, and simulation.
  1. 5.5 Simulation
312.1A
Apply knowledge of characteristics of types of programming languages (e.g., functional, compiled, object-oriented), including block-based languages.
  1. 13.1 Programming Languages
312.1B
Apply knowledge of the Software Development Life Cycle (SDLC) and methodologies (e.g., waterfall, iterative, agile).
  1. 11.1 Intro to Software Development
312.1C
Apply knowledge of programming style and good programming practices (e.g., indenting, spacing, comments, encapsulation, naming conventions, camelCase) and program documentation.
  1. 2.15 How to Indent Your Code
312.1D
Apply knowledge of tools related to the development of computer artifacts (e.g., integrated development environments [IDEs], application programming interfaces [APIs], libraries, mobile device simulators).
  1. 11.2 How Developers Create and Test Applications
  2. 12.6 Java Outside of CodeHS
  3. 15.3 Using a Class as a Client
312.1E
Apply knowledge of common programming errors and procedures for testing and debugging computer programs.
  1. 12.1 Basic Debugging in Java
  2. 12.2 Debugging Tools
  3. 12.3 Debugging Techniques
312.1F
Demonstrate knowledge of a variety of concepts related to programming (e.g., event driven, heuristic algorithms, parallel processing, artificial intelligence).
  1. 3.5 Future of Computing
  2. 13.5 User Input
  3. 16.3 Using Arrays
312.1G
Demonstrate knowledge of techniques for learning the characteristics of and proficiently using one or more programming languages (e.g., Java, Python, JavaScript, C, C++, C#/.NET, R, Rust).
  1. 13.1 Programming Languages
312.1H
Demonstrate knowledge of industry resources and career technical education concepts related to programming concepts and programming design and development.
  1. 11.3 Intro to Design Thinking
  2. 11.4 Prototype
  3. 11.5 Test
312.2A
Demonstrate knowledge of language-defined data types (e.g., integer, float, Boolean).
  1. 13.4 Variables and Types
  2. 13.9 Booleans
312.2B
Apply properties of strings and string methods (e.g., length, substring, concatenation).
  1. 13.19 String Types
  2. 14.4 String Methods
312.2C
Apply knowledge of constants, variables, and classes in various contexts.
  1. 15.2 Classes vs. Objects
  2. 15.3 Using a Class as a Client
  3. 15.5 Writing Classes and Instance Methods
  4. 15.8 Local Variables and Scope
312.2D
Apply a basic knowledge of data structures (e.g., arrays, lists, queues).
  1. 16.2 Introduction to Arrays
  2. 16.3 Using Arrays
  3. 16.4 2D Arrays
  4. 16.6 HashMaps, Stacks, and Queues
312.2E
Demonstrate knowledge of industry resources and career technical education concepts related to characteristics and uses of data types.
  1. 3.5 Future of Computing
  2. 3.6 Ethical and Social Implications of Computing
  3. 5.7 Analyzing Data
312.3A
Apply arithmetical operators as defined by the language (e.g., addition, subtraction, multiplication, integer division, modular arithmetic).
  1. 13.6 Arithmetic Expressions
312.3B
Apply relational operators (e.g., greater than, less than, equal to) in conditional statements.
  1. 13.10 Logical Operators
  2. 13.11 Comparison Operators
312.3C
Interpret logical operators (e.g., AND, OR, NOT) in various contexts (e.g., logic tables, truth tables, logic gates).
  1. 13.9 Booleans
  2. 13.10 Logical Operators
  3. 13.17 Short-Circuit Evaluation
  4. 13.18 DeMorgan's Laws
312.3D
Apply knowledge of conditional selection structures (e.g., if, if-else), including nesting.
  1. 13.12 If Statements
  2. 13.15 Nested Iterations
312.3E
Apply knowledge of iterative control structures (e.g., while, for), including nesting.
  1. 13.13 For Loops
  2. 13.14 While Loops
  3. 13.15 Nested Iterations
312.3F
Demonstrate knowledge of industry resources and career technical education concepts related to operators and control structures.
  1. 13.10 Logical Operators
  2. 13.11 Comparison Operators
  3. 13.12 If Statements
  4. 13.13 For Loops
  5. 13.14 While Loops
  6. 13.18 DeMorgan's Laws
312.4A
Demonstrate knowledge of principles of modularization and characteristics of program modules (e.g., functions/methods, objects, classes).
  1. 14.1 Java Methods
  2. 14.2 Methods and Parameters
  3. 14.3 Methods and Return Values
  4. 15.1 Intro to Classes and Objects
  5. 15.4 Writing Classes
312.4B
Analyze the characteristics and uses of inheritance, polymorphism, and classes in object-oriented programming.
  1. 15.1 Intro to Classes and Objects
  2. 15.11 Inheritance
  3. 15.12 Polymorphism
312.4C
Demonstrate knowledge of best practice principles related to object-oriented design and programming (e.g., abstraction, information hiding, encapsulation, constructors).
  1. 15.2 Classes vs. Objects
  2. 15.3 Using a Class as a Client
  3. 15.4 Writing Classes
  4. 15.9 Key Terms for Classes
312.4D
Apply knowledge of function calls, parameters, and parameter-passing techniques.
  1. 15.6 Getter and Setter Methods
  2. 15.7 Method Overloading
  3. 15.8 Local Variables and Scope
312.4E
Demonstrate knowledge of industry resources and career technical education concepts related to object-oriented design and development.
  1. 12.1 Basic Debugging in Java
  2. 12.5 Common Compiler Errors
  3. 12.6 Java Outside of CodeHS
  4. 15.13 Object-Oriented Design for Certification Success
313.1A
Demonstrate knowledge of how information (e.g., text, image, sound, color) can be represented digitally by binary data.
  1. 4.4 Encoding Text with Binary
313.1B
Demonstrate knowledge of characteristics of various number systems (e.g., binary, decimal, hexadecimal, ASCII, Unicode).
  1. 4.3 Number Systems
  2. 4.4 Encoding Text with Binary
313.1C
Demonstrate knowledge of basic computer architecture and peripherals (e.g., processors, memory, storage, digital and analog sensors), including using continuous and discrete data.
  1. 9.3 Peripheral Devices
313.1D
Demonstrate knowledge of the characteristics and functions of operating systems.
  1. 3.4 Hardware
  2. 8.2 Operating Systems Software
  3. 8.3 Comparing Operating Systems
313.1E
Apply knowledge of strategies for troubleshooting basic hardware and software problems.
  1. 10.1 Methodology
  2. 10.2 Support Practice
313.1F
Demonstrate knowledge of industry resources and career technical education concepts related to terminology and concepts related to computing systems.
  1. 3.2 Computer Organization
  2. 3.3 Software
  3. 3.6 Ethical and Social Implications of Computing
313.2A
Demonstrate knowledge of terminology and concepts related to computer networks (e.g., client, server, bandwidth, protocol, intranet, logic gates).
  1. 6.1 Welcome to the Internet
  2. 6.6 Packets and Protocols
  3. 9.4 Network Devices
  4. 9.6 Network Options
313.2B
Identify the basic structure and features of the Internet and the World Wide Web (WWW).
  1. 6.2 Internet Hardware
  2. 6.3 Internet Addresses
  3. 6.4 DNS
313.2C
Demonstrate knowledge of concepts related to data transfer on the Internet (e.g., routing, packet switching, https).
  1. 6.5 Routing
  2. 6.6 Packets and Protocols
313.2D
Demonstrate knowledge of terminology and concepts related to mobile technologies (e.g., apps, wireless connectivity, security) and the interaction between mobile devices and networks (e.g., Internet of Things [IoT], cloud computing).
  1. 6.2 Internet Hardware
  2. 9.6 Network Options
  3. 9.7 Network Communication
313.2E
Demonstrate knowledge of network security (e.g., firewalls, access permissions, secure administration practices).
  1. 6.7 Cybersecurity
  2. 9.6 Network Options
  3. 9.7 Network Communication
313.2F
Demonstrate knowledge of cybersecurity issues (e.g., data encryption, common attacks), and digital citizenship (e.g., safe browsing, ethics, passwords, cyberbullying, social engineering).
  1. 4.11 Cryptography
  2. 7.3 Cyberbullying
  3. 7.5 Privacy and Security
  4. 7.8 Common Security Problems
  5. 7.10 Digital Certificates
313.2G
Demonstrate knowledge of industry resources and career technical education concepts related to networks and the Internet.
  1. 9.8 Industry Resources