int maxIndex = 0; for (int k = 1; k <= words.length; k++) { if (words [k].compareTo (words [maxIndex]) > 0) { } maxIndex = = k;
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
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;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F5c1cc754-64b3-4c8b-8d95-a77ce12f8dce%2F77ec0e17-c649-4094-8a8b-4a774c447f66%2Fknqxf64_processed.png&w=3840&q=75)
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];](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F5c1cc754-64b3-4c8b-8d95-a77ce12f8dce%2F77ec0e17-c649-4094-8a8b-4a774c447f66%2F7df8td9_processed.png&w=3840&q=75)
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
![](/static/compass_v2/shared-icons/check-mark.png)
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
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education