Problem Set 10 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 10.1

    Almost-disjoint paths
    This is a required question
    This is a required question

    Problem 10.2

    Cache oblivious list ranking
    This is a required question
    This is a required question

    Problem 10.3

    Belady's anomaly in paging schemes
    This is a required question
    This is a required question

    Problem 10.4

    k-server problem on trees
    This is a required question
    This is a required question

    Problem 10.5

    Competitive snoopy caching
    This is a required question
    This is a required question
Request edit access