All categories

3 years ago

Pls help!!!!! I need these questions

Computers and Technology

2 answers:

g100num [7]3 years ago

8 0

Answer:

online identity for the first one and none of the above for the second one:)

lidiya [134]3 years ago

7 0

Online identity for the first and none of the above fire the second. Hope this helps :)

You might be interested in

Have fire have ....<br><br>babi from babi098

Genrish500 [490]

Answer:

yessss I tooo have a fire at my home

lolololololololololo

ok have a great day what is your name ?

4 0

3 years ago

you need to configure a wireless network using wpa2-enterprise. which of the following components should be part of your design?

Iteru [2.4K]

Answer: AES encryption

802.1x

Explanation:

4 0

2 years ago

Consider the language defined by the following regular expression. (x*y | zy*)* Does zyyxz belong to the language? Yes, because

Mrrafil [7]

Answer:

Consider the language defined by the following regular expression. (x*y | zy*)* 1. Does zyyxz belong to the language?

O. No, because zyy does not belong to x*y nor zy*

2. Does zyyzy belong to the language?

Yes, because both zy and zyy belong to zy*.

Explanation:

4 0

3 years ago

in java how do i Write a method named isEven that accepts an int argument. The method should return true if the argument is even

Veseljchak [2.6K]

<h2>Answer:</h2><h2>============================================</h2>

//Class header definition

public class TestEven {

//Method main to test the method isEven

public static void main(String args[ ] ) {

//Test the method isEven using numbers 5 and 6 as arguments

System.out.println(isEven(5));

System.out.println(isEven(6));

}

//Method isEven

//Method has a return type of boolean since it returns true or false.

//Method has an int parameter

public static boolean isEven(int number){

//A number is even if its modulus with 2 gives zero

if (number % 2 == 0){

return true;

}

//Otherwise, the number is odd

return false;

}

====================================================

<h2>Sample Output:</h2>

=========================================================

false

true

==========================================================

<h2>Explanation:</h2>

The above code has been written in Java. It contains comments explaining every part of the code. Please go through the comments in the code.

A sample output has also been provided. You can save the code as TestEven.java and run it on your machine.

3 0

3 years ago

Recursively computing the sum of the first n positive odd integers, cont. About (a) Use induction to prove that your algorithm t

julia-pushkina [17]

The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.

int recursiveOddSum(int n) {

if(2n-1==1) return 1;

return (2n-1) + recursiveOddSum(n-1);

}

To prove the correctness of this algorithm by induction, we start from the base case as usual:

$f(1)=1$

by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).

Now we can assume that $f(n-1)$ returns indeed the sum of the first n-1 odd numbers, and we have to proof that $f(n)$ returns the sum of the first n odd numbers. By the recursive logic, we have

$f(n)=f(n-1)+2n-1$

and by induction, $f(n-1)$ is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, $f(n)$ is the sum of the first n odd numbers, as required:

$f(n)=\underbrace{\underbrace{f(n-1)}_{\text{sum of the first n-1 odds}}+\underbrace{2n-1}_{\text{n-th odd}}}_{\text{sum of the first n odds.}}$

6 0

4 years ago