HemGrupperDiskuteraMerTidsandan
Sök igenom hela webbplatsen
Denna webbplats använder kakor för att fungera optimalt, analysera användarbeteende och för att visa reklam (om du inte är inloggad). Genom att använda LibraryThing intygar du att du har läst och förstått våra Regler och integritetspolicy. All användning av denna webbplats lyder under dessa regler.

Resultat från Google Book Search

Klicka på en bild för att gå till Google Book Search.

Data Structures and Algorithms in Java (2nd…
Laddar...

Data Structures and Algorithms in Java (2nd Edition) (utgåvan 2002)

av Robert Lafore

MedlemmarRecensionerPopularitetGenomsnittligt betygDiskussioner
801332,907 (4.17)Ingen/inga
Appropriate for all courses in data structures and algorithms, and for many intermediate-to-advanced level courses in Java programming. Many students view data structures and algorithms as difficult to understand, but this book thoroughly demystifies them. Working in Java, Robert Lafore presents each essential data structure and algorithm, using clear and simple example programs accessible through a Web browser-based "Workshop Applets." These programs demonstrate graphically exactly what each data structure looks like and how it works.   Coverage includes: arrays, stacks, queues, simple and advanced sorts, linked lists, recursion, binary trees, red-black trees, 2-3-4 trees, external storage, hash tables, heaps, weighted graphs, and more. For this edition, Lafore has rewritten each program to improve its operation, clarify the algorithms it illustrates, and reflect the latest versions of the Java 2 SDK. Lafore has also added brand-new questions and exercises at the end of every chapter. The result: students gain deep mastery over today's best practices and approaches for manipulating virtually any form of data with Java.… (mer)
Medlem:elarsen
Titel:Data Structures and Algorithms in Java (2nd Edition)
Författare:Robert Lafore
Info:Sams (2002), Edition: 2, Hardcover, 800 pages
Samlingar:Ditt bibliotek
Betyg:
Taggar:Ingen/inga

Verksinformation

Data Structures and Algorithms in Java av Robert Lafore

Ingen/inga
Laddar...

Gå med i LibraryThing för att få reda på om du skulle tycka om den här boken.

Det finns inga diskussioner på LibraryThing om den här boken.

Assigned text for a course in Data Structurs and Algorithms. Reasonably good explanations of the material, but the code provided is idiosyncratic and often awkward to follow, and there are some odd lapses. As an example of an odd lapse, LaFore's discussion of red-black trees cites "four rules" which define this structure. These are: 1) Every node is either red or black 2) the root of the tree is always black. 3) no red node has a red child and 4) every path from root to an empty node must contain the same number of black nodes. These rules are meant to ensure that the tree is balanced, but there's a fifth and later a sixth which are required, and not really discussed in any systematic fashion. The student (and in my case, the teacher) must stop and reconfigure the text to make it all hold together - a good learning opportunity, but not an example of a good textbook.

The text is supplemented by applets for each major area discussed, which would be much more useful if the author didn't feel the need to occupy 8-10 pages in any given chapter explaining how to use his fairly simple explanatory devices. ( )
  kiparsky | Jul 4, 2009 |
inga recensioner | lägg till en recension
Du måste logga in för att ändra Allmänna fakta.
Mer hjälp finns på hjälpsidan för Allmänna fakta.
Vedertagen titel
Information från den engelska sidan med allmänna fakta. Redigera om du vill anpassa till ditt språk.
Originaltitel
Alternativa titlar
Första utgivningsdatum
Personer/gestalter
Viktiga platser
Viktiga händelser
Relaterade filmer
Motto
Dedikation
Information från den engelska sidan med allmänna fakta. Redigera om du vill anpassa till ditt språk.
This book is dedicated to my readers, who have rewarded me over the years not only by buying my books, but with helpful suggestions and kind words. Thanks to you all!
Inledande ord
Citat
Avslutande ord
Särskiljningsnotis
Förlagets redaktörer
På omslaget citeras
Ursprungsspråk
Kanonisk DDC/MDS
Kanonisk LCC

Hänvisningar till detta verk hos externa resurser.

Wikipedia på engelska

Ingen/inga

Appropriate for all courses in data structures and algorithms, and for many intermediate-to-advanced level courses in Java programming. Many students view data structures and algorithms as difficult to understand, but this book thoroughly demystifies them. Working in Java, Robert Lafore presents each essential data structure and algorithm, using clear and simple example programs accessible through a Web browser-based "Workshop Applets." These programs demonstrate graphically exactly what each data structure looks like and how it works.   Coverage includes: arrays, stacks, queues, simple and advanced sorts, linked lists, recursion, binary trees, red-black trees, 2-3-4 trees, external storage, hash tables, heaps, weighted graphs, and more. For this edition, Lafore has rewritten each program to improve its operation, clarify the algorithms it illustrates, and reflect the latest versions of the Java 2 SDK. Lafore has also added brand-new questions and exercises at the end of every chapter. The result: students gain deep mastery over today's best practices and approaches for manipulating virtually any form of data with Java.

Inga biblioteksbeskrivningar kunde hittas.

Bokbeskrivning
Haiku-sammanfattning

Pågående diskussioner

Ingen/inga

Populära omslag

Snabblänkar

Betyg

Medelbetyg: (4.17)
0.5
1
1.5
2
2.5
3
3.5 1
4 1
4.5
5 1

Är det här du?

Bli LibraryThing-författare.

 

Om | Kontakt | LibraryThing.com | Sekretess/Villkor | Hjälp/Vanliga frågor | Blogg | Butik | APIs | TinyCat | Efterlämnade bibliotek | Förhandsrecensenter | Allmänna fakta | 203,287,286 böcker! | Topplisten: Alltid synlig