MARC record from Internet Archive

LEADER: 07880cam 22005654a 4500
001 ocm46508303
003 OCoLC
005 20220915130012.0
008 010314s2001 maua b 001 0 eng
010 $a 2001030694
040 $aDLC$beng$cDLC$dUBY$dFBR$dTXA$dBAKER$dBTCTA$dYDXCP$dOCLCG$dOCLCQ$dIG#$dBDX$dHDC$dOCLCF$dOCLCO$dEUM$dKASET$dOCLCQ$dTHHCU$dCSJ$dOCLCQ$dOCLCO
019 $a48248736$a813395074$a891155556$a992203281
020 $a0072369647
020 $a9780072369649
020 $a0071121846$q(ISE)
020 $a9780071121842$q(ISE)
035 $a(OCoLC)46508303$z(OCoLC)48248736$z(OCoLC)813395074$z(OCoLC)891155556$z(OCoLC)992203281
042 $apcc
050 00 $aQA76.73.J38$bC657 2002
082 00 $a005.7/3$221
100 1 $aCollins, William J.$q(William Joseph)
245 10 $aData structures and the Java collections framework /$cWilliam J. Collins.
250 $a1st ed.
260 $aBoston :$bMcGraw-Hill,$c2001.
300 $axx, 716 pages :$billustrations ;$c24 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
500 $aIncludes index.
505 00 $gChapter 1$tImportant Features of Java$g1 --$g1.1$tClasses$g2 --$gProgramming Project 1.1$tDeveloping and Using a Sequence Class$g37 --$gChapter 2$tInterfaces and Collection Classes$g39 --$g2.1$tAbstract Methods and Abstract Classes$g40 --$g2.2$tInterfaces$g41 --$g2.3$tArrays$g45 --$g2.4$tCollection Classes$g46 --$g2.5$tStorage Structures for Collection Classes$g48 --$gProgramming Project 2.1$tExpanding the LinkedCollection Class$g62 --$gChapter 3$tIntroduction to Software Engineering$g65 --$g3.1$tThe Software Development Life Cycle$g66 --$g3.2$tProblem Analysis$g66 --$g3.3$tProgram Design$g69 --$g3.4$tProgram Implementation$g73 --$g3.5$tProgram Maintenance$g86 --$gProgramming Project 3.1$tFurther Expansion of the LinkedCollection Class$g91 --$gChapter 4$tRecursion$g93 --$g4.2$tFactorials$g94 --$g4.3$tDecimal to Binary$g98 --$g4.4$tTowers of Hanoi$g102 --$g4.5$tBacktracking$g111 --$g4.6$tBinary Search$g120 --$g4.7$tIndirect Recursion$g131 --$g4.8$tThe Cost of Recursion$g132 --$gProgramming Project 4.1$tIterative Version of Towers of Hanoi$g142 --$gProgramming Project 4.2$tEight Queens$g144 --$gProgramming Project 4.3$tA Knight's Tour$g146 --$gChapter 5$tArray Lists$g149 --$g5.1$tThe List Interface$g150 --$g5.2$tThe ArrayList Class$g151 --$g5.3$tThe ArrayList Implementation$g162 --$g5.4$tApplication: High-Precision Arithmetic$g169 --$g5.5$tThe Vector Class$g175 --$gProgramming Project 5.1$tExtending the VeryLongInt Class$g179 --$gProgramming Project 5.2$tThe Deque Class$g180 --$gChapter 6$tLinked Lists$g185 --$g6.1$tThe LinkedList Class$g186 --$g6.2$tApplication: A Line Editor$g211 --$gProgramming Project 6.1$tExtending the Line Editor$g226 --$gProgramming Project 6.2$tAlternative Design and Implementation of the LinkedList Class$g231 --$gChapter 7$tQueues and Stacks$g233 --$g7.1$tQueues$g234 --$g7.2$tComputer Simulation$g242 --$g7.3$tApplication: A Simulated Car Wash$g244 --$g7.4$tStacks$g251 --$g7.5$tApplication: How Compilers Implement Recursion$g254 --$g7.6$tApplication: Converting From Infix to Postfix$g257 --$gProgramming Project 7.1$tExtending Speedo's Car Wash$g270 --$gProgramming Project 7.2$tRun-Time Evaluation of a Condition$g272 --$gProgramming Project 7.3$tAn Iterative Version of Maze-Search$g276 --$gChapter 8$tBinary Trees and Binary Search Trees$g277 --$g8.1$tDefinition and Properties of Binary Trees$g278 --$g8.2$tBinary Search Trees$g294 --$gProgramming Project 8.1$tAn Alternative Design and Implementation of the Binary-Search-Tree Data Structure$g321 --$gChapter 9$tBalanced Binary Search Trees$g323 --$g9.1$tA Problem with Binary Search Trees$g324 --$g9.2$tRotations$g324 --$g9.3$tAVL Trees$g329 --$g9.4$tRed-Black Trees$g348 --$gProgramming Project 9.1$tDefining the remove Method in the AVLTree Class$g360 --$gChapter 10$tTree Maps and Tree Sets$g361 --$g10.1$tThe TreeMap Class$g362 --$g10.2$tApplication: TreeMap Objects: A Simple Thesaurus$g389 --$g10.3$tThe TreeSet Class$g395 --$g10.4$tApplication: A Simple Spell-Checker$g399 --$gProgramming Project 10.1$tEnhancing the SpellChecker Project$g408 --$gProgramming Project 10.2$tDetermining Word Frequencies$g410 --$gProgramming Project 10.3$tBuilding a Concordance$g412 --$gChapter 11$tPriority Queues$g415 --$g11.2$tDefinition of the PriorityQueue Interface$g417 --$g11.3$tImplementations of the PriorityQueue Interface$g417 --$g11.4$tApplication: Huffman Codes$g432 --$gProgramming Project 11.1$tDecoding a Huffman-Encoded Message$g450 --$gChapter 12$tSorting$g453 --$g12.2$tInsertion Sort$g454 --$g12.3$tHow Fast Can We Sort?$g457 --$g12.4$tFast Sorts$g459 --$gProgramming Project 12.1$tFile Sorting$g491 --$gChapter 13$tSearching and the Hash Classes$g495 --$g13.1$tA Framework to Analyze Searching$g496 --$g13.2$tReview of Searching$g496 --$g13.3$tThe HashMap Class$g499 --$g13.4$tThe HashSet Class$g517 --$g13.5$tOpen-Address Hashing$g517 --$gProgramming Project 13.1$tComparing Chained Hashing and Open-Address Hashing$g538 --$gChapter 14$tGraphs, Trees, and Networks$g539 --$g14.1$tUndirected Graphs$g540 --$g14.2$tDirected Graphs$g543 --$g14.3$tTrees$g544 --$g14.4$tNetworks$g545 --$g14.5$tGraph Algorithms$g547 --$g14.6$tDeveloping a Network Class$g563 --$g14.7$tBacktracking through a Network$g582 --$gProgramming Project 14.1$tCompleting the Implementation of the Network Class under the Adjacency-Matrix Design$g589 --$gProgramming Project 14.2$tA Network Search$g590 --$gAppendix 1$tMathematical Background$g593 --$gA1.2$tFunctions and Sequences$g593 --$gA1.3$tSums and Products$g594 --$gA1.4$tLogarithms$g595 --$gA1.5$tMathematical Induction$g597 --$gAppendix 2$tThe GUI and GUIListener Classes$g607 --$gA2.2$tThreads$g608 --$gA2.3$tImplementing the Process Interface$g610 --$gA2.4$tThe GUI Class$g611 --$gA2.5$tThe GUIListener Class$g615 --$gA2.6$tPutting It All Together$g617 --$gAppendix 3$tThe Java Collections Framework$g619 --$gA3.2$tThe Collection Interface$g619 --$gA3.3$tThe List Interface$g621 --$gA3.4$tThe Listlterator Interface$g623 --$gA3.5$tThe Set Interface$g625 --$gA3.6$tThe Map Interface$g627 --$gA3.7$tThe ArrayList Class$g630 --$gA3.8$tThe LinkedList Class$g643 --$gA3.9$tThe TreeSet Class$g662 --$gA3.10$tThe TreeMap Class$g674 --$gA3.11$tThe HashSet Class$g689 --$gA3.12$tThe HashMap Class$g698.
504 $aIncludes bibliographical references (pages 709-710) and index.
520 $aThis student-friendly text is designed for a course in data structures where the implementation language is Java. The focus is on teaching students how to apply the concepts presented, therefore many applications and examples are included.
650 0 $aJava (Computer program language)
650 0 $aData structures (Computer science)
650 6 $aJava (Langage de programmation)
650 6 $aStructures de données (Informatique)
650 7 $aData structures (Computer science)$2fast$0(OCoLC)fst00887978
650 7 $aJava (Computer program language)$2fast$0(OCoLC)fst00982065
776 08 $iOnline version:$aCollins, William J. (William Joseph).$tData structures and the Java collections framework.$b1st ed.$dBoston : McGraw-Hill, 2001$w(OCoLC)754555934
856 41 $3Table of contents$uhttp://catdir.loc.gov/catdir/toc/mh021/2001030694.html
856 42 $3Publisher description$uhttp://catdir.loc.gov/catdir/description/mh021/2001030694.html
938 $aBaker & Taylor$bBKTY$c115.75$d115.75$i0072369647$n0003708068$sactive
938 $aBrodart$bBROD$n57405182$c$50.00
938 $aBaker and Taylor$bBTCP$n2001030694
938 $aIngram$bINGR$n9780072369649
938 $aYBP Library Services$bYANK$n100278699
029 1 $aAU@$b000022553657
029 1 $aNZ1$b6170510
994 $aZ0$bGTX
948 $hNO HOLDINGS IN GTX - 100 OTHER HOLDINGS