Adam has 5 barrels of different volumes. The barrel of which volume can contain the most liquid?

A hub a signal that refreshes the signal strength.

vekshin1

Answer:You are a network engineer. While moving a handheld wireless LAN device, you notice that the signal strength increases when the device is moved from a ...

Explanation:

7 0

2 years ago

It is true about Metals and alloys: a)-They are good electrical and thermal conductors b)-They can be used as semi-conductors c)

ycow [4]

Answer:

(d) a and c are correct

Explanation:

METALS : Metal are those materials which has very high ductility, high modulus of elasticity, good thermal and electrical conductivity

for example : iron, gold ,silver, copper

ALLOYS: Alloys are those materials which are made up of combining of two or more than two metals these also have good thermal and electrical conductivity and me liable property

for example ; bronze and brass

so from above discussion it is clear that option (d) will be the correct option

8 0

3 years ago

Read 2 more answers

Consider two different versions of algorithm for finding gcd of two numbers (as given below), Estimate how many times faster it

juin [17]

Answer:

Explanation:

Step 1:

a) The formula for compute greatest advisor is

gcd(m,n) = gcd (n,m mod n)

the gcd(31415,14142) by applying Euclid's algorithm is

gcd(31,415,14,142) =gcd(14,142,3,131)

=gcd=(3,131, 1,618)

=gcd(1,618, 1,513)

=gcd(1,513, 105)

=gcd(105, 43)

=gcd(43, 19)

=gcd(19, 5)

=gcd(5, 4)

=gcd(4, 1)

=gcd(1, 0)

=1

STEP 2

b) The number of comparison of given input with the algorithm based on checking consecutive integers and Euclid's algorithm is

The number of division using Euclid's algorithm =10 from part (a)

The consecutive integer checking algorithm:

The number of iterations =14,142 and 1 or 2 division of iteration.

14,142 ∠= number of division∠ = 2*14,142

Euclid's algorithm is faster by at least 14,142/10 =1400 times

At most 2*14,142/10 =2800 times.

5 0

3 years ago

CODE

zalisa [80]

Answer:

Explanation:

I'm not 100% this is what you want, but here it is:

2

3

13

8

11

A

13

6 0

2 years ago

Fill in the empty function so that it returns the sum of all the divisors of a number, without including it. A divisor is a numb

tekilochka [14]

Answer:

// Program is written in C++

// Comments are used to explain some lines

// Only the required function is written. The main method is excluded.

#include<bits/stdc++.h>

#include<iostream>

using namespace std;

int divSum(int num)

{

// The next line declares the final result of summation of divisors. The variable declared is also

//initialised to 0

int result = 0;

// find all numbers which divide 'num'

for (int i=2; i<=(num/2); i++)

{

// if 'i' is divisor of 'num'

if (num%i==0)

{

if (i==(num/i))

result += i; //add divisor to result

else

result += (i + num/i); //add divisor to result

}

cout<<result+1;

}

6 0

3 years ago