Analyze abstract data structures.
DefinitionAnalysis should include the following structures:
- Linked-list: a structure in which each item is linked to the next one by means of a pointer
- Tree: a structure begun at the root node in which each node can have child nodes
- Queue: a structure accessed by inserting items at one end and removing them from the other
- Stack: a dynamic structure accessed from only one end
- Array: a structure comprised of a group of variables under a single name and accessed by the index
- Graph: a structure in which nodes can be connected to any other node
Related Standards of Learning
The student will design and apply computer programs to solve practical problems in mathematics arising from business and applications in mathematics.
The student will select and implement appropriate data structures, including arrays (one- and/or two-dimensional) and objects.
The student will apply graphs to conflict-resolution problems, such as map coloring, scheduling, matching, and optimization.
The student will apply algorithms relating to trees, networks, and paths. Appropriate technology will be used to determine the number of possible solutions and generate solutions when a feasible number exists.