Answer: Local Area Network (LAN)
Explanation:
A Local Area Network (LAN) is a computer network that interconnects computers within a limited physical area such as a residence, school, laboratory, university campus or office building.
An example of LAN network is "Phone, Computer and TV connected to a single network (such as a Home Network) via Cables, Wifi, Bluetooth or Hotspot". When the devices are interconnected or connected to a LAN, it becomes accessible between each other.
A simplest example of a LAN Device is a <em>Home Router.</em>
Answer:
numbers = 1:1:100;
for num=numbers
remainder3 = rem(num,3);
remainder5 = rem(num,5);
if remainder3==0
disp("Yee")
else
if remainder3 == 0 && remainder5 == 0
disp ("Yee-Haw")
else
if remainder5==0
disp("Haw")
else
disp("Not a multiple of 5 or 4")
end
end
end
end
Explanation:
- Initialize the numbers variable from 1 to 100.
- Loop through the all the numbers and find their remainders.
- Check if a number is multiple of 5, 3 or both and display the message accordingly.
Answer:
0.00452
Explanation:
There are 4 sixes in a deck. So the chance that the first card you draw is a six, is 4/52. Then there are only 3 sixes left and 51 cards. So the chance that the second one is also a six is 3/51.
The combined chance is the multiplication, i.e., 4/52 * 3/51 = 0.00452
Answer:
False
Explanation:
The scheme where you can find the greatest common divisor (GCD) of two integers by repetitive application of the division algorithm is known as Euclidean Algorithm.
The Euclidean Algorithm for calculating GCD of two numbers X and Y can be given as follows:
- If X=0 then GCD(X, Y)=Y since the Greatest Common Divisor of 0 and Y is Y.
- If Y=0 then GCD(X, Y)=X since the Greates Common Divisor of 0 and X is X.
- Let R be the remainder of dividing X by Y assuming X > Y. (R = X % Y)
- Find GCD( Y, R ) because GCD( X, Y ) = GCD(Y, R ).
- Repeat the above steps again till R = 0.
