Answer:
float time_hourly=(time_min/60);
float speed_mph=(distance_mil/time_hourly);
Explanation:
I have taken a float variable time_hourly to convert the time given in minutes in hours.We need to divide the time in minutes by sixty since there are 60 minutes in an hour.
I have taken a float variable speed_mph to calculate the speed.Since we know the speed is distance/time and provided the distance is in miles and the time is in hours.
I think it's false. If I'm wrong then sorry.
Answer:
The main difference between LAN, MAN and WAN is the scope and coverage of the networks. LAN (Local area network) is usually used to connect computers in smaller distances such as in a building or in offices. They use various topologies such as bus topology, ring topology, star typology etc to connect the computers and share information only among the computers connected in LAN. A Metropolitan Network covers larger coverage than LAN and is usually used for connecting a city rather than single organization. A Wide Area Network is collection of networks or many LANS. The perfect example of WAN is internet which connects thousands and millions of networks. Another factor which distinguishes between LAN, MAN and WAN is that LAN and MAN are owned by certain entities such as government, educational institutions or organizations whereas WAN (i.e. Internet) is not owned by anyone.
Answer:
humans,washing mashines,dish washers
Explanation:
Answer:
Each time you insert a new node, call the function to adjust the sum.
This method has to be called each time we insert new node to the tree since the sum at all the
parent nodes from the newly inserted node changes when we insert the node.
// toSumTree method will convert the tree into sum tree.
int toSumTree(struct node *node)
{
if(node == NULL)
return 0;
// Store the old value
int old_val = node->data;
// Recursively call for left and right subtrees and store the sum as new value of this node
node->data = toSumTree(node->left) + toSumTree(node->right);
// Return the sum of values of nodes in left and right subtrees and
// old_value of this node
return node->data + old_val;
}
This has the complexity of O(n).
Explanation:
