Anyone doing Java ? I have a good resource for you! (1 Viewer)

[nishkak]

For any of you who are thinking of using Java for your major project or use it generally to learn programming in SDD i'd highly recommend the latest edition of Thinking in Java by Bruce Eckel. It's available for free on his site www.bruceeckel.com or you can get a printed copy from Amazon or something for around $60. I've read several volumes on Java and this is definitely the best one I've seen so far, extremely comprehensive, complete, errorless and intuitive. The chapter on Polymorphism explains it a whole lot better than any SDD textbook - which all seem ot think that polymorphism means that you have 2 mentods of the same name with different argument lists - -this is a completely different programming feature, Polymorphism is about casting classes to sub or super classes. Typical NSW HSC syllabus... *shakes head*

Hope somebody finds this useufl!

 

[pritnep]

thanks for the tip, although I am doing Visual Basic for my SDD major project I know someone that might need some java references for a program they are working on.

 

[ace]

Even though I did a Uni course on java, resources are resources

These links explain concepts more than just slabs of code, they are pretty useful. So useful I mailed them to a lecturer awhile ago.

---------------------------------------------------------------------

(2,4) Tree Java Applet
http://www.cs.mcgill.ca/~cs251/ClosestPair/BalancedTreeApplet/BalancedTreeApplet.html

Binary Tree Applet
http://www.cs.jhu.edu/~goodrich/dsa/trees/btree.html

AVL Tree Tutorial (Excellent in the way it describes rotations)
http://cairns.cs.jcu.edu.au/teaching/Subjects/cp2001/1998/LectureNotes/BalancedTrees/node2.html

Heap Sort (good resource, kind of technical in parts though)
http://www.iti.fh-flensburg.de/lang/algorithmen/sortieren/heap/heapen.htm

Prim Jarnik Algorithm (has an excellent java applet illustrating this algorithm in practice)
http://students.ceid.upatras.gr/~papagel/project/prim.htm

---------------------------------------------------------------------
Website:
McGill University School of Computer Science Class Notes for 308-251B
Data Structures and Algorithms

Stacks, Queues and Lists (found it alright, nothing special)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic6/

Tries, and Suffix Tries (good resource if you understand its content)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic7/

Trees, and lots of info on trees (has a good java applet on tree traversals)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic8/

Binary Search Trees (has an applet as well)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic9/

More Trees and Quicksort (java applet on QuickSort)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic10/

Hashing (has applet also on hash chaining)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic12/

Open Address Hashing (or Probing as called in other words)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic13/

Hashing (its applications)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic14/

Priority Queue Info (good resource)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic15/

Heaps
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic16/

Balanced Trees (has a 2-4 Tree Applet)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic19/

Augmented Data Structures (Good writings on the way trees can be utilised)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic20/

Different Coding Algorithms (has a section on Huffman Coding)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic21/

Huffman Trees (excellent theory information regarding the Huffman algorithm)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic22/

Graphs (lots of different graphs and there properties)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic25/

Depth-First Graph Searching (java Applet on DFS) (has info on complexity, different tours, etc.)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic26/

Breadth-First Search (java applet doesn't work in Opera, might work in IE, I don't know)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic27/

Minimum Spanning Trees (has a MST applet)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic28/

Shortest Path Algorithms (Dijkstra, indepth info, proofs, applet)
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic29/

---------------------------------------------------------------------

 

[mlando]

i find the oreilly books quit good. many are here.

 

[Slidey]

Big Java is the best book for an SDD course. It teaches Java whilst constantly keeping the software development cycle in mind. Also has sort algorithms.

 

[Slidey]

Jesus Christ I was confident about that, wasn't I? No, I'm sure better books than it exist. It's a good book, but it could be better; especially if you want to learn Java, not software engineering.

 

[dumarab]

Just use the Sun Microsystems resource it's the best.

 

[JustAnotherDan]

...which all seem ot think that polymorphism means that you have 2 mentods of the same name with different argument lists...

How can they mistake method overloading for polymorphism? I'm glad I dropped the subject.

I was doing SDD by correspondence last year, and our class was using VB. I dropped out, because I have dignity. (Oh, and the teacher was annoying)

A great resource authored by Josh Bloch aimed at intermediate developers is titled 'Effective Java'. It outlines a laundry-list of DOs and DON'Ts that should most definitely be taken into account when developing software solutions in Java.
There are plenty of other books that can be found at your local bookstore. However I recommend staying away from books in the 'For Dummies' series and the 'Learn x in 21 days' series.

For those wanting to start out, Sun's tutorial is quite reasonable for a free online resource (found here: http://java.sun.com/docs/books/tutorial/)
However, it lacks the substance that a good book will have, making programming concepts difficult to pick up for someone completely new to programming.