Please enable JavaScript to use CodeHS

Virginia Computer Science Programming Standards Mapping

to

Introduction to Computer Science in JavaScript (Golden)

21 Standards in this Framework 13 Standards Mapped 61% Mapped to Course


Standard Lessons
PRG.1 The student will describe and use best practices of program development that make some common flaws less likely and explain how this improves computer security.
  1. 1.4 Functions in Karel
  2. 1.5 The Start Function
  3. 1.6 Top Down Design and Decomposition in Karel
  4. 1.7 Commenting Your Code
  5. 3.2 Variables
  6. 7.1 Functions and Parameters 1
  7. 7.2 Functions and Parameters 2
  8. 7.3 Functions and Parameters 3
  9. 7.4 Functions and Return Values 1
  10. 7.5 Functions and Return Values 2
PRG.2 The student will create programs that model the relationships among different elements in collections of real-world data.
PRG.3 The student will translate numbers between machine representations and humanaccessible representations.
PRG.4 The student will design and implement a program working individually and in teams using a text-based language.
PRG.5 The student will explain the software life cycle and how it applies to iterative development processes.
PRG.6 The student will design and implement an algorithm a) with compound conditional execution, and analyze and evaluate complex Boolean conditions; and b) using complex iteration, including nested loops.
  1. 1.13 Control Structures Example
  2. 2.1 Challenge Problems
  3. 5.1 Booleans
  4. 5.2 Logical Operators
  5. 5.3 Comparison Operators
  6. 5.4 If Statements
  7. 5.7 For Loop Practice
  8. 8.1 Functions Challenges
  9. 11.1 Breakout
PRG.7 The student will implement programs that accept input from a variety of sources and produce output based on that input.
  1. 3.3 User Input
  2. 7.3 Functions and Parameters 3
  3. 9.5 Mouse Events: Mouse Clicked
  4. 9.6 Mouse Events: Mouse Moved
  5. 9.8 Key Events
  6. 11.1 Breakout
PRG.8 The student will trace the execution of iterative and recursive algorithms, illustrating output and changes in values of named variables.
  1. 5.9 While Loops
  2. 5.10 Loop and a Half
  3. 8.1 Functions Challenges
  4. 11.1 Breakout
PRG.9 The student will perform complex computations a) on numbers, including modular division and random number generation; and b) on strings, including substring manipulation and processing individual characters.
  1. 3.4 Basic Math in JavaScript
  2. 5.8 Random Numbers
PRG.10 The student will demonstrate an understanding of different data types by using appropriate constructs to convert between them when appropriate.
  1. 25.1 Intro to Lists/Arrays
  2. 25.8 Intro to Objects/Maps
  3. 25.12 Intro to Sets
  4. 25.13 Intro to Grids
PRG.11 The student will analyze a large-scale computational problem, identify generalizable patterns, and implement a solution.
  1. 2.1 Challenge Problems
  2. 8.1 Functions Challenges
  3. 11.1 Breakout
PRG.12 The student will implement an algorithm that uses existing functions and accesses existing libraries or APIs to satisfy its requirements.
PRG.13 The student will write functions, both with and without parameters, and both with and without return values, that represent abstractions useful to the solution of a larger problem.
  1. 7.1 Functions and Parameters 1
  2. 7.2 Functions and Parameters 2
  3. 7.3 Functions and Parameters 3
  4. 7.4 Functions and Return Values 1
  5. 7.5 Functions and Return Values 2
  6. 8.1 Functions Challenges
PRG.14 The student will create programs demonstrating an understanding of the interactions between classes in object-oriented design, and by implementing classes with instance data and methods to satisfy a design specification.
  1. 25.8 Intro to Objects/Maps
  2. 25.9 Basics of Objects
  3. 25.10 Iterating Over an Object
  4. 25.11 When Do I Use an Object?
PRG.15 The student will use code written by others by reading the documentation and incorporating it into their programs using proper citation of the reused code.
PRG.16 The student will read and store data in 1D and 2D collections, and design and implement algorithms to process and manipulate those collections.
  1. 25.12 Intro to Sets
  2. 25.13 Intro to Grids
  3. 25.14 Looping Over a Grid
  4. 25.15 Grid Example: Get a Row
PRG.17 The student will adapt classic algorithms for use in a particular context and analyze them for effectiveness and efficiency.
  1. 25.4 Array Length and Looping Through Arrays
PRG.18 The student will develop and use a series of test cases to verify that a program performs according to its design specifications, including edge cases and all branches.
  1. 1.10 If Statements
  2. 1.11 If/Else Statements
  3. 1.12 While Loops in Karel
  4. 1.13 Control Structures Example
  5. 2.1 Challenge Problems
  6. 5.4 If Statements
  7. 5.9 While Loops
  8. 8.1 Functions Challenges
  9. 11.1 Breakout
PRG.19 The student will, through the process of code review, evaluate a program's correctness, readability, usability, and other factors.
PRG.20 The student will use a systematic approach and debugging tools to independently debug a program.
  1. 1.6 Top Down Design and Decomposition in Karel
  2. 2.1 Challenge Problems
  3. 8.1 Functions Challenges
  4. 11.1 Breakout
PRG.21 The student will identify some of the practical, business, and ethical impacts of open source and free software and the widespread access they provide.