Question 1 ______ is a problem-solving technique that involves guesses at a solu

Question

Question 1

______ is a problem-solving technique that involves guesses at a solution.

Question 1 options:

Recursion

Backtracking

Box tracing

Induction

Save

Question 2

In the recursive solution to the Eight Queens problem, the problem size decreases by ______ at each recursive step.

Question 2 options:

one square

two squares

one column

two columns

Save

Question 3

In the Eight Queens problem, each column can contain ______.

Question 3 options:

exactly one queen

exactly two queens

at most two queens

at most three queens

Save

Question 4 ()

A language is a set of strings of ______.

Question 4 options:

numbers

letters

alphabets

symbols

Save

Question 5

The C++ ______ determines whether a given string is a syntactically correct C++ program.

Question 5 options:

applet

editor

compiler

programmer

Save

Question 6

In a grammar, the expression x | y means ______.

Question 6 options:

x or y

x followed by y

x out of y

x divided by y

Save

Question 7 ()

In a grammar, the expression x • y means ______.

Question 7 options:

x or y

x followed by y

x or y or both

x multiplied by y

Save

Question 8 (t)

An empty string ______.

Question 8 options:

has a length of 0

has a length of 1

is not a valid string

has a negative value for its length

Save

Question 9 ()

Which of the following strings is NOT a palindrome?

Question 9 options:

"madam"

""

"adam"

"deed"

Save

Question 10 ()

Which of the following is a fully parenthesized expression?

Question 10 options:

x * y + z

(x * y) + z

((x * y) + z)

(x) * (y) + (z)

Save

Question 11 ()

Which of the following is an infix expression?

Question 11 options:

/ a + b c

a b c + /

a b / + c

a / (b + c)

Save

Question 12 ()

Which of the following is the prefix form of the infix expression:
(8 + 6) / (16 - 4)

Question 12 options:

+ 8 6 / – 16 4

/ 8 6 + – 16 4

/ + ¬– 8 6 16 4

/ + 8 6 – 16 4

Save

Question 13 (1 point)

Which of the following is the postfix form of the infix expression:
a * b - (c + d)

Question 13 options:

a b c d + – *

a b * c d + –

a b c – * d +

a b c – d + *

Save

Question 14 ()

Which of the following is NOT a valid postfix expression?

Question 14 options:

a b c – d *

a b – c d + –

a b c + /

a b * c + d *

Save

Question 15 ()

Infix expressions do not need precedence rules.

Question 15 options:

Save

Question 16 ()

Parentheses are not necessary in prefix expressions.

Question 16 options:

Save

Question 17 ()

The following string is a valid prefix expression:
+ * a b c d

Question 17 options:

Save
Save All Responses

Recursion

Backtracking

Box tracing

Induction

Explanation / Answer

Backtracking
one square  
exactly one queen
symbols
compiler
x or y
x or y or both
has a length of 0
"adam"
((x * y) + z)
a / (b + c)
/ + 8 6 – 16 4
a b * c d + -
a b c – d *
False
True
False

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.