[harmy01]

Hey guys

I've been struggling with algorithms and data structure. although i have finally completed my labs, i'm keen to try more problems relating to algorithm and data structure. But failed to find any, tried Google, but it came up with advanced problems. i was hoping if you guys had any intermediate algorithms & data structure problem, what ever you guys have done to enhance your experience in this case. i would love to try

Thanks guys.

[b0ng01]

http://www.brpreiss..../html/book.html for java algorithms
http://www.dreaminco...esource-thread/ for data structures

You might want to check out "Introduction to Algorithms" by Thomas H. Cormen. It uses psuedo-code so it might be better for examples if you are trying to learn in a non-java centric way.

This post has been edited by b0ng01: 02 September 2010 - 07:47 PM

[Dogstopper]

As for challenges, you should try Project Euler. It's really good for learning problem solving with math.

Here's a good list:
http://www.dreaminco...and-challenges/

[harmy01]

Hey Thank you both, i would love to have more challenges, EG the lab work u guys do in your first year java course. Would be awesome

Thanks again

[Dogstopper]

harmy01, on 03 September 2010 - 12:26 AM, said:

Hey Thank you both, i would love to have more challenges, EG the lab work u guys do in your first year java course. Would be awesome

Thanks again

I've never taken a Java course. I'm still in high school...never had lab before...

[m-e-g-a-z]

The reason why I posted this.

[macosxnerd101]

Dogstopper, on 03 September 2010 - 07:05 AM, said:

harmy01, on 03 September 2010 - 12:26 AM, said:

Hey Thank you both, i would love to have more challenges, EG the lab work u guys do in your first year java course. Would be awesome

Thanks again

I've never taken a Java course. I'm still in high school...never had lab before...

You don't consider AP Computer Science a Java course? Or did you self-study for that one?

@harmy01: Try designing your own data structures. Those are excellent exercises. For Graphs, you can also work on Dijkstra's algorithm. For Trees, implement searching routines with recursion. Stacks are well designed for Postfix to infix to prefix type problems.

[Dogstopper]

macosxnerd101, on 03 September 2010 - 09:17 AM, said:

You don't consider AP Computer Science a Java course? Or did you self-study for that one?

No! Our teacher handed us a book and said "do"...

[javadork]

Did the teacher do anything else besides say "do"? For an AP course? I can't believe our education system has come down to this. *sigh*

[macosxnerd101]

This is pretty standard for high school programming classes, and a lot of introductory college programming classes. The teachers that get thrown into them at the high school level are generally unqualified. A lot of the time, the Calculus teacher will be told to take a summer workshop and teach AP Java the next year. And a lot of the graders don't know much beyond basic OOP for the scope of the class, which is why I was frustrated by the discouragement of using standard data structures.

I've talked about the AP CS class in some of my blog entries if you're interested in checking it out.

</offtopic>

[b0ng01]

No joke, when I took AP CS in H.S. we didn't even have computers. But, macosx is correct, my H.S. teacher cared very little about the topic and I am positive that my pinky toe knows more about programming than they do.