Question 1

What are the two base cases in a recursive description of a palindrome?

Accepted Answer

The two base cases in a recurs

Question 2

Induction can be used to prove that a recursive algorithm is correct.

Accepted Answer

A) True 
 B)False

Question 3

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

Accepted Answer

A) a b c d + - * 
B) a b * c d + - 
C) a b c - * d + 
D) a b c - d + * 
A) a b c d + - * 
B) a b * c d + - 
C) a b c - * d + 
D) a b c - d + *

Question 4

When is the base case of the Eight Queens problem reached?

Accepted Answer

The base case of the

Question 5

Which of the following is a prefix expression?

Accepted Answer

A) / a + b c 
B) a b c + / 
C) a * b + c 
D) a / (b +c) 
A) / a + b c 
B) a b c + / 
C) a * b + c 
D) a / (b +c)

Question 6

Which of the following is NOT a valid postfix expression?

Accepted Answer

A) a b c - d * 
B) a b - c d + - 
C) a b c + / 
D) a b * c + d * 
A) a b c - d * 
B) a b - c d + - 
C) a b c + / 
D) a b * c + d *

Question 7

Describe in your own words the language defined by this recursive definition:
 = @ |  | @ 
 = aab | aa  b

Accepted Answer

The set of words containing:an

Question 8

Which of the following is NOT a valid prefix expression?

Accepted Answer

A) - + a b + c d 
B) / a + b c 
C) * + * a b c d 
D) * - a b c d 
A) - + a b + c d 
B) / a + b c 
C) * + * a b c d 
D) * - a b c d

Question 9

The stricter the definition of a language,the easier it is for a compiler to recognize a syntactically legal expression.

Accepted Answer

A) True 
 B)False

Question 10

Which of the following is a postfix expression?

Accepted Answer

A) / a + b c 
B) a b c + / 
C) * a b c / + 
D) a / (b +c) 
A) / a + b c 
B) a b c + / 
C) * a b c / + 
D) a / (b +c)

Question 11

How can precedence and association rules be avoided in infix notation?

Accepted Answer

Precedence and association rul

Question 12

What is a closed-form formula?

Accepted Answer

A closed-form formul

Question 13

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

Accepted Answer

A) Recursion 
B) Backtracking 
C) Iteration 
D) Induction 
A) Recursion 
B) Backtracking 
C) Iteration 
D) Induction

Question 14

What is the main benefit of using a grammar that is recursive?

Accepted Answer

The main benefit of a grammar

Question 15

The empty string is a palindrome.

Accepted Answer

A) True 
 B)False

Question 16

Explain how you would design a method,returning boolean,that determines if a string passed as a parameter satisfies this recursive definition.
 =  
 = a | b | a  | b

Accepted Answer

We are basically looking to see if the s

Question 17

Which of the following strings is NOT a palindrome?

Accepted Answer

A) "madam" 
B) "" 
C) "adam" 
D) "deed" 
A) "madam" 
B) "" 
C) "adam" 
D) "deed"

Question 18

What is the value of the postfix expression: 6 7 + 8 2 - *?

Accepted Answer

A) -3 
B) -10 
C) 48 
D) 78 
A) -3 
B) -10 
C) 48 
D) 78

Question 19

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

Accepted Answer

A) one square 
B) two squares 
C) one column 
D) two columns 
A) one square 
B) two squares 
C) one column 
D) two columns

Question 20

According to the following statement:
JavaPrograms = {strings w : w is a syntactically correct Java program}
all strings are Java programs.

Accepted Answer

A) True 
 B)False

What are the two base cases in a recursive description of a palindrome?

Induction can be used to prove that a recursive algorithm is correct.

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

When is the base case of the Eight Queens problem reached?

Which of the following is a prefix expression?

Which of the following is NOT a valid postfix expression?

Describe in your own words the language defined by this recursive definition: < S > = @ | < W > | @ < S > < W > = aab | aa < W > b

Which of the following is NOT a valid prefix expression?

The stricter the definition of a language,the easier it is for a compiler to recognize a syntactically legal expression.

Which of the following is a postfix expression?

How can precedence and association rules be avoided in infix notation?

What is a closed-form formula?

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

What is the main benefit of using a grammar that is recursive?

The empty string is a palindrome.

Explain how you would design a method,returning boolean,that determines if a string passed as a parameter satisfies this recursive definition. < S > = < W > < W > < W > = a | b | a < W > | b < W >

Which of the following strings is NOT a palindrome?

What is the value of the postfix expression: 6 7 + 8 2 - *?

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

According to the following statement: JavaPrograms = {strings w : w is a syntactically correct Java program} all strings are Java programs.

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Stacks

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

External Methods

Filters

Exam 6: Problem Solving With Abstract Data Types

What are the two base cases in a recursive description of a palindrome?

Induction can be used to prove that a recursive algorithm is correct.

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

When is the base case of the Eight Queens problem reached?

Which of the following is a prefix expression?

Which of the following is NOT a valid postfix expression?

Describe in your own words the language defined by this recursive definition: < S > = @ | < W > | @ < S > < W > = aab | aa < W > b

Which of the following is NOT a valid prefix expression?

The stricter the definition of a language,the easier it is for a compiler to recognize a syntactically legal expression.

Which of the following is a postfix expression?

How can precedence and association rules be avoided in infix notation?

What is a closed-form formula?

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

What is the main benefit of using a grammar that is recursive?

The empty string is a palindrome.

Explain how you would design a method,returning boolean,that determines if a string passed as a parameter satisfies this recursive definition. < S > = < W > < W > < W > = a | b | a < W > | b < W >

Which of the following strings is NOT a palindrome?

What is the value of the postfix expression: 6 7 + 8 2 - *?

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

According to the following statement: JavaPrograms = {strings w : w is a syntactically correct Java program} all strings are Java programs.

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Stacks

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

External Methods

Filters