Answer:
A speed govenor
Explanation:
speed governor is an electronic device linked to the gearbox where sensors capture the movement of the vehicle. If the vehicle exceeds the specified speed limit, the device automatically slows the vehicle.
Answer:
Im unclear exactly what it is saying but i think its 2
Answer:
The explanation for this question is describes in the explanation section below.
Explanation:
A palindrome is a number, string, expression or certain character pattern that appears the very same backward as a forward.
Below is an algorithm for the series:
Step 1: Creates an object of generic stack-type of string set.
Step 2: Accept the sequence from those in the user as its entry.
Step 3: Throughout the specified set, disregard the white space.
Step 4: Build an object for the reverse string to be stored.
Step 5: To store the stack into the string, place the object that has come into the stack.
Step 6: Test whether the reversed string equals the initial string.
Step 7: Display the message of success.
Step 8: Display the message of failure when the strings aren't the same.
Answer:
The output is: Your cost is 100
Explanation:
Given
The above code snippet
and
Required
Determine the output of the code
if cost < 70 or cost > 150
The above condition checks if cost is less than 70 or cost is greater than 150
This condition is false because 100 is neither less than 70 nor is it greater than 150
So, the else statement will be executed.
discount = cost
Which means
discount = 100
So, the print instruction will print: Your cost is 100
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:
