Standards Mapping

127.790.d.1.a

identify job and internship opportunities and accompanying job duties and tasks and contact one or more companies or organizations to explore career opportunities

Texas Computer Science 2

• 12.1 Careers and Internships

127.790.d.1.b

examine the role of certifications, resumes, and portfolios in the computer science profession

Texas Computer Science 2

• 12.2 CS Career Preparation

127.790.d.1.c

employ effective technical reading and writing skills

Texas Computer Science 2

• 12.4 Technical Reading, Writing, and Communication

AP Computer Science A (Cortado)

• 1.7 Application Program Interface (API) and Libraries

127.790.d.1.d

employ effective verbal and non-verbal communication skills

Texas Computer Science 2

• 12.4 Technical Reading, Writing, and Communication

AP Computer Science A (Cortado)

• 3.2 Impact of Program Design
• 4.1 Ethical and Social Issues Around Data Collection

127.790.d.1.e

solve problems and think critically

Texas Computer Science 2

• 3.1 Introduction to Programming With Karel
• 3.6 Top Down Design and Decomposition in Karel
• 3.7 Commenting Your Code
• 3.16 Karel Challenges

AP Computer Science A (Cortado)

• 1.15 String Manipulation
• 2.9 Implementing Selection and Iteration Algorithms
• 2.10 Implementing String Algorithms
• 4.5 Implementing Array Algorithms
• 4.10 Implementing ArrayList Algorithms
• 4.13 Implementing 2D Array Algorithms

127.790.d.1.f

demonstrate leadership skills and function effectively as a team member

Texas Computer Science 2

• 11.4 Providing Feedback
• 12.1 Careers and Internships

127.790.d.1.g

identify legal and ethical responsibilities in relation to the field of computer science

Texas Computer Science 2

• 12.3 Legal and Ethical Responsibilities

AP Computer Science A (Cortado)

• 4.1 Ethical and Social Issues Around Data Collection

127.790.d.1.h

demonstrate planning and time-management skills

Texas Computer Science 2

• 11.2 Planning Your Project

127.790.d.1.i

compare university computer science programs

Texas Computer Science 2

• 12.2 CS Career Preparation

127.790.d.2.a

use program design problem-solving strategies to create program solutions

Texas Computer Science 2

• 3.6 Top Down Design and Decomposition in Karel

AP Computer Science A (Cortado)

• 3.1 Abstraction and Program Design
• 3.2 Impact of Program Design

127.790.d.2.b

read, analyze, and modify programs and their accompanying documentation such as an application programming interface (API), internal code comments, external documentation, or readme files

Texas Computer Science 2

• 3.7 Commenting Your Code
• 5.4 Javadocs and More Methods

AP Computer Science A (Cortado)

• 1.7 Application Program Interface (API) and Libraries
• 1.8 Documentation with Comments

127.790.d.2.c

follow a systematic problem-solving process that identifies the purpose and goals, the data types and objects needed, and the subtasks to be performed

Texas Computer Science 2

• 10.1 Activity 1: Introduction to Celebrity
• 11.2 Planning Your Project

AP Computer Science A (Cortado)

• 3.1 Abstraction and Program Design
• 3.5 Methods: How to Write Them
• 3.6 Methods: Passing and Returning References of an Object
• 4.4 Array Traversals
• 4.6 Using Text Files
• 13.1 Activity 1: Introduction to Celebrity

127.790.d.2.d

compare design methodologies and implementation techniques such as top-down, bottom-up, and black box

Texas Computer Science 2

• 3.6 Top Down Design and Decomposition in Karel

127.790.d.2.e

trace a program, including inheritance and black box programming

Texas Computer Science 2

• 10.4 Activity 4: Extending the Celebrity Class

AP Computer Science A (Cortado)

• 5.1 Inheritance
• 5.2 Writing Constructors for Subclasses
• 13.4 Activity 4: Extending the Celebrity Class

127.790.d.2.f

choose, identify, and use the appropriate abstract data type, advanced data structure, and supporting algorithms to properly represent the data in a program problem solution

Texas Computer Science 2

• 4.3 Variables and Types
• 4.4 User Input
• 7.11 HashMaps
• 9.2 Linear Search

AP Computer Science A (Cortado)

• 4.6 Using Text Files
• 4.10 Implementing ArrayList Algorithms
• 4.13 Implementing 2D Array Algorithms

127.790.d.2.g

use object-oriented programming development methodology, including data abstraction, encapsulation with information hiding, inheritance, and procedural abstraction in program development

Texas Computer Science 2

• 6.1 Introduction to Classes and Objects
• 6.5 Writing Classes and Instance Methods
• 6.13 Inheritance
• 6.14 Class Design and Abstract Classes

AP Computer Science A (Cortado)

• 3.1 Abstraction and Program Design
• 3.3 Anatomy of a Class
• 3.5 Methods: How to Write Them
• 5.1 Inheritance

127.790.d.3.a

use the principles of software development to work in software design teams

Texas Computer Science 2

• 11.1 Project Overview

127.790.d.3.b

break a problem statement into specific solution requirements

Texas Computer Science 2

• 3.6 Top Down Design and Decomposition in Karel

127.790.d.3.c

create a program development plan

Texas Computer Science 2

• 11.2 Planning Your Project

127.790.d.3.d

code part of a solution from a program development plan while a partner codes the remaining part

Texas Computer Science 2

• 11.2 Planning Your Project

127.790.d.3.e

collaborate with a team to test a solution, including boundary and standard cases

Texas Computer Science 2

• 11.4 Providing Feedback

127.790.d.3.f

develop presentations to report the solution findings

Texas Computer Science 2

• 12.4 Technical Reading, Writing, and Communication

127.790.d.4.a

use programming file structure and file access for required resources

Texas Computer Science 2

• 5.10 File Handling

AP Computer Science A (Cortado)

• 4.6 Using Text Files

127.790.d.4.b

acquire and process information from text files, including files of known and unknown sizes

Texas Computer Science 2

• 5.10 File Handling

AP Computer Science A (Cortado)

• 4.6 Using Text Files

127.790.d.4.c

manipulate data using string processing

Texas Computer Science 2

• 5.8 String Processing

AP Computer Science A (Cortado)

• 1.15 String Manipulation
• 2.10 Implementing String Algorithms
• 4.6 Using Text Files
• 4.9 ArrayList Traversals

127.790.d.4.d

manipulate data values by casting between data types

Texas Computer Science 2

• 4.6 Casting

AP Computer Science A (Cortado)

• 1.5 Casting and Range of Variables

127.790.d.4.e

use the structured data type of one-dimensional arrays to traverse, search, modify, insert, and delete data

Texas Computer Science 2

• 7.2 Introduction to Arrays
• 7.3 Using Arrays
• 7.4 Enhanced For Loops
• 7.6 Arrays vs ArrayLists

AP Computer Science A (Cortado)

• 4.3 Array Creation and Access
• 4.4 Array Traversals
• 4.5 Implementing Array Algorithms
• 4.6 Using Text Files

127.790.d.4.f

identify and use the structured data type of two-dimensional arrays to traverse, search, modify, insert, and delete data

Texas Computer Science 2

• 7.9 2D Arrays (Matrices or Grids)
• 7.10 Traversing 2D Arrays

AP Computer Science A (Cortado)

• 4.11 2D Array Creation and Access
• 4.12 2D Array Traversals
• 4.13 Implementing 2D Array Algorithms

127.790.d.4.g

identify and use a list object data structure to traverse, search, insert, and delete data

Texas Computer Science 2

• 7.5 ArrayList Methods
• 7.7 Additional Loop Examples
• 9.2 Linear Search

127.790.d.4.h

differentiate between categories of programming languages, including machine, assembly, high-level compiled, high-level interpreted, and scripted

Texas Computer Science 2

• 4.1 Programming Fundamentals

127.790.d.5.a

develop sequential algorithms using branching control statements, including nested structures, to create solutions to decision-making problems

Texas Computer Science 2

• 4.12 If Statements

AP Computer Science A (Cortado)

• 2.4 Nested if Statements
• 2.9 Implementing Selection and Iteration Algorithms
• 2.11 Nested Iteration

127.790.d.5.b

develop choice algorithms using selection control statements based on ordinal values

Texas Computer Science 2

• 6.7 Class Methods and Class Variables

AP Computer Science A (Cortado)

• 2.3 if Statements
• 2.4 Nested if Statements
• 2.5 Compound Boolean Expressions

127.790.d.5.c

demonstrate the appropriate use of short-circuit evaluation in certain situations;

Texas Computer Science 2

• 4.14 Short-Circuit Evaluation

AP Computer Science A (Cortado)

• 2.6 Comparing Boolean Expressions

127.790.d.5.d

use Boolean algebra, including De Morgan's Law, to evaluate and simplify logical expressions

Texas Computer Science 2

• 4.15 De Morgan's Laws

AP Computer Science A (Cortado)

• 2.6 Comparing Boolean Expressions

127.790.d.5.e

develop iterative algorithms using nested loops

Texas Computer Science 2

• 7.9 2D Arrays (Matrices or Grids)

AP Computer Science A (Cortado)

• 2.11 Nested Iteration
• 4.12 2D Array Traversals
• 4.13 Implementing 2D Array Algorithms

127.790.d.5.f

identify, trace, and appropriately use recursion in programming solutions, including algebraic computations

Texas Computer Science 2

• 7.9 2D Arrays (Matrices or Grids)

AP Computer Science A (Cortado)

• 4.16 Recursion
• 4.17 Recursive Searching and Sorting

127.790.d.5.g

trace, construct, evaluate, and compare search algorithms, including linear searching and binary searching

Texas Computer Science 2

• 9.2 Linear Search
• 9.3 Binary Search
• 9.6 Advanced: Recursion

AP Computer Science A (Cortado)

• 4.14 Searching Algorithms
• 4.17 Recursive Searching and Sorting

127.790.d.5.h

identify, describe, trace, evaluate, and compare standard sorting algorithms, including selection sort, bubble sort, insertion sort, and merge sort

Texas Computer Science 2

• 9.4 Selection Sort
• 9.5 Insertion Sort
• 9.7 Mergesort
• 9.10 Algorithm Performance

AP Computer Science A (Cortado)

• 4.15 Sorting Algorithms
• 4.17 Recursive Searching and Sorting

127.790.d.5.i

measure time and space efficiency of various sorting algorithms, including analyzing algorithms using "big-O" notation for best, average, and worst-case data patterns

Texas Computer Science 2

• 9.1 What is an Algorithm?
• 9.10 Algorithm Performance

127.790.d.5.j

develop algorithms to solve various problems such as factoring, summing a series, finding the roots of a quadratic equation, and generating Fibonacci numbers

Texas Computer Science 2

• 6.4 Writing Classes
• 6.7 Class Methods and Class Variables
• 9.6 Advanced: Recursion

AP Computer Science A (Cortado)

• 4.16 Recursion

127.790.d.5.k

test program solutions by investigating boundary conditions; testing classes, methods, and libraries in isolation; and performing stepwise refinement

Texas Computer Science 2

• 3.6 Top Down Design and Decomposition in Karel

127.790.d.5.l

identify and debug compile, syntax, runtime, and logic errors

Texas Computer Science 2

• 5.7 Exceptions

AP Computer Science A (Cortado)

• 1.1 Introduction to Algorithms, Programming, and Compilers

127.790.d.5.m

compare efficiency of search and sort algorithms by using informal runtime comparisons, exact calculation of statement execution counts, and theoretical efficiency values using "big-O" notation, including worst-case, best-case, and average-case time/space analysis

Texas Computer Science 2

• 9.10 Algorithm Performance

127.790.d.5.n

count, convert, and perform mathematical operations in the decimal, binary, octal, and hexadecimal number systems

Texas Computer Science 2

• 2.2 Notational Systems
• 2.3 Data Representation
• 4.5 Arithmetic Expressions

127.790.d.5.o

identify maximum integer boundary, minimum integer boundary, imprecision of real number representations, and round-off errors

Texas Computer Science 2

• 4.5 Arithmetic Expressions
• 7.4 Enhanced For Loops

AP Computer Science A (Cortado)

• 1.5 Casting and Range of Variables

127.790.d.5.p

create program solutions to problems using a mathematics library

Texas Computer Science 2

• 6.7 Class Methods and Class Variables

AP Computer Science A (Cortado)

• 1.11 Math Class

127.790.d.5.q

use random number generator algorithms to create simulations

Texas Computer Science 2

• 6.3 Using a Class as a Client
• 6.7 Class Methods and Class Variables

AP Computer Science A (Cortado)

• 1.11 Math Class
• 2.9 Implementing Selection and Iteration Algorithms

127.790.d.5.r

use composition and inheritance relationships to identify and create class definitions and relationships

Texas Computer Science 2

• 6.13 Inheritance
• 6.14 Class Design and Abstract Classes
• 6.18 Composition

AP Computer Science A (Cortado)

• 5.1 Inheritance

127.790.d.5.s

explain and use object relationships between defined classes, abstract classes, and interfaces

Texas Computer Science 2

• 6.17 Interfaces

127.790.d.5.t

create object-oriented class definitions and declarations using variables, constants, methods, parameters, and interface implementations

Texas Computer Science 2

• 6.7 Class Methods and Class Variables
• 6.17 Interfaces

AP Computer Science A (Cortado)

• 3.7 Class Variables and Methods

127.790.d.5.u

create adaptive behaviors using polymorphism

Texas Computer Science 2

• 6.15 Polymorphism

AP Computer Science A (Cortado)

• 5.6 Polymorphism

127.790.d.5.v

use reference variables for object and string data types

Texas Computer Science 2

• 4.16 Strings
• 7.2 Introduction to Arrays
• 7.5 ArrayList Methods

AP Computer Science A (Cortado)

• 1.15 String Manipulation
• 2.10 Implementing String Algorithms
• 4.3 Array Creation and Access
• 4.8 ArrayList Methods

127.790.d.5.w

use value and reference parameters appropriately in method definitions and method calls

Texas Computer Science 2

• 6.5 Writing Classes and Instance Methods
• 6.6 Getter and Setter Methods
• 6.8 Wrapper Classes
• 6.12 Objects vs Primitives

AP Computer Science A (Cortado)

• 1.10 Calling Class Methods
• 1.14 Calling Instance Methods
• 3.5 Methods: How to Write Them
• 3.6 Methods: Passing and Returning References of an Object
• 3.7 Class Variables and Methods

127.790.d.5.x

implement access scope modifiers

Texas Computer Science 2

• 6.15 Polymorphism
• 7.8 The List Interface

AP Computer Science A (Cortado)

• 3.3 Anatomy of a Class
• 3.8 Scope and Access
• 5.6 Polymorphism

127.790.d.5.y

use object comparison for content quality

Texas Computer Science 2

• 6.12 Objects vs Primitives

AP Computer Science A (Cortado)

• 2.6 Comparing Boolean Expressions

127.790.d.5.z

duplicate objects using the appropriate deep or shallow copy

Texas Computer Science 2

• 6.12 Objects vs Primitives

AP Computer Science A (Cortado)

• 3.4 Constructors

127.790.d.5.aa

apply functional decomposition to a program solution

Texas Computer Science 2

• 3.6 Top Down Design and Decomposition in Karel
• 6.1 Introduction to Classes and Objects
• 6.6 Getter and Setter Methods

AP Computer Science A (Cortado)

• 3.1 Abstraction and Program Design
• 3.3 Anatomy of a Class

127.790.d.5.bb

create objects from class definitions through instantiation

Texas Computer Science 2

• 6.6 Getter and Setter Methods

AP Computer Science A (Cortado)

• 1.12 Objects: Instances of Classes
• 1.13 Object Creation and Storage (Instantiation)
• 1.14 Calling Instance Methods

127.790.d.5.cc

examine and mutate the properties of an object using accessors and modifiers

Texas Computer Science 2

• 6.6 Getter and Setter Methods

AP Computer Science A (Cortado)

• 1.12 Objects: Instances of Classes
• 1.13 Object Creation and Storage (Instantiation)
• 1.14 Calling Instance Methods
• 3.5 Methods: How to Write Them
• 3.6 Methods: Passing and Returning References of an Object