Data structures and algorithms in java / Adam Drozdek.
Material type:
TextPublication details: Boston, Mass. Thomson/Course Technology, 2007Edition: Second editionDescription: xvi, 752 pages. : illustrations ; 25 cmISBN: 978-0534492526Subject(s): JAVA (COMPUTER PROGRAM LANGUAGE) | DATA STRUCTURES (COMPUTER SCIENCE) | COMPUTER ALGORITHMSLOC classification: QA 76.73.J38 .D76 2007
Books
| Item type | Current library | Home library | Collection | Shelving location | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|---|---|
|
Books
|
LRC - Main | National University - Manila | Computer Science | General Circulation | GC QA 76.73.J38 .D76 2007 (Browse shelf (Opens below)) | c.1 | Available | NULIB000002559 |
Browsing National University - Manila shelves, Shelving location: General Circulation, Collection: Computer Science Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| GC QA 76.73.C154 .M87 2010 Murach's C# 2010 : training & reference / | GC QA 76.73.J38 .C43 2014 Core Java professional / | GC QA 76.73.J38 .D45 2015 Java how to program: early objects / | GC QA 76.73.J38 .D76 2007 Data structures and algorithms in java / | GC QA 76.73.J38 .F37 2012 Java programming / | GC QA 76.73.J38 .H67 2017 vol.2 Core java: volume II advanced features / | GC QA 76.73.J38 .K62 2010 Data structures : Abstraction and design using java / |
Includes index.
1. Object-Oriented Programming Using Java 2. Complexity Analysis 3. Linked Lists 4. Stacks and Queues 5. Recursion 6. Binary Trees 7. Multiway Trees 8. Graphs 9. Sorting 10. Hashing 11. Data Compression 12. Memory Management 13. String Matching Appendix A: Computing BIG-O Appendix B: NP-Completeness
Using the Java programming language, author Adam Drozdek highlights three important aspects of data structures and algorithms. First, the book places special emphasis on the connection between data structures and their algorithms, including an analysis of the algorithms' complexity. Second, the book presents data structures in the context of object-oriented program design, stressing the principle of information hiding in its treatment of encapsulation and decomposition. Finally, the book closely examines data structure implementation. Overall, this practical and theoretical book prepares students with a solid foundation in data structures for future courses and work in design implementation, testing, or maintenance of virtually any software system.
There are no comments on this title.