Please enable JavaScript to use CodeHS

Texas Computer Science III Standards Mapping

to

Data Structures in C++

44 Standards in this Framework 16 Standards Mapped 36% Mapped to Course


Standard Lessons
127.764.c.1.a apply data abstraction and encapsulation to manage complexity
127.764.c.1.b implement a student-created class hierarchy
127.764.c.1.c read and write class specifications using visual organizers, including Unified Modeling Language
127.764.c.1.d use black box programming methodology
  1. 1.5 Functions in C++
127.764.c.1.e design, create, and use interfaces to apply protocols
127.764.c.1.f identify, describe, design, create, evaluate, and compare standard sorting algorithms that perform sorting operations on data structures, including quick sort and heap sort
127.764.c.1.g select, 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. 4.3 Stacks
  2. 4.5 Queues
  3. 5.2 Sets
  4. 5.4 Maps
  5. 7.3 Linked Lists
127.764.c.1.h manage complexity by using a systems approach
127.764.c.2.a use local area networks (LANs) and wide area networks (WANs), including the Internet and intranets, in research, file management, and collaboration
127.764.c.2.b create interactive human interfaces to acquire data from a user and display program results using an advanced Graphical User Interface (GUI)
127.764.c.2.c write programs and communicate with proper programming style to enhance the readability and functionality of the code by using meaningful descriptive identifiers, internal comments, white space, indentation, and a standardized program style
127.764.c.2.d work in software design teams
127.764.c.3.a identify and use the structured data type of arrays of objects to traverse, search, modify, insert, and delete data
127.764.c.3.b identify and use two-dimensional ragged arrays to traverse, search, modify, insert, and delete data
127.764.c.3.c identify and use a list object data structure, including vector, to traverse, search, insert, and delete object data
  1. 4.1 2D Vectors
127.764.c.3.d understand and trace a linked-list data structure
  1. 7.3 Linked Lists
127.764.c.3.e create program solutions using a linked-list data structure, including unordered single, ordered single, double, and circular linked
  1. 7.4 Project: Mail Forwarding
127.764.c.3.f understand composite data structures, including a linked list of linked lists
  1. 7.5 Graphs
127.764.c.3.g understand and create program solutions using stacks, queues, trees, heaps, priority queues, graph theory, and enumerated data types
  1. 4.3 Stacks
  2. 4.4 Project: RPN Calculator
  3. 4.5 Queues
  4. 4.6 Project: Karaoke Night
  5. 7.5 Graphs
127.764.c.3.h understand and create program solutions using sets, including HashSet and TreeSet
  1. 5.2 Sets
  2. 5.3 Project: Bingo
127.764.c.3.i understand and create program solutions using maps, including HashMap and TreeMap
  1. 5.4 Maps
  2. 5.5 Project: FRC Scoring System
127.764.c.3.j write and modify text file data
  1. 2.4 File Input/Output
127.764.4.a develop choice algorithms using selection control statements, including break, label, and continue
  1. 1.3 Conditional Statements
  2. 1.4 Loops
127.764.4.b demonstrate proficiency in the use of the bitwise operators
127.764.4.c develop iterative algorithms using do-while loops
127.764.4.d demonstrate proficiency in the use of the ternary operator
  1. 1.3 Conditional Statements
127.764.4.e create program solutions that use iterators
  1. 1.4 Loops
  2. 6.1 Functional Recursion
  3. 6.2 Procedural Recursion
  4. 6.3 Recursive Backtracking
  5. 6.4 Project: Sudoku Solver
127.764.4.f identify, trace, and appropriately use recursion
  1. 6.1 Functional Recursion
  2. 6.2 Procedural Recursion
  3. 6.3 Recursive Backtracking
  4. 6.4 Project: Sudoku Solver
127.764.4.g understand and create program solutions using hashing
127.764.4.h perform pattern recognition using regular expressions
127.764.4.i explore common algorithms, including matrix addition and multiplication, fractals, Towers of Hanoi, and magic square
  1. 4.1 2D Vectors
127.764.4.j create program solutions that exhibit robust behavior by understanding and avoiding runtime errors and handling anticipated errors
  1. 2.5 Error Handling
  2. 2.6 Project: Karel Internship
  3. 8.1 Virtual Lines
127.764.4.k understand object-oriented design concepts of inner classes, outer classes, and anonymous classes
127.764.4.l use object reference scope identifiers, including null, this, and super
127.764.4.m provide object functionality to primitive data types
127.764.4.n write program assumptions in the form of assertions
127.764.4.o write a Boolean expression to test a program assertion
127.764.4.p construct assertions to make explicit program invariants
127.764.5.a model ethical acquisition and use of digital information
127.764.5.b demonstrate proper digital etiquette, responsible use of software, and knowledge of acceptable use policies
127.764.6.a compare and contrast high-level programming languages
127.764.6.b create a small workgroup network
127.764.6.c create and apply a basic network addressing scheme
127.764.6.d create discovery programs in a low-level language, high-level language, and scripting language