Online Public Access Catalogue (OPAC)
Central Library - Vidyasagar University

“Education does not only mean learning, reading, writing, and arithmetic,

it should provide a comprehensive knowledge”

-Ishwarchandra Vidyasagar


Normal view MARC view ISBD view

Advanced Data Structures [ electronic resource ] / by Peter Brass.

By: Brass, Peter.
Material type: TextTextPublisher: Cambridge: Cambridge University Press , 2011ISBN: 9780511800191 ( e-book ).Subject(s): Computer Science | Algorithmics | Complexity | Computer Algebra | Computational GeometryGenre/Form: Electronic booksDDC classification: 005.1 Online resources: https://doi.org/10.1017/CBO9780511800191 View to click Summary: This text closely examines ideas, analysis, and implementation details of data structures as a specialised topic in applied algorithms. It looks at efficient ways to realise query and update operations on sets of numbers, intervals, or strings by various data structures, including: search trees; structures for sets of intervals or piece-wise constant functions; orthogonal range search structures; heaps; union-find structures; dynamization and persistence of structures; structures for strings; and hash tables. Instead of relegating data structures to trivial material used to illustrate object-oriented programming methodology, this is the first volume to show data structures as a crucial algorithmic topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text.
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 Status Date due Barcode
E-Book E-Book WWW
005.1 BRA/A (Browse shelf) Available EB152

This text closely examines ideas, analysis, and implementation details of data structures as a specialised topic in applied algorithms. It looks at efficient ways to realise query and update operations on sets of numbers, intervals, or strings by various data structures, including: search trees; structures for sets of intervals or piece-wise constant functions; orthogonal range search structures; heaps; union-find structures; dynamization and persistence of structures; structures for strings; and hash tables. Instead of relegating data structures to trivial material used to illustrate object-oriented programming methodology, this is the first volume to show data structures as a crucial algorithmic topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha