You are here

Level 2 (Computer Science and Community, Grades 6-9)

Collections Home-> CSTA Curriculum: Strand / Level / Curriculum Classification-> Computational Thinking


CT.L2-01 Use the basic steps in algorithmic problem-solving to design solutions (e.g., problem statement and exploration, examination of sample instances, design, implementing a solution, testing, evaluation).
CT.L2-02 Describe the process of parallelization as it relates to problem solving.
CT.L2-03 Define an algorithm as a sequence of instructions that can be processed by a computer.
CT.L2-04 Evaluate ways that different algorithms may be used to solve the same problem.
CT.L2-05 Act out searching and sorting algorithms.
CT.L2-06 Describe and analyze a sequence of instructions being followed (e.g., describe a character’s behavior in a video game as driven by rules and algorithms).
CT.L2-07 Represent data in a variety of ways including text, sounds, pictures, and numbers.
CT.L2-08 Use visual representations of problem states, structures, and data (e.g., graphs, charts, network diagrams, flowcharts).
CT.L2-09 Interact with content-specific models and simulations (e.g., ecosystems, epidemics, molecular dynamics) to support learning and research.
CT.L2-10 Evaluate what kinds of problems can be solved using modeling and simulation.
CT.L2-11 Analyze the degree to which a computer model accurately represents the real world.
CT.L2-12 Use abstraction to decompose a problem into sub problems.
CT.L2-13 Understand the notion of hierarchy and abstraction in computing including high level languages, translation, instruction set, and logic circuits.
CT.L2-14 Examine connections between elements of mathematics and computer science including binary numbers, logic, sets and functions.
CT.L2-15 Provide examples of interdisciplinary applications of computational thinking.