Algorithms
7 months ago
misskmath
Save
Edit
Host a game
Live GameLive
Homework
Solo Practice
Practice
• Question 1
30 seconds
Q.

What term describes values that can only be either True or False?

Intractable

Algorithmic

Boolean

Sequential

• Question 2
30 seconds
Q.

What is/are used to determine whether code should be run for both "IF" statements and "WHILE" loops

Pseudocode

Correctness

Conditions

Events

• Question 3
30 seconds
Q.

Which combination of statements can be used to express algorithms?

Iterative, selection, sequential

Selection, conditional, and Boolean

• Question 4
30 seconds
Q.

What type of problem cannot currently be determined or explained by an algorithm?

Indefinite

Undecidable

Intractable

Impossible

• Question 5
30 seconds
Q.

When is a compound condition using the logical operator "AND" true?

When either of the conditions are true

When both conditions are false

When both conditions are true

When the "NOT" operator is also used

• Question 6
30 seconds
Q.

Which type of loop runs a set number of times?

Indefinite

While

Infinite

For

• Question 7
30 seconds
Q.

Why is a "divide-and-conquer" search more efficient than a linear search

You only look at half the data set

You eliminate half the data set with each iteration

You have to search all the values

It is less efficient with large data sets

• Question 8
30 seconds
Q.

Sequential statements...

run one after the other in the order given

run only when a condition is true

run until a loop finishes

run until the user types "exit"

• Question 9
30 seconds
Q.

Else statements...

run each time an "if" condition is true

run when an "if" condition is false

run every time an "if" statement runs

do not need an "if" statement

• Question 10
30 seconds
Q.

With a problem that cannot be solved for all cases, what can sometimes be used as a close approximation?