Home > Store

Essential C++ for Engineers and Scientists, 2nd Edition

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

Essential C++ for Engineers and Scientists, 2nd Edition

Book

  • Your Price: $135.99
  • List Price: $159.99
  • Usually ships in 24 hours.

About

Features

  • NEW - NEW! Code updated to comply with ANSI C++ Standard.
  • NEW - NEW! Material on member operators and more coverage of member functions.
  • NEW - NEW! 50% more programming projects to choose from.
  • NEW - NEW! Two new case studies with full algorithm development.
  • NEW - NEW! Expanded coverage of files.
  • NEW - NEW! Uses structs.
  • NEW - NEW! Contains an appendix on C for readers who want to use this language.
  • NEW - NEW! Additional appendixes on both Borland and Visual C++ integrated development environments.
  • Covers the essential features of C++, including control structures, one-dimensional and multidimensional arrays, and file manipulation.
  • Includes features of object-oriented programming such as class definition and use, derived classes, constructor functions, operator overloading, and automatic conversion.
  • Contains over 80 engineering and scientific examples and programming projects drawn from interesting areas such as solar heating, environmentally sound power production, water conservation, automated manufacturing, and pipeline and power grid modeling.
  • Presents fundamentals of numerical methods that represent commonly used techniques for solving engineering and scientific problems.

Description

  • Copyright 2002
  • Dimensions: 7-3/8" x 9-1/8"
  • Pages: 560
  • Edition: 2nd
  • Book
  • ISBN-10: 0-201-74125-3
  • ISBN-13: 978-0-201-74125-4

Essential C++ for Engineers and Scientists focuses readers on the key elements of good programming and C++ using a multitude of engineering and scientific examples that are relevant to future engineers. The book covers the features of C++ needed for writing engineering programs, including many features of object-oriented programming. Early on, it makes some simplifying assumptions that allow the use of C++ topics without lengthy explanation, and then later discusses the intricacies of the features. Readers will come away with the confidence needed to solve problems with C++.

THIS SECOND EDITION FEATURES:
  • Over 50% more programming projects than in the first edition.
  • Two new case studies with complete algorithm development.
  • Over 80 engineering and scientific examples and programming projects drawn from interesting areas such as solar heating, environmentally sound power production, water conservation, automated manufacturing, pipeline and power grid modeling, and others.
  • Updated and enhanced coverage of many topics including member operators and member functions, files, and structs.
  • Reference appendices on using the C programming language and about both the Borland and Visual C++ integrated development environments.
  • Fundamentals of numerical methods that represent commonly used techniques for solving engineering and scientific problems.

Sample Content

Table of Contents

(Each chapter ends with a “Chapter Review.”)

Preface.


1. Computers: Revolutionary Machines with a Simple Design.

Computer Components.

Computer Software.

Object-Oriented Programming.

Computing for Engineers and Scientists.



2. Basic Elements of a C++ Program.

Simple C++ Program.

Statement Execution.

Input/Output Operations.

Data Types.

Arithmetic Expressions.

Additional Operators.

Namespaces.

Software Designer Beware.



3. Control Structures.

Three Essential Structures.

Conditions.

Selection and Repetition.

Nested and Multiple-Alternative Selection Structures.

The switch Statement for Multiple Alternatives.

Problem Solving with Decisions.

Software Designer Beware.



4. Repetition Structures.

Loop Form and the while Statement.

Interactive and Batch Processing.

The for Statement.

Operators That Change Their Operands.

Input Errors.

The do-while Loop.

Problem Solving with Loops.

Software Designer Beware.



5. User-Defined Functions.

Single-Result Functions.

void Functions.

Functions with Output Parameters.

Overloaded Functions.

Introduction to Scope of Names.

Recursive Functions (Optional).

Problem Solving with User-Defined Functions.

Software Designer Beware.



6. Data Structures and Classes of Objects.

Structure Types.

A Simple Class.

Analysis and Design of Classes.

Implementation of a Design as a Class.

Accessors and Constructor Functions for Type Conversion.

Class Reuse (Optional).

Software Designer Beware.



7. Arrays and Strings.

Arrays for List Storage.

Sequential Access of Array Elements.

Using Whole Arrays as Parameters.

Strings Revisited.

Classes with Array Components.

Dynamically Allocated Array Components.

Software Designer Beware.



8. Multidemensional Arrays.

Creating and Using Multidemensional Arrays.

Matrix Operations.

Linear Systems.

Dynamic Allocation of Two-Dimensional Array Components.

Software Designer Beware.



9. Input and Output Streams.

Text Files.

Stream Error Detection.

Formatting Text Output.

Searching a Database.

Software Designer Beware.



10. Introduction to Numerical Methods.

Finding Roots of Functions.

Fundamental Statistics.

Numerical Differentiation.

Numerical Integration.

Solving First-Order Differential Equations.

Software Designer Beware.



Appendix A. C, Parent Language of C++.


Appendix B. Selected C++ Standard Functions/Macros.


Appendix C. Selected C++ Input/Output Facilities.


Appendix D. Selected Facilities Provided by Class string.


Appendix E. C++ Operators.


Appendix F. C++ Keywords.


Appendix G. Microsoft Visual C++ Integrated Development Environment, An Introduction.


Appendix H. Borland C++ Builder Integrated Development Environment, An Introduction.


Appendix I. Character Sets.


Index.

Preface

Essential C++ for Engineers and Scientists, Second edition, teaches the essentials of problem solving and programming using a subset of C++ as the implementation language. It includes many practical examples from a wide range of scientific and engineering disciplines. The text can be used for a first course in programming: It assumes no prior knowledge of computers or programming.

Although somewhat abbreviated, the C++ coverage in this book includes the features useful in typical engineering and scientific programs, and it demonstrates these features as they are actually used, not in isolation. Language topics are presented in an order common in teaching other languages: first the basic control structures (sequence, selection, and repetition), input/output operations, expression evaluation, and library functions, and then defining and calling the user's own functions. Next, the fundamental construct of an object-oriented C++ program, the class, is presented. After the chapter on classes, the text builds on the notion of object orientation while continuing the standard subject matter of an introductory programming course for engineers and scientists: arrays and strings, multidimensional arrays, a review of file manipulation, and an introduction to selected numerical methods.

When C++ offers multiple ways of accomplishing the same goal, the text usually selects just one and uses it consistently. For example, it teaches the use of references for output parameters and limits coverage of pointers to array parameters and to dynamically allocated arrays.

Changes in the New Edition

Throughout the text, all programming examples have been updated to conform to standard C++ use of namespaces. We have improved the book in many other ways as well:

  • Integrated introduction to input/output file use with loop coverage
  • Added presentation of structs
  • Added smaller scale first example of classes
  • Added member operators while retaining friend operators
  • Expanded coverage of dynamically allocated arrays, both one- and two-dimensional
  • Integrated standard string class into data type coverage beginning in Chapter 2 (retained Cstring basics in array chapter)
  • Expanded numerical methods coverage by adding a case study on the use of augmented matrices to solve systems of linear equations
  • Added case studies using decision structures for finch classification and file use for database representation
  • Included more examples of reference parameters
  • Expanded input error recovery coverage
  • Added 50% more programming projects
  • Created new appendices in response to reviewer requests:
    • Introduction to C programming language
    • Laboratory-style introductions to two C++ integrated development environments—Microsoft Visual C++ and Borland C++ Builder

Flexible Ordering of Topics

Professors who prefer to present topics in an order different from the one in the textbook should check the dependencies shown in Table P.1 (in preface). Several sections of the text are completely optional, with no subsequent dependencies: Recursive Functions (5.6), Class Reuse (6.7), and Heap-Dynamic Array Allocation (7.6, 8.4). Figure P.1 (in preface) lists several different possible orderings of topics.

What About NO Objects?

A careful study of Fig. P.1 (in preface) shows that if you prefer not to cover objects at all, you can still present all other language topics except multidimensional arrays and dynamic array allocation. We have chosen to show function parameters that are multidimensional arrays only in the context of an object representation. This choice stems from our conviction that such a representation is simpler, since students can pass matrices as input and output parameters in exactly the same way as they pass simpler objects.

Software Engineering Concepts

This text presents many aspects of software engineering. Early chapters on control structures take a process-oriented approach to analysis and design and demonstrate algorithm development through stepwise refinement of pseudo-code. These chapters also include sections on tracing and debugging code. Chapter 5 introduces procedural abstraction through user-defined functions, and Chapter 6's introduction of classes is interwoven with examples of the object-oriented design process first described in Chapter 1.

The book emphasizes early on the need for a consistent, readable coding style, and its examples demonstrate such a style throughout. The inside back cover of the text shows examples of most C++ constructs. In addition to serving as a quick reference to where these constructs are discussed in the book, this table can be used as a standard for style of indentation, bracket use, and naming conventions.

Pedagogical Features

This textbook uses a rich array of pedagogical features with which to engage the student.

Definitions of Important Terms. Important terms are defined in the margins of the text.

End-of-Section Review Questions. Most sections are followed by a set of questions that check the student's understanding of the material covered. Some questions call for the analysis and tracing of program fragments; others ask the student to write or to modify some code. Answers to the odd-numbered questions are in the Answers section; answers to the even-numbered questions are included in the on-line Instructor's Manual.

Programming Projects. Each chapter concludes with a set of programming projects. Answers to selected projects appear in the on-line Instructor's Manual, so instructors also have the option of distributing all or part of a solution and asking the students to complete, extend, or improve the solution.

Examples and Case Studies. The book contains a wide variety of examples and case studies specially selected to give the student glimpses of important science and engineering applications of computing. They are usually complete programs, functions, or class definitions rather than incomplete fragments.

Code and Input Highlighting. Many programming examples use shading to draw the student's eye to sections of the code that demonstrate the current topic of interest. Additionally, all examples of program runs shade user-entered input to distinguish it from computer-generated output.

Pitfalls and Chapter Reviews. Each chapter concludes with a discussion of common programming errors, followed by a summary of important points in the chapter, and a table of new C++ constructs.

Comprehensive Index. Every textbook has an index, but this book's index is truly a pedagogical feature. Constructed by hand, the index includes terms, concepts, and examples from all chapters and appendixes.

Appendixes and Supplements

Reference tables of C++ operator precedence and C++ constructs appear on the inside covers of the book. Appendix A compares C++ to its parent language, C; Appendix B gives selected run-time functions available in standard libraries; and Appendix C summarizes selected I/O facilities. Appendix D is a reference for the standard string class; Appendix E is a reference of C++ operators; and Appendix F is a list of ANSI C++ keywords. Appendixes G and H introduce popular C++ integrated development environments and Appendix I lists the ASCII and EBCDIC character sets.

The Instructor's Manual includes suggestions for teaching each chapter, two quizzes for each chapter, a bank of exam questions, solutions to even-numbered review questions, and solutions to selected programming projects. It is accessible by qualified instructors only. Please contact your sales representative through the World Wide Web.

The example program code is available online at http://www.aw.com/cssupport (follow the links from there). Within the text, the programs that can be downloaded from this website are marked with a "www" icon.

Acknowledgments

Many people assisted in the development of this book. I am very grateful for the numerous examples and programming exercises contributed by Joan C. Horvath of Takeoff Technologies. I especially thank my University of Wyoming colleagues who have so graciously answered my questions. From Computer Science, they include Allyson J. Anderson (who prepared much of the answer key and the Instructor's Manual), John F. Ellis (who suggested the finch classification case study), Michael J. Magee, and John H. Rowland; from Geography, Lawrence M. Ostresh; from Mathematics, G. Eric Moorhouse; and from Mechanical Engineering, Dennis N. Coon and Donald A. Smith.

The reviewers of this manuscript were enormously helpful in suggesting improvements and in finding errors. They include:

Hyder A. Ali, California State University at Northridge
Christopher T. Alvin, University of Wisconsin at Madison
Todd Arbogast, University of Texas at Austin
Tom Bullock, University of Florida
Stephen B. Dobrow, Farleigh Dickinson University
Martin Granier, Western Washington University
Tom Hill, University at Buffalo
Jacob Y. Kazakia, Lehigh University
Andrew Kinley, Rose-Hulman Institute of Technology
Dr. JoAnn B. Koskol, Widener University
Donna L. Occhifinto, County College of Morris
S. D. Rajan, Arizona State University
Robert A. Rouse, Washington University St. Louis
Chi N. Thai, University of Georgia
Anthony Trippe, Rochester Institute of Technology
Tom Walker, Virginia Tech
Dr. David T. Young, Louisiana State University

I am grateful for the ongoing support of the Addison-Wesley team in this endeavor: Computer Science Executive Editor Susan Hartman Sullivan was responsible for initiating the new edition, Galia Shokry was the editorial assistant, Patty Mahtani supervised the design and production of the book, and Michael Hirsch developed the marketing campaign. Trillium Project Management and Publishers' Design and Production Services, Inc. coordinated the conversion of the manuscript to a finished book.

J.R.H.

Updates

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.

Overview


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.

Surveys

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.

Newsletters

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.

Security


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

Children


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

Marketing


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.

Choice/Opt-out


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.

Links


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