000 02200mam a22003494a 4500
001 2619846
003 BD-DhUL
005 20140807150054.0
008 990514s2000 ilua b 001 0 eng
010 _a 99033211
020 _a007109217X (alk. paper)
020 _a0071169008
035 _a(OCoLC)ocm41412055
040 _aDLC
_cDLC
_dOrLoB-B
042 _apcc
050 0 0 _aQA76.73.J38
_bS24 2000
082 0 0 _a005.74
_221
_bSAD
100 1 _aSahni, Sartaj.
245 1 0 _aData structures, algorithms, and applications in Java /
_cSartaj Sahni.
260 _aBoston :
_bMcGraw-Hill,
_cc2000.
300 _axxvi, 833 p. :
_bill. ;
_c24 cm. +
_e1 computer optical disc (4 3/4 in.)
365 _aUSD
_b24.95
504 _aIncludes bibliographical references and index.
505 0 0 _gPt. I.
_tPreliminaries.
_gCh. 1.
_tJava Review.
_gCh. 2.
_tPerformance Analysis of Programs.
_gCh. 3.
_tAsymptotic Notation.
_gCh. 4.
_tPerformance Measurement of Programs --
_gPt. II.
_tData Structures.
_gCh. 5.
_tLinear Lists - Array Representation.
_gCh. 6.
_tLinear Lists - Linked Representation.
_gCh. 7.
_tLinear Lists - Simulated Pointers.
_gCh. 8.
_tArrays and Matrices.
_gCh. 9.
_tStacks.
_gCh. 10.
_tQueues.
_gCh. 11.
_tSkip Lists and Hashing.
_gCh. 12.
_tBinary and Other Trees.
_gCh. 13.
_tPriority Queues.
_gCh. 14.
_tTournament Trees.
_gCh. 15.
_tBinary Search Trees.
_gCh. 16.
_tBalanced Search Trees.
_gCh. 17.
_tGraphs --
_gPt. III.
_tAlgorithm-Design Methods.
_gCh. 18.
_tThe Greedy Method.
_gCh. 19.
_tDivide and Conquer.
_gCh. 20.
_tDynamic Programming.
_gCh. 21.
_tBacktracking (On the Web).
_gCh. 22.
_tBranch and Bound (On the Web).
520 1 _a"Data Structures, Algorithms, and Applications in Java provides comprehensive coverage of fundamental data structures, making it ideal for use in a CS2 course. Sahni has made this text the most student friendly of all his text-books by using a gentle introduction, providing intuitive discussions, and including real-world applications."--BOOK JACKET.
650 0 _aJava (Computer program language)
650 0 _aData structures (Computer science)
650 0 _aComputer algorithms.
650 0 _aApplication software
_xDevelopment.
900 _aAUTH
_bTOC
942 _2ddc
_cBK
999 _c1160
_d1160