Problem Set 1 Survey
Please help us evaluate the difficulty and usefulness of the problems in this problem set. Participation in this survey is voluntary and anonymous. Thank you!
Problem 1.1
Solving Scenarios
*
easy
difficult
*
not useful
useful
Problem 1.2
Linear heap depth
*
easy
difficult
*
not useful
useful
Problem 1.3
Cutting nodes after k deletes
*
easy
difficult
*
not useful
useful
Problem 1.4
Interval search using persistence
*
easy
difficult
*
not useful
useful
Problem 1.5
Heap tradeoffs
*
easy
difficult
*
not useful
useful
Submit
This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Additional Terms