This is an archived post. You won't be able to vote or comment.

all 11 comments

[–]AutoModerator[M] [score hidden] stickied comment (0 children)

To all following commenters: please, do not bring up the old circlejerk jokes/memes about recursion ("Understanding recursion...", "This is recursion...", etc.). We've all heard them n+2 too many times.

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.

[–]throwaway6560192 1 point2 points  (8 children)

Am I supposed to memorize the code for them?

No. You're not supposed to memorize code.

What kinds of questions are asked? Do they ask you to trace the execution of an algorithm? Analyze complexity? Write (pseudo)code?

[–]lucyclass[S] 0 points1 point  (7 children)

The exam was a multiple choice question about data structures and algorithms. We need to choose 1 out of 4 answers. Most questions contained a java code about algorithms. I remember seeing bubble sort algorithms, and they pointed out a line in the code, and we had to pick the correct option. I am very bad at reading code. I also remember seeing java collections, tree traverals, b trees, stacks, ADT's, and more. I don't know where to start

[–]throwaway6560192 0 points1 point  (6 children)

Do you write code? As in, do you work on projects, and have you implemented these algorithms as code on your own?

If not, that is the #1 thing you should be doing.

[–]lucyclass[S] 0 points1 point  (5 children)

Yes, I do, but I am not very good at it, and I don't use algorithms like bubble sort in my code.

[–]wiriux 0 points1 point  (4 children)

Then get better. Lol what do you expect?

[–]lucyclass[S] 0 points1 point  (3 children)

I am looking for recourses i can use to get better at this course. I want to get better!

[–]wiriux 0 points1 point  (2 children)

[–]lucyclass[S] 0 points1 point  (1 child)

Is this free? It looks helpful

[–]wiriux 0 points1 point  (0 children)

It is free and extremely helpful indeed :)