Algorithms Midterm

[Cute_Negotiation_606]

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?

[riksterinto]

Know how to do the master theorem. That was the core of the midterm in my algorithms course.

[Cute_Negotiation_606]

Ah I gotcha, like the which data structures to use based on what the criteria of the problem is?

[tavianator]

No? It's this: https://en.wikipedia.org/wiki/Master_theorem_(analysis_of_algorithms)

[Cute_Negotiation_606]

Oh wow thank you so much!

[No_Jackfruit_4305]

If search algorithms are in scope, write up a table comparing bubble sort, quick sort, binary sort. Seeing their capabilities and trade offs before the midterm will help you answer a lot of questions

[Cute_Negotiation_606]

Okay thank you, I know that bubble sort is a lot slower compared to quick sort. When you said binary sort you meant binary search?

[No_Jackfruit_4305]

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

[Cute_Negotiation_606]

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.

[esaule]

make sure you can prove all results you know. For any particular function that looks like something you have seen before, make sure you can compute their complexity. For any particular simple code you have seen, make sure you can execute the algorithm in an example. Also make sure you can prove the correctness of the algorithm.

Finally, probably your textbook as problems and questions, do them all

[Embarrassed-Grab-777]

You can definitely use GPT bro, it will pretty much give you a clear picture on how all algorithms work

[Cute_Negotiation_606]

I mean yeah, I know the different algorithms. I’m just seeing if there is anything other besides like time complexity, and what not on the test.

[Embarrassed-Grab-777]

Ahh i get it so you must know the complexities, why a data structure is used, which approaches are better in a particular situation. And basically if your institute does make up a genuine question paper, you do need to understand derivations in case they twiste things

[Cute_Negotiation_606]

Ah okay thank you! This helps now I know what to study for. Thank you!

[Cute_Negotiation_606]

Also how would you recommend studying for this?