English	한국어
variable/ˈveərɪəbl/	变量
assignment/əˈsaɪnmənt/	과제 배정
Data abstraction/ˈdeɪtə əbˈstrækʃn/	데이터 추상화(Data abstraction)
remainder/rɪˈmeɪndə/	나머지

Enduring Understanding	Learning Objective	Essential Knowledge
AAP-1 To find specific solutions to generalizable problems, programmers represent and organize data in multiple ways.	AAP-1.C Represent a list or string using a variable. [Skill 3.A]	AAP-1.C.1 A list is an ordered sequence of elements. For example, `[value1, value2, value3, ...]` describes a list where `value1` is the first element, `value2` is the second element, `value3` is the third element, and so on. AAP-1.C.2 An element is an individual value in a list that is assigned a unique index. AAP-1.C.3 An index is a common method for referencing the elements in a list or string using natural numbers. AAP-1.C.4 A string is an ordered sequence of characters.
	AAP-1.D For data abstraction: a. Develop data abstraction using lists to store multiple elements. [Skill 3.B] b. Explain how the use of data abstraction manages complexity in program code. [Skill 3.C]	AAP-1.D.1 Data abstraction provides a separation between the abstract properties of a data type and the concrete details of its representation. AAP-1.D.2 Data abstractions manage complexity in programs by giving a collection of data a name without referencing the specific details of the representation. AAP-1.D.3 Data abstractions can be created using lists. AAP-1.D.4 Developing a data abstraction to implement in a program can result in a program that is easier to develop and maintain. AAP-1.D.5 Data abstractions often contain different types of elements. AAP-1.D.6 The use of lists allows multiple related items to be treated as a single value. Lists are referred to by different names, such as array, depending on the programming language. Exclusion statement (EK AAP-1.D.6): The use of linked lists is outside the scope of this course and the AP Exam. AAP-1.D.7 The exam reference sheet provides the notation `[value1, value2, value3, ...]` to create a list with those values as the first, second, third, and so on items. For example, Text: `aList ← [value1, value2, value3, ...]` Block: `aList ← value1, value2, value3` creates a new list that contains the values `value1`, `value2`, `value3`, and `...` at indices `1`, `2`, `3`, and `...` respectively and assigns it to `aList`. Text: `aList ← []` Block: `aList ←` (empty) creates a new empty list and assigns it to `aList`. Text: `aList ← bList` Block: `aList ← bList` assigns a copy of the list `bList` to the list `aList`. For example, if `bList` contains `[20, 40, 60]`, then `aList` will also contain `[20, 40, 60]` after the assignment. AAP-1.D.8 The exam reference sheet describes a list structure whose index values are 1 through the number of elements in the list, inclusive. For all list operations, if a list index is less than 1 or greater than the length of the list, an error message is produced and the program will terminate.

English	한국어
string/strɪŋ/	문자열(string)
concatenation/kənˌkætəˈneɪʃn/	연결 concat

Enduring Understanding	Learning Objective	Essential Knowledge
AAP-2 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.	AAP-2.E For relationships between two variables, expressions, or values: a. Write expressions using relational operators. [Skill 2.B] b. Evaluate expressions that use relational operators. [Skill 4.B]	AAP-2.E.1 A Boolean value is either true or false. AAP-2.E.2 The exam reference sheet provides the following relational operators: `=`, `≠`, `>`, `<`, `≥`, and `≤`. Text and Block: `a = b` `a ≠ b` `a > b` `a < b` `a ≥ b` `a ≤ b` These are used to test the relationship between two variables, expressions, or values. A comparison using a relational operator evaluates to a Boolean value. For example, `a = b` evaluates to `true` if `a` and `b` are equal; otherwise, it evaluates to `false`.
	AAP-2.F For relationships between Boolean values: a. Write expressions using logical operators. [Skill 2.B] b. Evaluate expressions that use logic operators. [Skill 4.B]	AAP-2.F.1 The exam reference sheet provides the logical operators `NOT`, `AND`, and `OR`, which evaluate to a Boolean value. AAP-2.F.2 The exam reference sheet provides Text: `NOT condition` Block: `NOT condition` which evaluates to `true` if `condition` is `false`; otherwise it evaluates to `false`. AAP-2.F.3 The exam reference sheet provides Text: `condition1 AND condition2` Block: `condition1 AND condition2` which evaluates to `true` if both `condition1` and `condition2` are `true`; otherwise it evaluates to `false`. AAP-2.F.4 The exam reference sheet provides Text: `condition1 OR condition2` Block: `condition1 OR condition2` which evaluates to `true` if `condition1` is `true` or if `condition2` is `true` or if both `condition1` and `condition2` are `true`; otherwise it evaluates to `false`. AAP-2.F.5 The operand for a logical operator is either a Boolean expression or a single Boolean value.

English	한국어
Boolean expression/ˈbuːlɪən ekˈspreʃn/	부울 부호 표현식
conditional (selection)/kənˈdɪʃənl/	조건부 (선택)
nested conditional/ˈnestɪd kənˈdɪʃənl/	중첩 조건문(nested conditional)
Iteration (a loop)/ˌɪtəˈreɪʃn/	반복 (루프)
infinite loop/ˈɪnfɪnət luːp/	무한 루프(infinite loop)
algorithm/ˈælɡərɪθəm/	알고리즘

Enduring Understanding	Learning Objective	Essential Knowledge
AAP-2 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.	AAP-2.G Express an algorithm that uses selection without using a programming language. [Skill 2.A]	AAP-2.G.1 Selection determines which parts of an algorithm are executed based on a condition being `true` or `false`.
	AAP-2.H For selection: a. Write conditional statements. [Skill 2.B] b. Determine the result of conditional statements. [Skill 4.B]	AAP-2.H.1 Conditional statements, or "if-statements," affect the sequential flow of control by executing different statements based on the value of a Boolean expression. AAP-2.H.2 The exam reference sheet provides Text: `IF(condition)` `{` `<block of statements>` `}` Block: `IF condition` `block of statements` in which the code in `block of statements` is executed if the Boolean expression `condition` evaluates to `true`; no action is taken if `condition` evaluates to `false`. AAP-2.H.3 The exam reference sheet provides Text: `IF(condition)` `{` `<first block of statements>` `}` `ELSE` `{` `<second block of statements>` `}` Block: `IF condition` `first block of statements` `ELSE` `second block of statements` in which the code in `first block of statements` is executed if the Boolean expression `condition` evaluates to `true`; otherwise, the code in `second block of statements` is executed.

Enduring Understanding	Learning Objective	Essential Knowledge
AAP-2 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.	AAP-2.J Express an algorithm that uses iteration without using a programming language. [Skill 2.A]	AAP-2.J.1 Iteration is a repeating portion of an algorithm. Iteration repeats a specified number of times or until a given condition is met.
	AAP-2.K For iteration: a. Write iteration statements. [Skill 2.B] b. Determine the result or side effect of iteration statements. [Skill 4.B]	AAP-2.K.1 Iteration statements change the sequential flow of control by repeating a set of statements zero or more times, until a stopping condition is met. AAP-2.K.2 The exam reference sheet provides Text: `REPEAT n TIMES` `{` `<block of statements>` `}` Block: `REPEAT n TIMES` `block of statements` in which the `block of statements` is executed `n` times. AAP-2.K.3 The exam reference sheet provides Text: `REPEAT UNTIL(condition)` `{` `<block of statements>` `}` Block: `REPEAT UNTIL condition` `block of statements` in which the code in `block of statements` is repeated until the Boolean expression `condition` evaluates to `true`. AAP-2.K.4 In `REPEAT UNTIL(condition)` iteration, an infinite loop occurs when the ending condition will never evaluate to `true`. AAP-2.K.5 In `REPEAT UNTIL(condition)` iteration, if the conditional evaluates to `true` initially, the loop body is not executed at all, due to the condition being checked before the loop.

Enduring Understanding	Learning Objective	Essential Knowledge
AAP-2 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.	AAP-2.N For list operations: a. Write expressions that use list indexing and list procedures. [Skill 2.B] b. Evaluate expressions that use list indexing and list procedures. [Skill 4.B]	AAP-2.N.1 The exam reference sheet provides basic operations on lists, including: accessing an element by index Text: `aList[i]` Block: `aList i` accesses the element of `aList` at index `i`. The first element of `aList` is at index `1` and is accessed using the notation `aList[1]`. assigning a value of an element of a list to a variable Text: `x ← aList[i]` Block: `x ← aList i` assigns the value of `aList[i]` to the variable `x`. assigning a value to an element of a list Text: `aList[i] ← x` Block: `aList i ← x` assigns the value of `x` to `aList[i]`. Text: `aList[i] ← aList[j]` Block: `aList i ← aList j` assigns the value of `aList[j]` to `aList[i]`. inserting elements at a given index Text: `INSERT(aList, i, value)` Block: `INSERT aList, i, value` shifts to the right any values in `aList` at indices greater than or equal to `i`. The length of the list is increased by 1, and `value` is placed at index `i` in `aList`. adding elements to the end of the list Text: `APPEND(aList, value)` Block: `APPEND aList, value` increases the length of `aList` by 1, and `value` is placed at the end of `aList`. removing elements Text: `REMOVE(aList, i)` Block: `REMOVE aList, i` removes the item at index `i` in `aList` and shifts to the left any values at indices greater than `i`. The length of `aList` is decreased by 1. determining the length of a list Text: `LENGTH(aList)` Block: `LENGTH aList` evaluates to the number of elements currently in `aList`. AAP-2.N.2 List procedures are implemented in accordance with the syntax rules of the programming language.
	AAP-2.O For algorithms involving elements of a list: a. Write iteration statements to traverse a list. [Skill 2.B] b. Determine the result of an algorithm that includes list traversals. [Skill 4.B]	AAP-2.O.1 Traversing a list can be a complete traversal, where all elements in the list are accessed, or a partial traversal, where only a portion of elements are accessed. Exclusion statement (EK AAP-2.O.1): Traversing multiple lists at the same time using the same index for both (parallel traversals) is outside the scope of this course and the AP Exam. AAP-2.O.2 Iteration statements can be used to traverse a list. AAP-2.O.3 The exam reference sheet provides Text: `FOR EACH item IN aList` `{` `<block of statements>` `}` Block: `FOR EACH item IN aList` `block of statements` The variable `item` is assigned the value of each element of `aList` sequentially, in order, from the first element to the last element. The code in `block of statements` is executed once for each assignment of `item`. AAP-2.O.4 Knowledge of existing algorithms that use iteration can help in constructing new algorithms. Some examples of existing algorithms that are often used with lists include: determining a minimum or maximum value in a list computing a sum or average of a list of numbers AAP-2.O.5 Linear search or sequential search algorithms check each element of a list, in order, until the desired value is found or all elements in the list have been checked.

English	한국어
procedural abstraction/prəˈsiːdʒərəl əbˈstrækʃn/	절차 추상화
abstraction/əbˈstrækʃn/	추상화

English	한국어
simulation/ˌsɪmjʊˈleɪʃn/	시뮬레이션(simulation)
Efficiency/ɪˈfɪʃənsi/	효율성
heuristic/hjuːˈrɪstɪk/	히어리스틱
undecidable/ˌʌndɪˈsaɪdəbl/	해결 불가능함
Interface/ˈɪntəfeɪs/	인터페이스

Variables and Assignments · ⁨변수 및 대입⁩

Watch a variable hold and change its value · ⁨변수의 값이 유지되고 변경되는 과정 관찰하기⁩

Data Abstraction · ⁨데이터 추상화⁩

Mathematical Expressions · ⁨수학적 표현식⁩

Evaluate an expression step by step · ⁨수식을 단계별로 평가하기⁩

Strings · ⁨문자열⁩

Boolean Expressions · ⁨부울린 식⁩

Try the OR truth table · ⁨OR 진리표 시도하기⁩

Conditionals · ⁨조건문⁩

Follow an if / else decision · ⁨if / else 결정문 따르기⁩

Nested Conditionals · ⁨중첩 조건문⁩

Iteration · ⁨반복⁩

Trace a loop one pass at a time · ⁨루프를 한 번의 반복 단위로 추적하기⁩

Developing Algorithms · ⁨알고리즘 개발⁩

Lists · ⁨목록⁩

Binary Search · ⁨이진 탐색⁩

Calling Procedures · ⁨절차 호출⁩

Developing Procedures · ⁨절차 개발⁩

Libraries · ⁨라이브러리⁩

Random Values · ⁨무작위 값⁩

Simulations · ⁨시뮬레이션⁩

Algorithmic Efficiency · ⁨알고리즘 효율성⁩

Undecidable Problems · ⁨결정 불가능한 문제⁩

Exam tips · ⁨시험 팁⁩

Interactive lessons on this topic · ⁨이 주제에 대한 인터랙티브 수업⁩

More topics in AP Computer Science Principles · ⁨AP 컴퓨터 과학 원리⁩ · ⁨AP Computer Science Principles · ⁨AP 컴퓨터 과학 원리⁩ 내 추가 주제⁩