Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Introduction to Java programming : brief version / / Y. Daniel Liang ; global edition contributions by Ming-Jyh Tsai
| Introduction to Java programming : brief version / / Y. Daniel Liang ; global edition contributions by Ming-Jyh Tsai |
| Autore | Liang Y. Daniel |
| Edizione | [Tenth edition, Global edition.] |
| Pubbl/distr/stampa | Boston : , : Pearson Education Limited, , [2015] |
| Descrizione fisica | 1 online resource (800 pages) : illustrations, tables |
| Disciplina | 005.133 |
| Collana | Always Learning |
| ISBN | 1-292-07857-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover -- Title -- Copyright -- Chapter 1 Introduction to Computers, Programs,and Java -- 1.1 Introduction -- 1.2 What Is a Computer? -- 1.3 Programming Languages -- 1.4 Operating Systems -- 1.5 Java, the World Wide Web, and Beyond -- 1.6 The Java Language Specification, API, JDK, and IDE -- 1.7 A Simple Java Program -- 1.8 Creating, Compiling, and Executing a Java Program -- 1.9 Programming Style and Documentation -- 1.10 Programming Errors -- 1.11 Developing Java Programs Using NetBeans -- 1.12 Developing Java Programs Using Eclipse -- Chapter 2 Elementary Programming -- 2.1 Introduction -- 2.2 Writing a Simple Program -- 2.3 Reading Input from the Console -- 2.4 Identifiers -- 2.5 Variables -- 2.6 Assignment Statements and Assignment Expressions -- 2.7 Named Constants -- 2.8 Naming Conventions -- 2.9 Numeric Data Types and Operations -- 2.10 Numeric Literals -- 2.11 Evaluating Expressions and Operator Precedence -- 2.12 Case Study: Displaying the Current Time -- 2.13 Augmented Assignment Operators -- 2.14 Increment and Decrement Operators -- 2.15 Numeric Type Conversions -- 2.16 Software Development Process -- 2.17 Case Study: Counting Monetary Units -- 2.18 Common Errors and Pitfalls -- Chapter 3 Selections -- 3.1 Introduction -- 3.2 boolean Data Type -- 3.3 if Statements -- 3.4 Two-Way if-else Statements -- 3.5 Nested if and Multi-Way if-else Statements -- 3.6 Common Errors and Pitfalls -- 3.7 Generating Random Numbers -- 3.8 Case Study: Computing Body Mass Index -- 3.9 Case Study: Computing Taxes -- 3.10 Logical Operators -- 3.11 Case Study: Determining Leap Year -- 3.12 Case Study: Lottery -- 3.13 switch Statements -- 3.14 Conditional Expressions -- 3.15 Operator Precedence and Associativity -- 3.16 Debugging -- Chapter 4 Mathematical Functions, Characters,and Strings -- 4.1 Introduction -- 4.2 Common Mathematical Functions.
4.3 Character Data Type and Operations -- 4.4 The String Type -- 4.5 Case Studies -- 4.6 Formatting Console Output -- Chapter 5 Loops -- 5.1 Introduction -- 5.2 The while Loop -- 5.3 The do-while Loop -- 5.4 The for Loop -- 5.5 Which Loop to Use? -- 5.6 Nested Loops -- 5.7 Minimizing Numeric Errors -- 5.8 Case Studies -- 5.9 Keywords break and continue -- 5.10 Case Study: Checking Palindromes -- 5.11 Case Study: Displaying Prime Numbers -- Chapter 6 Methods -- 6.1 Introduction -- 6.2 Defining a Method -- 6.3 Calling a Method -- 6.4 void Method Example -- 6.5 Passing Arguments by Values -- 6.6 Modularizing Code -- 6.7 Case Study: Converting Hexadecimals to Decimals -- 6.8 Overloading Methods -- 6.9 The Scope of Variables -- 6.10 Case Study: Generating Random Characters -- 6.11 Method Abstraction and Stepwise Refinement -- Chapter 7 Single-Dimensional Arrays -- 7.1 Introduction -- 7.2 Array Basics -- 7.3 Case Study: Analyzing Numbers -- 7.4 Case Study: Deck of Cards -- 7.5 Copying Arrays -- 7.6 Passing Arrays to Methods -- 7.7 Returning an Array from a Method -- 7.8 Case Study: Counting the Occurrences of Each Letter -- 7.9 Variable-Length Argument Lists -- 7.10 Searching Arrays -- 7.11 Sorting Arrays -- 7.12 The Arrays Class -- 7.13 Command-Line Arguments -- Chapter 8 Multidimensional Arrays -- 8.1 Introduction -- 8.2 Two-Dimensional Array Basics -- 8.3 Processing Two-Dimensional Arrays -- 8.4 Passing Two-Dimensional Arrays to Methods -- 8.5 Case Study: Grading a Multiple-Choice Test -- 8.6 Case Study: Finding the Closest Pair -- 8.7 Case Study: Sudoku -- 8.8 Multidimensional Arrays -- Chapter 9 Objects and Classes -- 9.1 Introduction -- 9.2 Defining Classes for Objects -- 9.3 Example: Defining Classes and Creating Objects -- 9.4 Constructing Objects Using Constructors -- 9.5 Accessing Objects via Reference Variables. 9.6 Using Classes from the Java Library -- 9.7 Static Variables, Constants, and Methods -- 9.8 Visibility Modifiers -- 9.9 Data Field Encapsulation -- 9.10 Passing Objects to Methods -- 9.11 Array of Objects -- 9.12 Immutable Objects and Classes -- 9.13 The Scope of Variables -- 9.14 The this Reference -- Chapter 10 Object-Oriented Thinking -- 10.1 Introduction -- 10.2 Class Abstraction and Encapsulation -- 10.3 Thinking in Objects -- 10.4 Class Relationships -- 10.5 Case Study: Designing the Course Class -- 10.6 Case Study: Designing a Class for Stacks -- 10.7 Processing Primitive Data Type Values as Objects -- 10.8 Automatic Conversion between Primitive Types and Wrapper Class Types -- 10.9 The BigInteger and BigDecimal Classes -- 10.10 The String Class -- 10.11 The StringBuilder and StringBuffer Classes -- Chapter 11 Inheritance and Polymorphism -- 11.1 Introduction -- 11.2 Superclasses and Subclasses -- 11.3 Using the super Keyword -- 11.4 Overriding Methods -- 11.5 Overriding vs. Overloading -- 11.6 The Object Class and Its toString() Method -- 11.7 Polymorphism -- 11.8 Dynamic Binding -- 11.9 Casting Objects and the instanceof Operator -- 11.10 The Object's equals Method -- 11.11 The ArrayList Class -- 11.12 Useful Methods for Lists -- 11.13 Case Study: A Custom Stack Class -- 11.14 The protected Data and Methods -- 11.15 Preventing Extending and Overriding -- Chapter 12 Exception Handling and Text I/O -- 12.1 Introduction -- 12.2 Exception-Handling Overview -- 12.3 Exception Types -- 12.4 More on Exception Handling -- 12.5 The finally Clause -- 12.6 When to Use Exceptions -- 12.7 Rethrowing Exceptions -- 12.8 Chained Exceptions -- 12.9 Defining Custom Exception Classes -- 12.10 The File Class -- 12.11 File Input and Output -- 12.12 Reading Data from the Web -- 12.13 Case Study: Web Crawler -- Chapter 13 Abstract Classes and Interfaces. 13.1 Introduction -- 13.2 Abstract Classes -- 13.3 Case Study: the Abstract Number Class -- 13.4 Case Study: Calendar and GregorianCalendar -- 13.5 Interfaces -- 13.6 The Comparable Interface -- 13.7 The Cloneable Interface -- 13.8 Interfaces vs. Abstract Classes -- 13.9 Case Study: The Rational Class -- 13.10 Class Design Guidelines -- Chapter 14 JavaFX Basics -- 14.1 Introduction -- 14.2 JavaFX vs Swing and AWT -- 14.3 The Basic Structure of a JavaFX Program -- 14.4 Panes, UI Controls, and Shapes -- 14.5 Property Binding -- 14.6 Common Properties and Methods for Nodes -- 14.7 The Color Class -- 14.8 The Font Class -- 14.9 The Image and ImageView Classes -- 14.10 Layout Panes -- 14.11 Shapes -- 14.12 Case Study: The ClockPane Class -- Chapter 15 Event-Driven Programming and Animations -- 15.1 Introduction -- 15.2 Events and Event Sources -- 15.3 Registering Handlers and Handling Events -- 15.4 Inner Classes -- 15.5 Anonymous Inner Class Handlers -- 15.6 Simplifying Event Handling Using Lambda Expressions -- 15.7 Case Study: Loan Calculator -- 15.8 Mouse Events -- 15.9 Key Events -- 15.10 Listeners for Observable Objects -- 15.11 Animation -- 15.12 Case Study: Bouncing Ball -- Chapter 16 JavaFX UI Controls and Multimedia -- 16.1 Introduction -- 16.2 Labeled and Label -- 16.3 Button -- 16.4 CheckBox -- 16.5 RadioButton -- 16.6 TextField -- 16.7 TextArea -- 16.8 ComboBox -- 16.9 ListView -- 16.10 ScrollBar -- 16.11 Slider -- 16.12 Case Study: Developing a Tic-Tac-Toe Game -- 16.13 Video and Audio -- 16.14 Case Study: National Flags and Anthems -- Chapter 17 Binary I/O -- 17.1 Introduction -- 17.2 How Is Text I/O Handled in Java? -- 17.3 Text I/O vs. Binary I/O -- 17.4 Binary I/O Classes -- 17.5 Case Study: Copying Files -- 17.6 Object I/O -- 17.7 Random-Access Files -- Chapter 18 Recursion -- 18.1 Introduction -- 18.2 Case Study: Computing Factorials. 18.3 Case Study: Computing Fibonacci Numbers -- 18.4 Problem Solving Using Recursion -- 18.5 Recursive Helper Methods -- 18.6 Case Study: Finding the Directory Size -- 18.7 Case Study: Tower of Hanoi -- 18.8 Case Study: Fractals -- 18.9 Recursion vs. Iteration -- 18.10 Tail Recursion -- Appendix A Java Keywords -- Appendix B The ASCII Character Set -- Appendix C Operator Precedence Chart -- Appendix D Java Modifiers -- Appendix E Special Floating-Point Values -- Appendix F Number Systems -- Appendix G Bitwise Operations -- Appendix H Regular Expressions -- Appendix I Enumerated Types -- Index -- Symbols. |
| Record Nr. | UNINA-9910154775003321 |
Liang Y. Daniel
|
||
| Boston : , : Pearson Education Limited, , [2015] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Introduction to Java programming : comprehensive version / / Y. Daniel Liang
| Introduction to Java programming : comprehensive version / / Y. Daniel Liang |
| Autore | Liang Y. Daniel |
| Edizione | [Tenth edition, Global edition.] |
| Pubbl/distr/stampa | Harlow, England : , : Pearson, , 2015 |
| Descrizione fisica | 1 online resource (1,344 pages) : illustrations (some color), tables |
| Disciplina | 005.13/3 |
| Collana | Always Learning |
| Soggetto topico | Java (Computer program language) |
| ISBN |
1-4886-7092-7
1-292-07002-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover -- Title -- Copyright -- Contents -- Chapter 1 Introduction to Computers, Programs, and Java -- 1.1 Introduction -- 1.2 What Is a Computer? -- 1.3 Programming Languages -- 1.4 Operating Systems -- 1.5 Java, the World Wide Web, and Beyond -- 1.6 The Java Language Specification, API, JDK, and IDE -- 1.7 A Simple Java Program -- 1.8 Creating, Compiling, and Executing a Java Program -- 1.9 Programming Style and Documentation -- 1.10 Programming Errors -- 1.11 Developing Java Programs Using NetBeans -- 1.12 Developing Java Programs Using Eclipse -- Chapter 2 Elementary Programming -- 2.1 Introduction -- 2.2 Writing a Simple Program -- 2.3 Reading Input from the Console -- 2.4 Identifiers -- 2.5 Variables -- 2.6 Assignment Statements and Assignment Expressions -- 2.7 Named Constants -- 2.8 Naming Conventions -- 2.9 Numeric Data Types and Operations -- 2.10 Numeric Literals -- 2.11 Evaluating Expressions and Operator Precedence -- 2.12 Case Study: Displaying the Current Time -- 2.13 Augmented Assignment Operators -- 2.14 Increment and Decrement Operators -- 2.15 Numeric Type Conversions -- 2.16 Software Development Process -- 2.17 Case Study: Counting Monetary Units -- 2.18 Common Errors and Pitfalls -- Chapter 3 Selections -- 3.1 Introduction -- 3.2 boolean Data Type -- 3.3 if Statements -- 3.4 Two-Way if-else Statements -- 3.5 Nested if and Multi-Way if-else Statements -- 3.6 Common Errors and Pitfalls -- 3.7 Generating Random Numbers -- 3.8 Case Study: Computing Body Mass Index -- 3.9 Case Study: Computing Taxes -- 3.10 Logical Operators -- 3.11 Case Study: Determining Leap Year -- 3.12 Case Study: Lottery -- 3.13 switch Statements -- 3.14 Conditional Expressions -- 3.15 Operator Precedence and Associativity -- 3.16 Debugging -- Chapter 4 Mathematical Functions, Characters, and Strings -- 4.1 Introduction -- 4.2 Common Mathematical Functions.
4.3 Character Data Type and Operations -- 4.4 The String Type -- 4.5 Case Studies -- 4.6 Formatting Console Output -- Chapter 5 Loops -- 5.1 Introduction -- 5.2 The while Loop -- 5.3 The do-while Loop -- 5.4 The for Loop -- 5.5 Which Loop to Use? -- 5.6 Nested Loops -- 5.7 Minimizing Numeric Errors -- 5.8 Case Studies -- 5.9 Keywords break and continue -- 5.10 Case Study: Checking Palindromes -- 5.11 Case Study: Displaying Prime Numbers -- Chapter 6 Methods -- 6.1 Introduction -- 6.2 Defining a Method -- 6.3 Calling a Method -- 6.4 Void Method Example -- 6.5 Passing Arguments by Values -- 6.6 Modularizing Code -- 6.7 Case Study: Converting Hexadecimals to Decimals -- 6.8 Overloading Methods -- 6.9 The Scope of Variables -- 6.10 Case Study: Generating Random Characters -- 6.11 Method Abstraction and Stepwise Refinement -- Chapter 7 Single-Dimensional Arrays -- 7.1 Introduction -- 7.2 Array Basics -- 7.3 Case Study: Analyzing Numbers -- 7.4 Case Study: Deck of Cards -- 7.5 Copying Arrays -- 7.6 Passing Arrays to Methods -- 7.7 Returning an Array from a Method -- 7.8 Case Study: Counting the Occurrences of Each Letter -- 7.9 Variable-Length Argument Lists -- 7.10 Searching Arrays -- 7.11 Sorting Arrays -- 7.12 The Arrays Class -- 7.13 Command-Line Arguments -- Chapter 8 Multidimensional Arrays -- 8.1 Introduction -- 8.2 Two-Dimensional Array Basics -- 8.3 Processing Two-Dimensional Arrays -- 8.4 Passing Two-Dimensional Arrays to Methods -- 8.5 Case Study: Grading a Multiple-Choice Test -- 8.6 Case Study: Finding the Closest Pair -- 8.7 Case Study: Sudoku -- 8.8 Multidimensional Arrays -- Chapter 9 Objects and Classes -- 9.1 Introduction -- 9.2 Defining Classes for Objects -- 9.3 Example: Defining Classes and Creating Objects -- 9.4 Constructing Objects Using Constructors -- 9.5 Accessing Objects via Reference Variables. 9.6 Using Classes from the Java Library -- 9.7 Static Variables, Constants, and Methods -- 9.8 Visibility Modifiers -- 9.9 Data Field Encapsulation -- 9.10 Passing Objects to Methods -- 9.11 Array of Objects -- 9.12 Immutable Objects and Classes -- 9.13 The Scope of Variables -- 9.14 The this Reference -- Chapter 10 Object-Oriented Thinking -- 10.1 Introduction -- 10.2 Class Abstraction and Encapsulation -- 10.3 Thinking in Objects -- 10.4 Class Relationships -- 10.5 Case Study: Designing the Course Class -- 10.6 Case Study: Designing a Class for Stacks -- 10.7 Processing Primitive Data Type Values as Objects -- 10.8 Automatic Conversion between Primitive Types and Wrapper Class Types -- 10.9 The BigInteger and BigDecimal Classes -- 10.10 The String Class -- 10.11 The StringBuilder and StringBuffer Classes -- Chapter 11 Inheritance and Polymorphism -- 11.1 Introduction -- 11.2 Superclasses and Subclasses -- 11.3 Using the super Keyword -- 11.4 Overriding Methods -- 11.5 Overriding vs. Overloading -- 11.6 The Object Class and Its toString() Method -- 11.7 Polymorphism -- 11.8 Dynamic Binding -- 11.9 Casting Objects and the instanceof Operator -- 11.10 The Object's equals Method -- 11.11 The ArrayList Class -- 11.12 Useful Methods for Lists -- 11.13 Case Study: A Custom Stack Class -- 11.14 The protected Data and Methods -- 11.15 Preventing Extending and Overriding -- Chapter 12 Exception Handling and Text I/O -- 12.1 Introduction -- 12.2 Exception-Handling Overview -- 12.3 Exception Types -- 12.4 More on Exception Handling -- 12.5 The finally Clause -- 12.6 When to Use Exceptions -- 12.7 Rethrowing Exceptions -- 12.8 Chained Exceptions -- 12.9 Defining Custom Exception Classes -- 12.10 The File Class -- 12.11 File Input and Output -- 12.12 Reading Data from the Web -- 12.13 Case Study: Web Crawler -- Chapter 13 Abstract Classes and Interfaces. 13.1 Introduction -- 13.2 Abstract Classes -- 13.3 Case Study: the Abstract Number Class -- 13.4 Case Study: Calendar and GregorianCalendar -- 13.5 Interfaces -- 13.6 The Comparable Interface -- 13.7 The Cloneable Interface -- 13.8 Interfaces vs. Abstract Classes -- 13.9 Case Study: The Rational Class -- 13.10 Class Design Guidelines -- Chapter 14 JavaFX Basics -- 14.1 Introduction -- 14.2 JavaFX vs Swing and AWT -- 14.3 The Basic Structure of a JavaFX Program -- 14.4 Panes, UI Controls, and Shapes -- 14.5 Property Binding -- 14.6 Common Properties and Methods for Nodes -- 14.7 The Color Class -- 14.8 The Font Class -- 14.9 The Image and ImageView Classes -- 14.10 Layout Panes -- 14.11 Shapes -- 14.12 Case Study: The ClockPane Class -- Chapter 15 Event-Driven Programming and Animations -- 15.1 Introduction -- 15.2 Events and Event Sources -- 15.3 Registering Handlers and Handling Events -- 15.4 Inner Classes -- 15.5 Anonymous Inner Class Handlers -- 15.6 Simplifying Event Handling Using Lambda Expressions -- 15.7 Case Study: Loan Calculator -- 15.8 Mouse Events -- 15.9 Key Events -- 15.10 Listeners for Observable Objects -- 15.11 Animation -- 15.12 Case Study: Bouncing Ball -- Chapter 16 JavaFX UI Controls and Multimedia -- 16.1 Introduction -- 16.2 Labeled and Label -- 16.3 Button -- 16.4 CheckBox -- 16.5 RadioButton -- 16.6 TextField -- 16.7 TextArea -- 16.8 ComboBox -- 16.9 ListView -- 16.10 ScrollBar -- 16.11 Slider -- 16.12 Case Study: Developing a Tic-Tac-Toe Game -- 16.13 Video and Audio -- 16.14 Case Study: National Flags and Anthems -- Chapter 17 Binary I/O -- 17.1 Introduction -- 17.2 How Is Text I/O Handled in Java? -- 17.3 Text I/O vs. Binary I/O -- 17.4 Binary I/O Classes -- 17.5 Case Study: Copying Files -- 17.6 Object I/O -- 17.7 Random-Access Files -- Chapter 18 Recursion -- 18.1 Introduction -- 18.2 Case Study: Computing Factorials. 18.3 Case Study: Computing Fibonacci Numbers -- 18.4 Problem Solving Using Recursion -- 18.5 Recursive Helper Methods -- 18.6 Case Study: Finding the Directory Size -- 18.7 Case Study: Tower of Hanoi -- 18.8 Case Study: Fractals -- 18.9 Recursion vs. Iteration -- 18.10 Tail Recursion -- Chapter 19 Generics -- 19.1 Introduction -- 19.2 Motivations and Benefits -- 19.3 Defining Generic Classes and Interfaces -- 19.4 Generic Methods -- 19.5 Case Study: Sorting an Array of Objects -- 19.6 Raw Types and Backward Compatibility -- 19.7 Wildcard Generic Types -- 19.8 Erasure and Restrictions on Generics -- 19.9 Case Study: Generic Matrix Class -- Chapter 20 Lists, Stacks, Queues, and Priority Queues -- 20.1 Introduction -- 20.2 Collections -- 20.3 Iterators -- 20.4 Lists -- 20.5 The Comparator Interface -- 20.6 Static Methods for Lists and Collections -- 20.7 Case Study: Bouncing Balls -- 20.8 Vector and Stack Classes -- 20.9 Queues and Priority Queues -- 20.10 Case Study: Evaluating Expressions -- Chapter 21 Sets and Maps -- 21.1 Introduction -- 21.2 Sets -- 21.3 Comparing the Performance of Sets and Lists -- 21.4 Case Study: Counting Keywords -- 21.5 Maps -- 21.6 Case Study: Occurrences of Words -- 21.7 Singleton and Unmodifiable Collections and Maps -- Chapter 22 Developing Efficient Algorithms -- 22.1 Introduction -- 22.2 Measuring Algorithm Efficiency Using Big O Notation -- 22.3 Examples: Determining Big O -- 22.4 Analyzing Algorithm Time Complexity -- 22.5 Finding Fibonacci Numbers Using Dynamic Programming -- 22.6 Finding Greatest Common Divisors Using Euclid's Algorithm -- 22.7 Efficient Algorithms for Finding Prime Numbers -- 22.8 Finding the Closest Pair of Points Using Divide-and-Conquer -- 22.9 Solving the Eight Queens Problem Using Backtracking -- 22.10 Computational Geometry: Finding a Convex Hull -- Chapter 23 Sorting -- 23.1 Introduction. 23.2 Insertion Sort. |
| Record Nr. | UNINA-9910154769403321 |
|
Liang Y. Daniel
|
||
| Harlow, England : , : Pearson, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Introduction to programming with C++ / / Y. Daniel Liang ; international edition contributions by Mohit P. Tahiliani, NITK Surathkal
| Introduction to programming with C++ / / Y. Daniel Liang ; international edition contributions by Mohit P. Tahiliani, NITK Surathkal |
| Autore | Liang Y. Daniel |
| Edizione | [Third edition, International edition.] |
| Pubbl/distr/stampa | Upper Saddle River : , : Pearson, , [2014] |
| Descrizione fisica | 1 online resource (714 pages) |
| Disciplina | 001.6424 |
| Collana | Always learning |
| Soggetto topico | C (Computer program language) |
| ISBN | 0-273-79419-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover -- CONTENTS -- Chapter 1 Introduction to Computers, Programs, and C++ -- 1.1 Introduction -- 1.2 What Is a Computer? -- 1.3 Programming Languages -- 1.4 Operating Systems -- 1.5 History of C++ -- 1.6 A Simple C++ Program -- 1.7 C++ Program-Development Cycle -- 1.8 Programming Style and Documentation -- 1.9 Programming Errors -- Chapter 2 elementary Programming -- 2.1 Introduction -- 2.2 Writing a Simple Program -- 2.3 Reading Input from the Keyboard -- 2.4 Identifiers -- 2.5 Variables -- 2.6 Assignment Statements and Assignment Expressions -- 2.7 Named Constants -- 2.8 Numeric Data Types and Operations -- 2.9 Evaluating Expressions and Operator Precedence -- 2.10 Case Study: Displaying the Current Time -- 2.11 Augmented Assignment Operators -- 2.12 Increment and Decrement Operators -- 2.13 Numeric Type Conversions -- 2.14 Software Development Process -- 2.15 Case Study: Counting Monetary Units -- 2.16 Common Errors -- Chapter 3 Selections -- 3.1 Introduction -- 3.2 The bool Data Type -- 3.3 if Statements -- 3.4 Two-Way if-else Statements -- 3.5 Nested if and Multi-Way if-else Statements -- 3.6 Common Errors and Pitfalls -- 3.7 Case Study: Computing Body Mass Index -- 3.8 Case Study: Computing Taxes -- 3.9 Generating Random Numbers -- 3.10 Logical Operators -- 3.11 Case Study: Determining Leap Year -- 3.12 Case Study: Lottery -- 3.13 Switch Statements -- 3.14 Conditional Expressions -- 3.15 Operator Precedence and Associativity -- 3.16 Debugging -- Chapter 4 Mathematical Functions, Characters, and Strings -- 4.1 Introduction -- 4.2 Mathematical Functions -- 4.3 Character Data Type and Operations -- 4.4 Case Study: Generating Random Characters -- 4.5 Case Study: Guessing Birthdays -- 4.6 Character Functions -- 4.7 Case Study: Converting a Hexadecimal Digit to a Decimal Value -- 4.8 The string Type.
4.9 Case Study: Revising the Lottery Program Using Strings -- 4.10 Formatting Console Output -- 4.11 Simple File Input and Output -- Chapter 5 Loops -- 5.1 Introduction -- 5.2 The while Loop -- 5.3 The do-while Loop -- 5.4 The for Loop -- 5.5 Which Loop to Use? -- 5.6 Nested Loops -- 5.7 Minimizing Numeric Errors -- 5.8 Case Studies -- 5.9 Keywords break and continue -- 5.10 Case Study: Checking Palindromes -- 5.11 Case Study: Displaying Prime Numbers -- Chapter 6 Functions -- 6.1 Introduction -- 6.2 Defining a Function -- 6.3 Calling a Function -- 6.4 void Functions -- 6.5 Passing Arguments by Value -- 6.6 Modularizing Code -- 6.7 Overloading Functions -- 6.8 Function Prototypes -- 6.9 Default Arguments -- 6.10 Inline Functions -- 6.11 Local, Global, and Static Local Variables -- 6.12 Passing Arguments by Reference -- 6.13 Constant Reference Parameters -- 6.14 Case Study: Converting Hexadecimals to Decimals -- 6.15 Function Abstraction and Stepwise Refinement -- Chapter 7 Single-Dimensional Arrays and C-Strings -- 7.1 Introduction -- 7.2 Array Basics -- 7.3 Problem: Lotto Numbers -- 7.4 Problem: Deck of Cards -- 7.5 Passing Arrays to Functions -- 7.6 Preventing Changes of Array Arguments in Functions -- 7.7 Returning Arrays from Functions -- 7.8 Problem: Counting the Occurrences of Each Letter -- 7.9 Searching Arrays -- 7.10 Sorting Arrays -- 7.11 C-Strings -- Chapter 8 Multidimensional Arrays -- 8.1 Introduction -- 8.2 Declaring Two-Dimensional Arrays -- 8.3 Processing Two-Dimensional Arrays -- 8.4 Passing Two-Dimensional Arrays to Functions -- 8.5 Problem: Grading a Multiple-Choice Test -- 8.6 Problem: Finding a Closest Pair -- 8.7 Problem: Sudoku -- 8.8 Multidimensional Arrays -- Chapter 9 Objects and Classes -- 9.1 Introduction -- 9.2 Defining Classes for Objects -- 9.3 Example: Defining Classes and Creating Objects -- 9.4 Constructors. 9.5 Constructing and Using Objects -- 9.6 Separating Class Definition from Implementation -- 9.7 Preventing Multiple Inclusions -- 9.8 Inline Functions in Classes -- 9.9 Data Field Encapsulation -- 9.10 The Scope of Variables -- 9.11 Class Abstraction and Encapsulation -- Chapter 10 Object-Oriented Thinking -- 10.1 Introduction -- 10.2 The string Class -- 10.3 Passing Objects to Functions -- 10.4 Array of Objects -- 10.5 Instance and Static Members -- 10.6 Constant Member Functions -- 10.7 Thinking in Objects -- 10.8 Object Composition -- 10.9 Case Study: The StackOfIntegers Class -- 10.10 Class Design Guidelines -- Chapter 11 Pointers and Dynamic Memory Management -- 11.1 Introduction -- 11.2 Pointer Basics -- 11.3 Defining Synonymous Types Using the typedef Keyword -- 11.4 Using const with Pointers -- 11.5 Arrays and Pointers -- 11.6 Passing Pointer Arguments in a Function Call -- 11.7 Returning a Pointer from Functions -- 11.8 Useful Array Functions -- 11.9 Dynamic Persistent Memory Allocation -- 11.10 Creating and Accessing Dynamic Objects -- 11.11 The this Pointer -- 11.12 Destructors -- 11.13 Case Study: The Course Class -- 11.14 Copy Constructors -- 11.15 Customizing Copy Constructors -- Chapter 12 Templates, Vectors, and Stacks -- 12.1 Introduction -- 12.2 Templates Basics -- 12.3 Example: A Generic Sort -- 12.4 Class Templates -- 12.5 Improving the Stack Class -- 12.6 The C++ vector Class -- 12.7 Replacing Arrays Using the vector Class -- 12.8 Case Study: Evaluating Expressions -- Chapter 13 File Input and Output -- 13.1 Introduction -- 13.2 Text I/O -- 13.3 Formatting Output -- 13.4 Functions: getline, get, and put -- 13.5 fstream and File Open Modes -- 13.6 Testing Stream States -- 13.7 Binary I/O -- 13.8 Random Access File -- 13.9 Updating Files -- Chapter 14 Operator Overloading -- 14.1 Introduction -- 14.2 The Rational Class. 14.3 Operator Functions -- 14.4 Overloading the Subscript Operator [] -- 14.5 Overloading Augmented Assignment Operators -- 14.6 Overloading the Unary Operators -- 14.7 Overloading the ++ and -- Operators -- 14.8 friend Functions and friend Classes -- 14.9 Overloading the < -- < -- and > -- > -- Operators -- 14.10 Automatic Type Conversions -- 14.11 Defining Nonmember Functions for Overloading Operators -- 14.12 The Rational Class with Overloaded Function Operators -- 14.13 Overloading the = Operators -- Chapter 15 Inheritance and Polymorphism -- 15.1 Introduction -- 15.2 Base Classes and Derived Classes -- 15.3 Generic Programming -- 15.4 Constructors and Destructors -- 15.5 Redefining Functions -- 15.6 Polymorphism -- 15.7 Virtual Functions and Dynamic Binding -- 15.8 The protected Keyword -- 15.9 Abstract Classes and Pure Virtual Functions -- 15.10 Casting: static_cast versus dynamic_cast -- Chapter 16 Exception Handling -- 16.1 Introduction -- 16.2 Exception-Handling Overview -- 16.3 Exception-Handling Advantages -- 16.4 Exception Classes -- 16.5 Custom Exception Classes -- 16.6 Multiple Catches -- 16.7 Exception Propagation -- 16.8 Rethrowing Exceptions -- 16.9 Exception Specification -- 16.10 When to Use Exceptions -- Chapter 17 Recursion -- 17.1 Introduction -- 17.2 Example: Factorials -- 17.3 Case Study: Fibonacci Numbers -- 17.4 Problem Solving Using Recursion -- 17.5 Recursive Helper Functions -- 17.6 Towers of Hanoi -- 17.7 Eight Queens -- 17.8 Recursion versus Iteration -- 17.9 Tail Recursion -- APPENDIXES -- Appendix A: C++ Keywords -- Appendix B: The ASCII Character Set -- Appendix C: Operator Precedence Chart -- Appendix D: Number Systems -- Appendix E: Bitwise Operations -- INDEX -- CREDIT. |
| Record Nr. | UNINA-9910151658103321 |
|
Liang Y. Daniel
|
||
| Upper Saddle River : , : Pearson, , [2014] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||