[go: up one dir, main page]
Scribd
Upload
490 views5 pages

Section 3 Quiz 1

The document is a quiz on topics related to recursion, strings, regular expressions, and string manipulation in Java. It consists of 15 multiple choice questions with answers indicated by an asterisk. The questions cover topics such as how many copies of itself a non-linear recursive method can call; which case handles the last recursive call; methods for replacing segments of strings; and regular expression symbols and their meanings.

Uploaded by

Fabiola Ester Tomasila II
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
490 views5 pages

Section 3 Quiz 1

The document is a quiz on topics related to recursion, strings, regular expressions, and string manipulation in Java. It consists of 15 multiple choice questions with answers indicated by an asterisk. The questions cover topics such as how many copies of itself a non-linear recursive method can call; which case handles the last recursive call; methods for replacing segments of strings; and regular expression symbols and their meanings.

Uploaded by

Fabiola Ester Tomasila II
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Test: Section 3 Quiz 1 - L1-L3

Review your answers, feedback, and question scores below. An asterisk (*) indicates a correct answer.

Section 3 - Quiz 1 L1-L3


(Answer all questions in this section)

1. A non-linear recursive method can call how many copies of itself?


Mark for Review
(1) Points

1
2 or more (*)
None

Correct

2. Which case handles the last recursive call?


Mark for Review
(1) Points

The convergence case


The secondary case
The base case (*)
The primary case
The recursive case

Correct

3. Which case does a recursive method call last?


Mark for Review
(1) Points

Recursive Case
Convergence Case
Basic Case
Base Case (*)
None of the above

Correct

4. A linear recursion requires the method to call which direction?


Mark for Review
(1) Points
Forward
Backward (*)
Both forward and backward
None of the above

Correct

5. Which of the following methods can be used to replace a segment in a string with a
new string? Mark for Review
(1) Points

remove(String oldString, String newString)


replaceAll(String oldString, String newString) (*)
replaceAll(String newString)
substring(int start, int end, String newString)
None of the above. There is no replaceAll(String newString) method with one
argument.

Correct

Page 1 of 3 Next Summary

Test: Section 3 Quiz 1 - L1-L3

Review your answers, feedback, and question scores below. An asterisk (*) indicates a correct answer.

Section 3 - Quiz 1 L1-L3


(Answer all questions in this section)

6. Identify the method, of those listed below, that is not available to both StringBuilders
and Strings? Mark for Review
(1) Points

length()
charAt(int index)
delete(int start, int end) (*)
indexOf(String str)

Correct
7. Using the FOR loop method of incrementing through a String is beneficial if you desire
to: (Choose Three) Mark for Review
(1) Points

(Choose all correct answers)

Read the String backwards (from last element to first element). (*)
Parse the String. (*)
Search for a specific character or String inside of the String. (*)
You don't use a FOR loop with Strings

Incorrect. Refer to Section 3 Lesson 1.

8. Which of the following correctly defines a StringBuilder?


Mark for Review
(1) Points

A method that adds characters to a string.


A class inside the java.util.regex package.
There is no such thing as a StringBuilder in Java.
A class that represents a string-like object. (*)

Correct

9. Which of the following methods for the String class take a regular expression as a
parameter and returns true if the string matches the expression? Mark for Review
(1) Points

compareTo(String regex)
equals(String regex)
equalsIgnoreCase(String regex)
matches(String regex) (*)

Correct

10. Consider that you are making a calendar and decide to write a segment of code that
returns true if the string month is April, May, June, or July. Which code segment Mark for Review
correctly implements use of regular expressions to complete this task? (1) Points

return month.matches("April|May|June|July"); (*)


return month.compareTo("April, May, June, July");
return month.equals("April, May, June, July");
return month.substring(0,3);
return month.matches("April"|"May"|"June"|"July");
Correct

Previous Page 2 of 3 Next Summary

Test: Section 3 Quiz 1 - L1-L3

Review your answers, feedback, and question scores below. An asterisk (*) indicates a correct answer.

Section 3 - Quiz 1 L1-L3


(Answer all questions in this section)

11. A regular expression is a character or a sequence of characters that represent a string


or multiple strings. Mark for Review
True or false? (1) Points

True (*)
False

Correct

12. The following code correctly initializes a pattern with the regular expression "[0-
9]{2}/[0-9]{2}/[0-9]{2}". Mark for Review
(1) Points
Pattern dateP = Pattern.compile("[0-9]{2}/[0-9]{2}/[0-9]{2}");

True or false?

True (*)
False

Correct

13. Which of the following does not correctly match the regular expression symbol to its
proper function? Mark for Review
(1) Points

"{x}" means there must be x occurrences of the preceding character in the string
to be a match.
"?" means there may be zero or one occurrences of the preceding character in
the string to be a match.
"+" means there may be zero or more occurrences of the preceding character in
the string to be a match. (*)
"{x,}" means there may be x or more occurrences of the preceeding character in
the string to be a match.
"{x,y}" means there may be between x and y occurrences of the preceding
character in the string to be a match.

Correct

14. Which of the following correctly defines Matcher?


Mark for Review
(1) Points

A method of dividing a string into a set of sub-strings.


A regular expression symbol that represents any character.
A class in the java.util.regex package that stores the format of a regular
expression.
A class in the java.util.regex package that stores the matches between a pattern
and a string. (*)

Correct

15. What does the dot (.) represent in regular expressions?


Mark for Review
(1) Points

An indication for one or more occurrences of the preceding character.


A match for any character. (*)
A range specified between brackets that allows variability of a character.
Nothing, it is merely a dot.

Correct

Previous Page 3 of 3 Summary

You might also like