Aronowitz - C++ Programming: A Step-by-Step Guide to Learn, in an Easy Way, the Fundamentals of C++ Programming Language

C ++ Programming A Step-by-Step Guide to Learn, in an Easy Way, the Fundamentals of C++ Programming Language st Edition 2020 By Alexander Aronowitz For information contact : (alabamamond@gmail.com, memlnc) http://www.memlnc.com First Edition: 2020 C++ Programming Copyright 2020 by Alexander Aronowitz "Programming isn't about what you know; it's about what you can figure out. - Chris Pine Table of contents PRELIMINARY REMARKS About the author of the book: FOREWORD Acknowledgments FOREWORD TO THE FIRST EDITION Acknowledgments PRELIMINARY REMARKS Book structure Implementation notes Exercises Language draft notes Historical reference Comparison of C ++ and C languages Efficiency and structure Philosophical remarks C ++ Programming Notes Some helpful tips A note for C programmers List of references CHAPTER 1. BRIEF OVERVIEW OF C ++ 1.1 INTRODUCTION 1.2 Programming paradigms 1.2.1 Procedural programming 1.2.2 Modular programming 1.2.3 Data abstraction 1.2.4 The Limits of Data Abstraction 1.2.5 Object Oriented Programming 1.3 "Superior C" 1.3.1 Program and standard output 1.3.2 Variables and arithmetic operations 1.3.3 Pointers and Arrays 1.3.4 Conditional statements and loops 1.3.5 Functions 1.3.6 Modules 1.4 Support for data abstraction 1.4.1 Initialization and deletion 1.4.2 Assignment and Initialization 1.4.3 Type templates 1.4.4 Handling Exceptions 1.4.5 Type conversions 1.4.6 Multiple implementations 1.5 Object-oriented programming support 1.5.1 Calling mechanism 1.5.2 Type check 1.5.3 Multiple inheritance 1.5.4 Encapsulation 1.6 The Limits of Perfection CHAPTER 2. DESCRIPTIONS AND CONSTANTS 2.1 DESCRIPTIONS 2.1.1 Scope 2.1.2 Objects and Addresses 2.1.3 Lifetime of objects 2.2 NAMES 2.3 TYPES 2.3.1 Basic types 2.3.2 Implicit type conversion 2.3.3 Derived types 2.3.4 The void type 2.3.5 Pointers 2.3.6 Arrays 2.3.7 Pointers and Arrays 2.3.8 Structures 2.3.9 Type equivalence 2.3.10 Links 2.4 LITERALS 2.4.1 Integer constants 2.4.2 Floating point constants 2.4.3 Character constants 2.4.4 Strings 2.4.5 Zero 2.5 Named constants 2.5.1. Enumerations 2.6. Save memory 2.6.1 Fields 2.6.2.

Associations 2.7 Exercises CHAPTER 3. EXPRESSIONS AND OPERATORS 3.1 Calculator 3.1.1 Analyzer 3.1.2 Input function 3.1.3 Name table 3.1.4 Error handling 3.1.5 Driver 3.1.6 Command line parameters 3.2 Summary of operations 3.2.1 Brackets 3.2.2 Calculation order 3.2.3 Increment and decrement 3.2.4 Bitwise logical operations 3.2.5 Type conversion 3.2.6 Free memory 3.3 Statement of operators 3.3.1 Select Operators 3.3.2 The goto statement 3.4 Comments and text arrangement 3.5 Exercises CHAPTER 4. 4.1 Introduction 4.2 Binding 4.3 Header files 4.3.1 Single header file 4.3.2 Multiple header files 4.4 Linking with programs in other languages 4.5 How to create a library 4.6 Functions 4.6.1 Function descriptions 4.6.2 Function definitions 4.6.3 Passing parameters 4.6.4 Return value 4.6.5 Array parameter 4.6.6 Function name overloading 4.6.7 Default parameter values 4.6.8 Undefined number of parameters 4.6.9 Function Pointer 4.7 Macro tools 4.8 Exercises 5. CLASSES 5.1 Introduction and overview 5.2 Classes and members 5.2.1 Member functions 5.2.2 Classes 5.2.3 Link to yourself 5.2.4 Initialization 5.2.5 Deletion 5.2.6 Substitution 5.3 Interfaces and implementations 5.3.1 Alternative implementations 5.3.2 Completed class example 5.4 More about classes 5.4.1 Friends 5.4.2 Clarifying Member Name 5.4.3 Nested classes 5.4.4 Static members 5.4.5 Member pointers 5.4.6 Structures and unions 5.5 Constructors and destructors 5.5.1 Local variables 5.5.2 Static memory 5.5.3 Free memory 5.5.4 Class Objects as Members 5.5.5 Arrays of class objects 5.5.6 Small objects 5.6 Exercises CHAPTER 6. 6.1 Introduction and overview 6.2 Derived classes 6.2.1 Member functions 6.2.2 Constructors and destructors 6.2.3 Class hierarchy 6.2.4 Type fields 6.2.5 Virtual functions 6.3 Abstract classes 6.4 Example of a completed program 6.4.1 Screen Monitor 6.4.2 Shape library 6.4.3 Application program 6.5 Multiple inheritance 6.5.1 Multiple occurrences of a base class 6.5.2 Disambiguation 6.5.3 Virtual base classes 6.6 Access Control 6.6.1 Protected members 6.6.2 Access to base classes 6.7 Free memory 6.7.1 Virtual Constructors 6.7.2 Specifying placement 6.8 Exercises CHAPTER 7. 7.1 Introduction 7.2 Operator functions 7.2.1 Binary and unary operations 7.2.2 Predefined Operation Properties 7.2.3 Operator functions and user-defined types 7.3 Custom type conversion operations 7.3.1 Constructors 7.3.2 Conversion operations 7.3.3 Ambiguities 7.4 Literals 7.5 Large objects 7.6 Assignment and Initialization 7.7 Indexing 7.8 Calling a function 7.9 Indirect appeal 7.10 Increment and decrement 7.11 String class 7.12 Friends and Members 7.13 Cautions 7.14 Exercises CHAPTER 8.

TYPE TEMPLATES 8.1 Introduction 8.2 Simple type pattern 8.3 Type templates for a list 8.3.1 List with forced link 8.3.2 List without forced link 8.3.3 List implementation 8.3.4 Iteration 8.4 Type templates for functions 8.4.1 Simple type template for a global function 8.4.2 Derived classes allow you to introduce new operations 8.4.3 Passing operations as function parameters 8.4.4 Implicit transfer of operations 8.4.5 Injecting Operations Using Template Class Parameters 8.5 Overload Resolution for Template Function 8.6 Type template parameters 8.7 Type templates and derived classes 8.7.1 Specifying Implementation Using Template Parameters 8.8 Associative array 8.9 Exercises CHAPTER 9. 9.1 Error handling 9.1.1 Exceptions and traditional error handling 9.1.2 Other perspectives on special situations 9.2 Distinguishing special situations 9.3 Exception names 9.3.1 Grouping exceptions 9.3.2 Derived exceptions 9.4 Resource Requests 9.4.1 Constructors and destructors 9.4.2 Precautions 9.4.3 resource exhaustion 9.4.4 Exceptions and constructors 9.5 Exceptional situations may not be errors 9.6 Setting the interface 9.6.1 Unexpected exceptions 9.7 Uncaught exceptions 9.8 Other ways to handle errors 9.9 Exercises CHAPTER 10. FLOWS 10.1 INTRODUCTION 10.2 CONCLUSION 10.2.1 Inference of built-in types 10.2.2 Inference of user-defined types 10.3 ENTER 10.3.1 Introducing built-in types 10.3.2 Stream states 10.3.3 Entering custom types 10.4 Formatting 10.4.1 The ios class 10.4.1.1 Binding streams 10.4.1.2 Output fields 10.4.1.3 Format status 10.4.1.4 Displaying integers 10.4.1.5 Aligning margins 10.4.1.6 Output of floating numbers. 10.4.2 Manipulators 10.4.2.1 Standard I / O Handlers 10.4.3 ostream members 10.4.4 istream Members 10.5 Files and streams 10.5.1 Closing Streams 10.5.2 String streams 10.5.3 Buffering 10.6 I / O in C 10.7 Exercises CHAPTER 11. DESIGN AND DEVELOPMENT 11.1 Introduction 11.2 Objectives and means 11.3 Development process 11.3.1 Development cycle 11.3.2 Design objectives 11.3.3 Design steps 11.3.3.1 Step 1: define classes 11.3.3.2 Step 2: Define the set of operations 11.3.3.3 Step 3: specifying dependencies 11.3.3.4 Step 4: define the interfaces 11.3.3.5 Rebuilding the class hierarchy 11.3.3.6 Using models 11.3.4 Experiment and Analysis 11.3.5 Testing 11.3.6 Escort 11.3.7 Efficiency 11.4 Project management 11.4.1 Reuse 11.4.2 Size 11.4.3 Human Factors 11.5 Code of practice 11.6 References with comments CHAPTER 12. 12.1.1 Ignoring classes 12.1.2 Ignoring inheritance 12.1.3 Ignoring Static Type Checking 12.1.4 Hybrid project 12.2 Classes 12.2.1 What are classes? 12.2.2 Class hierarchies 12.2.3 Dependencies within a class hierarchy. 12.2.4 Membership relations 12.2.5 Ownership and Inheritance 12.2.6 Usage relationships 12.2.7 Relationships within a class 12.2.7.1 Invariants 12.2.7.2 Encapsulation 12.2.8 Programmable relationships 12.3 Components 12.4 Interfaces and implementations 12.5 Code of practice CHAPTER 13. 12.2.4 Membership relations 12.2.5 Ownership and Inheritance 12.2.6 Usage relationships 12.2.7 Relationships within a class 12.2.7.1 Invariants 12.2.7.2 Encapsulation 12.2.8 Programmable relationships 12.3 Components 12.4 Interfaces and implementations 12.5 Code of practice CHAPTER 13.