wood burning stoves*
The moose likes Meaningless Drivel and the fly likes Data Structures and Algorithm Analysis Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login
JavaRanch » Java Forums » Other » Meaningless Drivel
Bookmark "Data Structures and Algorithm Analysis" Watch "Data Structures and Algorithm Analysis" New topic

Data Structures and Algorithm Analysis

Nick George
Ranch Hand

Joined: Apr 04, 2004
Posts: 815
Keep yer movin' finger steady, Ernest, I'm not actually asking about data structures.
So, they're shippin' the Big George off to a nearby college next year to take a computer science course, and I just found out that they're givin' me "Data Structures and Algorithm Analysis 203." However, I've found no description of the course anywhere. Anyone take such a course, and know what that means? I assume they're not just going to have me look at TreeSets for however many weeks...
[ May 05, 2004: Message edited by: Joseph George ]

I've heard it takes forever to grow a woman from the ground
Warren Dew
Ranch Hand

Joined: Mar 04, 2004
Posts: 1332
In my experience, 'data structures' courses are just that - courses on structuring and organizing data, whether into c structs or Java objects. 'Algorithm analysis' I would guess to involve functional decomposition and similar issues.
If I'm right, it's a good course, focusing on the fundamental issues of software engineering rather than on any particular language.
fred rosenberger
lowercase baba

Joined: Oct 02, 2003
Posts: 11229

I had two Algorithms/Data structures classes. I think one was a 200 level class. We talked about 3-4 basic sorts (bubble, insert, maybe one more), and then a bunch of data structures. we coded our own stacks, queues, linked lists, etc.
The class was in C, so there was a major amount of coding being done for each project.
i also had a 300 level class. in it, we did a LOT of math, and figuring out which sort is the most efficient... which came in handy at work when they were using a quick-sort to insert 1000 or so records into an already sorted list of millions (by writting an insertion sort, i cut execution time from 20+ hours to 30 minutes (and old VMS mainframe)).
At any rate, it was a lot more mathy, and less code-y.
hope that helps.

There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
Stefan Wagner
Ranch Hand

Joined: Jun 02, 2003
Posts: 1923

I recently bought 'Algorithms in C++' from guru Sedgewick at ebay, and think, it's renamed to 'Algorithms and data structures' in newer prints.
I guess you will find a detailed description/ chapter overview at amazon.
I will only need it from time to time, but I guess it's in general essential.

Damien Howard
Ranch Hand

Joined: Apr 01, 2003
Posts: 456
It is the 2nd programming course you take right after intro to programming. If you know about trees sorting shortest path algorithms etc then it will be an easy review.
Arjun Shastry
Ranch Hand

Joined: Mar 13, 2003
Posts: 1874
Sedgewick has also another volume "Graph Algorithms Part 5" and another one "Analysis of Algorithms" ,this copy is rarely available.Anybody dared to read "The Art of Computer Programming" by D E Knuth?

HS Thomas
Ranch Hand

Joined: May 15, 2002
Posts: 3404
Data Structures and Algorithm Analysis in Java, by Mark Allen Weiss.link
I agree. Here's the link: http://aspose.com/file-tools
subject: Data Structures and Algorithm Analysis