> For the complete documentation index, see [llms.txt](https://www.csprinciples.com/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://www.csprinciples.com/big-idea-3/3.3-mathematical-expressions.md). # 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. --- # Agent Instructions This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com. ## Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter: ``` GET https://www.csprinciples.com/big-idea-3/3.3-mathematical-expressions.md?ask=&goal= ``` `ask` is the immediate question: it should be specific, self-contained, and written in natural language. `goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.