I know you guys can answer 3 Multiple choice at atime but please answer one extra so I do not have to ask one more question. 7.) Which of the following is correct? a. String[] list = new String{"red", "yellow", "green"}; b. String[] list = new String[]{"red", "yellow", "green"}; c. String[] list = {"red", "yellow", "green"}; d. String list = {"red", "yellow", "green"}; e. String list = new String{"red", "yellow", "green"}; 8.) What are the base cases in the following recursive method? public static void xMethod(int n) { if (n > 0) { System.out.print(n % 10); xMethod(n / 10); } } a. n > 0 b. n <= 0 c. no base cases d. n < 0 9.) Fill in the codeto complete the following method for computing factorial. /** Return the factorial for a specified index */ public static long factorial(int n) { if (n == 0) // Base case return 1; else return _____________; // Recursive call } a. n * (n - 1) b. n c. n * factorial(n - 1) d. factorial(n - 1) * n 10.) All Java applications must have a method __________. a. public static Main(String[] args) b. public static Main(String args[]) c. public static void main(String[] args) d. public void main(String[] args) e. public static main(String[] args)
I know you guys can answer 3 Multiple choice at atime but please answer one extra so I do not have to ask one more question. 7.) Which of the following is correct? a. String[] list = new String{"red", "yellow", "green"}; b. String[] list = new String[]{"red", "yellow", "green"}; c. String[] list = {"red", "yellow", "green"}; d. String list = {"red", "yellow", "green"}; e. String list = new String{"red", "yellow", "green"}; 8.) What are the base cases in the following recursive method? public static void xMethod(int n) { if (n > 0) { System.out.print(n % 10); xMethod(n / 10); } } a. n > 0 b. n <= 0 c. no base cases d. n < 0 9.) Fill in the codeto complete the following method for computing factorial. /** Return the factorial for a specified index */ public static long factorial(int n) { if (n == 0) // Base case return 1; else return _____________; // Recursive call } a. n * (n - 1) b. n c. n * factorial(n - 1) d. factorial(n - 1) * n 10.) All Java applications must have a method __________. a. public static Main(String[] args) b. public static Main(String args[]) c. public static void main(String[] args) d. public void main(String[] args) e. public static main(String[] args)
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
I know you guys can answer 3 Multiple choice at atime but please answer one extra so I do not have to ask one more question.
7.) Which of the following is correct?
a. String[] list = new String{"red", "yellow", "green"};
b. String[] list = new String[]{"red", "yellow", "green"};
c. String[] list = {"red", "yellow", "green"};
d. String list = {"red", "yellow", "green"};
e. String list = new String{"red", "yellow", "green"};
8.) What are the base cases in the following recursive method?
public static void xMethod(int n) {
if (n > 0) {
System.out.print(n % 10);
xMethod(n / 10);
}
}
a. n > 0
b. n <= 0
c. no base cases
d. n < 0
a. String[] list = new String{"red", "yellow", "green"};
b. String[] list = new String[]{"red", "yellow", "green"};
c. String[] list = {"red", "yellow", "green"};
d. String list = {"red", "yellow", "green"};
e. String list = new String{"red", "yellow", "green"};
8.) What are the base cases in the following recursive method?
public static void xMethod(int n) {
if (n > 0) {
System.out.print(n % 10);
xMethod(n / 10);
}
}
a. n > 0
b. n <= 0
c. no base cases
d. n < 0
9.) Fill in the codeto complete the following method for computing factorial.
/** Return the factorial for a specified index */
public static long factorial(int n) {
if (n == 0) // Base case
return 1;
else
return _____________; // Recursive call
}
a. n * (n - 1)
b. n
c. n * factorial(n - 1)
d. factorial(n - 1) * n
10.) All Java applications must have a method __________.
a. public static Main(String[] args)
b. public static Main(String args[])
c. public static void main(String[] args)
d. public void main(String[] args)
e. public static main(String[] args)
/** Return the factorial for a specified index */
public static long factorial(int n) {
if (n == 0) // Base case
return 1;
else
return _____________; // Recursive call
}
a. n * (n - 1)
b. n
c. n * factorial(n - 1)
d. factorial(n - 1) * n
10.) All Java applications must have a method __________.
a. public static Main(String[] args)
b. public static Main(String args[])
c. public static void main(String[] args)
d. public void main(String[] args)
e. public static main(String[] args)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education