Answer:
There is Name resolution failure
Explanation:
This normally occurs when the computer can't access the host (your server). It can be caused by several factors, such as:
-Internet connectivity is down
-The client does not have DNS servers configured or is configured with the incorrect DNS server IP addresses.
-The DNS servers are failing.
Answer:
60 J
Explanation:
Given,
Work done to push the box = 100 J
Energy dissipated by friction = 40 J.
According to work energy theorem work done is equal to change in kinetic energy.
Change in Kinetic energy = Work done by student + Work done by friction
Change in Kinetic energy = 100 J - 40 J
Work done by the friction will be negative because it will act in opposite direction of force applied.
Change in Kinetic energy = 60 J
The subnet mask can be utilized to segment the 172.16.0.0 network to qualify for a minimum of 6 subnets while maximizing the numeral of broadcasters per subnet is 255.255.224.0
<h3>What do subnet masks mean?</h3>
- A subnet mask is a 32-bit numeral formed by setting keeper bits to all 0s and developing network times to all 1s.
- In this way, the subnet mask divides the IP speech into the network and host addresses.
- A subnet mask is used to separate an IP address into two pieces. One element defines the host (computer), and the different part identifies the network to which it belongs.
- To better comprehend how IP lessons and subnet masks work, look at an IP speech and see how it's managed.
To learn more about subnet mask, refer to:
brainly.com/question/3234986
#SPJ4
Answer:
C) grip the sterring wheel firmly
Explanation:
Answer:
// here is code in c++.
#include <bits/stdc++.h>
using namespace std;
// function that return greatest common divisor
int g_c_d(int num1, int num2)
{
if (num1 == 0)
return num2;
return g_c_d(num2 % num1, num1);
}
// main function
int main()
{
// variables
int num1,num2;
cout<<"enter two numbers:";
// read two numbers from user
cin>>num1>>num2;
// call the function and print the gcd of both
cout<<"greatest common divisor of "<<num1<<" and "<<num2<<" is "<<g_c_d(num1.num2)<<endl;
}
Explanation:
Read two numbers from user and assign them to variables "num1" and "num2".Call the function g_c_d() with parameter "num1" and "num2".According to Euclidean algorithm, if we subtract smaller number from the larger one the gcd will not change.Keep subtracting the smaller one then we find the gcd of both the numbers.So the function g_c_d() will return the gcd of both the numbers.
Output:
enter two numbers:5 9
greatest common divisor of 5 and 9 is 1
enter two numbers:-25 15
greatest common divisor of -25 and 15 is 5
