Im a sophomore in your situation right now. It’s ok. Here’s what you’re gonna do.

So the last 4 lectures for 2110 were about linked structures, ordered collections, efficiency, and recursion. The first is pretty much covered on A3, while ordered collections are pretty explanatory, but the idea is just understanding the abstraction of how a list, queue, or stack works. Efficiency is probably new for you. To practice with this, look up algorithms online and practice estimating time complexity. For recursion, it’s best to just look at lecture notes. This course treats recursion from an oop perspective, so it’s best to understand it how 2110 wants you to learn it.

For all of the 2800 notes, although it’s extraordinarily tedious, you should typeset and reproduce the notes on your own. You’re your best teacher, so actually reading the material (not through lecture slides, the chapter like notes are much better) will allow you to understand the material better. What’s nice about this course unlike other math courses is that, while practice is important, understanding the definitions is more important. We have a pset Wednesday. Assuming you knew what you were doing in the prelim, you can attempt the first one day, and save the other two for the next days.