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. 

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.  

Quantum computers are likely to be superior to classical computers for all use cases.  

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

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

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 100.00 2000 400.00 3000 900.00 4000 1600.00 5000 2500.00

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

 Which of the following transaction actions are fully idempotent? Select all that apply.

According to Alan Turing, it may be possible to have a perfect antivirus program one day.

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