PLTW Computer Science FINAL EXAM

studied byStudied by 16 people
5.0(1)
Get a hint
Hint

User Story

1 / 52

flashcard set

Earn XP

Description and Tags

53 Terms

1

User Story

a written description of a program written from the perspective of a user

New cards
2

User-Centered

When you are developing an app, or any software solution, it is important to think about people who will be using that softare.

New cards
3

User Interface

the inputs and outputs that allow a user to interact with a piece of software. User interfaces can include a variety of forms such as buttons, menus, images, text, and graphics.

New cards
4

Calling a Procedure

To direct a program to execute or reference a certain procedure. A procedure is a subroutine that is stored only once but can be called many times in a program to execute when needed.

New cards
5

If-Then-Else Conditional Statements

  1. Boolean expression of input: Yes/No - True/False

  2. If True or Yes, then a value is inputted and the operation continues.

  3. If False or No, then a value is not inputted and "else" is initialized.

  4. If Else, the 1st input is not true or yes, then the second condition is met.

New cards
6

Global vs. Local Variables

Both variables are stored data. Global variables are accessible by any part of the program at any time. Local variables are only accessible by particular parts of the program.

New cards
7

While Loops

A control structure that allows a piece of code to repeated until a certain condition is false

New cards
8

The Software Development Process

  1. Investigate

  2. Plan

  3. Design

  4. Create & Test

  5. Evaluate the Solution

  6. Document and Present

New cards
9

Event-Driven Programming

some program statements run when triggered by an event, like a mouse click or a key press

New cards
10

Index/Indices

A specific location by order for an individual element in a list.

New cards
11

Abstraction

the result of creating a program where the focus is on what each step does instead of how the steps are performed. Also, the method or procedure used to control difficulty in a computer program or system.

New cards
12

Best-So-Far Loop

A piece of code (loop) that contains a variable which stores the "best" value as defined by the programmer. Each time the code executes the loop, the program evaluates whether it finds a "better" value as defined by the programmer. If it finds one that is better, then it replaces that variable value with the new value and continues until it reaches the end of the list.

New cards
13

Feature

A function of an application or user interface.

New cards
14

TEMP Chart

A model for building vocabulary: Term, Example, Meaning, Picture.

New cards
15

Component

A function or artifact in an app that you can add in design view of MIT App Inventor. E.g., Canvases, Cameras, Labels, Sliders, Sounds, Horizontal Arrangements, & Buttons

New cards
16

Event

An action or occurrence that happens during runtime that will trigger a response or behavior by the software.

New cards
17

Event Handlers

A control block that looks for inputs or events to know when to perform a specific action.

New cards
18

Procedures

A sequence of actions or instructions to follow in solving a problem or accomplishing a task. Also called subprogram.

New cards
19

Debugging

To identify errors or bugs in computer hardware or programs and fix them.

New cards
20

Input

Information or signals entered into a computer system using an interface

such as buttons, keys on a keyboard, touch screens, & accelerometers.

New cards
21

Output

Information or signals produced or delivered by a computer system.

New cards
22

Iteration

A process of repeating a set of instructions a specified number of times or until a condition is met.

New cards
23

Variables

The smallest unit of data storage that a program can use.

This includes known or unknown information referred to as a "value".

Variables are either global or local.

New cards
24

Arguments

The values that a program provides to a function or subroutine.

These are also referred to as parameters.

New cards
25

Strings

Text or characters displayed by a program.

New cards
26

Concatenation

A joining together of separate items

- without changing them

- into one place.

New cards
27

Arithmetic Operators

A symbol in code that tells a computer to perform a specific math operation,

such as addition, subtraction, multiplication, or division.

New cards
28

Relational Operators

The = ≠ > < operators used to compare two items.

They are also referred to as comparison operators.

New cards
29

Logical Operators

A representation of a logical statement that is used to examine the

relationship between two values and determine whether the statement is true

or false. Examples of logical operators are AND, OR, and NOT.

New cards
30

Conditional Statements

A programming statement that evaluates a true/false Boolean expression to

determine the next steps in a program. Conditional statements are often

written as "if-then" or "if-then-else" statements.

New cards
31

Boolean Expressions

A processing decision branch using relational operators (= ≠ > <) that is

defined to return a Boolean value ("true" or "false").

New cards
32

Boolean Operators

â—Ź not

â—Ź equal to

â—Ź and

â—Ź or

New cards
33

Transistor

A physical component that can make yes/no & true/false decisions.

New cards
34

Chained Conditional Statements

A series of conditional statements which a computer executes

until it finds one that is true.

New cards
35

Integer

A whole number that does not have a decimal or any digits after the decimal.

New cards
36

Procedure

A sequence of actions or instructions to follow in solving a problem or

accomplishing a task. A procedure is a group of statements that may be used

at one or more points in a computer program.

These are also referred to as subprograms.

New cards
37

Backlog

A sequential and prioritized list of what needs to be done to create the app

the user wants. The list can be technical requirements or user centric in the

form of user stories.

New cards
38

Sprint-Task-List

A list of individual parts that need development to address a backlog item.

New cards
39

Scope

A description of the parts of a program where a particular variable can be

accessed and modified.

New cards
40

Natural Language

The language that people use in daily conversations with each other.

New cards
41

Pseudocode

A way to work out the logic without worrying too much about the specifics

of the language you are programming in.

New cards
42

Incremental Counter

A loop that changes the value of a count by a certain amount every time an event occurs.

New cards
43

Decrement

To reduce in number by one.

New cards
44

Loop

A sequence of instructions that continually repeats until a condition is met.

A loop is a type of iteration.

New cards
45

Problem Decomposition

The process of breaking a complex problem or system into parts that are

easier to conceive, understand, program, and maintain.

New cards
46

Sprints

The individual parts that need development to address a backlog item.

New cards
47

Local Database

A storage space on a device used to store information from an app.

New cards
48

Procedural Abstraction

The process of applying or using a procedure and only knowing what the

procedure does, without knowing how it does it.

New cards
49

Function

A named section of a program that performs a specific task. A function is a

block of organized and reusable code that performs a single action. A

function can be a procedure or a subroutine.

New cards
50

Method

A function that is a member of a class.

New cards
51

Class

A template for creating objects. A class is a grouping of functions and

associated data into a cohesive unit that specifies the methods and attributes

(also called properties) that are related to an object.

When an object is created from a class, the resulting object is called "an

instance of the class."

New cards
52

Modulo

A mathematical operator that performs division but returns the remainder.

New cards
53

Accumulator

A role that a variable may take on in which it keeps a running or cumulative

total or value.

Commonly an accumulator is initialized outside of a loop, assigned new

values within the loop, and then its result is used outside of the loop.

New cards

Explore top notes

note Note
studied byStudied by 9 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 8 people
Updated ... ago
4.0 Stars(1)
note Note
studied byStudied by 39 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 9 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 9 people
Updated ... ago
4.0 Stars(1)
note Note
studied byStudied by 7 people
Updated ... ago
4.0 Stars(1)
note Note
studied byStudied by 20 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 36210 people
Updated ... ago
4.9 Stars(187)

Explore top flashcards

flashcards Flashcard59 terms
studied byStudied by 6 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard200 terms
studied byStudied by 24 people
Updated ... ago
4.0 Stars(1)
flashcards Flashcard27 terms
studied byStudied by 2 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard49 terms
studied byStudied by 3 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard22 terms
studied byStudied by 2 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard24 terms
studied byStudied by 6 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard68 terms
studied byStudied by 3 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard79 terms
studied byStudied by 9 people
Updated ... ago
5.0 Stars(2)