127.764.c.1.a

apply data abstraction and encapsulation to manage complexity

2

127.764.c.1.b

implement a student-created class hierarchy

3

127.764.c.1.c

read and write class specifications using visual organizers, including Unified Modeling Language

4

127.764.c.1.d

use black box programming methodology

5

127.764.c.1.e

design, create, and use interfaces to apply protocols

6

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

7

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

8

127.764.c.1.h

manage complexity by using a systems approach

9

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

10

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)

11

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

12

127.764.c.2.d

work in software design teams

13

127.764.c.3.a

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

14

127.764.c.3.b

identify and use two-dimensional ragged arrays to traverse, search, modify, insert, and delete data

15

127.764.c.3.c

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

16

127.764.c.3.d

understand and trace a linked-list data structure

17

127.764.c.3.e

create program solutions using a linked-list data structure, including unordered single, ordered single, double, and circular linked

18

127.764.c.3.f

understand composite data structures, including a linked list of linked lists

19

127.764.c.3.g

understand and create program solutions using stacks, queues, trees, heaps, priority queues, graph theory, and enumerated data types

20

127.764.c.3.h

understand and create program solutions using sets, including HashSet and TreeSet

21

127.764.c.3.i

understand and create program solutions using maps, including HashMap and TreeMap

22

127.764.c.3.j

write and modify text file data

23

127.764.4.a

develop choice algorithms using selection control statements, including break, label, and continue

24

127.764.4.b

demonstrate proficiency in the use of the bitwise operators

25

127.764.4.c

develop iterative algorithms using do-while loops

26

127.764.4.d

demonstrate proficiency in the use of the ternary operator

27

127.764.4.e

create program solutions that use iterators

28

127.764.4.f

identify, trace, and appropriately use recursion

29

127.764.4.g

understand and create program solutions using hashing

30

127.764.4.h

perform pattern recognition using regular expressions

31

127.764.4.i

explore common algorithms, including matrix addition and multiplication, fractals, Towers of Hanoi, and magic square

32

127.764.4.j

create program solutions that exhibit robust behavior by understanding and avoiding runtime errors and handling anticipated errors

33

127.764.4.k

understand object-oriented design concepts of inner classes, outer classes, and anonymous classes

34

127.764.4.l

use object reference scope identifiers, including null, this, and super

35

127.764.4.m

provide object functionality to primitive data types

36

127.764.4.n

write program assumptions in the form of assertions

37

127.764.4.o

write a Boolean expression to test a program assertion

38

127.764.4.p

construct assertions to make explicit program invariants

39

127.764.5.a

model ethical acquisition and use of digital information

40

127.764.5.b

demonstrate proper digital etiquette, responsible use of software, and knowledge of acceptable use policies

41

127.764.6.a

compare and contrast high-level programming languages

42

127.764.6.b

create a small workgroup network

43

127.764.6.c

create and apply a basic network addressing scheme

44

127.764.6.d

create discovery programs in a low-level language, high-level language, and scripting language

Texas Computer Science 3 (Outdated)