If you forget your privacy password what will you do if the ask this question what is the name of one of your teacher?

Implement a recursive method named power that takes 2 integer parameters named base and expo. The method will return the base ra

nika2105 [10]

Answer:

def power(base, expo):

if expo == 0:

return 1

else:

return base * power(base, expo-1)

Explanation:

*The code is in Python.

Create a method called power that takes base and expo as parameters

Check if the expo is equal to 0. If it is return 1 (This is our base case for the method, where it stops. This way our method will call itself "expo" times). If expo is not 0, return base * power(base, expo-1). (Call the method itself, decrease the expo by 1 in each call and multiply the base)

3 0

3 years ago

Please answer fast screenshot included - thanks in advance

aleksley [76]

Answer:

Webpage Layouts where finally designed using html code

Explanation:

4 0

4 years ago

Create a recursive method, a method that calls itself, that returns the number of vowels that appear in any string given. Keep i

kvv77 [185]

<h2>Answer:</h2>

//Define the method as noOfVowels

//Let it receive the string to be checked as argument

public static int noOfVowels(String string){

//Check the length of the string

//If it is less than 1, then it is an empty string

//Hence return 0

if(string.length() < 1){

return 0;

}

//Else,

else{

//get the character at the first position in the string

//and convert it to a lower case

char x = string.toLowerCase().charAt(0);

//Check if the character is a vowel

if (x == 'a' || x == 'e' || x == 'i' || x == 'o' || x == 'u'){

//if it is a vowel, add 1 to a recall of the method.

//But this time, call the method with

//the string excluding the first character.

//i.e the substring of the string starting at index 1 rather than 0

return 1 + noOfVowels(string.substring(1));

}

else {

//If it is not a vowel, just recall the method with

//the string excluding the first character

//i.e the substring of the string starting at index 1 rather than 0

return noOfVowels(string.substring(1));

}

<h2>Explanation:</h2><h2></h2>

The code has been written in Java and it contains comments explaining every part of the code. Please go through the comments carefully.

The actual lines of code have been written in bold face to distinguish them from comments.

The code is re-written without comments as follows;

public static int noOfVowels(String string){

if(string.length() < 1){

return 0;

}

else{

char x = string.toLowerCase().charAt(0);

if (x == 'a' || x == 'e' || x == 'i' || x == 'o' || x == 'u'){

return 1 + noOfVowels(string.substring(1));

}

else{

return noOfVowels(string.substring(1));

}

3 0

3 years ago

Assume the variable myWord references a string. Write a statement that uses a slicing

givi [52]

Answer:

"myWord[-5:]"

Explanation:

So whenever you slice a string, the syntax in python is expressed as:

string[a:b:c]

where a=start index (this is included in the sliced string)

b = end index (this is excluded from the sliced string)

c = increment

If any of these are included, they are set to default values, where a=0, b=len(string), and c=1.

The increment isn't necessary here, and it's just so you know the syntax a bit more

Anyways, I'm assuming when the question asks to display "the last 5 characters in the string" it means in order? e.g "abcdefghijk" -> "ghijk" and not "abcdefghijk" -> "kjihg"

The last piece of information to know is what a negative index represents.

For example if I have the piece of code

"

string = "hello world"

print(string[-1])

"

This will output "d", and the negative 1 represents the last letter. If you did -2, it would output the 2nd to last letter and so on.

So to print the last 5 characters, we simply use the -5 as the starting index.

"

string = "hello world"

print(string[-5:])

"

This will print "world" or in other words, the last 5 letters. The reason for this is because the -5 in the first spot means the starting index is the 5th to last letter, and when you have the : after the -5, this is the way of telling python you're slicing the string, and not indexing 1 character. You don't need to include another value after that, because it will default to the last index of the string, or more specifically the last index + 1, since the last index is still included.

So the last thing to know, is that if the string isn't greater than 5 characters, it just prints the entire string, and no errors are raised. You can test this out your self as well. So whenever you have a string that's less than 5 characters the entire string is outputted.

3 0

2 years ago

Consider a set of mobile computing clients in a certain town who each

poizon [28]

Answer: answer given in the explanation

Explanation:

We have n clients and k-base stations, say each client has to be connected to a base station that is located at a distance say 'r'. now the base stations doesn't have allocation for more than L clients.

To begin, let us produce a network which consists of edges and vertex

Network (N) = (V,E)

where V = [S, cl-l, - - - - cl-n, bs-l - - - - - - bs-k, t]

given that cl-l, - - - - - cl-n represents nodes for the clients

also we have that bs-l, - - - - - bs-k represents the nodes for base station

Also

E = [ (s, cl-i), (cl-i,bs-j), (bs-j,t)]

(s, cl-i) = have capacity for all cl-i (clients)

(cl-i,bs-j) = have capacity for all cl-i clients & bs-j (stations)

⇒ using Fond Fulkorson algorithm we find the max flow in N

⇒ connecting cl-i clients to bs-j stations

like (cl-i, bs-j) = 1

if f(cl-i, bs-j) = 0

⇒ say any connection were to produce a valid flow, then

if cl-i (clients) connected f(s,cl-i) = 1 (o otherwise)

if cl-i (clients) connected to bs-j(stations) f(cl-i,bs-j) = 1 (o otherwise)

f(bs-j,t) = no of clients (cl-i) connected to bs-j

⇒ on each node, the max flow value (f) is longer than the no of clients that can be connected.

⇒ create the connection between the client and base station i.e. cl-l to base bs-j iff f(cl-i, bs-j) = 1

⇒ when considering the capacity, we see that any client cannot directly connect to the base stations, and also the base stations cannot handle more than L clients, that is because the load allocated to the base statsion is L.

from this, we say f is the max no of clients (cl-i) that can be connected if we find the max flow, we can thus connect the client to the base stations easily.

cheers i hope this helps

5 0

3 years ago

If you forget your privacy password what will you do if the ask this question what is the name of one of your teacher?​

If you forget your privacy password what will you do if the ask this question what is the name of one of your teacher?