![]() |
Opamp Technical Books 1033 N. Sycamore Ave. Los Angeles, CA 90038 WWW.OPAMP.COM 1 - 800 - 468 - 4322 8:00am-4:30pm M-F 9:00am-5:30pm Sat |
|
|---|
![]() |
Keywords: C++
Your search found 250 books Now viewing Books 1 - 25 In stock items ship IMMEDIATELY. Other titles usually ship within 2-3 days. |
![]() |
|---|
| 3D Programming with C++ | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| This book is currently the only detailed book in print that explains and uses techniques of accurate physics modeling to create highly realistic 3D games. All of the examples and source code presented are designed to harness the power of Microsoft's latest version of DirectX-a graphics programming API that greatly enhances the work of developing high performance PC graphics. Currently the only detailed book in print that explains and uses techniques of accurate physics modeling to create highly realistic 3D games. | |||||||
| PARAGLYPH PRESS - O'REILLY | ISBN-10: 1932111328 ISBN-13: 9781932111323 | PGS: N/A | List: 49.99 YOUR PRICE: 39.99 | ||||
| A Concise Introduction to Image Processing using C++, 1st Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Chapman & Hall/CRC - TAYLOR & FRANCIS | H | ISBN-10: 1584888970 ISBN-13: 9781584888970 | PGS: 264 | List: 91.95 YOUR PRICE: 87.35 | |||
| A First Book of C++, From Here to There, 4th Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Gary Bronson's A FIRST BOOK OF C++, Fourth Edition, takes a hands-on, applied approach to the first programming language course for students studying computer science. The book begins with procedural programming in C, and then gradually introduces object-oriented programming features and the C++ language syntax that enables first-time programmers to use them. CONTENTS: Part I: FUNDAMENTALS OF C++ PROGRAMMING. 1. Getting Started. 2. Data Types, Declarations, and Displays. 3. Assignment and Interactive Input. 4. Selection. 5. Repetition. 6. Modularity Using Functions. 7. Arrays. 8. Arrays and Pointers. 9. I/O Streams and Data Files. Part II: OBJECT-ORIENTED PROGRAMMING. 10. Introduction to Classes. 11. Adding Functionality to Your Classes. 12. Extending Your Classes. 13. The Standard Template Library. Part III: ADDITIONAL TOPICS. 14. The string Class and Exception Handling. 15. Strings as Character Arrays. 16. Data Structures. Appendices. A: Operator Precedence Table. B: ASCII Character Codes. C: Bit Operations (online only; NOT in book). D: Floating-Point Number Storage. E: Solutions to Selected Exercises. | |||||||
| Course Technology - CENGAGE - CENGAGE | S | ISBN-10: 1111531005 ISBN-13: 9781111531003 | PGS: 816 | List: 151.95 YOUR PRICE: 144.35 | |||
| A Guided Tour of Microsoftr Visual Studior 2010: Visual Basicr, Visual C#r and Visual C++r, 1st Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Learn about Microsoft Visual Studio 2010 with eight engaging videos! With author Corinne Hoisington as a guide, users will learn about the new Visual Studio 2010 interface and the most exciting features of Visual Basic 2010, Visual C# 2010, and Visual C++ 2010. The videos also provide an overview of ASP.NET and coverage of Microsoft Office and database programming. CONTENTS: VIDEO 1. What's New in Visual Studio 2010. VIDEO 2. User Interface Highlights. VIDEO 3. Coding in Visual Basic 2010. VIDEO 4. Coding in Visual C# 2010. VIDEO 5. Coding in Visual C++ 2010. VIDEO 6. Web Applications Overview: ASP.NET. VIDEO 7. Programming Office with Visual Basic. VIDEO 8. Programming Databases with Visual Basic or Visual C++. | |||||||
| Course Technology - CENGAGE | ISBN-10: 111152713X ISBN-13: 9781111527136 | PGS: 0 | List: 28.95 YOUR PRICE: 27.50 | ||||
| Absolute C++ plus MyProgrammingLab with Pearson eText -- Access Card, 5th Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| >Contents Chapter 1 C++ Basics 1 1.1 Introduction to C++ 2 Origins of the C++ Language 2 C++ and Object-Oriented Programming 3 The Character of C++ 3 C++ Terminology 4 A Sample C++ Program 4 1.2 Variables, Expressions, and Assignment Statements 6 Identifiers 6 Variables 8 Assignment Statements 10 Pitfall: Uninitialized Variables 12 Tip: Use Meaningful Names 13 More Assignment Statements 13 Assignment Compatibility 14 Literals 15 Escape Sequences 17 Naming Constants 17 Arithmetic Operators and Expressions 19 Integer and Floating-Point Division 21 Pitfall: Division with Whole Numbers 22 Type Casting 22 Increment and Decrement Operators 25 Pitfall: Order of Evaluation 27 1.3 Console Input/Output 28 Output Using cout 28 New Lines in Output 29 Tip: End Each Program with \n or endl 30 Formatting for Numbers with a Decimal Point 31 Output with cerr 32 Input Using cin 32 Tip: Line Breaks in I/O 34 1.4 Program Style 34 Comments 35 1.5 Libraries and Namespaces 35 Libraries and include Directives 36 Namespaces 36 Pitfall: Problems with Library Names 37 Chapter Summary: 38 Answers to Self-Test Exercises 39 Programming Projects 40 Chapter 2 Flow of Control 43 2.1 Boolean Expressions 44 Building Boolean Expressions 44 Pitfall: Strings of Inequalities 45 Evaluating Boolean Expressions 46 Precedence Rules 48 Pitfall: Integer Values Can Be Used as Boolean Values 52 2.2 Branching Mechanisms 54 if-else Statements 54 Compound Statements 56 Pitfall: Using = in Place of == 57 Omitting the else 59 Nested Statements 59 Multiway if-else Statement 59 The switch Statement 60 Pitfall: Forgetting a break in a switch Statement 63 Tip: Use switch Statements for Menus 63 Enumeration Types 64 The Conditional Operator 64 2.3 Loops 65 The while and do-while Statements 66 Increment and Decrement Operators Revisited 68 The Comma Operator 70 The for Statement 72 Tip: Repeat-N-Times Loops 74 Pitfall: Extra Semicolon in a for Statement 75 Pitfall: Infinite Loops 75 The break and continue Statements 78 Nested Loops 81 2.4 Introduction to File Input Reading From a Text File Using ifstream Chapter Summary 81 Answers to Self-Test Exercises 82 Programming Projects 87 Chapter 3 Function Basics 91 3.1 Predefined Functions 92 Predefined Functions That Return a Value 92 Predefined void Functions 97 A Random Number Generator 99 3.2 Programmer-Defined Functions 103 Defining Functions That Return a Value 103 Alternate Form for Function Declarations 106 Pitfall: Arguments in the Wrong Order 107 Pitfall: Use of the Terms Parameter and Argument 107 Functions Calling Functions 107 Example: A Rounding Function 107 Functions That Return a Boolean Value 110 Defining void Functions 111 return Statements in void Functions 113 Preconditions and Postconditions 113 main Is a Function 115 Recursive Functions 116 3.3 Scope Rules 117 Local Variables 117 Procedural Abstraction 120 Global Constants and Global Variables 121 Blocks 124 Nested Scopes 124 Tip: Use Function Calls in Branching and Loop Statements 125 Variables Declared in a for Loop 125 Chapter Summary 126 Answers to Self-Test Exercises 126 Programming Projects 130 Chapter 4 Parameters and Overloading 137 4.1 Parameters 138 Call-by-Value Parameters 138 A First Look at Call-by-Reference Parameters 141 Call-by-Reference Mechanism in Detail 143 Constant Reference Parameters 145 Example: The swapValues Function 146 Tip: Think of Actions, Not Code 147 Mixed Parameter Lists 148 Tip: What Kind of Parameter to Use 149 Pitfall: Inadvertent Local Variables 151 Tip: Choosing Formal Parameter Names 153 Example: Buying Pizza 153 4.2 Overloading and Default Arguments 156 Introduction to Overloading 156 Pitfall: Automatic Type Conversion and Overloading 159 Rules for Resolving Overloading 160 Example: Revised Pizza-Buying Program 162 Default Arguments 164 4.3 Testing and Debugging Functions 166 The assert Macro 166 Stubs and Drivers 167 Chapter Summary 170 Answers to Self-Test Exercises 171 Programming Projects 172 Chapter 5 Arrays 177 5.1 Introduction to Arrays 178 Declaring and Referencing Arrays 178 Tip: Use for Loops with Arrays 181 Pitfall: Array Indexes Always Start with Zero 181 Tip: Use a Defined Constant for the Size of an Array 181 Arrays in Memory 182 Pitfall: Array Index Out of Range 184 Initializing Arrays 184 5.2 Arrays in Functions 187 Indexed Variables as Function Arguments 187 Entire Arrays as Function Arguments 188 The const Parameter Modifier 192 Pitfall: Inconsistent Use of const Parameters 193 Functions That Return an Array 194 Example: Production Graph 194 5.3 Programming with Arrays 200 Partially Filled Arrays 200 Tip: Do Not Skimp on Formal Parameters 200 Example: Searching an Array 203 Example: Sorting an Array 205 5.3 Multidimensional Arrays 210 Multidimensional Array Basics 210 Multidimensional Array Parameters 212 Example: Two-Dimensional Grading Program 213 Chapter Summary 218 Answers to Self-Test Exercises 219 Programming projects 223 Chapter 6 Structures and Classes 231 6.1 Structures 232 Structure Types 234 Pitfall: Forgetting a Semicolon in a Structure Definition 238 Structures as Function Arguments 238 Tip: Use Hierarchical Structures 239 Initializing Structures 242 6.2 Classes 244 Defining Classes and Member Functions 244 Encapsulation 250 Public and Private Members 251 Accessor and Mutator Functions 255 Tip: Separate Interface and Implementation 257 Tip: A Test for Encapsulation 258 Structures versus Classes 259 Tip: Thinking Objects 261 Chapter Summary 261 Answers to Self-Tesr Exercises 262 Programming Projects 264 Chapter 7 Constructors and Other Tools 267 7.1 Constructors 268 Constructor Definitions 268 Pitfall: Constructors with No Arguments 273 Explicit Constructor Calls 275 Tip: Always Include a Default Constructor 275 Example: BankAccount Class 278 Class Type Member Variables 285 7.2 More Tools 288 The const Parameter Modifier 288 Pitfall: Inconsistent Use of const 290 Inline Functions 295 Static Members 297 Nested and Local Class Definitions 300 7.3 Vectors—A Preview of the Standard Template Vector Basics 301 Pitfall: Using Square Brackets beyond the Vector Size 303 Tip: Vector Assignment Is Well Behaved 305 Efficiency Issues 305 Chapter Summary 307 Answers to Self-Test Exercises 307 Programming Projects 309 Chapter 8 Operator Overloading, Friends, and References 315 8.1 Basic Operator Overloading 316 Overloading Basics 317 Tip: A Constructor Can Return an Object 322 Returning by const Value 323 Tip: Returning Member Variables of a Class Type 326 Overloading Unary Operators 327 Overloading as Member Functions 328 Tip: A Class Has Access to All Its Objects 330 Overloading Function Application ( ) 331 Pitfall: Overloading &&, , and the Comma Operator 331 8.2 Friend Functions and Automatic Type Conversion 332 Constructors for Automatic Type Conversion 332 Pitfall: Member Operators and Automatic Type Conversion 333 Friend Functions 334 Friend Classes 336 Pitfall: Compilers without Friends 338 8.3 References and More Overloaded Operators 339 References 339 Pitfall: Returning a Reference to Certain Member Variables 341 Overloading >> and << 341 Tip: What Mode of Returned Value to Use 348 The Assignment Operator 350 Overloading the Increment and Decrement Operators 351 Overloading the Array Operator [ ] 354 Overloading Based on L-Value versus R-Value 356 Chapter Summary 356 Answers to Self-Test Exercises 356 Programming Projects 359 Chapter 9 Strings 363 9.1 An Array Type for Strings 364 C-String Values and C-String Variables 365 Pitfall: Using = and == with C-strings 369 Other Functions in Example: Command-Line Arguments 373 C-String Input and Output 375 9.2 Character Manipulation Tools 378 Character I/O 378 The Member Functions get and put 379 Example: Checking Input Using a Newline Function 381 Pitfall: Unexpected '\n' in Input 383 The putback, peek, and ignore Member Functions 384 Character-Manipulating Functions 387 Pitfall: toupper and tolower Return int Values 389 9.3 The Standard Class string 390 Introduction to the Standard Class string 391 I/O with the Class string 394 Tip: More Versions of getline 397 Pitfall: Mixing cin >> variable; and getline 398 String Processing with the Class string 399 Example: Palindrome Testing 403 Converting between string Objects and C-Strings 407 Chapter Summary 407 Answers to Self-Test Exercises 408 Programming Projects 412 Chapter 10 Pointers and Dynamic Arrays 419 10.1 Pointers 420 Pointer Variables 421 Basic Memory Management 429 Pitfall: Dangling Pointers 432 Dynamic Variables and Automatic Variables 432 Tip: Define Pointer Types 433 Pitfall: Pointers as Call-by-Value Parameters 435 Uses for Pointers 437 10.2 Dynamic Arrays 438 Array Variables and Pointer Variables 438 Creating and Using Dynamic Arrays 439 Example: A Function That Returns an Array 443 Pointer Arithmetic 445 Multidimensional Dynamic Arrays 446 10.3 Classes, Pointers, and Dynamic Arrays 449 The -> Operator 449 The this Pointer 450 Overloading the Assignment Operator 451 Example: | |||||||
| Addison Wesley - PEARSON | S | ISBN-10: 0132989921 ISBN-13: 9780132989923 | PGS: N/A | List: 152.27 YOUR PRICE: 144.66 | |||
| Absolute C++, 4th Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
Chapter 1: C++ Basics | |||||||
| Addison Wesley - PEARSON | ISBN-10: 0136083811 ISBN-13: 9780136083818 | PGS: N/A | List: 141.20 YOUR PRICE: 134.14 | ||||
| Absolute C++, 5th Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Addison Wesley - PEARSON | ISBN-10: 013283071X ISBN-13: 9780132830713 | PGS: N/A | List: 145.60 YOUR PRICE: 138.32 | ||||
| Absolute C++, Student Value Edition Plus MyProgrammingLab with Pearson eText -- Access Card Package, 5th Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Addison Wesley - PEARSON | S | ISBN-10: 0132989948 ISBN-13: 9780132989947 | PGS: N/A | List: 101.33 YOUR PRICE: 96.26 | |||
| Absolute C++, Student Value Edition, 5th Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Addison Wesley - PEARSON | ISBN-10: 0132846810 ISBN-13: 9780132846813 | PGS: N/A | List: 94.67 YOUR PRICE: 89.94 | ||||
| Accelerated C++: Practical Programming by Example, 1st Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
Preface. 0. Getting Started.
Comments.
#include.
The Main Function.
Curly Braces.
Using the Standard Library for Output.
The Return Statement.
A Slightly Deeper Look.
Details. 1. Working with Strings.
Input.
Framing a Name.
Details. 2. Looping and Counting.
The Problem.
Overall Structure.
Writing an Unknown Number of Rows.
Writing a Row.
The Complete Framing Program.
Counting.
Details. 3. Working with Batches of Data.
Computing Student Grades.
Using Medians Instead of Averages.
Details. 4.Organizing Programs and Data.
Organizing computations.
Organizing Data.
Putting it All Together.
Partitioning the Grading Program.
The Revised Grading Program.
Details. 5. Using Sequential Containers and Analyzing Strings.
Separating Students into Categories.
Iterators.
Using Iterators Instead of Indices.
Rethinking Our Data Structure for Better Performance.
The List Type.
Taking Strings Apart.
Testing Our Split Function.
Putting Strings Together.
Details. 6. Using Library Algorithms.
Analyzing Strings.
Comparing Grading Schemes.
Classifying Students, Revisited.
Algorithms, Containers, and Iterators.
Details. 7. Using Associative Containers.
Containers that Support Efficient Look-Up.
Counting Words.
Generating a Cross-Reference Table.
Generating Sentences.
A Note on Performance.
Details. 8. Writing Generic Functions.
What is a Generic Function?
Data-Structure Independence.
Input and Output Iterators.
Using Iterators for Flexibility.
Details. 9. Defining New Types.
Student_info revisited.
Class Types.
Protection.
The Student_info class.
Constructors.
Using the Student_info class.
Details. 10. Managing Memory and Low-Level Data Structures.
Pointers and Arrays.
String Literals Revisited.
Initializing Arrays of Character Pointers.
Arguments to Main.
Reading and Writing Files.
Three Kinds of Memory Management.
Details. 11. Defining Abstract Data Types.
The Vec Class.
Implementing the Vec Class.
Copy Control.
Dynamic Vecs.
Flexible Memory Management.
Details. 12. Making Class Objects Act Like Values.
A Simple String Class.
Automatic Conversions.
Str Operations.
Some Conversions are Hazardous.
Conversion Operators.
Conversions and Memory Management.
Details. 13. Using Inheritance and Dynamic Binding.
Inheritance.
Polymorphism and Virtual Functions.
Using Inheritance to Solve Our Problem.
A Simple Handle Class.
Using the Handle Class.
Subtleties.
Details. 14. Managing Memory (Almost) Automatically.
Handles that Copy their Objects.
Reference-Counted Handles.
Handles that Let you Decide When to Share Data.
An Improvement on Controllable Handles.
Details. 15. Revisiting Character Pictures.
Design.
Implementation.
Details. 16. Where Do We Go From Here?
Use the Abstractions You Have.
Learn More. Appendix A. Language Details.
Declarations.
Types.
Expressions.
Statements. Appendix B. Library Summary.
Input-Output.
Containers and Iterators.
Algorithms. Index. 020170353XT04062001 | |||||||
| Addison-Wesley Professional - PEARSON | ISBN-10: 020170353X ISBN-13: 9780201703535 | PGS: N/A | List: 49.99 YOUR PRICE: 47.49 | ||||
| Activities Workbook for Knowlton/Barksdale/Turner/Collings/CEP Inc.'s Programming BASICS: Using Microsoft Visual Basic, HTML, C++, a | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| CONTENTS: Unit 1: Introducing Programming Logic and Languages Lesson 1: Introducing Programming Logic and Languages Unit 2: Introduction to Visual Basic Lesson 1: A First Look at Microsoft Visual Basic Lesson 2: Forms, Controls and Properties Lesson 3: Events and Code Lesson 4: Mathematical Operators Lesson 5: Exponentiation, Order of Operations, and Error Handling Lesson 6: Data Types and Variables Lesson 7: Strings and Decimal Types Lesson 8: If Statements Lesson 9: Nested If Statements and Option Buttons Lesson 10: Do Loops Lesson 11: For Next Loops and Multiple Forms Unit 3: Introduction to C++ Lesson 1: Entering, Compiling, and Running a C++ Program Lesson 2: Variables and Constants Lesson 3: Math Operations Lesson 4: How Data Types Affect Calculations Lesson 5: Strings and the String Class Lesson 6: Input and Output Lesson 7: Building Blocks of Decision Making Lesson 8: Selection Structures Lesson 9 : Loops Lesson 10: Building Programs with Functions Lesson 11: Passing Data and Using Library Functions Unit 4: Introduction to Web Programming with HTML and JavaScript Lesson 1: Quick HTML Know-How Lesson 2: HTML Organization Techniques Lesson 3: HTML Power Techniques Lesson 4: What is JavaScript? Lesson 5: Using Images with JavaScript Unit 5: Introduction to Java Lesson 1: Integrating Applets into Web Pages Lesson 2: Introduction to Java Programming Lesson 3: Data Types and Strings Lesson 4: Math Operations Lesson 5: I/O and Exception Handling Lesson 6: Decision Making in Programs Lesson 7: Loops Lesson 8:. Data File Basics Lesson 9: Developing and Inheriting Classes Lesson 10: Arrays and Vectors Lesson 11: Applets | |||||||
| Course Technology - CENGAGE | ISBN-10: 0619058005 ISBN-13: 9780619058005 | PGS: 232 | List: 60.95 YOUR PRICE: 57.90 | ||||
| Activities Workbook for Lambert/Nance's Fundamentals of C++: Introductory, 2nd, 2nd Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| CONTENTS: Unit 1: Getting Started with C++ Lesson 1: Computer Science, Computer Architecture, and Computer Languages Lesson 2: Problem-Solving Fundamentals: Data Types and Output Lesson 3: More Problem-Solving Fundamentals: Calculation and Input Unit 2: Introduction to Control Structures Lesson 4: User-Defined Functions Lesson 5: Selection Statements Lesson 6: Repetition Statements Unit 3: Introduction to Data Structures Lesson 7: Files Lesson 8: Vectors and Matrices Unit 4: Advanced Topics Lesson 9: Introduction to User-Defined Classes Lesson 10: Class Templates, Polymorphism, and Inheritance Lesson 11: Recursion and Efficient Searching and Sorting | |||||||
| Course Technology | S | ISBN-10: 0538695617 ISBN-13: 9780538695619 | PGS: 0 | List: 43.95 YOUR PRICE: 41.75 | |||
| Addison-Wesley's C++ Backpack Reference Guide | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Addison Wesley - PEARSON | ISBN-10: 0321350138 ISBN-13: 9780321350138 | PGS: N/A | List: 15.20 YOUR PRICE: 14.44 | ||||
| ADTs, Data Structures, and Problem Solving with C++, 2nd Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
1. Software Engineering. 2. Introduction to Data Structures and Abstract Data TypesÑC-Style Types. 3. Procedural Programming, Structures, and Classes. 4. Standard I/O and String Classes. 5. Lists. 6. Stacks. 7. Queues. 8. Templates and Standard Containers. 9. Recursion and Algorithm Analysis. 10. More Linked Lists. 11. Binary Trees and Hash Tables. 12. Sorting. 13. OOP and ADTs. 14. Trees. 15. Graphs and Digraphs. Appendix A: ASCII Character Set. Appendix B: Number Systems. Appendix C: Basic C++. Appendix D: Other C++ Features. Appendix E: Answers to Quick Quizzes. Index. | |||||||
| Prentice Hall - PEARSON | ISBN-10: 0131409093 ISBN-13: 9780131409095 | PGS: N/A | List: 167.80 YOUR PRICE: 159.41 | ||||
| Advanced C++ Programming Styles and Idioms, 1st Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
Preface. 1. Introduction.
C++: An Evolving Language.
Handling Complexity with Idioms.
Objects for the Nineties.
Design and Language. 2. Data Abstraction and Abstract Data Types.
Classes.
Object Inversion.
Constructors and Destructors.
Inline Functions.
Initialization of Static Data Members.
Static Member Functions.
Scoping and const.
Initialization Ordering of Global Objects, Constants, and Static Class Members.
Enforcement of const for Class Object Member Functions.
Pointers to Member Functions.
Program Organization Conventions. 3. Concrete Data Types.
The Orthodox Canonical Class Form.
Scoping and Access Control.
Overloading: Redefining the Semantics of Operators and Functions.
Type Conversion.
Reference Counting: Making Variables Use “Magic Memory.”
Operators new and delete.
Separating Initialization from Instantiation. 4. Inheritance.
Simple Inheritance.
Scoping and Access Control.
Constructors and Destructors.
Class Pointer Conversion.
Type Selector Fields. 5. Object-Oriented Programming.
C++ Run-Time Type Support: Virtual Functions.
Destructor Interaction and Virtual Destructors.
Virtual Functions and Scoping.
Pure Virtual Functions and Abstract Base Classes.
Envelope and Letter Classes.
Functors: Functions as Objects.
Multiple Inheritance.
The Inheritance Canonical Form. 6. Object-Oriented Design.
Types and Classes.
The Activities of Object-Oriented Design.
Object-Oriented Analysis and Domain Analysis.
Object and Class Relationships.
Subtyping, Inheritance and Forwarding.
Rules of Thumb for Subtyping, Inheritance, and Independence. 7. Reuse and Objects.
All Analogies Break Down Somewhere.
Design Reuse.
Four Code Reuse Mechanisms.
Parameterized Types, or Templates.
Private Inheritance: Does Inheritance Support Reuse?
Storage Reuse.
Interface Reuse: Variants.
Reuse, Inheritance, and Forwarding.
Architectural Alternatives for Source Reuse.
Generalizations on Reuse and Objects. 8. Programming with Exemplars in C++.
An Example: Employee Exemplars.
Exemplars and Generic Constructors: The Exemplar Community Idiom.
Autonomous Generic Constructors.
Abstract Base Exemplars.
Toward a Frame Exemplar Idiom.
A Word About Notation.
Exemplars and Program Administration. 9. Emulating Symbolic Language Styles in C++.
Incremental C++ Development.
Symbolic Canonical Form.
An Example: A General Collection Class.
Code and Idioms To Support Incremental Loading.
Garbage Collection.
Primitive Type Encapsulation.
Multi-Methods under the Symbolic Idiom. 10. Dynamic Multiple Inheritance.
An Example: A Multi-Technology Window System.
Caveats. 11. Systemic Issues.
Static System Design.
Dynamic System Design. Appendix A: C in a C++ Environment.
Function Calls.
Function Parameters.
Function Prototypes.
Call-by-Reference Parameters.
Variable Number of Parameters.
Function Pointers.
The const Type Modifier.
Interfacing with C Code. Appendix B: Shapes Program: C++ Code. Appendix C: Reference Return Values from Operators. Appendix D: Why Bitwise Copy Doesn’t Work.
Why Member-by-Member Copy Isn’t a Panacea. Appendix E: Symbolic Shapes. Appendix F: Block-Structured Programming in C++.
What is Block-Structured Programming?
Basic Building Blocks for Structured C++ Programming.
An Alternative for Blocks with Deeply Nested Scopes.
Implementation Considerations Block-Structure Video Game Code. Index. 0201548550T04062001 | |||||||
| Addison-Wesley Professional - PEARSON | ISBN-10: 0201548550 ISBN-13: 9780201548556 | PGS: N/A | List: 59.99 YOUR PRICE: 56.99 | ||||
| Advanced CORBA® Programming with C++, 1st Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
Preface. 1. Introduction.
Introduction.
Organization of the Book.
CORBA Version.
Typographical Conventions.
Source Code Examples.
Vendor Dependencies.
Contacting the Authors. I. INTRODUCTION TO CORBA. 2. An Overview of CORBA.
Introduction.
The Object Management Group.
Concepts and Terminology.
CORBA Features.
Request Invocation.
General CORBA Application Development.
Summary. 3. A Minimal CORBA Application.
Chapter Overview.
Writing and Compiling an IDL Definition.
Writing and Compiling a Server.
Writing and Compiling a Client.
Running Client and Server.
Summary. II. CORE CORBA. 4. The OMG Interface Definition Language.
Chapter Overview.
Introduction.
Compilation.
Source Files.
Lexical Rules.
Basic IDL Types.
User-Defined Types.
Interfaces and Operations.
User Exceptions.
System Exceptions.
System Exceptions or User Exceptions?
Oneway Operations.
Contexts.
Attributes.
Modules.
Forward Declarations.
Inheritance.
Names and Scoping.
Repository Identifiers and pragma Directives.
Standard Include Files.
Recent IDL Extensions.
Summary. 5. IDL for a Climate Control System.
Chapter Overview.
The Climate Control System.
IDL for the Climate Control System.
The Complete Specification. 6. Basic IDL-to-C++ Mapping.
Chapter Overview.
Introduction.
Mapping for Identifiers.
Mapping for Modules.
The CORBA Module.
Mapping for Basic Types.
Mapping for Constants.
Mapping for Enumerated Types.
Variable-Length Types and _var Types.
The String_var Wrapper Class.
Mapping for Wide Strings.
Mapping for Fixed-Point Types.
Mapping for Structures.
Mapping for Sequences.
Mapping for Arrays.
Mapping for Unions.
Mapping for Recursive Structures and Unions.
Mapping for Type Definitions.
User-Defined Types and _var Classes.
Summary. 7. Client-Side C++ Mapping.
Chapter Overview.
Introduction.
Mapping for Interfaces.
Object Reference Types.
Life Cycle of Object References.
Semantics of _ptr References.
Pseudo-Objects.
ORB Initialization.
Initial References.
Stringified References.
The Object Pseudo-Interface.
_var References.
Mapping for Operations and Attributes.
Parameter Passing Rules.
Mapping for Exceptions.
Mapping for Contexts.
Summary. 8.Developing a Client for the Climate Control System.
Chapter Overview.
Introduction.
Overall Client Structure.
Included Files.
Helper Functions.
The main Program.
The Complete Client Code.
Summary. 9. Server-Side C++ Mapping.
Chapter Overview.
Introduction.
Mapping for Interfaces.
Servant Classes.
Object Incarnation.
Server main.
Parameter Passing Rules.
Raising Exceptions.
Tie Classes.
Summary. 10. Developing a Server for the Climate Control System.
Chapter Overview.
Introduction.
The Instrument Control Protocol API.
Designing the Thermometer Servant Class.
Implementing the Thermometer Servant Class.
Designing the Thermostat Servant Class.
Implementing the Thermostat Servant Class.
Designing the Controller Servant Class.
Implementing the Controller Servant Class.
Implementing the Server Main Function.
The Complete Server Code.
Summary. 11. The Portable Object Adapter.
Chapter Overview.
Introduction.
POA Fundamentals.
POA Policies.
POA Creation.
Servant IDL Type.
Object Creation and Activation.
Reference, ObjectId, and Servant.
Object Deactivation.
Request Flow Control.
ORB Event Handling.
POA Activation.
POA Destruction.
Applying POA Policies.
Summary. 12. Object Life Cycle.
Chapter Overview.
Introduction.
Object Factories.
Destroying, Copying, and Moving Objects.
A Critique of the Life Cycle Service.
The Evictor Pattern.
Garbage Collection of Servants.
Garbage Collection of CORBA Objects.
Summary. III. CORBA MECHANISMS. 13. GIOP, IIOP, and IORs.
Chapter Overview.
An Overview of GIOP.
Common Data Representation.
GIOP Message Formats.
GIOP Connection Management.
Detecting Disorderly Shutdown.
An Overview of IIOP.
Structure of an IOR.
Bidirectional IIOP.
Summary. 14. Implementation Repositories and Binding.
Chapter Overview.
Binding Modes.
Direct Binding.
Indirect Binding via an Implementation Repository.
Migration, Reliability, Performance, and Scalability.
Activation Modes.
Race Conditions.
Security Considerations.
Summary. IV. DYNAMIC CORBA. 15. C++ Mapping for Type Any.
Chapter Overview.
Introduction.
Type Any C++ Mapping.
Pitfalls in Type Definitions.
Summary. 16. Type Codes.
Chapter Overview.
Introduction.
The TypeCode Pseudo-Object.
C++ Mapping for the TypeCode Pseudo-Object.
Type Code Comparisons.
Type Code Constants.
Type Code Comparison for Type Any.
Creating Type Codes Dynamically.
Summary. 17. Type DynAny.
Chapter Overview.
Introduction.
The DynAny Interface.
C++ Mapping for the DynAny Pseudo-Object.
Using DynAny for Generic Display.
Obtaining Type Information.
Summary. V. CORBASERVICES. 18. The OMG Naming Service.
Chapter Overview.
Introduction.
Basic Concepts.
Structure of the Naming Service IDL.
Semantics of Names.
Naming Context IDL.
Iterators.
Pitfalls in the Naming Service.
The Names Library.
Naming Service Tools.
What to Advertise.
When to Advertise.
Federated Naming.
Adding Naming to the Climate Control System.
Summary. 19. The OMG Trading Service.
Chapter Overview.
Introduction.
Trading Concepts and Terminology.
IDL Overview.
The Service Type Repository.
The Trader Interfaces.
Exporting Service Offers.
Withdrawing Service Offers.
Modifying Service Offers.
The Trader Constraint Language.
Importing Service Offers.
Bulk Withdrawal.
The Admin Interface.
Inspecting Service Offers.
Exporting Dynamic Properties.
Trader Federation.
Trader Tools.
Architectural Considerations.
What to Advertise.
Avoiding Duplicate Service Offers.
Adding Trading to the Climate Control System.
Summary. 20. The OMG Event Service.
Chapter Overview.
Introduction.
Distributed Callbacks.
Event Service Basics.
Event Service Interfaces.
Implementing Consumers and Suppliers.
Choosing an Event Model.
Event Service Limitations.
Summary. VI. POWER CORBA. 21. Multithreaded Applications.
Chapter Overview.
Introduction.
Motivation for Multithreaded Programs.
Fundamentals of Multithreaded Servers.
Multithreading Strategies.
Implementing a Multithreaded Server.
Servant Activators and the Evictor Pattern.
Summary. 22. Performance, Scalability, and Maintainability.
Chapter Overview.
Introduction.
Reducing Messaging Overhead.
Optimizing Server Implementations.
Federating Services.
Improving Physical Design.
Summary. Appendix A: Source Code for the ICP Simulator. < | |||||||
| Addison-Wesley Professional - PEARSON | ISBN-10: 0201379279 ISBN-13: 9780201379273 | PGS: N/A | List: 79.99 YOUR PRICE: 75.99 | ||||
| Advanced Qt Programming: Creating Great Software with C++ and Qt 4, 1st Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Prentice Hall - PEARSON | H | ISBN-10: 0321635906 ISBN-13: 9780321635907 | PGS: N/A | List: 54.99 YOUR PRICE: 52.24 | |||
| Advanced Six Degrees of Freedom Aerospace Simulation and Analysis in C++ | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| The culmination of Dr. Zipfelís renowned teaching tools is this multimedia CD on high fidelity aerospace simulations. If you have mastered his previous publications, or if you are a professional working in modeling and simulation, you will profit from this interactive training of advanced aerospace systems in C++. In 20 Labs you will learn the formulation of six degrees of freedom equations of motions over the rotating elliptical Earth. Study the aerodynamics, propulsion and flight controls of a hypersonic ascent vehicle. Insert a transfer vehicle into orbit, and release an interceptor that rendezvous with a space station or intercepts a satellite. You will use 17 progressively more complex simulations that model such advanced systems as INS, GPS with Kalman filter, star tracker, rendezvous and intercept guidance with phased array seeker. You will be rewarded with a sophisticated simulation for a three stage hypersonic vehicle with orbiting space station and ground tracking radar, as well as MatlabÆ m-files for flight controller design. This CD builds on two previously published self-study courses, entitled: Building Aerospace Simulations in C++ and Fundamentals of Six Degrees of Freedom Aerospace Simulations and Analysis in FORTRAN and C++, and is anchored in the textbook Modeling and Simulation of Aerospace Vehicle Dynamics.You may picture yourself being in a classroom at the University of Florida with students who have used the same material to earn 3 graduate credits. All you need is this CD, the textbook, the Microsoft C++ 6 or 7 compiler, and Microsoft Internet Explorer 6. Use this CADAC web link CADAC web link to apply for a free CD with tailor-made plotting programs. The instructions come alive with 90 video and audio clips, and about 800 hyperlinks connecting the 619 training charts. A total of 150 hands-on exercises will help you explore the simulations and check your progress against the provided solutions. Once completed, you will have mastered most key components of advanced aerospace simulations." | |||||||
| AIAA | ISBN-10: 1563477947 ISBN-13: 9781563477942 | PGS: N/A | List: 265.00 YOUR PRICE: 251.75 | ||||
| ADVANCED VISUAL C++ 5 | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Contents: Review of Visual C++; Customizing Your Windows; Powerful Visual C++ User-Interface Methods; More Power with Graphics; In-Depth Working with Memory in Visual C++; Making Dynamic Link Libraries Work for You; Behind the Scenes with Windows Hooks; Multithreaded Programs & Synchronization in Visual C++ 5; Making Full Use of Windows 95's Resources; Building ActiveX Controls & Using Databases. CD-ROM INCLUDED. | |||||||
| M&T | S | ISBN-10: 1558515658 ISBN-13: 9781558515659 | PGS: 654 | List: 49.95 YOUR PRICE: 42.46 | |||
| Algorithms and Data Structures in C++ | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Some Aspects of Programming in C++. Arithmetic. Sorting Arrays and Files. Stacks, Queues and Lists. Searching and String Processing. Binary Trees. B-trees. Tries, Priority Queues and File Compression. Graphs. Some Combinatorial Algorithms. Fundamentals of Interpreters and Compilers. Appendix. Bibliography. Index. | |||||||
| JOHN WILEY & SONS | S | ISBN-10: 0471963550 ISBN-13: 9780471963554 | PGS: 368 | List: 93.95 YOUR PRICE: 89.25 | |||
| Algorithms and Data Structures in C++ | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Data Representations. Algorithms. Data Structures and Searching. Algorithms for Computer Arithmetic. Index. | |||||||
| CRC - TAYLOR & FRANCIS | H | ISBN-10: 0849371716 ISBN-13: 9780849371714 | PGS: 272 | List: 79.95 YOUR PRICE: 75.95 | |||
| Algorithms in C++ Part 5: Graph Algorithms, 3rd Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
17. Graph Properties and Types.
Glossary.
Graph ADT.
Adjacency-Matrix Representation.
Adjacency-Lists Representation.
Variations, Extensions, and Costs.
Graph Generators.
Simple, Euler, and Hamilton Paths.
Graph-Processing Problems. 18. Graph Search.
Exploring a Maze.
Depth-First Search.
Graph-Search ADT Functions.
Properties of DFS Forests.
DFS Algorithms.
Separability and Biconnectivity.
Breadth-First Search.
Generalized Graph Search.
Analysis of Graph Algorithms. 19. Digraphs and DAGs.
Glossary and Rules of the Game.
Anatomy of DFS in Digraphs.
Reachability and Transitive Closure.
Equivalence Relations and Partial Orders.
DAGs.
Topological Sorting.
Reachability in DAGs.
Strong Components in Digraphs.
Transitive Closure Revisited.
Perspective. 20. Minimum Spanning Trees.
Representations.
Underlying Principles of MST Algorithms.
Prim's Algorithm and Priority-First Search.
Kruskal's Algorithm.
Boruvka's Algorithm.
Comparisons and Improvements.
Euclidean MST. 21. Shortest Paths.
Underlying Principles.
Dijkstra's algorithm.
All-Pairs Shortest Paths.
Shortest Paths in Acyclic Networks.
Euclidean Networks.
Reduction.
Negative Weights.
Perspective. 22. Network Flow.
Flow Networks.
Augmenting-Path Maxflow Algorithms.
Preflow-Push Maxflow Algorithms.
Maxflow Reductions.
Mincost Flows.
Network Simplex Algorithm.
Mincost-Flow Reductions.
Perspective. References for Part Five. Index. 0201361183T12172001 | |||||||
| Addison-Wesley Professional - PEARSON | ISBN-10: 0201361183 ISBN-13: 9780201361186 | PGS: N/A | List: 54.99 YOUR PRICE: 52.24 | ||||
| Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, 3rd Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
FUNDAMENTALS. 1. Introduction.
Algorithms.
A Sample Problem-Connectivity.
Union-Find Algorithms.
Perspective.
Summary of Topics. 2. Principles of Algorithm Analysis.
Implementation and Empirical Analysis.
Analysis of Algorithms.
Growth of Functions.
Big-Oh Notation.
Basic Recurrences.
Examples of Algorithm Analysis.
Guarantees, Predictions, and Limitations. DATA STRUCTURES. 3. Elementary Data Structures.
Building Blocks.
Arrays.
Linked Lists.
Elementary List Processing.
Memory Allocation for Lists.
Strings.
Compound Data Structures. 4. Abstract Data Types.
Abstract Objects and Collections of Objects.
Pushdown Stack ADT.
Examples of Stack ADT Clients.
Stack ADT Implementations.
Creation of a New ADT.
FIFO Queues and Generalized Queues.
Duplicate and Index Items.
First-Class ADTs.
Application-Based ADT Example.
Perspective. 5. Recursion and Trees.
Recursive Algorithms.
Divide and Conquer.
Dynamic Programming.
Trees.
Mathematical Properties of Trees.
Tree Traversal.
Recursive Binary-Tree Algorithms.
Graph Traversal.
Perspective. SORTING. 6. Elementary Sorting Methods.
Rules of the Game.
Selection Sort.
Insertion Sort.
Bubble Sort.
Performance Characteristics of Elementary Sorts.
Shellsort.
Sorting Other Types of Data.
Index and Pointer Sorting.
Sorting Linked Lists.
Key-Indexed Counting. 7. Quicksort.
The Basic Algorithm.
Performance Characteristics of Quicksort.
Stack Size.
Small Subfiles.
Median-of-Three Partitioning.
Duplicate Keys.
Strings and Vectors.
Selection. 8. Merging and Mergesort.
Two-Way Merging.
Abstract In-Place Merge.
Top-Down Mergesort.
Improvements to the Basic Algorithm.
Bottom-Up Mergesort.
Performance Characteristics of Mergesort.
Linked-List Implementations of Mergesort.
Recursion Revisited. 9. Priority Queues and Heapsort.
Elementary Implementations.
Heap Data Structure.
Algorithms on Heaps.
Heapsort.
Priority-Queue ADT.
Priority Queues for Index Items.
Binomial Queues. 10. Radix Sorting.
Bits, Bytes, and Words.
Binary Quicksort.
MSD Radix Sort.
Three-Way Radix Quicksort.
LSD Radix Sort.
Performance Characteristics of Radix Sorts.
Sublinear-Time Sorts. 11. Special-Purpose Sorts.
Batcher's Odd-Even Mergesort.
Sorting Networks.
External Sorting.
Sort-Merge Implementations.
Parallel Sort/Merge. SEARCHING. 12. Symbol Tables and BSTs.
Symbol-Table Abstract Data Type.
Key-Indexed Search.
Sequential Search.
Binary Search.
Binary Search Trees (BSTs).
Performance Characteristics of BSTs.
Index Implementations with Symbol Tables.
Insertion at the Root in BSTs.
BST Implementations of Other ADT Functions. 13. Balanced Trees.
Randomized BSTs.
Splay BSTs.
Top-Down 2-3-4 Trees.
Red-Black Trees.
Skip Lists.
Performance Characteristics.
Separate Chaining.
Linear Probing.
Double Hashing.
Dynamic Hash Tables.
Perspective. 15. Radix Search.
Digital Search Trees.
Tries.
Patricia Tries.
Multiway Tries and TSTs.
Text String Index Applications. 16. External Searching.
Rules of the Game.
Indexed Sequential Access.
B Trees.
Extendible Hashing.
Perspective. Index. 0201350882T04062001 | |||||||
| Addison-Wesley Professional - PEARSON | ISBN-10: 0201350882 ISBN-13: 9780201350883 | PGS: N/A | List: 69.99 YOUR PRICE: 66.49 | ||||
| An Introduction to Object-Oriented Programming in C++ | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| This second edition introduces readers to programming in C++, from the simplest of C++ programs through features such as classes and templates to namespaces. Emphasis is placed on developing a good programming technique. This new edition includes: * Th, OverviewThe Development EnvironmentGetting StartedFundamental Data Types, Declarations, Definitions and ExpressionsMaking Decisions and RepetitionFunctionsArraysStructures, Unions, Enumerations and TypedefsThe C++ ClassOperators and OverloadingF | |||||||
| SPRINGER VERLAG | S | ISBN-10: 1852334505 ISBN-13: 9781852334505 | PGS: N/A | List: 115.00 YOUR PRICE: 109.25 | |||
![]() |
Your search found 250 books Now viewing Books 1 - 25 In stock items ship IMMEDIATELY. Other titles usually ship within 2-3 days. |
![]() |
|---|
| Location/Hours/General Info. | Ordering & Shipping | Search Techniques/Examples |
| Corporate Accounts | Government Buyers | Librarians |
| Universities & Colleges | Training Accounts | International Orders |
| Technical Books on these areas & more: | ||
|---|---|---|
| Computer | Business | Electronics |
| Engineering | Uniform & Code | Construction |
| Film & TV Industry | Legal | Medical |
| Recording Industry | Math & Science | Classic & Out-Of-Print Titles |
OPAMP Technical Books
1033 N. Sycamore Avenue
Los Angeles, California 90038
USA
800-468-4322 / 323-464-4322 FAX
323-464-0977
Copyright © 1997-2007 Opamp Technical Books, Inc.