केन्द्रीय ग्रन्थालय | राष्ट्रीय प्रौद्योगिकी संस्थान गोवा

Central Library | National Institute of Technology Goa
Library Catalogue

Amazon cover image
Image from Amazon.com

Data structures and algorithms analysis in C++

By: Material type: TextTextPublication details: Noida: Pearson, 2013Edition: 3rdDescription: 607p.: 12x20x1; PaperbackISBN:
  • 9788131714744
Subject(s): DDC classification:
  • 005.73 WEI/DAT
Summary: About the book: The C++ language is brought up-to-date and simplified, and the Standard Template Library is now fully incorporated throughout the text. Data Structures and Algorithm Analysis in C++ is logically organized to cover advanced data structures topics from binary heaps to sorting to NP-completeness. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Notes Barcode
Reference Reference Central Library NIT Goa General stacks 005.73 WEI/DAT (Browse shelf(Opens below)) Not for loan Reference Book Rack number 37(A) 4207
Books Books Central Library NIT Goa General stacks 005.73 WEI/DAT (Browse shelf(Opens below)) Available Book Rack number 3(A) 4208
Books Books Central Library NIT Goa General stacks 005.73 WEI/DAT (Browse shelf(Opens below)) Available Book Rack number 3(A) 4209
Books Books Central Library NIT Goa General stacks 005.73 WEI/DAT (Browse shelf(Opens below)) Available Book Rack number 3(A) 4210
Books Books Central Library NIT Goa General stacks 005.73 WEI/DAT (Browse shelf(Opens below)) Available Book Rack number 3(A) 4211

About the book: The C++ language is brought up-to-date and simplified, and the Standard Template Library is now fully incorporated throughout the text. Data Structures and Algorithm Analysis in C++ is logically organized to cover advanced data structures topics from binary heaps to sorting to NP-completeness. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm.

There are no comments on this title.

to post a comment.
Koha Library Software is maintained by Library Team. For assistance contact to library@nitgoa.ac.in