Exams

Midterm 2

Dates: Mar 27 - 29 Instructions: Coverpage here

Topics:

  • Stacks, Queues, and Deques
  • Loops
  • Recursion
  • Searching & Sorting

Midterm 1

Dates: Feb 20 - 22

Exam:

Topics & Success Rates:

TopicM1 Achieved Mastery*M1 Average
Abstract Data Types781%
Arrays985%
Linked Lists476%
Copy Depth1186%
Iterators470%

Topics To Review:

  • A singly linked linked list allows fast (i.e., linear time) insertion and deletion when you have access to the node you want to insert or remove after. If you have to find a node, it’s expensive because traversing the list is O(n)
  • Iterators allow you to abstract traversal on top of your implementation. Therefore, you can say something like next without worrying about how the data structure will find the next element. We can keep discussing iterators.

*Master is usually (arbitrarily) set at 90%. There are a lot of people who did extremely well who did not quite break 90%. I note 90% in particular just because of convention within the field.

Past exams

CSC 210 Exams (Mastery)

CSC 210 Exams (Prior to Mastery Approach)

CSC 212 Exams (Nick and Jordan)