For this and all assignments, do not use data structures or algorithms that we have not covered in class (e. g. hash tables). Relevant topics: array lists, stacks, queues, dictionaries, insertion sort. Write a program that reads a string of up to 9 lower-case letters from the stan-dard input and prints out the longest words (in words. txt) that can be formed by reordering a subset of the letters. If there is more than one word of the maximum length, print out all of them in alphabetical order, each on a new line. Name your program Longest Words and upload it to Vocareum. For example, if the input isnjwhoaurgthen the correct output is
jargonourang
then the correct output is
jargon
ourang
For full credit, your program should take no more than 5 seconds and in no case should it take longer than 30 seconds.

In a response of approximately 50 words, explain why it would be essential for the successful a/v technician to participate in additional coursework, presentations and seminars offered by equipment manufacturers as well as annual conferences attended by colleagues in the industry.

Write a program that inserts the digits of an integer into an array in originalorderfollowed by reverse order. first, promptthe user to enter a positive integer(> 0). determine the number of digits of the integer. create a dynamically allocated integer arrayof a size twice the number of digits.now insert the digits in original order which will occupy half of the array. then, insert the digits in reverse order.finally, output thedigits in thearray.use at least two functions to organize your program.

When making changes to optimize part of a processor, it is often the case that speeding up one type of instruction comes at the cost of slowing down something else. for example, if we put in a complicated fast floating-point unit, that takes space, and something might have to be moved farther away from the middle to accommodate it, adding an extra cycle in delay to reach that unit. the basic amdahl's law equation does not take into account this trade-off. a. if the new fast floating-point unit speeds up floating-point operations by, on average, 2ă—, and floating-point operations take 20% of the original program's execution time, what is the overall speedup (ignoring the penalty to any other instructions)? b. now assume that speeding up the floating-point unit slowed down data cache accesses, resulting in a 1.5ă— slowdown (or 2/3 speedup). data cache accesses consume 10% of the execution time. what is the overall speedup now? c. after implementing the new floating-point operations, what percentage of execution time is spent on floating-point operations? what percentage is spent on data cache accesses?