In-Class 6

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

In-Class 6

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

What is the lookup complexity of a 'trie'?

1 point

It is O(log(n)) -- i.e. proportional to the number of entries.

It is O(|k|) where 'k' is the length of the key. For example, it would be proportional to the length of the key.

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