You are the head of a division of a big silicon valley company and have assigned one of your engineers, jim, the job of devising an algorithm to sort through an english text of n words and convert it into an esperanto document. jim comes up with an algorithm which takes 2n2+2n bit operations to handle an input text with n words. suppose the computers in your business can handle one bit operation every nanosecond (1 nanosecond =10−9 seconds). how many nanoseconds would it take jim's algorithm to convert a text with 10 words on these computers? 1224*10^(-9) equation editorequation editor how many days would it take jim's algorithm to convert a text with 50 words on these computers? ( do not round your answers for webwork.)

Unit 3 computer programming study guide refer to code.org for puzzles refer to brainpop; under functions, computer programming, variables part one: define. algorithm- a list of steps to finish a task binary- a way to represent information using 1 and 0 bug- part of a program that does not work correctly code- 1 or more commands to be carried out by a computer function debug sequencing loop repeat conditionals variable part two: answer accordingly. a programmer is to a computer as a teacher is to: a good algorithm must be: imagine writing a program that instructs a bird how to take off, fly and land. what function is likely to be looped? which of the following is most similar to a function? what do variables and functions have in common? 8. the main cause of bugs in coding is: 9. list the following in order from the simplest to most complex: function program step 10. if a program has gone through many iterations, what must be true? 11. what is a benefit of drying up code? a. it makes it less likely to break b. it makes the code compatible with different software c. it saves programmers time d. it makes it less vulnerable to hackers 12. a statement in a function can be most closely compared to: a. a step in a recipe b. a line of a poem c. a brushstroke in a painting d. a piece of assembled furniture t/f: are the solutions provided true? t/f: t/f: t/f: