Curriculum Links

Great Principles of Computer Science #

Link to curriculum

• Computation

  • Searching Algorithms
  • Sorting Algorithms
  • Sorting Networks
  • Minimal Spanning Trees
  • Finite State Automata
  • Graph Colouring
  • Dominating Sets
  • Steiner Trees
  • Phylogenetics
  • Divide and Conquer
  • Artificial Intelligence
  • Line Drawing

• Communication

  • Text Compression
  • Error Detection
  • Information Theory
  • Network Protocols
  • Information Hiding
  • Cryptographic Protocols
  • Public Key Encryption
  • Human Interface Design
  • Modems Unplugged

• Coordination

  • Minimal Spanning Trees
  • Routing and Deadlock

• Recollection

  • Binary Numbers
  • Image Representation
  • Text Compression
  • Error Detection
  • Modems Unplugged
  • Databases
  • Line Drawing

• Automation

  • Programming Languages
  • [Turing Test]
  • Harold the Robot
  • Artificial Intelligence

• Evaluation

  • Human Interface Design
  • [Turing Test]

• Design

  • Human Interface Design

ACM K12 Model Curriculum #

• Level I (Grades K2)

  • Topic 11: Understand how 0s and 1s can be used to represent information, such as digital images and numbers.
    • Binary Numbers
    • Image Representation
    • Error Detection

• Level I (Grades 3-5)

  • Topic 2: Discuss common uses of technology in daily life and the advantages and disadvantages those uses provide.

    • Modems Unplugged
    • Databases

  • Topic 11: develop a simple understanding of an algorithm.

    • Text Compression
    • Searching Algorithms
    • Minimal Spanning Trees
    • Routing and Deadlock
    • Divide and Conquer

• Level I (Grades 6-8)

  • Topic 8: Select appropriate tools and technology resources to accomplish a variety of tasks and solve problems.

    • Databases

  • Topic 9: Demonstrate an understanding of concepts underlying hardware, software, algorithms, and their practical applications.

    • Information Theory
    • Programming Languages
    • Modems Unplugged
    • Divide and Conquer
    • Line Drawing

  • Topic 11: Understand the graph as a tool for representing problem states and solutions to complex problems.

    • Finite State Automata

• Level I (Grades K-12) Topic 12:

  • Understand how to arrange (sort) information into useful order, such as a telephone directory.
    • Sorting Algorithms

Add your Curriculum #

If you’d like to add your local curriculum, please get in touch.