All categories

3 years ago

Which line of code will create an instance of the pet class?

Computers and Technology

2 answers:

Sunny_sXe [5.5K]3 years ago

8 0

Answer:

myPetA = pet(self, 'dog', 'Spot')

Explanation:

I mite be wrong

saul85 [17]3 years ago

8 0

Answer:

myPetA=pet('dog','Spot') or C

Explanation:

credit to who deserves it, the guy in the other answers comment section confimed my thought

You might be interested in

Design the program in the following way:

natali 33 [55]

Answer:

d = {}

while True:

name = input("Enter the name of the boat (Press Enter or q to stop): ")

if name == "" or name == "q":

break

time = int(input("Enter the time (in seconds): "))

d[name] = time

winner_name = min(d, key=d.get)

winner_time = min(d.values())

average_time = sum(d.values()) / len(d.values())

slowest_boat = max(d, key=d.get)

slowest_time = max(d.values())

print(f"Winner name: {winner_name} and its time: {winner_time}")

print(f"Average time: {average_time}")

print(f"Slowest boat: {slowest_boat} and its time: {slowest_time}")

Explanation:

*The code is in Python.

Create an empty map(dictionary) to hold the values

Create a while loop. Inside the loop:

Ask the user to enter the name of the boat. Check if the user presses Enter or q, using if and break

Ask the user to enter the time

Insert these values as key-value pair to the map

When the loop is done:

Find the winner_name, the min() function finds the minimum value in a list. In this case, the key=d.get creates a list of the values in the map. The min(d, key=d.get) returns the key of the minimum value

Find the winner_time, min(d.values()) returns the minimum time in our map

Find the average time, the sum() function, returns the sum of the values in a list. In this case, sums all the values in the map. The len() function finds the count of the values. If we divide the sum of times entered by the count of the times entered, we get the average time

Find the slowest_time, the max() function returns the max of the value in a list. In this case, the maximum value is the slowest time

Print the results

5 0

3 years ago

Assume that the classes listed in the Java Quick Reference have been imported where appropriate. Unless otherwise noted in the q

mash [69]

Answer:

See explaination

Explanation:

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);

}

4 0

3 years ago

Explain how any simple substitution cipher that involves a permutation of the alphabet can be thought of as a special case of th

Kaylis [27]

A simple substitution cipher takes each vector ( $e_i$ ) and assigns it to the vectors [ $e_{\pi (i)}$ ] in a one-to-one function so as to make them equivalent.

<h3>What is the Hill cipher?</h3>

In 1929, the Hill cipher was invented by Lester S. Hill and it can be described as a poly-graphic substitution cipher that is typically based on linear algebra and it avails a cryptographer an ability to simultaneously operate on more than three (3) symbols.

In Cryptography, the simple substitution cipher is usually viewed as a function which takes each plaintext letter (alphabet) and assigns it to a ciphertext letter. Thus, it takes each vector ( $e_i$ ) and assigns it to the vectors [ $e_{\pi (i)}$ ] in a one-to-one function so as to make them equivalent.

Read more on Hill cipher here: brainly.com/question/13155546

#SPJ1

6 0

2 years ago

Someone help me please

MA_775_DIABLO [31]

Answer:

I think it is the last 2 but i am not 100% sure.

Explanation:

3 0

3 years ago

Write a JAVA program containing a method called hasEight(), which takes an int as input and returns true if the number contains

skelet666 [1.2K]

Here's my code for that, consider it under the WTFPL (http://www.wtfpl.net/). Here is a pastebin of the code, as to avoid text formatting. (Link: https://pastebin.com/S3BDGxqm Raw: https://pastebin.com/raw/S3BDGxqm)

package javaapplication6;

import java.util.Scanner;

public class JavaApplication6 {

public static void main(String[] args) {

Scanner myScanner = new Scanner(System.in);

boolean a;

int s;

System.out.println("Enter an int");

s = myScanner.nextInt();

a = hasEight(s);

System.out.println(a);

}

private static boolean hasEight(int s)

{

String str = String.valueOf(s);

return str.contains("8");

}

7 0

3 years ago