In-Class

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

In-Class

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)

First Name *

Last Name *

E-mail (Please use Northeastern e-mail) *

Which section of Algorithms are you in? *

Mike

John

What is a 'call stack'

1 point

Every time you make a function call, some memory is allocated for the function(i.e the arguments and return value). The function is removed from the call stack once it 'returns'.

Clear selection

Can you recurse 'forever' in a C program if you are adding something on the call stack every time you recurse?

1 point

While it is possible to have an 'infinite' loop, if you are constantly adding things to the call stack without removing them, your computer will eventually run out of memory.

Recurse forever! What could go wrong?

Clear selection

What is the time complexity of merge sort?

1 point

O(n!)

O(nlog(n))

O(n^2)

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