We want to build 10 letter “words” using only the first n=9n=9 letters of the alphabet. For example, if n=5n=5 we can use the first 5 letters, {a,b,c,d,e}{a,b,c,d,e} (Recall, words are just strings of letters, not necessarily actual English words.) How many of these words are there in total? How many of these words contain no repeated letters? How many of these words start with the sub-word “ade”? How many of these words either start with “ade” or end with “be” or both? How many of the words containing no repeats also do not contain the sub-word “bed”?

Implement F1, F2, and F3 with PLA. A B F, F2 F3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

If A={8,12,16,20} and B={12,16,20,24,28}, what is the value of P (A and B)?

Consider the code C={00010, 01100,01011,11010,01010}. What is the minimum distance of C? For what k is the code C k-error detecting? Write the set of error patterns that C can detect?

What is Benford’s Law? Benford’s Law involves looking at the first digit of a series of numbers. For example, suppose that you were to use a random number generator to generate integers in the range of 100 to 999 and you looked at how often the number begins with 1, how often it begins with 2, and so on. Any decent random number generator would spread the answers out evenly among the 9 regions, so we’d expect to see each digit about one-ninth of the time (11.1%). But with a lot of real-world data, we see a very different distribution. The expected distribution under Benford’s Law is shown below:1: 30.1%, 2: 17.6%, 3: 12.5%, 4: 9.7%, 5: 7.9%, 6: 6.7%, 7: 5.8%, 8: 5.1%, 9: 4.6% You should use this distribution in your program. You are being provided with a text file giving population data for 247 countries and territories. Your program should read in the data in this file and extract the information needed to keep count of how often each first digit is found. It may be useful to know…

Instrument FrequencyCounter to use Stopwatch and StdDraw to make a plot where the x-axis is the number of calls on get() or put() and the y-axis is the total running time, with a point plotted of the cumulative time after each call. Run your program for Tale of Two Cities using SequentialSearchST and again using BinarySearchST and discuss the results. Note : Sharp jumps in the curve may be explained by caching, which is beyond the scope of this question.

List Out Differences Between Strdup() And Strcpy()?

A particular random number generator is able to give a bunch of random integers from 0 to 65535. How many numbers do you need from this generator to guarantee that there existst two subsets of integers that sum to the same number?

Let us use the list [d1, d2, represent the (positive) big-integer d1d2...dn. dn], where each di is between 0 and 9, to type BigInt = [Int] For example, [9, 9, 9, 9, 9, 9, 9, 9, 9, 8] represents the big-integer 9999999998. Fill out the implementation for bigAdd : BigInt -> BigInt -> BigInt so that it takes two integer lists, where each integer is between 0 and 9 and returns the list corresponding to the addition of the two big-integers. Again, you have to fill in the implementation to supply the appropriate values to f, base, args. You should get the following behavior: ghci> bigAdd [9, 9] [1, 0, 0, 2] [1, 1, 0, 1] ghci> bigAdd [9, 9, 9, 9] [9, 9, 9] [1, 0, 9, 9, 8]