CS 70

Final Proficiency Check Retries for All Groups

If you received a “not demonstrated” for any of this semester's CS 70 proficiency checks, you may retake them here for the final time, this time with partial credit for partial demonstration of proficiency.

You can remind yourself of the learning objectives for these proficiency checks (especially the ones that you got wrong the first or second time) here:

When you feel you're ready to retake the proficiency checks, click the links below to go to Gradescope. Once you begin each proficiency check, you must complete it in one sitting and you may not refer to this webpage or any other resources (see the rules and reminders below).

  • Group 0: Course Policies
    • PC 0A — Late Work
    • PC 0B — Proficiency Checks
    • PC 0C — Academic Honesty
    • PC 0D — Getting Help
  • Group 1: Numeric Types and Memory Models
    • PC1A — Memory Diagrams
    • PC1B — Numeric Types Fundamentals
    • PC1C — Promotion and Conversion
    • PC1D — Using Numeric Types
  • Group 2: Statically Sized Arrays of Primitives
    • PC 2A — Array Definition
    • PC 2B — Array Characteristics
    • PC 2C — Use Arrays
    • PC 2D — Array Errors
  • Group 3: Compilation
    • PC 3A — Compilation Stages
    • PC 3B — Compilation Commands
    • PC 3C — Program Organization
    • PC 3D — #include Guards
  • Group 4: References and Pointers
  • Group 5: Object Lifetime
    • PC 5A — Model Objects
    • PC 5B — Lifetime Timing
    • PC 5C — Pointers to Classes
    • PC 5D — Constructors and Destructors
  • Group 6: Iterators
    • PC 6A — Iterator Definition
    • PC 6B — Using Iterators
    • PC 6C — Iterator Interface
    • PC 6D — Invalid Iterators
  • Group 7: Complexity
    • PC 7A — Measuring Cost
    • PC 7B — Asymptotic Complexity
    • PC 7C — Complexity Analyses
    • PC 7D — Amortized Bounds
  • Group 8: Trees
    • PC 8A — Binary Search Trees
    • PC 8B — Random and Randomized Trees
    • PC 8C — 2–3–4 and Red–Black Trees
    • PC 8D — BST Complexity
  • Group 9: Hash Tables
    • PC 9A — Hash Functions
    • PC 9B — Hash Table Operations
    • PC 9C — Collision Resolution Strategies
    • PC 9D — Hash Table Complexity
  • Group 10: Concluding Topics
    • PC 10A — Heaps and Priority Queues
    • PC 10B — Inheritance and Subtype Polymorphism
    • PC 10C — User-Defined Type Conversion
    • PC 10D — Choosing Data Structures

Completing the Proficiency Checks

We have written these proficiency checks to be short (~5 minutes each), and there is no time limit at all. Take as long as you need—though we do not expect you to need long.

However, you must start and end each proficiency check in a single sitting without interruption by other activities that would expose you to another person. No email, checking your phone, going to the dining hall, etc. Eating, resting, stretching, and other activities are encouraged if it helps you do your best!

Once you have opened a proficiency check, you have started it. You may not leave and come back to it at a different time, so be sure not to open it until you're ready to complete it!

Grading

Each final try will be graded much like other exam questions you've experienced, with partial credit for partial demonstration of proficiency. If you get one or two minor things wrong, you'll probably get almost full credit. If you get many things or particularly important things wrong, you'll get less credit.

Resources

You may not use any resources while you are completing this assignment, including course webpages, textbooks, your own notes, a compiler, Internet resources, and so on.

A Note on Academic Integrity

We believe that these untimed proficiency checks, which you are allowed to take at any point during the week, allow each student to best demonstrate their learning through frequent, low-stakes assessment at the time that works best for them. This flexibility is only possible if we all truly commit to meeting our community's academic-integrity expectations. You may study for this proficiency check with other people in the class. You must complete this proficiency check on your own. You cannot share or distribute this proficiency check with anyone. You cannot discuss the check question(s) with anyone in the class until after the due date (including the optional late day). You can never discuss the exam with anyone who is not in CS 70. You cannot use resources (e.g., notes, a computer) not explicitly described above.

If you have any questions about the rules, ask before you start the proficiency check.

Failure to report a violation will be considered the same as if you had committed a violation yourself. All academic dishonesty cases will be referred to, and will follow the procedures of, your home campus.

(When logged in, completion status appears here.)