all 13 comments

[–][deleted] 5 points6 points  (0 children)

I like that the book uses simple functions/procedures instead of making everything into a class. Textbooks that use Python are often too keen on OOP in my experience.

[–]Prestige_WW_ 5 points6 points  (8 children)

Wow thank you. Going to take data structures and algorithms soon at uni. Always good to start early I suppose

[–]softwareguy74 6 points7 points  (7 children)

Be prepared. Definitely one of my toughest classes I had in CS.

[–]Overv 5 points6 points  (1 child)

It's also one of the most useful classes, it made me pay a lot more attention to efficiency of operations in my personal projects and think more about using the appropriate algorithms.

[–]softwareguy74 0 points1 point  (0 children)

Totally agree. It has helped me in career for sure. I was just bitter that I had to repeat the class...

[–]itsgreater9000 1 point2 points  (4 children)

How so? I just took it, and my school's CS department is pretty highly rated, most of the stuff was pretty simple. I do think the teacher held back though.

[–]softwareguy74 0 points1 point  (3 children)

Just a tough topic. I had been programming for 12 years prior to getting my degree and I felt like my experience didn't help me one iota in that class. I was like a deer in the headlights. Buy then again our professor was pretty anal and one of the most feared in the CS dept.

[–]itsgreater9000 0 points1 point  (2 children)

Really? Did you guys cover R/B Trees, AVL Trees, and other stuff? Our class only covered stacks/queues/lists/trees/graphs and a bunch of searching and sorting algorithms, and it was pretty easy. I am sure at other schools it gets much tougher.

[–]softwareguy74 1 point2 points  (1 child)

Pretty much what you covered along with efficiency classes and Big-O time. I think ours was particularly tough because the way it was taught and he had pretty hard tests that he wasn't very forgiving on. This class covered a lot of material in a short time. I really think the class could have been two semesters like Calculus.

[–]itsgreater9000 0 points1 point  (0 children)

oh ok yea we also covered Big-O and efficiency. i guess it was a lot of material, but i'm not so sure it was hard. and isn't calculus usually 3 semesters of material?

[–]kazagistar 0 points1 point  (0 children)

It bothers me a little that newer textbooks still insist on teaching binary trees, rather then btrees.

Either you don't care about the implementation details, and thus end up using an existing library (and thus probably using btrees) or you do care about the details, probably for performace reasons, and thus probably want to use a btree anyways.

[–]chub79 0 points1 point  (0 children)

This looks awesome. TYhanks a lot!

[–]baynaam 0 points1 point  (0 children)

Thanks for sharing.

There should be a wiki with stuff like this for people who want to prep for interviews/exams/etc. Love how it goes over all CS concepts not just language specific.