Data structures, algorithms, and applications in Java /

Saved in:
Bibliographic Details
Author / Creator:Sahni, Sartaj.
Imprint:Boston : McGraw-Hill, c2000.
Description:xxvi, [846] p. : ill. ; 25 cm.
Language:English
Subject:
Format: Print Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/4214803
Hidden Bibliographic Details
ISBN:007109217X
Notes:Includes bibliographical references and index.

MARC

LEADER 00000pam a22000004a 4500
001 4214803
003 ICU
005 20030529144200.0
008 990514s2000 maua b 001 0 eng
010 |a  99033211  
020 |a 007109217X 
035 |a 99033211 
040 |a DLC  |c DLC  |d NhCcYBP  |d OrLoB-B  |d OCoLC 
042 |a pcc 
050 0 0 |a QA76.73.J38  |b S24 2000 
082 0 0 |a 005.74  |2 21 
100 1 |a Sahni, Sartaj.  |0 http://id.loc.gov/authorities/names/n83065447  |1 http://viaf.org/viaf/195714756 
245 1 0 |a Data structures, algorithms, and applications in Java /  |c Sartaj Sahni. 
260 |a Boston :  |b McGraw-Hill,  |c c2000. 
300 |a xxvi, [846] p. :  |b ill. ;  |c 25 cm. 
336 |a text  |b txt  |2 rdacontent  |0 http://id.loc.gov/vocabulary/contentTypes/txt 
337 |a unmediated  |b n  |2 rdamedia  |0 http://id.loc.gov/vocabulary/mediaTypes/n 
338 |a volume  |b nc  |2 rdacarrier  |0 http://id.loc.gov/vocabulary/carriers/nc 
504 |a Includes bibliographical references and index. 
505 0 0 |g Pt. I.  |t Preliminaries.  |g Ch. 1.  |t Java Review.  |g Ch. 2.  |t Performance Analysis of Programs.  |g Ch. 3.  |t Asymptotic Notation.  |g Ch. 4.  |t Performance Measurement of Programs --  |g Pt. II.  |t Data Structures.  |g Ch. 5.  |t Linear Lists - Array Representation.  |g Ch. 6.  |t Linear Lists - Linked Representation.  |g Ch. 7.  |t Linear Lists - Simulated Pointers.  |g Ch. 8.  |t Arrays and Matrices.  |g Ch. 9.  |t Stacks.  |g Ch. 10.  |t Queues.  |g Ch. 11.  |t Skip Lists and Hashing.  |g Ch. 12.  |t Binary and Other Trees.  |g Ch. 13.  |t Priority Queues.  |g Ch. 14.  |t Tournament Trees.  |g Ch. 15.  |t Binary Search Trees.  |g Ch. 16.  |t Balanced Search Trees.  |g Ch. 17.  |t Graphs --  |g Pt. III.  |t Algorithm-Design Methods.  |g Ch. 18.  |t The Greedy Method.  |g Ch. 19.  |t Divide and Conquer.  |g Ch. 20.  |t Dynamic Programming.  |g Ch. 21.  |t Backtracking (On the Web).  |g Ch. 22.  |t Branch and Bound (On the Web). 
650 0 |a Java (Computer program language)  |0 http://id.loc.gov/authorities/subjects/sh95008574 
650 0 |a Data structures (Computer science)  |0 http://id.loc.gov/authorities/subjects/sh85035862 
650 0 |a Computer algorithms.  |0 http://id.loc.gov/authorities/subjects/sh91000149 
650 0 |a Application software  |x Development.  |0 http://id.loc.gov/authorities/subjects/sh95009362 
901 |a ToCBNA 
903 |a HeVa 
035 |a (OCoLC)170954818 
929 |a cat 
999 f f |i b66aaa61-c9d7-5d16-b7fe-f88b9e5870b4  |s 19bd650a-0a1a-5a0b-86a5-ddeb636eed20 
928 |t Library of Congress classification  |a QA76.73.J38 S24 2000  |l JCL  |c JCL-Sci  |i 4633955 
927 |t Library of Congress classification  |a QA76.73.J38 S24 2000  |l JCL  |c JCL-Sci  |e CRERAR  |b 55433477  |i 6714453