Blog

I understand that on timed assessments in Canvas (like the final), the timer does not stop once I begin, even if I navigate away from the exam.  The exam will be automatically submitted when the time is up.  

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 10 2000 10 3000 10 4000 10 5000 10

Now open an new tab and access your own notes. I recommend you save a link to your notes as a bookmark in chrome (using the star button in the url bar).  When you’re done, respond to the following:I was able to access my notes or I am not using online notes.   Note: If you are unable to access your online notes, reach out to the instructor to get your note website whitelisted, and you can retake this quiz to verify they are accessible. 

Binary search is always better than linear search because it requires less work.

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

Using the “same as earlier trick”, reconstruct this string (ignore dashes): QRSTUV-b2c6

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      

Give the checksum we would get using the last digit of sum checksum for the message   97420

Using the encoding chart shown below for a (7, 4) Hamming code, you get the message 1011010.  How should you interpret this message?  In other words, what 4-digit value is the sender trying to communicate?  

Give the number of comparisons required on average to search a list with a length of 131,072 items using linear search