Computer Science Standards
Results
Showing 1 - 2 of 2 Standards
Standard Identifier: 9-12.DA.9
Grade Range:
9–12
Concept:
Data & Analysis
Subconcept:
Storage
Practice(s):
Recognizing and Defining Computational Problems (3.3)
Standard:
Describe tradeoffs associated with how data elements are organized and stored.
Descriptive Statement:
People make choices about how data elements are organized and where data is stored. These choices affect cost, speed, reliability, accessibility, privacy, and integrity. Students describe implications for a given data organziation or storage choice in light of a specific problem. For example, students might consider the cost, speed, reliability, accessibility, privacy, and integrity tradeoffs between storing photo data on a mobile device versus in the cloud. Alternatively, students might compare the tradeoffs between file size and image quality of various image file formats and how choice of format may be infuenced by the device on which it is to be accessed (e.g., smartphone, computer).
Describe tradeoffs associated with how data elements are organized and stored.
Descriptive Statement:
People make choices about how data elements are organized and where data is stored. These choices affect cost, speed, reliability, accessibility, privacy, and integrity. Students describe implications for a given data organziation or storage choice in light of a specific problem. For example, students might consider the cost, speed, reliability, accessibility, privacy, and integrity tradeoffs between storing photo data on a mobile device versus in the cloud. Alternatively, students might compare the tradeoffs between file size and image quality of various image file formats and how choice of format may be infuenced by the device on which it is to be accessed (e.g., smartphone, computer).
Standard Identifier: 9-12S.AP.15
Grade Range:
9–12 Specialty
Concept:
Algorithms & Programming
Subconcept:
Control
Practice(s):
Recognizing and Defining Computational Problems, Communicating About Computing (3.2, 7.2)
Standard:
Demonstrate the flow of execution of a recursive algorithm.
Descriptive Statement:
Recursion is a powerful problem-solving approach where the problem solution is built on solutions of smaller instances of the same problem. A base case, which returns a result without referencing itself, must be defined, otherwise infinite recursion will occur. Students represent a sequence of calls to a recursive algorithm and show how the process resolves to a solution. For example, students could draw a diagram to illustrate flow of execution by keeping track of parameter and returned values for each recursive call. Alternatively, students could create a video showing the passing of arguments as the recursive algorithm runs.
Demonstrate the flow of execution of a recursive algorithm.
Descriptive Statement:
Recursion is a powerful problem-solving approach where the problem solution is built on solutions of smaller instances of the same problem. A base case, which returns a result without referencing itself, must be defined, otherwise infinite recursion will occur. Students represent a sequence of calls to a recursive algorithm and show how the process resolves to a solution. For example, students could draw a diagram to illustrate flow of execution by keeping track of parameter and returned values for each recursive call. Alternatively, students could create a video showing the passing of arguments as the recursive algorithm runs.
Questions: Curriculum Frameworks and Instructional Resources Division |
CFIRD@cde.ca.gov | 916-319-0881