Search engines - there was no single way to ask a question
Answer:
The decimal value of 101₂² base 2 = 25 base 10
Explanation:
The number 101₂² in decimal value is found as follows;
101₂ × 101₂ = 101₂ + 0₂ + 10100₂
We note that in 101 + 10100 the resultant 2 in the hundred position will have to be converted to a zero while carrying over 1 to the thousand position to give;
101₂ + 0₂ + 10100₂ = 11001₂
Therefore;
101₂² = 11001₂
We now convert the result of the square of the base 2 number, 101², which is 11001₂ to base 10 as follows;
Therefore converting 11001₂ to base 10 gives;
11001₂= 1 × 2⁴ + 1 × 2³ + 0 × 2² + 0 × 2 ¹ + 1 × 2⁰
Which gives;
16 + 8 + 0 + 0 + 1 = 25₁₀.
In the interview when the candidate is asked about yourself then telling about childhood past is not correct. Therefore the given statement is false.
<h3>What is an interview?</h3>
An interview is an interaction or a conversation between an employer and the interested candidate. In the conversation the interviewee is asked about their education, family background, and work experiences.
When an interviewer ask about tell me about yourself, then the interviewee should not tell about their childhood past, rather the interviewee should give few information about their family, education, and working.
Therefore, the given statement is false.
Learn more about interview, here:
brainly.com/question/13073622
#SPJ1
Answer:
The code commented is given below, also the lines that start with # are comments that explains the code.
# Create a function named times_print that receives 2 values x and y
def times_print(x, y):
# Print the formatted string
print("The value of {} times {} is {}".format(x,y,x*y))
# Create the main function
def main():
# Call the funciton times_print 3 times with different values
times_print(2,3)
times_print(4,5)
times_print(5,6)
# Execute the main function
main()
Explanation:
The code was written using Python 3.5, and here I attach the screenshots of the program running:
An optimization problem is one in which you want to find, not just a solution, but the best solution •<span>A <span>“greedy algorithm” sometimes works </span></span><span>well for optimization problems </span>•<span>But only a few optimization problems can </span><span> be solved by the <span>greedy method</span></span>
