Select the the correct order of the step-by-step sorting of the following list using selection sort. 4 6 8 2 1 9 7 3 5
Select the correct sequence of values that would compared ag…
Select the correct sequence of values that would compared against when performing a binary search of this array for the value 74. For example, selecting “3” in the Order row would mean that the corresponding value in that column would be checked third; selecting “N/A” would mean the value in that column would never be checked. Index 0 1 2 3 4 5 6 Value 15 27 33 41 56 62 74 Order
It takes 0.75 seconds to sort a list of 100,000 items using…
It takes 0.75 seconds to sort a list of 100,000 items using selection sort. Estimate the time to do the same sort on 200,000 items
Using the “same as earlier trick”, reconstruct this string (…
Using the “same as earlier trick”, reconstruct this string (ignore dashes): QRSTUV-b2c6
Give the checksum we would get using the last digit of sum c…
Give the checksum we would get using the last digit of sum checksum for the message 97420
Which of the following transaction actions are fully idempo…
Which of the following transaction actions are fully idempotent? Select all that apply.
Using the encoding chart shown below for a (7, 4) Hamming co…
Using the encoding chart shown below for a (7, 4) Hamming code, you get the message 0001010. How should you interpret this message? In other words, what 4-digit value is the sender trying to communicate?
What “trick” is used to detect errors in transmission of the…
What “trick” is used to detect errors in transmission of the following message? MMMYYY NNNAAAMMMEEE IIISSS JJJAAAMMMIIIEEE!!!
In the neural network below, inputs to the system are shown…
In the neural network below, inputs to the system are shown in the boxes and ovals are neurons labeled with their thresholds. Give the value of Y1 and Y2. Assume each neuron uses a simple comparison of inputs to the threshold and outputs only a 0 or 1
You programmed a new searching algorithm and are trying to d…
You programmed a new searching algorithm and are trying to determine how efficient it is by timing (t) how long it takes to run on lists of various sizes (N). Use the results below to determine the growth pattern of your program. N t 1000 9.97 2000 10.97 3000 11.55 4000 11.97 5000 12.29