Advanced Data Structures in C++ Book by Vic Broquard
Home > Computer & Internet > Computer programming / software development > Software engineering > Advanced Data Structures in C++
Advanced Data Structures in C++

Advanced Data Structures in C++


     0     
5
4
3
2
1



International Edition


About the Book

After a complete review of basic class construction with which you should be familiar, Advanced Data Structures in C++ covers more advanced features of classes. Among these are forward references, class enumerated data types, friend functions, constant data members, static data members, static member functions, reference variables that are data members, methods of inlining functions and how to make a production library. Next, Advanced Data Structures in C++ covers in depth all of the various operator overloaded functions; there are a rather large number of them. Then, the principles of inheritance are fully covered. Virtual functions are presented along with the need for them. Examples clearly illustrate their usage. Abstract base classes and pure virtual functions are presented with a significant example of their usage. Advanced Data Structures in C++ discusses C++ error handling in depth along with dynamic casting and run time type identification. How "out of memory" errors are caught is discussed in depth, since Microsoft's VC 7 (and subsequent compilers) new function now no longer returns 0 when short of memory. The design of a hierarchy of exception classes is presented showing how an application can fully utilize the C++ error handling mechanism. Also, how to replace the new and delete functions, replacing the terminate and unexpected error handlers is shown. Next, Advanced Data Structures in C++ presents a full review of the four basic container classes, including the growable array, double linked list, stack and queue. C++ programming templates are covered in depth followed by an example of converting the double linked list into a template class. How client programs are written using these template classes is presented next. A thorough discussion of binary files and hashing techniques comes next. Direct file processing techniques cover the relative record number method, the remainder method and ISAM (Indexed Sequential Access Method). How to write master file update programs is discussed in depth. The impact of structure alignment is visibly shown. Then, Advanced Data Structures in C++ shows the need for hashing techniques. Hence, various methods of hashing are presented. Trees are discussed in depth next, including notation and needed functions and tree operations, such as inserting a new node and deleting a node. Advanced Data Structures in C++ shows a complete example of a binary search tree using an ISAM data base. Advanced Data Structures in C++'s chapter on sorting algorithms presents five different methods in detail. It also implements a benchmark program you can use for comparison purposes. B-trees and their variations are covered next. A complete implementation of an AVL tree is presented. Advanced Data Structures in C++ discusses graphs, priority queues and heaps in detail. Network operations are also shown. The sample program illustrates graphs in depth including showing the shortest path. The examples show how to produce useful formatted results, not just theoretical displays. Next, sets and maps are discussed. Set implementations include the set as an array and the set as a bit vector. The map structure is used to show the very beginning steps of data compression routines. The STL (Standard Template Library) is introduced. How they are created and used is discussed. Examples show how to use the basic container classes. The last chapter of Advanced Data Structures in C++ presents the theory of complex program analysis and included the big-O notation. However, I have kept the level of math low for those who are weak on higher mathematical procedures. The concepts should be easily understood and can be utilized by anyone to estimate the performance of a routing. An appendix shows in depth how to use the new Microsoft VC (.NET) compiler to build and debug C++ programs. Each chapter of Advanced Data Structures in C++ has a set of Review Questions and Programming Problems to solve.


Best Sellers



Product Details
  • ISBN-13: 9781941415559
  • Publisher: Broquard eBooks
  • Publisher Imprint: Broquard eBooks
  • Height: 279 mm
  • No of Pages: 626
  • Series Title: English
  • Weight: 1477 gr
  • ISBN-10: 1941415555
  • Publisher Date: 05 Sep 2014
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Spine Width: 32 mm
  • Width: 216 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Advanced Data Structures in C++
Broquard eBooks -
Advanced Data Structures in C++
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Advanced Data Structures in C++

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!