Answer:
Here is a UpdateTimeWindow() method with parameters timeStart, timeEnd, and offsetAmount
// the timeEnd and timeStart variables are passed by pointer
void UpdateTimeWindow(int* timeStart, int* timeEnd, int offsetAmount){
// this can also be written as *timeStart = *timeStart + offsetAmount;
*timeStart += offsetAmount; //adds value of offsetAmount to that of //timeStart
// this can also be written as *timeEnd = *timeEnd + offsetAmount;
*timeEnd += offsetAmount; } //adds value of offsetAmount to that of //timeEnd
Explanation:
The function has three int parameters timeStart, timeEnd, and offsetAmount.
First two parameters timeStart and End are passed by pointer. You can see the asterisk sign with them. Then in the body of the function there are two statements *timeStart += offsetAmount; and *End+= offsetAmount; in these statements the offsetAmount is added to the each of the two parameters timeStart and timeEnd.
Please take down this question. It is a test question and posting it on this forum is considered cheating.
On single and double overhead cam engines, the cams are driven by the crankshaft, via either a belt or chain called the timing belt or timing chain. These belts and chains need to be replaced or adjusted at regular intervals.
Answer:
An unsolvable problem is one for which no algorithm can ever be written to find the solution. An undecidable problem is one for which no algorithm can ever be written that will always give a correct true/false decision for every input value.
Answer: network topology is the arrangement of nodes which includes routers and switches so that enables connection between the server and the client.
however due to times when there is huge traffic in the nodes there needs to be an optimal path for the exchange of information which is accomplished by different routing protocols.
Explanation:
Routing Information Protocol(RIP) is one such protocol which enables to route packets from the source to the destination having the least possible traffic along its path. There are two sets of routing algorithm which are
1. Static routing protocols
2. Dynamic routing protocols.
The difference between the two is that dynamic routing protocols helps to construct the routing tables dynamically as compared to static routing.
RIP is a type of dynamic routing whereby it sends the contents of its routing table the adjacent routers every 30 seconds and whenever a route is discarded from the routing table it is marked as unusable.
RIp is supported by almost all routers and also supports load balancing which is one of it advantages.
