JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
5006 In-Class 1
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
Where are algorithms used today? (Check all that apply)
1 point
Medicine
Games
Navigation systems
Algorithmic Trading/Banks
What is the 'growth' of the binary search. That is, if I have 'N' items, how long does it take me to search through 'N' sorted items.
1 point
O(log(N))
O(N)
O(N*N)
Clear selection
Why do we typically perform 'worse-case' analysis of an algorithm?
1 point
A more conservative estimate gives us an upper bounds on how long some operation will take. This is one way to have confidence in how long a task will take.
Clear selection
What was the Big-Oh complexity of bubble sort?
1 point
O(log(N))
O(N*N) or 'Big Oh of N squared'
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
