1. (a) A candidate seeking a credential as a computer science educator for grades K-12 shall meet the following education requirements:

   1. (1) Either:

      1. a. Have at least a bachelor's degree; or
      2. b. Hold a current eligible industry-recognized credential as defined in RSA 200-O:2, II; and
   2. (2) Meet the requirements of (c) below.
2. (b) Candidates seeking a credential shall use one of the alternatives in Ed 505.05- Ed 505.07 after having met the requirements of (c) below.

3. (c) A candidate seeking a credential as a computer science educator for grades K-12 shall have the following skills, competencies, and knowledge through a combination of learning activities such as, but not limited to, academic and supervised clinical experience in the following areas:

   1. (1) In the area of impacts of computing, the candidate shall have the ability to:

      1. a. Use computing to:

         1. 1. Express creativity;
         2. 2. Solve problems;
         3. 3. Communicate;
         4. 4. Collaborate; and
         5. 5. Innovate in a variety of fields and careers;
      2. b. Assess obstacles to equal access to computing as well as the impacts of these obstacles;

      3. c. Assess impacts of computing innovations and practices with respect to:

         1. 1. Beneficial and harmful effects;
         2. 2. Ethical practices; and
         3. 3. Privacy, security, and legal issues; and
      4. d. Keep current with knowledge on emerging technologies and their potential impacts;

   2. (2) In the area of algorithms and computational thinking, the candidate shall have the ability to:

      1. a. Analyze algorithmic processes and develop algorithms using:

         1. 1. Pattern recognition;
         2. 2. Problem decomposition; and
         3. 3. Abstraction;
      2. b. Convert between binary, decimal, and hexadecimal number systems;
      3. c. Use different fonts to represent, develop and analyze algorithms including, but not limited to natural language, flowcharts, and pseudocode;
      4. d. Use heuristic solutions to address computing limitations including, but not limited to, time, space, and solvability;
      5. e. Use standard algorithms including, but not limited to, searching and sorting algorithms and analyze implementations of those algorithms for correctness, efficiency, and clarity; and
      6. f. Use simple recursive algorithms including, but not limited to, fractals, Zeno's paradox, and Towers of Hanoi;

   3. (3) In the area of programming, the candidate shall have the ability to:

      1. a. Write and modify computer programs in block-based and at least one text-based programming language;

      2. b. Analyze computer programs in terms of:

         1. 1. Correctness;
         2. 2. Usability;
         3. 3. Readability;
         4. 4. Extensibility;
         5. 5. Modifiability; and
         6. 6. Reusability;

      3. c. Program using the following elements:

         1. 1. Basic control structures;
         2. 2. Standard operators;
         3. 3. Variables and data types;
         4. 4. Functions; and
         5. 5. Data structures;
      4. d. Write event-driven programs that respond to external events including, but not limited to, sensors, messages, and clicks;
      5. e. Use libraries and APIs;
      6. f. Use and evaluate multiple development and execution environments;
      7. g. Facilitate collaboration in the development of software;
      8. h. Program user interactions with graphical and other user interface components;
      9. i. Demonstrate knowledge of various software development models;

      10. j. Model practices in software development, including:

          1. 1. User requirements analysis;
          2. 2. Program design;
          3. 3. Implementation and documentation;
          4. 4. Testing and debugging; and
          5. 5. Evolution driven by feedback;
      11. k. Develop object-oriented programs; and
      12. l. Model the process of program compilation and interpretation;

   4. (4) In the area of data and analysis, the candidate shall have the ability to:

      1. a. Model concepts of processing data, including:

         1. 1. Encoding;
         2. 2. Compression; and
         3. 3. Encryption;
      2. b. Create and use models and simulations;

      3. c. Work with data using computational tools, including to:

         1. 1. Collect, aggregate, and generate;
         2. 2. Store, manage, and manipulate; and
         3. 3. Process, analyze, and visualize; and

   5. (5) In the area of computing systems and networks, the candidate shall have the ability to:

      1. a. Evaluate and compare computing systems using various criteria;
      2. b. Evaluate and compare local, network, and cloud computing and storage;

      3. c. Model computer networks in terms of:

         1. 1. Protocol stack components; and

         2. 2. Network protocols, such as:

            1. (i) Transmission control protocol/internet protocol (TCP/IP);
            2. (ii) Domain name servers (DNS); and
            3. (iii) Hypertext transfer protocol secure (HTTPS); and
      4. d. Demonstrate fundamental concepts of cybersecurity including, but not limited to, confidentiality, integrity, availability, non-repudiation, and authentication.

Source. #12419, eff 11-14-17; renumbered by #12603 (formerly Ed 507.52); ss by #13822, eff 12-15-23, EXPIRES: 6-12-24; ss #13959, eff 5-10-24