Question

Define Goal seek and tamplates ?​

Answer 1

Answer:

${\huge{\underline{\underline{\mathfrak{\red{Answer:-}}}}}}$

ɪɴ ᴄᴏᴍᴘᴜᴛɪɴɢ, ɢᴏᴀʟ ꜱᴇᴇᴋɪɴɢ ɪꜱ ᴛʜᴇ ᴀʙɪʟɪᴛʏ ᴛᴏ ᴄᴀʟᴄᴜʟᴀᴛᴇ ʙᴀᴄᴋᴡᴀʀᴅ ᴛᴏ ᴏʙᴛᴀɪɴ ᴀɴ ɪɴᴘᴜᴛ ᴛʜᴀᴛ ᴡᴏᴜʟᴅ ʀᴇꜱᴜʟᴛ ɪɴ ᴀ ɢɪᴠᴇɴ ᴏᴜᴛᴘᴜᴛ. ᴛʜɪꜱ ᴄᴀɴ ᴀʟꜱᴏ ʙᴇ ᴄᴀʟʟᴇᴅ ᴡʜᴀᴛ-ɪғ ᴀɴᴀʟʏꜱɪꜱ ᴏʀ ʙᴀᴄᴋ-ꜱᴏʟᴠɪɴɢ. ɪᴛ ᴄᴀɴ ᴇɪᴛʜᴇʀ ʙᴇ ᴀᴛᴛᴇᴍᴘᴛᴇᴅ ᴛʜʀᴏᴜɢʜ ᴛʀɪᴀʟ ᴀɴᴅ ɪᴍᴘʀᴏᴠᴇᴍᴇɴᴛ ᴏʀ ᴍᴏʀᴇ ʟᴏɢɪᴄᴀʟ ᴍᴇᴀɴꜱ.

Answer 2

Explanation:

In computing, goal seeking is the ability to calculate backward to obtain an input that would result in a given output. This can also be called what-if analysis or back-solving. It can either be attempted through trial and improvement or more logical means.