All categories

3 years ago

Who is president is US

Computers and Technology

1 answer:

Setler [38]3 years ago

5 0

?? You wantYou nethe president of US?

You might be interested in

When copying a pie chart from Calc or Excel to Impress or PowerPoint, once the chart has been pasted, it cannot be edited.

dem82 [27]

The answer is true
i think

7 0

3 years ago

Read 2 more answers

write a function that given an integer n returns the smallest integer greater than n the sume of whose digits is twice as big th

USPshnik [31]

The code below is written in javascript which gives us the integer,

<h3>The function code is</h3>

function solution (num){

//Javascript function

var x=0,sum=0,a,b;

var d=""; //variable declaration

var digits = num.toString().split('');

var Individual = digits.map(Number);

//console.log(Individual);

for (var i=0;i<Individual.length;i++)

{//For loop

x=x+Individual[i];

}

var y=x*2;

for(var i=0;i<Individual.length;i++)

{

sum=sum+Individual[i];

d=""+d+Individual[i];

if(sum==y)

break;

if(i==Individual.length-1)

{

i=-1;

continue;

}

console.log("the value is "+d);

}

var number = prompt("enter the number");

//Asking user for value...

console.log("the number is");

console.log(number);

solution(num

For more information on javascript, visit

brainly.com/question/16698901?referrer=searchResults

3 0

2 years ago

________ is a password-cracking method wherein the attacker compares passwords to lists of common words.

Dmitriy789 [7]

Hi!

When someone repeatedly compares passwords to lists of common words, this is known as the dictionary attack.

We call it this because they are <em>literally </em>using a dictionary to attack you!

Hopefully, this helps! =)

7 0

3 years ago

Topological sort requires only a tiny addition to the DFS algorithms. Exactly one of the following data structures is required t

Alekssandra [29.7K]

Answer:

Stack.

Explanation:

Topological sort requires a bit of addition to DFS algorithm.So DFS can be done by two ways that are either you can use recursion or you can use Stack data structure to implement DFS.

Since recursion uses stack memory when it makes recursive calls and if you want to do it iteratively you can stack data structure.

8 0

3 years ago

In Python please.

SOVA2 [1]

Answer:

negatives = []

zeros = []

positives = []

while True:

number = input("Enter a number: ")

if number == "":

break

else:

number = int(number)

if number < 0:

negatives.append(number)

elif number == 0:

zeros.append(number)

else:

positives.append(number)

for n in negatives:

print(n)

for z in zeros:

print(z)

for p in positives:

print(p)

Explanation:

Initialize three lists to hold the numbers

Create a while loop that iterates until the user enters a blank line

Inside the loop:

If the number is smaller than 0, put it in the negatives list

If the number is 0, put it in the zeros list

Otherwise, put the number in the negatives list

When the while loop is done, create three for loops to print the numbers inside the lists

5 0

3 years ago