Answer:
Tactic Exchange
Explanation:
The approaching style of the student to his/her friend for help is of an influence categorized as the "Exchange Influence Tactic".
The Exchange Influence Tactic refers to when a person persuades someone or seeks influence over him/her by offering some sort of reward for their help rendered. It might also work by reminding other person of any favor which you offered in the past that should be repaid now.
Here the student is seeking help of his/her friend for completion of a final report for which he/she is already late. In exchange the student is assuring his/her friend the completion of certain spreadsheets which are pending on him/her. Hence, the student has used the exchange tactic to get his work done by offering a favor in response.
Hi, you haven't provided the programing language in which you need the code, I'll just explain how to do it using Python, and you can apply a similar method for any programming language.
Answer:
def rightMost(num):
lenNum = len(str(num))
rightNum = num%(10**(lenNum-1))
print(rightNum)
return(rightNum)
Explanation:
In this function we receive an integer number, then we find how many digits this number has, and finally, we find the rightmost digits; the main operation is modulo (takes the remainder after a division), what we want is to take all the digits except the first one, for that reason we find the modulo of the number when divided by ten to the power of the length of the number minus one, for example, if the number is 2734 we divided by 10^(4-1), where four is the length of the number, this way we get 2734/1000 and the module of it is 734.
Explanation:
I have attached the answer as an image. I can't upload the file as it requires a licensed product and I only used demo version. I can provide the file too if you can give me your vlsig file required to use full software. However, If you just copy along the images on your Visual Studio, you will easily create the files yourself. Answer is provided for both scenarios as part A and part B, one which stops after 1 iteration and the one which loops until 0 height is given.