Welcome to UE Central Library

Keep Smiling

Data structures and problem solving using Java (Record no. 15947)

MARC details
000 -LEADER
fixed length control field 01085nam a22002177a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200903111824.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 181116b ||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780201549911
040 ## - CATALOGING SOURCE
Transcribing agency PK-IsLIS
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.73
Item number W4361
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Weiss, Mark Allen
245 ## - TITLE STATEMENT
Title Data structures and problem solving using Java
Statement of responsibility, etc / Mark Allen Weiss
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc USA :
Name of publisher, distributor, etc Addison Wesley,
Date of publication, distribution, etc 1999
300 ## - PHYSICAL DESCRIPTION
Extent xxxii, 780 p.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data structures (Computer science
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Java (Computer program language)
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Problem solving--Data processing
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer algorithms
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Books
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 1. Primitive java <br/>2. References <br/>3. Objects and classes <br/>4. Inheritance <br/>5. Data structures<br/>6. Recurison <br/>7. Sorting algorithms <br/>8. Ranomization <br/>9. Stacks and compilers <br/>10. Utilities <br/>11. Simulation <br/>12. Graphs and paths <br/>13. Stacks and queues <br/>14. Linked lists<br/>15. Trees <br/>16. Binary search trees<br/>17. Hash tables <br/>18. A priority queue: the binary heap <br/>19. Splay trees <br/>20. Meging priority queues <br/>21. The disjoint set class<br/>
Holdings
Withdrawn status Damaged status Not for loan Home library Current library Date acquired Source of acquisition Full call number Barcode Date last seen Price effective from Koha item type
      UE-Central Library UE-Central Library 16.11.2018 U.E.24099 005.73 W4361 T9703 16.11.2018 16.11.2018 Books
Copyright © 2023, University of Education, Lahore. All Rights Reserved.
Email:centrallibrary@ue.edu.pk