Home > Store

Object-Oriented Programming Using C++, 2nd Edition

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

Object-Oriented Programming Using C++, 2nd Edition

Book

  • Sorry, this book is no longer in print.
Not for Sale

About

Features

This book by best-selling C and C++ author Ira Pohl providesa clear and thorough introduction to object-orientedprogramming using C++. The book focuses on ADTs andpolymorphism as the keys to understanding the OOP paradigm.Each chapter shows how specific language features of C++support object-oriented programming concepts, and examinescritical design choices and trade-offs. The up-to-datecoverage, based on the ANSI proposal, includes parameterizedtypes, exception handling, templates, iterator abstraction,and the use of iostream.h. Extensive exercises, many designedto be completed while reading the text, help the readerunderstand the concepts and make the book ideal for self-paced study.

  • Provides an exceptionally clear, complete, and readable guide to OOP for the experienced programmer.
  • Discusses C++ language features (including templates, exception handling and parameterized types) in detail in the context of the OOP paradigm.
  • Uses "dissections", the author's trademark approach, to walk the reader through key programming elements and coding options.
  • Adopts a consistent and standard coding style accepted by professionals in the C++ community.
  • Includes fully-tested code in all example programs.

Description

  • Copyright 1997
  • Dimensions: 7-1/4" x 9-1/4"
  • Pages: 568
  • Edition: 2nd
  • Book
  • ISBN-10: 0-201-89550-1
  • ISBN-13: 978-0-201-89550-6

Object-Oriented Programming Using C++, Second Editionprovides the experienced programmer with a clear and thorough introduction tothe object-oriented paradigm using ANSI C++. Each chapter introduces you tospecific C++ language features that support object-oriented programmingconcepts, including the most recent additions to the language such as STL,namespaces, RTTI, and the bool type. Best-selling author and C++ authority,Ira Pohl, employs his trademark approach of "dissection" todemonstrate key programming elements and idioms and to teach you how toevaluate tradeoffs and make critical design choices.

Features
  • Reflects the latest developments in the C++ ANSI standard includingsubstantial detail on the new STL libraries.
  • Explains how an object-oriented programming concept is supported by alanguage feature.
  • Teaches by example, introducing you to full working programs right fromthe start.
  • Incorporates interactive, proven exercises to help check your understandingof key OO concepts and put them into practice.
  • Provides code for all example programs covered in the book, as well asadjunct programs that illustrate points made in the book.


0201895501B04062001

Downloads

Source Code

Click below for Source Code related to this title:
opus2e.tar.Z

opus2e.zip

Sample Content

Table of Contents



1. Why Object-Oriented Programming in C++.

Object-Oriented Programming.

Why C++ is a Better C.

Encapsulation and Type Extensibility.

Construction of Objects.

Conversions, Operators, and Seamless Types.

Inheritance.

Polymorphism.

Benefits of Object-Oriented Programming.



2. Native Types and Statements.

Program Elements.

Input and Output.

Program Structure.

Simple Types.

The Traditional Conversions.

Enumeration Types.

Expressions.

Statements.



3. Functions and Pointers.

Functions.

Function Definition.

The RETURN Statement.

Function Prototypes.

Default Arguments.

Overloading Functions.

Inlining.

Scope.

Storage Class.

Pointer Types.

Reference Declarations and Call-By-Reference.

The Use of VOID.

Arrays and Pointers.

The Relationship Between Arrays and Pointers.

Passing Arrays to Functions.

Strings: A Kernel Language ADT.

Multidimensional Arrays.

Free Storage Operators NEW and DELETE.



4. Implementing ADTs in the Base Language.

The Aggregate Type STRUCT.

Structure Pointer Operator.

An Example: Stack.

Unions.

Complex Numbers.

An Example: Flushing.

Bit Fields.

An Example: Dynamic Arrays.



5. Data Hiding and Member Functions.

Member Functions.

Visibility PRIVATE and PUBLIC.

Classes.

Class Scope.

STATIC Member.

An Example: Revisiting Flushing.

The THIS Pointer.

STATIC and CONST Member Functions.

Containers and Items Access.



6. Object Creation.

Classes with Constructors.

Construction a Dynamically Sized Stack.

Classes with Destructors.

An Example: Dynamically Allocated Strings.

A Class.

Members That Are Class Types.

An Example: A Singly Linked List.

Polynomials as a Linked List.

Strings Using Reference Semantics.

No Constructor Copy Constructor, and Other Mysteries.



7. Ad Hoc Polymorphism.

Class-Defined Conversion.

Overloading and Function Selection.

FRIEND Functions.

Overloading Operators.

Unary Operator Overloading.

Binary Operator Overloading.

Overloading Assignment and Subscripting Operators.

More Signature Matching.

Polynomial: Type and Language Expectations.



8. Visitation: Iterators and Containers.

Visitation.

Iterators.

An Example: QUICKSORT.

Friendly Classes and Iterators.

Overloading Operator () for Indexing.

Overloading NEW and DELETE.

Pointer Operators and Smart Pointers.

Genericity with VOID.



9. Inheritance: Subtyping and Code Reuse.

A Derived Class.

Typing Conversions and Visibility.

Code Reuse: A Dynamic Array Bounds.

Code Reuse: A Binary Tree Class.

Virtual Functions.

Abstract Base Classes.

Multiple Inheritance.

Inheritance and Design.

Detailed C++ Considerations.



10. Parametric Polymorphism.

Template Class Stack.

Function Templates.

Class Templates.

Parameterizing the Class VECT.

Parameterizing QUICKSORT.

Parameterized Binary Search Tree.

Inheritance.

Ownership and Design Issues.

Detailed Considerations.



11. Exceptions.

Using ASSERT.H.

Using SIGNAL.H.

C++ Exceptions.

Throwing Exceptions.

TRY Blocks.

Handlers.

Exception Specification.

TERMINATE () and UNEXPECTED().

Example Exception Code.

The Philosophy of Error Recovery.



12. OOP Using C++.

OOP Language Requirements.

ADTs in Non-OOP Languages.

Clients and Manufacturers.

Reuse and Inheritance.

Polymorphism.

Language Complexity.

C++ OOP Bandwagon.

Platonism: Tabula Rasa Design.

Design Principles.

Schema, Diagrams and Tools.

Last Word.



Appendices.

ASCII Character Codes.

Operator Precedence and Associativity.

C++ Language Guide.

Input and Output.



Index. 0201895501T04062001

Preface

PREFACE

This book is intended as an introduction to object-oriented programming(OOP) using ANSI C++ for the reader or student who already has programmingexperience. It explains C++ features in the context of OOP.

C++ has had many recent additions including STL, namespaces, RTTI, and thebool type. These can be used readily by someone already proficient in basicC++, but most books have yet to treat these topics. This book can provide ahandy guide to these new constructs.

The examples both within the book, and accessible at Addison-Wesley's website are intended to exhibit good programming style. The Addison-Wesley website, www.aw.com for this book contains the programs in the book as well asadjunct programs that illustrate points made in the book, or that flesh outshort pieces of programs. The programs available at the web site areintroduced by their .cpp or .h names.

C++, invented at Bell Labs by Bjarne Stroustrup in the mid-1980s, is apowerful modern successor language to C. C++ adds to C the concept ofclass, a mechanism for providing user-defined types also calledabstract data types. It supports object-oriented programming by thesemeans and by providing inheritance and run-time type binding.

By carefully developing working C++ programs, using the method ofdissection, this book presents a simple and thorough introduction to theprogramming process in C++. Dissection is a technique for explaining newelements in a program that the student is seeing for the first time. Ithighlights key points in the many examples of working code that are used toteach by example.

This book is intended for use in a first course in programming in C++. Itcan be used as a supplementary text in an advanced programming course, datastructures course, software methodology course, comparative language course,or other courses where the instructor wants C++ to be the language of choice.Each chapter presents a number of carefully explained programs. Many programsand functions are dissected.

All the major pieces of code were tested. A consistent and proper codingstyle is adopted from the beginning. The style standard used is one chosen byprofessionals in the C++ community.

In conjunction with A Book on C, Third Edition by Al Kelley and IraPohl (Addison Wesley Longman, 1995), an integrated treatment of the Cand C++ programming languages and their use are presented which are notavailable elsewhere. For the beginner, a simpler introduction to the Clanguage is C by Dissection: The Essentials of C Programming, ThirdEdition by Al Kelley and Ira Pohl (Addison Wesley Longman, 1995).

Chapters contain:

    Object-Oriented Concept: Explains how an object-orientedprogramming concept is supported by a language feature.

    Working Code: Small examples of working code illustrateconcepts. Code illustrates a language feature or an OOP concept.

    Dissections: A program particularly illustrative of thechapter's themes is analyzed by dissection. Dissection is similar to astructured walk-through of the code. Its intention is to explain to the readernewly encountered programming elements and idioms.

    Pragmatics: Tips, pitfalls, nuances, and advice on thetopic.

    Summary: A succinct list of points are reiterated ashelpful chapter review.

    Exercises: The exercises test the student's knowledge ofthe language. Many exercises are intended to be done interactively whilereading the text. This encourages self-paced instruction by the reader. Theexercises also frequently extend the reader's knowledge to an advanced area ofuse.

The book incorporates:

    Object-Oriented Programming. Object-Orientation isstressed throughout. Chapter 1, "Why Object-Oriented Programming in C++?,"provides an introduction to C++'s use as an object-oriented programminglanguage. Chapter 2, "Native Types and Statements," shows data types,expressions, and simple statements. Chapter 3, "Functions and Pointers,"continues with similarities between functions and complex data types. The middle chapters show how classes work. Classes are the basis for abstract datatypes and object-oriented programming. The last few chapters give advanceddetails of the use of inheritance, templates, and exceptions. Chapter 12, "OOPUsing C++," discusses OOP and the Platonic programming philosophy. Thisbook develops in the programmer an appreciation of this point of view. At anypoint in the text the programmer can stop and use the new material.

    Teaching by Example. This book is a tutorial that stressesexamples of working code. From the start the student is introduced to fullworking programs. An interactive environment is assumed. Exercises areintegrated with the examples to encourage experimentation. Excessive detail isavoided in explaining the larger elements of writing working code. Eachchapter has several important example programs. Major elements of theseprograms are explained by dissection.

    Data Structures in C++. The text emphasizes many of thestandard data structures from computer science. Stacks, safe arrays,dynamically allocated multidimensional arrays, lists, trees, and strings areall implemented. Exercises extend the student's understanding of how toimplement and use these structures. Implementation is consistent with anabstract data type approach to software.

    Standard Template Library (STL). STL is explained and usedin Chapter 9, "Templates, Generic Programming, and STL." Many of the datastructure examples foreshadow its explanation and use. There is a strongemphasis on the template mechanism required for STL and the iterator idiomthat STL exploits.

    ANSI C++ language and iostream.h. For an existing,widely used language, C++ continues to change at a rapid pace. This book isbased on the most recent standard: the ANSI C++ Committee language documents.A succinct informal language reference is provided in Appendix C, "LanguageGuide." Chief additions include templates and exception handling. The examplesuse the iostream.h I/O library. This has replaced stdio.h usedin the C community. Use of the iostream.h library is described inAppendix D, "Input/Output."

    Reference Value in Appendices. There is an easilyaccessible informal language reference appendix: Appendix C, "Language Guide."Though this is not official, it specifies the language definition in a tersemanner. There is also an appendix on the key I/O libraries, iostream.hand stream.h: Appendix D, "Input/Output." A short guide to both thestring library and STL is given in Appendix E, "STL and StringLibraries."

    Idiomatic and Mainstream. The book attempts to stay withmainstream aspects of the language that are most important for the student andprofessional. It avoids arcane features of the language that are error proneor confusing. It is idiomatic in its use of code. The code is readily copiedand reapplied to other problems.

    Industry- and Course-Tested. It is the basis of manyon-site professional training courses given by the author, who has used itscontents to train professionals and students in various forums since 1986. Thevarious changes in the new edition are course-tested, and reflect considerableteaching and consulting experience by the author. The book is the basis for anextensive series of video training tapes and on-line courses. More informationon these courses is available at the author's web site at www.cse.ucsc.edu/~pohl.

Acknowledgments

My special thanks to my wife, Debra Dolsberry, who encouraged me throughoutthis project. She acted as book designer and technical editor for this secondedition. She developed appropriate formats and style sheets in FrameMaker 4.0and guided the transition process from the first edition in troff. Shealso implemented and tested all major pieces of code. Her carefulimplementations of the code and exercises led to many improvements. StephenClamage of TauMetric Corporation provided wonderfully insightful comments onlanguage detail. William Engles of University of Wisconsin described animproved shuffling routine for the poker example. Reviews for this additionwere provided by Jean Bell, Colorado School of Mines; Arthur Delcher, LoyolaUniversity; Konstantin Läufer, Loyola University; James L. Murphy,California State University; Kent Wooldridge, California State University;Shih-Ho Wang, University of California; David B. Teague, Western CarolinaUniversity; Lukasz Pruski, California State University; and David Gregory.Randal Burns and Hiroya Chiba, teaching assistants and computer sciencegraduate students of University of California at Santa Cruz, also contributedto the reviewing process.

The first edition had help, inspiration, and encouragement from, PeterApers, University of Twente, The Netherlands; Henri Bal, Vrije University, TheNetherlands; Michael Beeson, State University of California; Nan Borreson,Borland International; Douglas Campbell, University of Conneticut; CathyCollins, USC; Steve Demurjian; Robert Doran, University of Auckland, NewZealand; Robert Durling, UCSC; Daniel Edelson, UCSC; Anton Eliens, VrijeUniversity, The Netherlands; Ray Fujioka, USC; Thomas Judson, University ofPortland; Al Kelley, UCSC; Jim Kempf, Sun Microsystems, Incorporated; DarrellLong, UCSC; Charlie McDowell, UCSC; Laura Pohl, Cottage Consultants; Reind vande Riet, Vrije University, The Netherlands; Anthony Wasserman, IDE; and SalihYurttas, Texas A&M University.

The second edition was developed with the support of my editor J. CarterShanklin and editorial assistant Angela Buenning. Finally, I thank BjarneStroustrup for inventing such a powerful language and encouraging others tohelp teach it.



0201895501P04062001

Updates

Errata

Click below for Errata related to this title:
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