Texas Computer Science III
41 Standards
127.675.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
127.675.d.1.b
examine the role of certifications, resumes, and portfolios in the computer science profession
127.675.d.1.c
employ effective technical reading and writing skills
127.675.d.1.d
employ effective verbal and non-verbal communication skills
127.675.d.1.e
solve problems and think critically
127.675.d.1.f
demonstrate leadership skills and function effectively as a team member
127.675.d.1.g
demonstrate an understanding of legal and ethical responsibilities in relation to the field of computer science
127.675.d.1.h
demonstrate planning and time-management skills
127.675.d.1.i
compare university computer science programs
127.675.d.2.a
apply object-oriented programming, including data abstraction, encapsulation, inheritance, and polymorphism, to manage the complexity of a project
127.675.d.2.b
design and implement a class hierarchy
127.675.d.2.c
read and write class specifications using visual organizers, including Unified Modeling Language
127.675.d.2.d
identify, describe, evaluate, compare, and implement standard sorting algorithms that perform sorting operations on data structures, including quick sort and heap sort
127.675.d.2.e
identify and use the appropriate abstract data type, advanced data structure, and supporting algorithms to properly represent the data in a program problem solution
127.675.d.3.a
use networked tools for file management and collaboration
127.675.d.3.b
work in software design teams
127.675.d.4.a
identify and use two-dimensional ragged arrays to traverse, search, modify, insert, and delete data
127.675.d.4.b
describe and demonstrate proper linked list management, including maintaining the head and safe addition and deletion of linked objects
127.675.d.4.c
create or trace program solutions using a linked-list data structure, including unordered single, ordered single, double, and circular linked
127.675.d.4.d
describe composite data structures, including a linked list of linked lists
127.675.d.4.e
create or trace program solutions using stacks, queues, trees, heaps, priority queues, graph theory, and enumerated data types
127.675.d.4.f
create or trace program solutions using sets, including hash and tree-based data structures
127.675.d.4.g
create or trace program solutions using map style data structures
127.675.d.4.h
write and modify text file data
127.675.d.5.a
evaluate expressions using bitwise operators
127.675.d.5.b
evaluate expressions using the ternary operator
127.675.d.5.c
identify, trace, and appropriately use recursion in programming solutions, including processing binary trees
127.675.d.5.d
create or trace program solutions using hashing
127.675.d.5.e
explore common algorithms such as matrix addition and multiplication, fractals, Towers of Hanoi, and magic square
127.675.d.5.f
create program solutions that exhibit robust behavior by recognizing and avoiding runtime errors and handling anticipated errors
127.675.d.6.a
use appropriate formatting and write documentation to support code maintenance, including pre- and post-condition statements
127.675.d.6.b
write program assumptions in the form of assertions
127.675.d.6.c
write a Boolean expression to test a program assertion
127.675.d.6.d
construct assertions to make explicit program invariants
127.675.d.7.a
analyze and create computer program workflow charts and basic system diagrams, documenting system functions, features, and operations
127.675.d.7.b
gather requirements and design and implement a process by which programs can interact with each other such as using interfaces
127.675.d.7.c
create simple programs using a low-level language such as assembly
127.675.d.7.d
create discovery programs in a high-level language
127.675.d.7.e
create scripts for an operating system
127.675.d.7.f
explore industry best practices for secure programming
127.675.d.7.g
explore emerging industry or technology trends