Temporary storage location for cutting and pasting
1 answer:
You might be interested in
Answer:
Check the explanation
Explanation:
CODE:-
import java.util.*;
class UserName{
ArrayList<String> possibleNames;
UserName(String firstName, String lastName){
if(this.isValidName(firstName) && this.isValidName(lastName)){
possibleNames = new ArrayList<String>();
for(int i=1;i<firstName.length()+1;i++){
possibleNames.add(lastName+firstName.substring(0,i));
}
}else{
System.out.println("firstName and lastName must contain letters only.");
}
}
public boolean isUsed(String name, String[] arr){
for(int i=0;i<arr.length;i++){
if(name.equals(arr[i]))
return true;
}
return false;
}
public void setAvailableUserNames(String[] usedNames){
String[] names = new String[this.possibleNames.size()];
names = this.possibleNames.toArray(names);
for(int i=0;i<usedNames.length;i++){
if(isUsed(usedNames[i],names)){
int index = this.possibleNames.indexOf(usedNames[i]);
this.possibleNames.remove(index);
names = new String[this.possibleNames.size()];
names = this.possibleNames.toArray(names);
}
}
}
public boolean isValidName(String str){
if(str.length()==0) return false;
for(int i=0;i<str.length();i++){
if(str.charAt(i)<'a'||str.charAt(i)>'z' && (str.charAt(i)<'A' || str.charAt(i)>'Z'))
return false;
}
return true;
}
public static void main(String[] args) {
UserName person1 = new UserName("john","smith");
System.out.println(person1.possibleNames);
String[] used = {"harta","hartm","harty"};
UserName person2 = new UserName("mary","hart");
System.out.println("possibleNames before removing: "+person2.possibleNames);
person2.setAvailableUserNames(used);
System.out.println("possibleNames after removing: "+person2.possibleNames);
}
}
Kindly check the attached image below for the code output.
Answer:
Total number of character comparison = 43
Explanation:
Using the Brute force algorithm
The string of n characters is known as text, and the string of m characters is known as the pattern.
From the given information:
The text (n)=THERE_IS_MORE_TO_LIFE_THAN_INCREASING_ITS_SPEED
The pattern (m) = GANDHI
The total no of characters that we have in the text = 47
The total number of characters in pattern = 6
For a brute force algorithm;
Since; the first character of the pattern does not exist in the text, then the number of trials made can be attempted can be expressed as = n – m + 1
= 47 – 6 + 1
= 47 – 5
= 42
Thus; the algorithm will attempt the trial 42 times.
Now, for loop in the algorithm to run 42 times, the G in the pattern will have to align against the for T in the text, and in the last case, it will be aligned against the last space.
On each attempted trial, the algorithm will make one unsuccessful comparison.
However, at the trial at which the G in the pattern Is aligned with the G in the text, there will be two successful comparisons.
Hence, we can calculate the total number of character comparison as follows:
Total number of character comparison =
Total number of character comparison = ( (( 42 – 1) × 1 ) + ( 1 × 2) )
Total number of character comparison = 41 + 2
Total number of character comparison = 43