I'm gearing up for an upcoming exam that focuses on algorithms, but I'm feeling pretty lost on how to prepare. It's a multiple-choice test, and unlike subjects like math, I just can't seem to find the right study method. I'm torn between creating sub-programs for each topic to solidify my understanding or just hammering through practice multiple-choice questions. What would you recommend?
2 Answers
I’d go for making programs and rewriting the examples from class. Trust me, when you write out the code and make mistakes, that's when you really learn. Just reading isn't as effective for retention, in my experience.
Start by reviewing what you've covered in class. Look into your homework assignments and any previous tests you've taken—those are often great indicators of what you need to focus on. Knowing how your class is structured can really help narrow down your study areas!
That makes sense! We've mainly gone over linked lists, doubly linked lists, maps, as well as Dijkstra's and Kruskal's algorithms. Lots of foundational data structures too. So, you think reviewing those specifically would be helpful?
Totally agree! I struggle with just reading the material too. My professor skips showing actual code, which makes it confusing. I’ll definitely lean on programming to learn, thanks for the tip!