Please enable JavaScript to use CodeHS

Standards Mapping

for Texas Computer Science II

Clear selection Print / Download

59

Standards in this Framework

59

Standards Mapped

100%

Mapped to Course

Standard Lessons
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
  1. Texas Computer Science 2
  2. 12.1 Careers and Internships
127.790.d.1.b
examine the role of certifications, resumes, and portfolios in the computer science profession
  1. Texas Computer Science 2
  2. 12.2 CS Career Preparation
127.790.d.1.c
employ effective technical reading and writing skills
  1. Texas Computer Science 2
  2. 12.4 Technical Reading, Writing, and Communication
  3. AP Computer Science A (Cortado)
  4. 1.7 Application Program Interface (API) and Libraries
127.790.d.1.d
employ effective verbal and non-verbal communication skills
  1. Texas Computer Science 2
  2. 12.4 Technical Reading, Writing, and Communication
  3. AP Computer Science A (Cortado)
  4. 3.2 Impact of Program Design
  5. 4.1 Ethical and Social Issues Around Data Collection
127.790.d.1.e
solve problems and think critically
  1. Texas Computer Science 2
  2. 3.1 Introduction to Programming With Karel
  3. 3.6 Top Down Design and Decomposition in Karel
  4. 3.7 Commenting Your Code
  5. 3.16 Karel Challenges
  6. AP Computer Science A (Cortado)
  7. 1.15 String Manipulation
  8. 2.9 Implementing Selection and Iteration Algorithms
  9. 2.10 Implementing String Algorithms
  10. 4.5 Implementing Array Algorithms
  11. 4.10 Implementing ArrayList Algorithms
  12. 4.13 Implementing 2D Array Algorithms
127.790.d.1.f
demonstrate leadership skills and function effectively as a team member
  1. Texas Computer Science 2
  2. 11.4 Providing Feedback
  3. 12.1 Careers and Internships
127.790.d.1.g
identify legal and ethical responsibilities in relation to the field of computer science
  1. Texas Computer Science 2
  2. 12.3 Legal and Ethical Responsibilities
  3. AP Computer Science A (Cortado)
  4. 4.1 Ethical and Social Issues Around Data Collection
127.790.d.1.h
demonstrate planning and time-management skills
  1. Texas Computer Science 2
  2. 11.2 Planning Your Project
127.790.d.1.i
compare university computer science programs
  1. Texas Computer Science 2
  2. 12.2 CS Career Preparation
127.790.d.2.a
use program design problem-solving strategies to create program solutions
  1. Texas Computer Science 2
  2. 3.6 Top Down Design and Decomposition in Karel
  3. AP Computer Science A (Cortado)
  4. 3.1 Abstraction and Program Design
  5. 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
  1. Texas Computer Science 2
  2. 3.7 Commenting Your Code
  3. 5.4 Javadocs and More Methods
  4. AP Computer Science A (Cortado)
  5. 1.7 Application Program Interface (API) and Libraries
  6. 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
  1. Texas Computer Science 2
  2. 10.1 Activity 1: Introduction to Celebrity
  3. 11.2 Planning Your Project
  4. AP Computer Science A (Cortado)
  5. 3.1 Abstraction and Program Design
  6. 3.5 Methods: How to Write Them
  7. 3.6 Methods: Passing and Returning References of an Object
  8. 4.4 Array Traversals
  9. 4.6 Using Text Files
  10. 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
  1. Texas Computer Science 2
  2. 3.6 Top Down Design and Decomposition in Karel
127.790.d.2.e
trace a program, including inheritance and black box programming
  1. Texas Computer Science 2
  2. 10.4 Activity 4: Extending the Celebrity Class
  3. AP Computer Science A (Cortado)
  4. 5.1 Inheritance
  5. 5.2 Writing Constructors for Subclasses
  6. 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
  1. Texas Computer Science 2
  2. 4.3 Variables and Types
  3. 4.4 User Input
  4. 7.11 HashMaps
  5. 9.2 Linear Search
  6. AP Computer Science A (Cortado)
  7. 4.6 Using Text Files
  8. 4.10 Implementing ArrayList Algorithms
  9. 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
  1. Texas Computer Science 2
  2. 6.1 Introduction to Classes and Objects
  3. 6.5 Writing Classes and Instance Methods
  4. 6.13 Inheritance
  5. 6.14 Class Design and Abstract Classes
  6. AP Computer Science A (Cortado)
  7. 3.1 Abstraction and Program Design
  8. 3.3 Anatomy of a Class
  9. 3.5 Methods: How to Write Them
  10. 5.1 Inheritance
127.790.d.3.a
use the principles of software development to work in software design teams
  1. Texas Computer Science 2
  2. 11.1 Project Overview
127.790.d.3.b
break a problem statement into specific solution requirements
  1. Texas Computer Science 2
  2. 3.6 Top Down Design and Decomposition in Karel
127.790.d.3.c
create a program development plan
  1. Texas Computer Science 2
  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
  1. Texas Computer Science 2
  2. 11.2 Planning Your Project
127.790.d.3.e
collaborate with a team to test a solution, including boundary and standard cases
  1. Texas Computer Science 2
  2. 11.4 Providing Feedback
127.790.d.3.f
develop presentations to report the solution findings
  1. Texas Computer Science 2
  2. 12.4 Technical Reading, Writing, and Communication
127.790.d.4.a
use programming file structure and file access for required resources
  1. Texas Computer Science 2
  2. 5.10 File Handling
  3. AP Computer Science A (Cortado)
  4. 4.6 Using Text Files
127.790.d.4.b
acquire and process information from text files, including files of known and unknown sizes
  1. Texas Computer Science 2
  2. 5.10 File Handling
  3. AP Computer Science A (Cortado)
  4. 4.6 Using Text Files
127.790.d.4.c
manipulate data using string processing
  1. Texas Computer Science 2
  2. 5.8 String Processing
  3. AP Computer Science A (Cortado)
  4. 1.15 String Manipulation
  5. 2.10 Implementing String Algorithms
  6. 4.6 Using Text Files
  7. 4.9 ArrayList Traversals
127.790.d.4.d
manipulate data values by casting between data types
  1. Texas Computer Science 2
  2. 4.6 Casting
  3. AP Computer Science A (Cortado)
  4. 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
  1. Texas Computer Science 2
  2. 7.2 Introduction to Arrays
  3. 7.3 Using Arrays
  4. 7.4 Enhanced For Loops
  5. 7.6 Arrays vs ArrayLists
  6. AP Computer Science A (Cortado)
  7. 4.3 Array Creation and Access
  8. 4.4 Array Traversals
  9. 4.5 Implementing Array Algorithms
  10. 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
  1. Texas Computer Science 2
  2. 7.9 2D Arrays (Matrices or Grids)
  3. 7.10 Traversing 2D Arrays
  4. AP Computer Science A (Cortado)
  5. 4.11 2D Array Creation and Access
  6. 4.12 2D Array Traversals
  7. 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
  1. Texas Computer Science 2
  2. 7.5 ArrayList Methods
  3. 7.7 Additional Loop Examples
  4. 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
  1. Texas Computer Science 2
  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
  1. Texas Computer Science 2
  2. 4.12 If Statements
  3. AP Computer Science A (Cortado)
  4. 2.4 Nested if Statements
  5. 2.9 Implementing Selection and Iteration Algorithms
  6. 2.11 Nested Iteration
127.790.d.5.b
develop choice algorithms using selection control statements based on ordinal values
  1. Texas Computer Science 2
  2. 6.7 Class Methods and Class Variables
  3. AP Computer Science A (Cortado)
  4. 2.3 if Statements
  5. 2.4 Nested if Statements
  6. 2.5 Compound Boolean Expressions
127.790.d.5.c
demonstrate the appropriate use of short-circuit evaluation in certain situations;
  1. Texas Computer Science 2
  2. 4.14 Short-Circuit Evaluation
  3. AP Computer Science A (Cortado)
  4. 2.6 Comparing Boolean Expressions
127.790.d.5.d
use Boolean algebra, including De Morgan's Law, to evaluate and simplify logical expressions
  1. Texas Computer Science 2
  2. 4.15 De Morgan's Laws
  3. AP Computer Science A (Cortado)
  4. 2.6 Comparing Boolean Expressions
127.790.d.5.e
develop iterative algorithms using nested loops
  1. Texas Computer Science 2
  2. 7.9 2D Arrays (Matrices or Grids)
  3. AP Computer Science A (Cortado)
  4. 2.11 Nested Iteration
  5. 4.12 2D Array Traversals
  6. 4.13 Implementing 2D Array Algorithms
127.790.d.5.f
identify, trace, and appropriately use recursion in programming solutions, including algebraic computations
  1. Texas Computer Science 2
  2. 7.9 2D Arrays (Matrices or Grids)
  3. AP Computer Science A (Cortado)
  4. 4.16 Recursion
  5. 4.17 Recursive Searching and Sorting
127.790.d.5.g
trace, construct, evaluate, and compare search algorithms, including linear searching and binary searching
  1. Texas Computer Science 2
  2. 9.2 Linear Search
  3. 9.3 Binary Search
  4. 9.6 Advanced: Recursion
  5. AP Computer Science A (Cortado)
  6. 4.14 Searching Algorithms
  7. 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
  1. Texas Computer Science 2
  2. 9.4 Selection Sort
  3. 9.5 Insertion Sort
  4. 9.7 Mergesort
  5. 9.10 Algorithm Performance
  6. AP Computer Science A (Cortado)
  7. 4.15 Sorting Algorithms
  8. 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
  1. Texas Computer Science 2
  2. 9.1 What is an Algorithm?
  3. 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
  1. Texas Computer Science 2
  2. 6.4 Writing Classes
  3. 6.7 Class Methods and Class Variables
  4. 9.6 Advanced: Recursion
  5. AP Computer Science A (Cortado)
  6. 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
  1. Texas Computer Science 2
  2. 3.6 Top Down Design and Decomposition in Karel
127.790.d.5.l
identify and debug compile, syntax, runtime, and logic errors
  1. Texas Computer Science 2
  2. 5.7 Exceptions
  3. AP Computer Science A (Cortado)
  4. 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
  1. Texas Computer Science 2
  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
  1. Texas Computer Science 2
  2. 2.2 Notational Systems
  3. 2.3 Data Representation
  4. 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
  1. Texas Computer Science 2
  2. 4.5 Arithmetic Expressions
  3. 7.4 Enhanced For Loops
  4. AP Computer Science A (Cortado)
  5. 1.5 Casting and Range of Variables
127.790.d.5.p
create program solutions to problems using a mathematics library
  1. Texas Computer Science 2
  2. 6.7 Class Methods and Class Variables
  3. AP Computer Science A (Cortado)
  4. 1.11 Math Class
127.790.d.5.q
use random number generator algorithms to create simulations
  1. Texas Computer Science 2
  2. 6.3 Using a Class as a Client
  3. 6.7 Class Methods and Class Variables
  4. AP Computer Science A (Cortado)
  5. 1.11 Math Class
  6. 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
  1. Texas Computer Science 2
  2. 6.13 Inheritance
  3. 6.14 Class Design and Abstract Classes
  4. 6.18 Composition
  5. AP Computer Science A (Cortado)
  6. 5.1 Inheritance
127.790.d.5.s
explain and use object relationships between defined classes, abstract classes, and interfaces
  1. Texas Computer Science 2
  2. 6.17 Interfaces
127.790.d.5.t
create object-oriented class definitions and declarations using variables, constants, methods, parameters, and interface implementations
  1. Texas Computer Science 2
  2. 6.7 Class Methods and Class Variables
  3. 6.17 Interfaces
  4. AP Computer Science A (Cortado)
  5. 3.7 Class Variables and Methods
127.790.d.5.u
create adaptive behaviors using polymorphism
  1. Texas Computer Science 2
  2. 6.15 Polymorphism
  3. AP Computer Science A (Cortado)
  4. 5.6 Polymorphism
127.790.d.5.v
use reference variables for object and string data types
  1. Texas Computer Science 2
  2. 4.16 Strings
  3. 7.2 Introduction to Arrays
  4. 7.5 ArrayList Methods
  5. AP Computer Science A (Cortado)
  6. 1.15 String Manipulation
  7. 2.10 Implementing String Algorithms
  8. 4.3 Array Creation and Access
  9. 4.8 ArrayList Methods
127.790.d.5.w
use value and reference parameters appropriately in method definitions and method calls
  1. Texas Computer Science 2
  2. 6.5 Writing Classes and Instance Methods
  3. 6.6 Getter and Setter Methods
  4. 6.8 Wrapper Classes
  5. 6.12 Objects vs Primitives
  6. AP Computer Science A (Cortado)
  7. 1.10 Calling Class Methods
  8. 1.14 Calling Instance Methods
  9. 3.5 Methods: How to Write Them
  10. 3.6 Methods: Passing and Returning References of an Object
  11. 3.7 Class Variables and Methods
127.790.d.5.x
implement access scope modifiers
  1. Texas Computer Science 2
  2. 6.15 Polymorphism
  3. 7.8 The List Interface
  4. AP Computer Science A (Cortado)
  5. 3.3 Anatomy of a Class
  6. 3.8 Scope and Access
  7. 5.6 Polymorphism
127.790.d.5.y
use object comparison for content quality
  1. Texas Computer Science 2
  2. 6.12 Objects vs Primitives
  3. AP Computer Science A (Cortado)
  4. 2.6 Comparing Boolean Expressions
127.790.d.5.z
duplicate objects using the appropriate deep or shallow copy
  1. Texas Computer Science 2
  2. 6.12 Objects vs Primitives
  3. AP Computer Science A (Cortado)
  4. 3.4 Constructors
127.790.d.5.aa
apply functional decomposition to a program solution
  1. Texas Computer Science 2
  2. 3.6 Top Down Design and Decomposition in Karel
  3. 6.1 Introduction to Classes and Objects
  4. 6.6 Getter and Setter Methods
  5. AP Computer Science A (Cortado)
  6. 3.1 Abstraction and Program Design
  7. 3.3 Anatomy of a Class
127.790.d.5.bb
create objects from class definitions through instantiation
  1. Texas Computer Science 2
  2. 6.6 Getter and Setter Methods
  3. AP Computer Science A (Cortado)
  4. 1.12 Objects: Instances of Classes
  5. 1.13 Object Creation and Storage (Instantiation)
  6. 1.14 Calling Instance Methods
127.790.d.5.cc
examine and mutate the properties of an object using accessors and modifiers
  1. Texas Computer Science 2
  2. 6.6 Getter and Setter Methods
  3. AP Computer Science A (Cortado)
  4. 1.12 Objects: Instances of Classes
  5. 1.13 Object Creation and Storage (Instantiation)
  6. 1.14 Calling Instance Methods
  7. 3.5 Methods: How to Write Them
  8. 3.6 Methods: Passing and Returning References of an Object