Studied by 12 people

0.0(0)

get a hint

hint

Computer Science

computer science

comouter

technology

device

binary

binary search

search

linaer search

swap

loop

repeat untill lopp

can_move

robot

rotate left

rotate right

boolean

boolean tables

numeric procedures

relational

boolean operators

input operators

display operators

operators

list

assignment operators

expression

modulus

operator precedence

mathematical operators

display

expression

abstraction

coding

programming

variables

java

programmers

cobol

grace hopper

University/Undergrad

1

Meaningful variable names

________ help with the readability of program code and reduce the level of complexity of a program.

New cards

2

input parameter

The ________ for the DISPLAY abstraction is expression.

New cards

3

modulus

A(n) ________ is a mathematical operation that returns the remainder after an initial number (the dividend) is divided by another number (the divisor)

New cards

4

dividend

If the ________ is less than the divisor, the resulting modulus calculation will equal the value of the ________.

New cards

5

modulus calculation

If the divisor is a multiple of the dividend, it will divide evenly with no remainder, resulting in a(n) ________ of 0.

New cards

6

abstraction

A(n) ________ is a way to represent essential features without including the background details or explanations.

New cards

7

DISPLAY

________ (expression) is an abstraction that is used on your AP exam to ________ a value of expression followed by a space.

New cards

8

assignment operator

The ________ allows a program to change the value represented by a variable.

New cards

9

left of MOD

A zero to the ________ is feasible and results in a modulus calculation of 0.

New cards

10

COBOL

The first language to use abstractions instead of machine language was ________, which was designed by Grace Hopper.

New cards

11

SWAP

THE ________: A common algorithm is the ________.

New cards

12

dividend

The ________ is 4, and 3 is the divisor.

New cards

13

modulus

The ________ is the integer remainder when two numbers are divided.

New cards

14

Abstractions

________ reduce complexity and allow for efficient design and implementation of complex software systems.

New cards

15

Coding in a programming language is often translated into code in another low

level language that the computer can execute

New cards

16

First

Parentheses

New cards

17

Second

MOD, *, /

New cards

18

Third

+, −

New cards

19

Write a 1 on top, and multiply it by the divisor

1 multiplied by 3 is 3

New cards

20

Answer

0

New cards

21

Answer

True

New cards

22

Answer

50%

New cards

23

THE SWAP

A common algorithm is the swap

New cards

24

abstraction

is a way to represent essential features without including the background details or explanations.

New cards

25

*System.out.print(“Hello World”);*

\n

In JAVA, the same code can be written using the System.out.print abstraction:

New cards

26

Programmers

have worked to hide details by using abstractions.

New cards

27

Variables

vary

New cards

28

Coding

in a programming language is often translated into code in another low- level language that the computer can execute.

New cards

29

DISPLAY

(expression) is an abstraction that is used on your AP exam to display a value of expression followed by a space.

New cards

30

modulus

is a mathematical operation that returns the remainder after an initial number (the dividend) is divided by another number (the divisor).

New cards

31

list

is an ordered sequence of elements starting with the index 1.

New cards

32

ROTATE_RIGHT

will rotate the robot 90 degrees clockwise.

New cards

33

ROTATE_LEFT

will rotate the robot 90 degrees counterclockwise.

New cards

34

Loops

will repeat a section of code until a condition is met.

New cards

35

Swap

common algorithm

New cards

36

linear search

(or sequential search) is an algorithm for finding an element in a list.

New cards

37

binary search

is a search algorithm that halves the number of elements that need to be searched after every comparison.

New cards