int maxIndex = 0; for (int k = 1; k <= words.length; k++) { if (words [k].compareTo (words [maxIndex]) > 0) { } maxIndex = = k;

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
icon
Related questions
Question
B)
C)
int maxIndex = 0;
for (int k = 1; k <= words.length; k++)
{
if (words [k].compareTo (words [maxIndex]) > 0)
{
}
}
return words [maxIndex];
int maxIndex = 0;
for (int k = 1; k< words.length; k++)
{
if (words [k].compareTo (words [maxIndex]) > 0)
{
}
maxIndex = k;
}
return maxIndex;
D) String maxWord = words [0];
}
maxIndex = k;
for (int k = 1; k < words.length; k++)
{
if (words [k].compareTo (maxWord) > 0)
{
}
maxWord k;
}
return maxWord;
E) String maxWord = words [0];
for (int k = 1; k< words.length; k++)
{
if (words [k].compareTo(maxWord) > 0)
{
maxWord words [k];
}
return maxword;
Transcribed Image Text:B) C) int maxIndex = 0; for (int k = 1; k <= words.length; k++) { if (words [k].compareTo (words [maxIndex]) > 0) { } } return words [maxIndex]; int maxIndex = 0; for (int k = 1; k< words.length; k++) { if (words [k].compareTo (words [maxIndex]) > 0) { } maxIndex = k; } return maxIndex; D) String maxWord = words [0]; } maxIndex = k; for (int k = 1; k < words.length; k++) { if (words [k].compareTo (maxWord) > 0) { } maxWord k; } return maxWord; E) String maxWord = words [0]; for (int k = 1; k< words.length; k++) { if (words [k].compareTo(maxWord) > 0) { maxWord words [k]; } return maxword;
d
Consider the following instance variable and incomplete method. The method is intended to return
a string from the array words that would be last alphabetically.
private String [] words;
public String findLastWord ()
{
}
/* missing implementation */
Assume that words has been initialized with one or more strings containing only lowercase letters.
Which of the following code segments can be used to replace / * missing implementation * / so
that findLastword will work as intended?
A)
int maxIndex = 0;
for (int k = 0; k< words.length; k++)
{
if (words [k].compareTo (max Index) > 0)
{
}
maxIndex k;
}
return words [maxIndex];
Transcribed Image Text:d Consider the following instance variable and incomplete method. The method is intended to return a string from the array words that would be last alphabetically. private String [] words; public String findLastWord () { } /* missing implementation */ Assume that words has been initialized with one or more strings containing only lowercase letters. Which of the following code segments can be used to replace / * missing implementation * / so that findLastword will work as intended? A) int maxIndex = 0; for (int k = 0; k< words.length; k++) { if (words [k].compareTo (max Index) > 0) { } maxIndex k; } return words [maxIndex];
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Methods of StringBuilder class
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education