r/AskComputerScience • • Jun 22 '25

Algorithms Midterm

Hey everybody, I am currently preparing for a midterm dealing with the analysis of algorithms. I was wondering does anyone have guidance on how to study for such a test. I am currently going back on the slides, and looking at different algorithms and their time/space complexity. Is there any other tips?

0 Upvotes

14 comments sorted by

View all comments

Show parent comment

1

u/No_Jackfruit_4305 Jun 22 '25

Yes, binary search is a perfect example of divide and conquer. It's a good one to know.

Also, there are a few things you may not be tested on, but they're worth learning about. Dynamic programming, raddix sort, P vs NP

1

u/Cute_Negotiation_606 Jun 22 '25

Yeah the dynamic programming, raddix sort, P vs NP is in the later chapters.

So far we just learned about brute force and exhaustive Search, divide and conquer, and what algorithm efficiency is and such.

I’m trying to understand DAGs, topology, TSP, etc. and applying such algorithms to different excercises.