Answer the following questions about the information in Appendix J:
o What will be printed if the input is 0?
o What will be printed if the input is 100?
o What will be printed if the input is 51?
o What will be printed if the user enters "Wingding"?
o Is this design robust? If so, explain why. If not, explain what you can do to make it
robust.
o How many levels of nesting are there in this design?
o Give a set of values that will test the normal operation of this program segment.
Defend your choices.
o Give a set of test values that will cause each of the branches to be executed.
o Give a set of test values that test the abnormal operation of this program segment.

Let T[1..n] be a sorted array of distinct integers, some of which may be negative. Give an algorithm that can find an index i such that 1 <= i <= n and T[i] = i, provided such an index exists. Your algorithm should take a time in Big "O" (log n) in worst case.

Suppose that all edge weights in a graph are integers in the range from 1 to |V|. How fast can you make Kruskal's algorithm run? What if the edge weights are integers in the range from 1 to W for some constant W?

Suppose in the manufacturing process, a part needs to be 2.5 inches. Due to the random errors, it cannot be 2.5 inches exactly. Here are readings from three inspectors in a verification test. Find the % of gauge error. How does the gauge verification improve the performance of a manufacturing process?
See attachment for data.

Consider searching algorithms on the following array of data:
[22 21 9 4 16 2 10 14 20 31 26 19 17 28 8 13]
Suppose you want to implement a searching algorithm to see if the data set contains the number 19. Demonstrate how the search would go if you used:
A sequential search
A binary search
State the runtime for each o

Find the polynomials that represent 1/x^3+x , x/x^3+x, x^2/x^3+x, and x^3/x^3+x modulo the irrreducible polynomial x^5+x^2+1 over F2 ( the field with two elements 0 and 1)
Your answers should be polynomials over F2 with degrees at most four. (Can you explain in here why at most degree four)
Note: Use the Eucliden algorith

Please assist so that I can complete the following:
You will create a program that runs a sorting algorithm on a set of randomized values. Your program should run the algorithm several times, to get the average time for each sorting technique.
STEPS
1. Write a program using C++ or Java that will take in randomized value