✒️
Computer Science Principles
  • Introduction
  • Overview
  • Course at a Glance
  • Course Exam Description
  • Create Performance Task
  • Reference Sheet
  • Resources
  • Big Idea 1
    • 1.1 Collaboration
    • 1.2 Program Function and Purpose
    • 1.3 Program Design and Development
    • 1.4 Identifying and Correcting Errors
  • Big Idea 2
    • 2.1 Binary Numbers
    • 2.2 Data Compression
    • 2.3 Extracting Information from Data
    • 2.4 Using Programs with Data
  • Big Idea 3
    • 3.1 Variables and Assignments
    • 3.2 Data Abstraction
    • 3.3 Mathematical Expressions
    • 3.4 Strings
    • 3.5 Boolean Expression
    • 3.6 Conditionals
    • 3.7 Nested Conditionals
    • 3.8 Iteration
    • 3.9 Developing Algorithms
    • 3.10 Lists
    • 3.11 Binary Search
    • 3.12 Calling Procedures
    • 3.13 Developing Procedures
    • 3.14 Libraries
    • 3.15 Random Values
    • 3.16 Simulations
    • 3.17 Algorithmic Efficiency
    • 3.18 Undecidable Problems
  • Big Idea 4
    • 4.1 The Internet
    • 4.2 Fault Tolerant
    • 4.3 Parallel and Distributed Computing
  • Big Idea 5
    • 5.1 Beneficial and Harmful Effects
    • 5.2 Digital Divide
    • 5.3 Computing Bias
    • 5.4 Crowdsourcing
    • 5.5 Legal and Ethical Concerns
    • 5.6 Safe Computing
  • Code
    • Week 10
    • Week 11
    • Week 12
    • Week 13
    • Week 14
    • Week 15
    • Week 16
    • Week 17
    • Week 18
    • Week 19
    • Week 20
    • Week 21
    • Week 22
Powered by GitBook
On this page
  • Enduring Understanding
  • Learning Objective
  • Essential Knowledge
  • Learning Objective
  • Essential Knowledge
  • Learning Objective
  • Essential Knowledge

Was this helpful?

Export as PDF
  1. Big Idea 3

3.3 Mathematical Expressions

Enduring Understanding

The way statements are sequenced and combined in a program determines the computed result. Programs incorporate iteration and selection constructs to represent repetition and make decisions to handle varied input values.

Learning Objective

Express an algorithm that uses sequencing without using a programming language.

Essential Knowledge

An algorithm is a finite set of instructions that accomplish a specific task.

Beyond visual and textual programming languages, algorithms can be expressed in a variety of ways, such as natural language, diagrams, and pseudocode.

Algorithms executed by programs are implemented using programming languages.

Every algorithm can be constructed using combinations of sequencing, selection, and iteration.

Learning Objective

Represent a step-by-step algorithmic process using sequential code statements. 

Essential Knowledge

Sequencing is the application of each step of an algorithm in the order in which the code statements are given.

A code statement is a part of program code that expresses an action to be carried out.

An expression can consist of a value, a variable, an operator, or a procedure call that returns a value.

Expressions are evaluated to produce a single value

The evaluation of expressions follows a set order of operations defined by the programming language.

Sequential statements execute in the order they appear in the code segment.

Clarity and readability are important considerations when expressing an algorithm in a programming language.

Learning Objective

Evaluate expressions that use arithmetic operators.

Essential Knowledge

Arithmetic operators are part of most programming languages and include addition, subtraction, multiplication, division, and modulus operators.

The exam reference sheet provides a MOD b, which evaluates to the remainder when a is divided by b. Assume that a is an integer greater than or equal to 0 and b is an integer greater than 0. For example, 17 MOD 5 evaluates to 2.

The exam reference sheet provides the arithmetic operators +, -, *, /, and MOD. Text and Block:

  • a + b

  • a - b

  • a * b

  • a / b

  • a MOD b

These are used to perform arithmetic on a and b. For example, 17 / 5 evaluates to 3.4.

The order of operations used in mathematics applies when evaluating expressions. The MOD operator has the same precedence as the * and / operators.

Previous3.2 Data AbstractionNext3.4 Strings

Last updated 1 year ago

Was this helpful?