FUTMinna Library

Your cart is empty.
Normal view MARC view ISBD view

A concise introduction to data structures using Java / by Mark J. Johnson.- (Print resources)

By: Johnson, Mark J. (Mark James), 1961- [ (Author)].
Material type: materialTypeLabelBookSeries: Chapman & Hall/CRC textbooks in computing: Publisher: Boca Raton: CRC/Taylor & Francis Group, c2014Description: xvii, 218p.: ill.; 24cm.Content type: text Media type: computer Carrier type: online resourceSubject(s): Data structures (Computer science) -- Textbooks | Java (Computer program language) -- Textbooks | COMPUTERS -- Programming Languages -- General | MATHEMATICS -- General | MATHEMATICS -- Advanced | Data structures (Computer science) | Java (Computer program language) | Datenstruktur | JavaGenre/Form: Textbooks.DDC classification: 005.2/762
Contents:
Machine generated contents note: 1.A Brief Introduction to Java -- 1.1. Basics -- 1.2. Strings -- 1.3. Arrays -- 1.4. Using Objects -- 1.5. Writing Classes -- 2. Algorithm Analysis -- 2.1. Big-O Notation -- 2.2. Sorting: Insertion Sort -- 2.3. Searching: Binary Search -- 3. Integer Stacks -- 3.1. Stack Interface -- 3.2. Array Implementation -- 3.3. Linked Implementation -- 4. Generic Stacks -- 4.1. Generic Types -- 4.2. Generic Stack Implementations -- 4.3. Evaluating Expressions: Background -- 4.4. Evaluating Expressions: Implementations -- 5. Queues -- 5.1. Interface and Linked Implementation -- 5.2. Array Implementation -- 5.3. Inheritance: Fixed-Length Queues -- Project: Fixed-Length Queue Simulation -- 6. Lists -- 6.1. Interface -- 6.2. Array Implementation -- 6.3. Linked Implementation -- 6.4. Iterators -- 7. Recursion -- 7.1. Mathematical Functions -- 7.2. Visualizing Recursion -- 7.3. Recursive and Generalized Searches -- 7.4. Applications -- 8. Trees -- 8.1. Definitions and Examples -- 8.2. Traversals -- 8.3. Binary Tree Abstract Class -- Project: A Collection Hierarchy -- 9. Binary Search Trees -- 9.1. Queries -- 9.2. Insertion -- 9.3. Deletion -- 9.4. Performance -- 10. Heaps -- 10.1. Priority Queue Interface and Array-Based Heaps -- 10.2. Insertion and Deletion -- 10.3. Buildheap and Heapsort -- Project: Event-Based Simulation -- 11. Hash Tables -- 11.1. Map Interface and Linked Implementation -- 11.2. Hash Tables -- 11.3. Chaining -- 11.4. Linear Probing.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Copy number Status Date due Barcode
Books,Booklets,Workbooks Books,Booklets,Workbooks IBB Library-Gidan Kwano
QA76.9.D33.J64 2014 (Browse shelf) nc 1 Available 2342132251
Books,Booklets,Workbooks Books,Booklets,Workbooks IBB Library-Gidan Kwano
QA76.9.D33.J64 2014 (Browse shelf) nc 2 Available 2342132252
Books,Booklets,Workbooks Books,Booklets,Workbooks IBB Library-Gidan Kwano
QA76.9.D33.J64 2014 (Browse shelf) nc 3 Available 2342132253
Books,Booklets,Workbooks Books,Booklets,Workbooks IBB Library-Gidan Kwano
QA76.9.D33.J64 2014 (Browse shelf) nc 4 Available 2342132254
Books,Booklets,Workbooks Books,Booklets,Workbooks IBB Library-Gidan Kwano
QA76.9.D33.J64 2014 (Browse shelf) nc 5 Available 2342132255

Academic

Includes bibliographical references (pages 201-202) and index.

Machine generated contents note: 1.A Brief Introduction to Java -- 1.1. Basics -- 1.2. Strings -- 1.3. Arrays -- 1.4. Using Objects -- 1.5. Writing Classes -- 2. Algorithm Analysis -- 2.1. Big-O Notation -- 2.2. Sorting: Insertion Sort -- 2.3. Searching: Binary Search -- 3. Integer Stacks -- 3.1. Stack Interface -- 3.2. Array Implementation -- 3.3. Linked Implementation -- 4. Generic Stacks -- 4.1. Generic Types -- 4.2. Generic Stack Implementations -- 4.3. Evaluating Expressions: Background -- 4.4. Evaluating Expressions: Implementations -- 5. Queues -- 5.1. Interface and Linked Implementation -- 5.2. Array Implementation -- 5.3. Inheritance: Fixed-Length Queues -- Project: Fixed-Length Queue Simulation -- 6. Lists -- 6.1. Interface -- 6.2. Array Implementation -- 6.3. Linked Implementation -- 6.4. Iterators -- 7. Recursion -- 7.1. Mathematical Functions -- 7.2. Visualizing Recursion -- 7.3. Recursive and Generalized Searches -- 7.4. Applications -- 8. Trees -- 8.1. Definitions and Examples -- 8.2. Traversals -- 8.3. Binary Tree Abstract Class -- Project: A Collection Hierarchy -- 9. Binary Search Trees -- 9.1. Queries -- 9.2. Insertion -- 9.3. Deletion -- 9.4. Performance -- 10. Heaps -- 10.1. Priority Queue Interface and Array-Based Heaps -- 10.2. Insertion and Deletion -- 10.3. Buildheap and Heapsort -- Project: Event-Based Simulation -- 11. Hash Tables -- 11.1. Map Interface and Linked Implementation -- 11.2. Hash Tables -- 11.3. Chaining -- 11.4. Linear Probing.

Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK). UkOxU

Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force. UkOxU

Description based on print version record.

B-37624/SABA/22/06/18

There are no comments for this item.

Log in to your account to post a comment.