True is the right answer for ur question
The asterisk key or * key which is on above the number 8 on the computer keyboard is used to represent and perform the multiplication operations.
Star key is represented with (*) symbol and used to perform the multiplication operations in a computer. The functions of this can be changed with different software.
The * key is generally known as the asterisk. It is found above the number 8 on a computer keyboard, and pressing the number 8 with shift is used to create this key.
Hence, the asterisk key or * key which is on above the number 8 on computer keyboard is used to represent and perform the multiplication operations.
Learn more about the keyboard key here:
#SPJ1
Answer:
Explanation:
it is B: multiplication
I am 100% sure it is correct
Answer:
numbers = (0, 9, 8, 7, 5, 2, 4, 5, 3)
numList = list(numbers)
print(numList)
Explanation:
Answer:
A Trojan
Explanation:
Emma has downloaded a Trojan. A Trojan, also referred to as Trojan horse is a type of malware that may look like it is legitimate, but once installed in your computer, it can cause a great havoc by taking control of your computer. It is usually designed to cause damage to a system, or to steal information, or inflict harm to your network or computer.
Based on the scenario described, it is most likely that Emma has downloaded a malware onto her computer called as Trojan. Therefore, the correct option is A.
A Trojan is a type of malware that poses as a trustworthy program or file in order to trick people into downloading and installing it. Once installed, it can perform a number of nefarious tasks including stealing confidential data such as passwords and credit card details. Trojan horse is another name for Trojan. Trojans are so called because they hide their true nature like the famous Trojan Horse.
Therefore, the correct option is A.
Learn more about Trojan, here:
#SPJ6
Algorithm 1
This algorithm creates a string from the message in which every vowel (a, e, i, o, and u) is removed unless the vowel is at the very start of a word (i.e., it is preceded by a space or is the first letter of the message). Every repeated non-vowel character is also removed from the new string (i.e., if a character appears several times in a row it should only appear once at that location). So for example the string "I will arrive in Mississippi really soon" becomes "i wl arv in mssp rly sn".
After applying this algorithm, your program should output the shortened message, the number of vowels removed, the number of repeated non-vowel characters removed, and how much shorter the shortened message is than the original message. The exact format in which the program should print this information is shown in the sample runs.
Algorithm 2
This algorithm creates a string by taking each unique character in the message in the order they first appear and putting that letter and the number of times it appears in the original message into the shortened string. Your algorithm should ignore any spaces in the message, and any characters which it has already put into the shortened string. For example, the string "I will arrive in Mississippi really soon" becomes "8i1w4l2a3r1v2e2n1m5s2p1y2o".
After applying this algorithm, your program should output the shortened message, the number of different characters appearing, and how much shorter the shortened message is than the original message. The exact format in which the program should print this information is shown in the sample runs.
Sample Run 1
Type the message to be shortened
This message could be a little shorter
Algorithm 1
Vowels removed: 11
Repeats removed: 2
Algorithm 1 message: ths msg cld b a ltl shrtr
Algorithm 1 characters saved: 13
Algorithm 2
Unique characters found: 15
Algorithm 2 message: 4t2h2i4s1m5e2a1g1c2o1u3l1d1b2r
Algorithm 2 characters saved: 8
Sample Run 2
Type the message to be shortened
I will arrive in Mississippi really soon
Algorithm 1
Vowels removed: 11
Repeats removed: 6
Algorithm 1 message: i wl arv in mssp rly sn
Algorithm 1 characters saved: 17
Algorithm 2
Unique characters found: 13
Algorithm 2 message: 8i1w4l2a3r1v2e2n1m5s2p1y2o
Algorithm 2 characters saved: 14
import java.util.Scanner;
public class JavaApplication54 {
public static int appearance(String word, char letter){
int count = 0;
for (int i = 0; i < word.length(); i++){
if (word.charAt(i) == letter){
count++;
}
}
return count;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println("Type the message to be shortened");
String message = scan.nextLine();
message = message.toLowerCase();
int volCount = 0, repCount = 0, num = 0;
char prevC = ' ';
String vowels = "aeiou";
String newMessage = "";
for (int i = 0; i < message.length(); i++){
char c = message.charAt(i);
if (vowels.indexOf(c) != -1 && prevC == ' '){
newMessage += c;
}
else if (vowels.indexOf(c) == -1 && prevC != c){
newMessage += c;
}
else if (vowels.indexOf(c) != -1){
volCount ++;
}
else{
repCount++;
}
prevC = c;
}
System.out.println("Algorithm 1");
System.out.println("Vowels removed: "+volCount);
System.out.println("Repeats removed: "+repCount);
System.out.println("Algorithm 1 message: "+newMessage);
System.out.println("Algorithm 1 characters saved: "+(message.length() - newMessage.length()));
String uniqueMessage = "";
for (int i = 0; i<message.length(); i++){
char w = message.charAt(i);
if (uniqueMessage.indexOf(w)== -1 && w!=' '){
uniqueMessage += appearance(message,w)+""+w;
num++;
}
}
System.out.println("Algorithm 2");
System.out.println("Unique characters found: "+num);
System.out.println("Algorithm 2 message: "+uniqueMessage);
System.out.println("Algorithm 2 characters saved: "+(message.length() - uniqueMessage.length()));
}
}
I hope this helps!