Home > Store

Discovering Modern C++, 2nd Edition

eBook (Watermarked)

  • Your Price: $31.99
  • List Price: $39.99
  • Includes EPUB and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    Adobe Reader PDF The popular standard, used most often with the free Adobe® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

Also available in other formats.

Register your product to gain access to bonus material or receive a coupon.


  • Copyright 2022
  • Pages: 576
  • Edition: 2nd
  • eBook (Watermarked)
  • ISBN-10: 0-13-679840-3
  • ISBN-13: 978-0-13-679840-8

As scientific and engineering projects grow larger and more complex, more are being written in C++. With embedded hardware growing more powerful, much of its software is moving to C++, too. When you master C++, you’ll gain strong skills for programming at nearly every level, from “close to the hardware” to the highest-level abstractions. In short, C++ is a language that scientific and technical practitioners need to know.
Peter Gottschling’s Discovering Modern C++, Second Edition is an intensive introduction that guides you smoothly to sophisticated approaches based on advanced features. Thoroughly updated for C++17 and C++ 20, this Second Edition introduces key concepts using examples from many technical problem domains, drawing on his extensive experience training professionals and teaching C++ to students of physics, math, and engineering.
This book is designed to help you get started rapidly and then master increasingly robust features, from lambdas to expression templates. You’ll also learn how to take advantage of the powerful libraries available to C++ programmers: both the Standard Template Library (STL) and scientific libraries for arithmetic, linear algebra, differential equations, and graphs. In this Second Edition, Gottschling also presents thorough and expert coverage of multi-threading and variadic templates.
Throughout, Gottschling demonstrates how to write clear and expressive software using object orientation, generics, metaprogramming, and procedural techniques. By the time you’re finished, you’ll have mastered all the abstractions you need to write C++ programs with exceptional quality and performance.



Download the code files from the author's GitHub site: https://github.com/petergottschling/dmc3

Sample Content

Sample Pages

Download the sample pages (includes Chapter 1)

Table of Contents



Chapter 1   C++ Basics                                                                              

1.1   Our First Program                                                                            

1.2   Variables                                                                                    

1.3   Operators                                                                                     

1.4   Expressions and Statements                                                                   

1.5   Functions                                                                                     

1.6   Error Handling                                                                               

1.7   I/O                                                                                          

1.8   Arrays, Pointers, and References                                                             

1.9   Structuring Software Projects                                                                

1.10 Exercises                                                                                     

Chapter 2   Classes                                                                                

2.4   Destructors                                                                                   

2.5   Method Generation R´esum´e                                                                   

2.6   Accessing Member Variables                                                                   

2.7   Operator Overloading Design                                                                  

2.8   Exercises                                                                                    

Chapter 3   Generic Programming                                                                     

3.1   Function Templates                                                                           

3.2   Namespaces and Function Lookup                                                               

3.3   Class Templates                                                                              

3.4   Type Deduction and Definition                                                                

3.5   A Little Bit of Theory on Templates: Concepts                                                 

3.6   Template Specialization                                                                      

3.7   Non-Type Parameters for Templates                                                            

3.8   Functors                                                                                      

3.9   Lambda                                                                                       

3.10 Variable Templates                                                                             

3.11 Variadic Templates                                                                            

3.12 Exercises                                                                                     

Chapter 4   Libraries                                                                               

4.1   Standard Template Library                                                                    

4.2   Numerics                                                                                      

4.3   Meta-programming                                                                             

4.4   Utilities                                                                                    

4.5   The Time Is Now                                                                               

4.6   Concurrency                                                                                  

4.7   Scientific Libraries Beyond the Standard                                                     

4.8   Exercises


Chapter 5   Meta-Programming                                                                       

5.1   Let the Compiler Compute                                                                     

5.2   Providing and Using Type Information                                                         

5.3   Expression Templates                                                                         

5.4   Meta-Tuning: Write Your Own Compiler Optimization                                    

5.5   Turing Completeness                                                                          

5.6   Exercises


Chapter 6   Object-Oriented Programming                                                            

6.1   Basic Principles                                                                             

6.2   Removing Redundancy                                                                           

6.3   Multiple Inheritance                                                                         

6.4   Dynamic Selection by Sub-typing                                                              

6.5   Conversion                                                                                    

6.6   CRTP                                                                                         

6.7   Exercises


Chapter 7   Scientific Projects                                                                    

7.1   Implementation of ODE Solvers                                                                

7.2   Creating Projects                                                                             

7.3   Some Final Words


Appendix A  Clumsy Stuff                                                                              

A.1  More Good and Bad Scientific Software                                                         

A.2  Basics in Detail                                                                              

A.2.4   Duff’s Device                                                                              

A.2.5   More about main                                                                           

A.3  Real-World Example: Matrix Inversion                                                           

A.4  Class Details                                                                                 

A.5  Method Generation                                                                             

A.5.1  Controlling the Generation                                                           

A.5.2   Generation Rules                                                                         

A.5.3  Pitfalls and Design Guides                                                             

A.6  Template Details                                                                              

A.6.1   Uniform Initialization                                                                   

A.6.2  Which Function Is Called?                                                            

A.6.3  Specializing for Specific Hardware                                                 

A.6.4   Variadic Binary I/O                                                                       

A.7  Using std::vector in C++03                                                                    

A.7.1  Using std::vector in C++03                                                          

A.7.2   variant                                                                                     

A.8  Dynamic Selection in Old Style                                                                

A.9  Meta-Programming Details                                                                      

A.9.1   First Meta-Program in History                                                       

A.9.2   Meta-Functions                                                                           

A.9.3  Backward-Compatible Static Assertion                                            

A.9.4  Anonymous Type Parameters                                                        

A.9.5  Benchmark Sources of Dynamic Unrolling                                      

A.9.6   Benchmark for Matrix Product


Appendix B  Programming Tools                                                                       

B.1  g++                                                                                           

B.2  Debugging                                                                                      

B.2.1  Text-Based Debugger                                                                  

B.2.2  Debugging with Graphical Interface: DDD                                      

B.3  Memory Analysis                                                                               

B.4  gnuplot                                                                                        

B.5  Unix, Linux, and Mac OS

Appendix C  Language Definitions                                                                    

C.1  Value Categories                                                                               

C.2  Operator Overview                                                                             

C.3  Conversion Rules                                                                              

C.3.1   Promotion                                                                                   

C.3.2   Other Conversions                                                                       

C.3.3   Usual Arithmetic Conversions                                                        

C.3.4   Narrowing                                                                                  




Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020