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; dConsider the following instance variable and incomplete method. The method is intended to returna 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 * / sothat 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];

Answered: int maxIndex = 0; for (int k = 1; 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

See similar textbooks

Related questions

Q: public class Test { public static void main(String[] args) { int arr[] = {1,2,3,4,5}; int count = 0;…

A: The program is to double the even elements in an array.

Q: void showValues(int a[4]), int cols = 5) { for (int roW = 1; row <= 4; row++) for (int col = 1; col…

A: Task :- Identify the errors in given piece of code.

Q: Consider the following code fragment: static int f(int[ ] arr, int x ) { int start = 0; int end -…

A: EXPLANATION: The Big O notation is a mathematical notation that represents a function's limiting…

Q: Counting the number of 1 bits in a bit string s can be accomplished in Java by first initializing an…

A: The answer is given below.

Q: bool validPassword=true; cin >> passPhrase; } if (passPhrase.length() 4) {…

A: The C++ code is given below

Q: public class GameList { Game head; public GameList() { head = null; } public void addFront(String n,…

A: To add a tail pointer to the 'GameList' class, you can modify the class as follows:

Q: 2. Modify the method in Question 1 so that the item with the highest key is not only returned by the…

A: I think the given code is correct, the problem with the code is that it is not displaying the output…

Q: Code: public class RURottenTomatoes { public static void main (String[] args) { int r =…

A: Actually your code ia not wrong but some places their are some implementations problems I have fixed…

Q: ew HMap<

A: Design a 4-bit ALU that implements the following set ofoperations with only the following components…

Q: teration

A: Dear Student, Both the answers are correct the reason for the same along with output is given below…

Q: correct the syntax errors using System; class GFG { void KMPSearch(string pat, string txt)…

A: Correcting the C++ code for pattern searching

Q: void getInput(){ for(int i =0; i < studentName.length; i++){ System.out.print("Student name: ");…

A: Refer to step 2 for the answer.

Q: 1. Trace each of the above algorithm using specific values for a and b. 2. Compare both algorithms.

A: 1. Trace each of the above algorithms using specific values of a and b. Take a=20, b=5. GCD of…

Q: Question 2. package sortsearchassigncodeex1; import java.util.Scanner; import java.io.*; // //…

A: Function fillArray() takes Scanner class object and an array as function parameter. The function…

Q: The following method is a Selection Sort method. Within the method, there is an error on one line.…

A: if at the last , minindex stored is not equal to i then only swapping should occur.

Q: In C++ whats the answer from below ? int size = 10; for ( int i = -1; i < size ; i++) { arr[size -…

A: Given range of i is from -1 to 9. Therefore, The array elements and their index according to given…

Q: t funcB(int); t funcA(int n) { if (n 4) { return n funcA(n - 5); }else { return n- funcB(n - 1); t…

A: Here in this question we ha have given a code segment and we have asked to find the output of this…

Concept explainers

Methods of StringBuilder class

The StringBuilder class can be used to create mutable strings. The methods defined in the StringBuilder class are widely used to manipulate and concatenate strings. It is a non-synchronized class which has public methods that can be accessed by multiple threads. It is not thread-safe.

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;

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

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!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions

For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, 1 #include 2 3 int main(void) { const int SIZE_LIST = 4; int keysList[SIZE_LIST]; int itemsList[SIZE_LIST]; int i; 4 6 7 8 scanf("%d", &keysList[0]); scanf ("%d", &keysList[1]); scanf("%d", &keysList[2]); scanf("%d", &keysList[3]); 10 11 12 13 scanf ("%d", &itemsList[0]); scanf ("%d", &itemsList[1]); scanf("%d", &itemsList[2]); scanf ("%d", &itemsList[3]); 14 15 16 17 18 19 /* Your code goes here */ 20 21 printf("\n"); 22 23 return 0; 24 }
Practice / Frequency of Characters Write a method that returns the frequency of each characters of a given String parameter. If the given String is null, then return null If the given String is empty return an empty map Example input: output: empty map explanation: input is empty Example input: null output: null explanation: input is null. Since problem output is focused on the frequency we can comfortably use Map data structure. Because we can use characters as key and the occurrences of them as value. Example input: responsible output: {r=1, e=2, s=2, p=1, o=1, n=1, i=1, b=1, l=1} explanation: characters are keys and oc values ences are
#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode { struct treeNode* leftPtr; int data; struct treeNode* rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode* TreeNodePtr; void insertNode(TreeNodePtr* treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr);} void insertNode(TreeNodePtr* treePtr, int value) { if (*treePtr == NULL) { *treePtr = malloc(sizeof(TreeNode)); if…
#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode { struct treeNode *leftPtr; int data; struct treeNode *rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode *TreeNodePtr; void insertNode(TreeNodePtr *treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr);} void insertNode(TreeNodePtr *treePtr, int value) { if (*treePtr == NULL) { *treePtr = malloc(sizeof(TreeNode)); if (*treePtr != NULL) { (*treePtr)->data = value;…
public class Program7 { publicstaticvoidmain(String[]args){ int[]numbers=newint[100]; String[]names={"Maria","Aris","Galin","Galena"}; double[]balances=newdouble[]{2,56,12.57,36.57,57.89}; //length System.out.println(numbers.length); System.out.println(names.length); System.out.println(balances.length); //modifying names[3]="Celine Dion"; System.out.println("__________________________"); //looping for(inti=0;i<names.length;i++){ System.out.println(names[i]); } System.out.println("__________________________"); for(Stringname:names){ System.out.println(name); } //modifying array System.out.println("__________________________"); for(inti=0;i<names.length;i++){ names[i]=names[i]+" Annan"; System.out.println(names[i]); } System.out.println("__________________________"); doubletotal=0.0; for(inti=0;i<balances.length;i++){ total+=balances[i]; } System.out.println("Total Balance: "+ total); } } //calculate the average of the total balance