JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
In-Class 9
In-Class Activity to be completed in class.
Note: For this activity and all other activities, you should only make 1 submission (your first submission is always the one graded)
Sign in to Google
to save your progress.
Learn more
* Indicates required question
First Name
*
Your answer
Last Name
*
Your answer
E-mail (Please use Northeastern e-mail)
*
Your answer
Which section of Algorithms are you in?
*
Mike
John
Do we need to prove a 'definition'?
1 point
No, it is given.
Clear selection
What is the Big-O complexity of the following function: f(n^2 + 100n + 15712958)
1 point
O(n^2)
O(n)
O(15712958)
Clear selection
If you had to prove 1,000,000,000 different cases, do you think proof by case would be a good technique?
1 point
It is unlikely that would be a good technique, especially if we are constrained to solving it by hand. We may otherwise try a technique like 'proof by induction' or some other technique.
Clear selection
Submit
Clear form
Never submit passwords through Google Forms.
This content is neither created nor endorsed by Google.
Report Abuse
-
Terms of Service
-
Privacy Policy
Forms
