Write a function number_of_pennies() that returns the total number of pennies given a number of dollars and (optionally) a number of pennies. Ex: If you have $5.06 then the input is 5 6, and if you have $4.00 then the input is 4. Sample output with inputs: 5 6 4 506 400

Answer:

Step 1 : Start

Step 2 : Set target= 0

Step 3 : Use a While loop

Step 4 : input donation

Step 5 : Sum - - > target += donation

Step 6 :, check loop condition

Step 7 : End

Explanation:

Algorithm is a sequence of written instructions or steps which we want the computer to in other to solve a particular problem :

Counter is set at 0

Total amount is initially set to := 0

Using a while loop ;

While target amout is less than 200 ; user inputs the amout to donate and it is added to target amount. This loop continues until target amount is greater than 200. Then the loop terminates.

Answer:

We can use APC to help with dynamic tracks by :-

Answer:

The statement is as follows:

print("{0:,.1f}".format(number))

Explanation:

Required

Statement to print 1234567.456 as 1,234,567.5

To do this, we make use of the format keyword, and we set the print format in the process.

To round up number to 1 decimal place, we use the following format:

"{0:,.1f}"

To include comma in the thousand place, we simply include a comma sign before the number of decimal place of the output; i.e. before 1

"{0:,.1f}"

So, the print statement is:

print("{0:,.1f}".format(number))

Answer:

1)PERFORMANCE

2)RANGE

Explanation:

A mesh network can be regarded as local network topology whereby infrastructure nodes connect dynamically and directly, with other different nodes ,cooperate with one another so that data can be efficiently route from/to clients. It could be a Wireless mesh network or wired one.

Wireless mesh network, utilize

only one node which is physically wired to a network connection such as DSL internet modem. Then the one wired node will now be responsible for sharing of its internet connection in wireless firm with all other nodes arround the vicinity. Then the nodes will now share the connection in wireless firm to nodes which are closest to them, and with this wireless connection wide range of area can be convered which is one advantage of wireless mesh network, other one is performance, wireless has greater performance than wired one.

Some of the benefits derived from configuring a wireless mesh network is

1)PERFORMANCE

2)RANGE

Based on the information given, the correct options are performance and range.

It should be noted that a mesh network can be regarded as the local network topology whereby infrastructure nodes connect directly, with other different nodes ,cooperate with one another so that data can be efficiently route from/to clients.

The advantage of configuring a wireless mesh network is that it enhances performance and range.

Learn more about network on:

https://brainly.com/question/1167985

Answer:

The function in Python is as follows:

def rotateRight(strng, d):

   lent = len(strng)

   retString = strng[lent - d : ] + strng[0 : lent - d]

   return retString

Explanation:

This defines the function

def rotateRight(strng, d):

This calculates the length of the string

   lent = len(strng)

This calculates the return string

   retString = strng[lent - d : ] + strng[0 : lent - d]

This returns the return string

   return retString

Addition:

The return string is calculated as thus:

This string is split from the index passed to the function to the last element of the string, i.e. from dth to last.

The split string is then concatenated to the beginning of the remaining string

Answer:

Blurring can provide the optical illusion of a fast movement. It is often used in videos to hide sensitive or age-inappropriate information, the protection of identities (hence security) or just to provide decency.

Explanation:

Mostly used during animated videos where unlike (real videos) the blur does not occur naturally, the blur is used to make speed believable. Speed invigorates, and highlights intensity. Blurring still images can help to make more realistics motions of speed. An example where lots of blurring is used as prostproduction effects is in Flash.

Cheers

Answer:

Three cups would be needed.

Explanation:

2 2/3 × 3/4 = 8/2 × 3/4 = 24/8 = 3

Answer:

Following are the response to the given question:  

Explanation:

Build a spring, sink, vertices, and vertices for each car for a household. Every unit in the stream is a human. Attach the source from each vertical of a family with such a capacity line equivalent to the family size; this sets the number of members in each household. Attach every car vertices to the sink with the edge of the car's passenger belt; this assures the correct number of people for every vehicle. Connecting every vertex in your household to any vertex in your vehicle with a capacity 1 border guarantees that one family member joins a single car. The link between both the acceptable allocation of people to vehicles as well as the maximum flow inside the graph seems clear to notice.

Answer:

b i just guessed

Explanation:

Answer:

b. Joyce recruits users to test new software by explaining to them how it will benefit the organization.

Explanation:

Skills can be classified as hard or soft. Hard skills include skills such as technical skills that are acquired through technical knowledge and training.

Soft skills on the other hand are skills exhibited as a result of personality traits, character and behaviours such as time management, leadership, communication and organizational skills.

Some hard skills include;

i. Ability to design banners and posters

ii. Proficiency in using programming languages such as Java to build software applications

iii. Evaluating the result of a test or research.

Some soft skills include;

i. Making public speeches that captivate the audience.

ii. Ability to recruit and test capabilities in others.

iii. Leading a team

So, Joyce recruiting users to test new software by explaining to them how it will benefit the organization is a form of soft skill since it consists, at minimum, of leadership and communication skills

Answer:

Below is the required JAVA Code:

Explanation:

public static int largestDigit(int n) {

   if (n < 0) {

       return largestDigit(-1 * n);

   } else if (n == 0) {

       return 0;

   } else {

       int digit = n % 10;

       int maxDigit = largestDigit(n / 10);

       if (digit > maxDigit)

           maxDigit = digit;

       return maxDigit;

   }

}

\color{red}Method\;tested\;in\;a\;complete\;java\;program\;if\;you\;are\;interested.

public class LargestDigitRecursive {

   public static int largestDigit(int n) {

       if (n < 0) {

           return largestDigit(-1 * n);

       } else if (n == 0) {

           return 0;

       } else {

           int digit = n % 10;

           int maxDigit = largestDigit(n / 10);

           if (digit > maxDigit)

               maxDigit = digit;

           return maxDigit;

       }

   }

   public static void main(String[] args) {

       System.out.println(largestDigit(14263203));

       System.out.println(largestDigit(845));

       System.out.println(largestDigit(52649));

       System.out.println(largestDigit(3));

       System.out.println(largestDigit(0));

       System.out.println(largestDigit(-573026));

       System.out.println(largestDigit(-2));

   }

}

OUTPUT:

6

8

9

3

0

7

2

Answer:

The function is as follows:

def addingAllTheWeirdStuff(array1,array2):

   sumOdd = 0

   for i in array2:

       if i % 2 == 1:

           sumOdd+=i

   for i in array1:

       if i < 10:

           sumOdd+=i

   print("Sum:",sumOdd)

   sumEven = 0

   for i in array1:

       if i % 2 == 0:

           sumEven+=i

   for i in array2:

       if i > 10:

           sumEven+=i

   print("Sum:",sumEven)

Explanation:

This declares the function

def addingAllTheWeirdStuff(array1,array2):

This initializes the sum of odd numbers in array 2 to 0

   sumOdd = 0

This iterates through array 2

   for i in array2:

This adds up all odd numbers in it

       if i % 2 == 1:

           sumOdd+=i

This iterates through array 1

   for i in array1:

This adds up all elements less than 10 to sumOdd

       if i < 10:

           sumOdd+=i

This prints the calculated sum

   print("Sum:",sumOdd)

This initializes the sum of even numbers in array 1 to 0

   sumEven = 0

This iterates through array 1

   for i in array1:

This adds up all even numbers in it

       if i % 2 == 0:

           sumEven+=i

This iterates through array 2

   for i in array2:

This adds up all elements greater than 10 to sumEven

       if i > 10:

           sumEven+=i

This prints the calculated sum

   print("Sum:",sumEven)

Answer:

//In java

for (int i = 0; i <= 100; i++)

{

if ( i % 2 == 0 )

{

System.out.println( i + " ");

}

}

Answer:

chosen ciphertext

Explanation:

Chosen ciphertext attack is a scenario in which the attacker has the ability to choose ciphertexts C i and to view their corresponding decryptions – plaintexts P i . It is essentially the same scenario as a chosen plaintext attack but applied to a decryption function, instead of the encryption function.

Cyber attack usually associated with obtaining decryption keys that do not run in fixed time is called the chosen ciphertext attack.

Hence, chosen ciphertext attempts the use of modular exponentiation.

Learn more : https://brainly.com/question/14826269

Answer:

b. False

Explanation:

False, unchecked exceptions do not cause compilation errors and do not require try/catch blocks or throws statements. However, although they are not required it is good programming to include them in order to handle any exceptions that may arise. If you do not include a proper way to handle such an exception the program will still run but may run into an exception during runtime. If this occurs then the entire program will crash because it does not know how to handle the exception since you did not provide instructions for such a scenario.

Answer:

Confidentiality

Explanation:

Cyber security can be defined as a preventive practice of protecting computers, software programs, electronic devices, networks, servers and data from potential theft, attack, damage, or unauthorized access by using a body of technology, frameworks, processes and network engineers.

In Cybersecurity, there are certain security standards, frameworks, antivirus utility, and best practices that must be adopted to ensure there's a formidable wall to prevent data corruption by malwares or viruses, protect data and any unauthorized access or usage of the system network.

In this scenario, a hacker gains access to a web server and reads the credit card numbers stored on that server. Thus, the security principle which is violated is confidentiality.

Confidentiality refers to the act of sharing an information that is expected to be kept secret, especially between the parties involved. Thus, a confidential information is a secret information that mustn't be shared with the general public.

This ultimately implies that, confidentiality requires that access to collected data be limited only to authorized staffs or persons.

Answer:

Yup

Explanation:

Answer:

Although this word was made up in order to be a contender for the longest word in English, it can be broken down into smaller chunks in order to understand it.

Anti- means that you are against something; monopoly means the exclusive control over something; geographic is related to geography; and the remaining part has to do with nationalism.

So this word means something like 'a nationalistic feeling of being against geographic monopoly,' but you can see that it doesn't have much sense.

(answer copied from  Kalahira just to save time)

Answer:

The function is as follows:

def get_win_percentage(self):

       return self.team_wins / (self.team_wins + self.team_losses)

Explanation:

This defines the function

def get_win_percentage(self):

This calculates the win percentage and returns it to main

       return self.team_wins / (self.team_wins + self.team_losses)

See attachment for complete (and modified) program.

Answer: def get_win_percentage(self):

Explanation: got it right on edgen

Answer:

computer

Explanation:

is an ICT device that help and makes things or work easy

Answer:

The algorithm is as follows:

1. Input sentence

2. Input character

3. Length = len(sentence)

4. count = 0

5. For i = 0 to Length-1

 5.1 If sentence[i] == character

    5.1.1 count++

6. Print count

7. Stop

The program in C++ is as follows:

#include <iostream>

#include <string.h>

using namespace std;

int main(){

char str[100];   char chr;

cin.getline(str, 100);

cin>>chr;

int count = 0;

for (int i=0;i<strlen(str);i++){

 if (str[i] == chr){

  count++;} }

cout << count;

return 0;}

Explanation:

I will provide explanation for the c++ program. The explanation can also be extended to the algorithm

This declares the string and the character

char str[100];   char chr;

This gets input for the string variable

cin.getline(str, 100);

This gets input for the character variable

cin>>chr;

This initializes count to 0

int count = 0;

This iterates through the characters of the string

for (int i=0;i<strlen(str);i++){

If the current character equals the search character, count is incremented by 1

 if (str[i] == chr){  count++;} }

This prints the count

cout << count;

Answer:

Test if L(M1-2) is empty.

Construct FA M2-1 from M1 and M2 which recognizes the language L(>M2) - L(>M1).

COMMENT: note we use the algorithm that is instrumental in proving that regular languages are closed with respect to the set difference operator.

Test if L(M2-1) is empty.

Answer yes if and only if both answers were yes.

Explanation:

An algorithm must be guaranteed to halt after a finite number of steps.

Each step of the algorithm must be well specified (deterministic rather than non-deterministic).

Three basic problems:

Given an FA M and an input x, does M accept x?

Is x in L(M)

Given an FA M, is there a string that it accepts?

Is L(M) the empty set?

Given an FA M, is L(M) finite?

Algorithm for determining if M accepts x.

Simply execute M on x.

Output yes if we end up at an accepting state.

This algorithm clearly halts after a finite number of steps, and it is well specified.

This algorithm is also clearly correct.

Testing if L(M) is empty.

Incorrect "Algorithm"

Simulate M on all strings x.

Output yes if and only if all strings are rejected.

The "algorithm" is well specified, and it is also clearly correct.

However, this is not an algorithm because there are an infinite number of strings to simulate M on, and thus it is not guaranteed to halt in a finite amount of time.

COMMENT: Note we use the algorithm for the first problem as a subroutine; you must think in this fashion to solve the problems we will ask.

Correct Algorithm

Simulate M on all strings of length between 0 and n-1 where M has n states.

Output no if and only if all strings are rejected.

Otherwise output yes.

This algorithm clearly halts after a finite number of steps, and it is well specified.

The correctness of the algorithm follows from the fact that if M accepts any strings, it must accept one of length at most n-1.

Suppose this is not true; that is, L(M) is not empty but the shortest string accepted by M has a length of at least n.

Let x be the shortest string accepted by M where |x| > n-1.

Using the Pumping Lemma, we know that there must be a "loop" in x which can be pumped 0 times to create a shorter string in L.

This is a contradiction and the result follows.

COMMENT: There are more efficient algorithms, but we won't get into that.

Testing if L(M) is finite

Incorrect "Algorithm"

Simulate M on all strings x.

Output yes if and only if there are a finite number of yes answers.

This "algorithm" is well specified and correct.

However, this is not an algorithm because there are an infinite number of strings to simulate M on, and thus it is not guaranteed to halt in a finite amount of time.

COMMENT: Note we again use the algorithm for the first problem as a subroutine.

Correct Algorithm

Simulate M on all strings of length between n and 2n-1 where M has n states.

Output yes if and only if no string is accepted.

Otherwise output no.

This algorithm clearly halts after a finite number of steps, and it is well specified.

The correctness of the algorithm follows from the fact that if M accepts an infinite number of strings, it must accept one of length between n and 2n-1.

This builds on the idea that if M accepts an infinite number of strings, there must be a "loop" that can be pumped.

This loop must have length at most n.

When we pump it 0 times, we have a string of length less than n.

When we pump it once, we increase the length of the string by at most n so we cannot exceed 2n-1. The problem is we might not exceed n-1 yet.

The key is we can keep pumping it and at some point, its length must exceed n-1, and in the step it does, it cannot jump past 2n-1 since the size of the loop is at most n.

 This proof is not totally correct, but it captures the key idea.

COMMENT: There again are more efficient algorithms, but we won't get into that.

   Other problems we can solve using these basic algorithms (and other algorithms we've seen earlier this chapter) as subroutines.

       COMMENT: many of these algorithms depend on your understanding of basic set operations such as set complement, set difference, set union, etc.

Given a regular expression r, is Lr finite?

Convert r to an equivalent FA M.

COMMENT: note we use the two algorithms for converting a regular expression to an NFA and then an NFA to an FA.

Test if L(M) is finite.

Output the answer to the above test.

Given two FAs M1 and M2, is L(M1) = L(M2)?

Construct FA M1-2 from M1 and M2 which recognizes the language L(>M1) - L(>M2).

COMMENT: note we use the algorithm that is instrumental in proving that regular languages are closed with respect to the set difference operator.

Test if L(M1-2) is empty.

Construct FA M2-1 from M1 and M2 which recognizes the language L(>M2) - L(>M1).

COMMENT: note we use the algorithm that is instrumental in proving that regular languages are closed with respect to the set difference operator.

Test if L(M2-1) is empty.

Answer yes if and only if both answers were yes.

Answer:

here you go. wish you a great day tomorrow.

and in fact,computer science is somewhat the right category

Abstract art may be - and may seem like - almost anything. This because, unlike the painter or artist who can consider how best they can convey their mind using colour or sculptural materials and techniques. The conceptual artist uses whatever materials and whatever form is most suited to putting their mind across - that would be anything from the presentation to a written statement. Although there is no one kind or structure employed by abstract artists, from the late 1960s specific tendencies emerged.

Answer:

Explanation:

Pink: Down 5 then left 2.

Yellow: Left 3 and down 2.

Green: Right 7, down 4 and left 1.

Purple: Up 6 and left 9.

Red: Left 7, down 5 and left 1.

You can do the last one, blue :)

Answer:

Explanation:

u=up, d=down, r=right, l=left

yellow: l3d2

pink: d5l2

green: r7d4l1

purple: u6l9

red: l7d5l1

blue: r2u7l5

Answer: hi mom

Explanation: got it right on edgen