Readings from Programming with C++
- Length: 400 pages
- Edition: 1
- Language: English
- Publisher: Cengage Learning
- Publication Date: 2021-01-01
- ISBN-10: 0357637755
- ISBN-13: 9780357637753
- Sales Rank: #3613227 (See Top 100 Books)
Using a beginner’s approach that’s ideal for anyone who has never programmed, McMullen/Matthews/Parsons’ READINGS FROM PROGRAMMING WITH C++ helps you develop a useful understanding of computer science while equipping you with the skills to use C++ programming language. This interesting, straightforward approach to programming emphasizes fundamental computer concepts using a programming language-independent approach and clear presentation with little technical jargon. Modules introduce important computer science concepts, procedural programming and object-oriented programming in short segments. Relevant real-world examples, streamlined code and descriptive figures help you better understanding today’s computing concepts. You can tackle the learning modules in any order, interspersing conceptual modules with hands-on programming modules. You even refine critical-thinking and problem-solving skills as you strengthen computer science skills and build your confidence.
Cover Brief Contents Table of Contents Preface About the Authors Acknowledgments Module 1: Computational Thinking 1.1: Algorithms 1.2: Decomposition 1.3: Pattern Identification 1.4: Abstraction Summary Key Terms Module 2: Programming Tools 2.1: Programming Languages 2.2: Coding Tools 2.3: Build Tools 2.4: Debugging Tools 2.5: IDEs and SDKs Summary Key Terms Module 3: Literals, Variables, and Constants 3.1: Literals 3.2: Variables and Constants 3.3: Assignment Statements 3.4: Input and Output Summary Key Terms Module 4: Numeric Data Types and Expressions 4.1: Primitive Data Types 4.2: Numeric Data Types 4.3: Mathematical Expressions 4.4: Numeric Data Type Conversion 4.5: Formatting Output Summary Key Terms Module 5: Character and String Data Types 5.1: Character Data Types 5.2: String Data Types 5.3: String Functions 5.4: Concatenation and Typecasting Summary Key Terms Module 6: Decision Control Structures 6.1: If-Then Control Structures 6.2: Relational Operators 6.3: Multiple Conditions 6.4: Conditional Logical Operators Summary Key Terms Module 7: Repetition Control Structures 7.1: Count-Controlled Loops 7.2: Counters and Accumulators 7.3: Nested Loops 7.4: Pre-Test Loops 7.5: Post-Test Loops Summary Key Terms Module 8: Arrays 8.1: Array Basics 8.2: One-Dimensional Arrays 8.3: Array Input and Output 8.4: Array Operations 8.5: Two-Dimensional Arrays Summary Key Terms Module 9: Functions 9.1: Function Basics 9.2: Void Functions 9.3: Functions With Parameters 9.4: Return Values 9.5: Scope Summary Key Terms Module 10: Recursion 10.1: Key Components of Recursion 10.2: Using Recursion to Solve Complex Problems 10.3: Managing Memory During Recursion Summary Key Terms Module 11: Exceptions 11.1: Defining Exceptions 11.2: Dealing with Exceptions 11.3: Using Exceptions Summary Key Terms Module 12: File Operations 12.1: File Input and Output 12.2: Processing a File 12.3: Reading From a File 12.4: Closing a File 12.5: Creating a Writing New Files Summary Key Terms Module 13: Classes and Objects 13.1: Classes in Object-Oriented Programming 13.2: Using Objects 13.3: Using Static Elements in a Class 13.4: Characteristics of Objects in Object-Oriented Programs Summary Key Terms Module 14: Methods 14.1: Using Methods 14.2: Changing the Default Behavior of an Object 14.3: Method Cascading and Method Chaining 14.4: Using Constructors Summary Key Terms Module 15: Encapsulation 15.1: Components of Class Structure 15.2: Accessor and Mutator Context 15.3: Using Constructors 15.4: Encapsulation Enforcement With Access Modifiers 15.5: Interfaces and Headers Summary Key Terms Module 16: Inheritance 16.1: Using Inheritance 16.2: Necessary Components for Inheritance 16.3: Creating a Child Class that Inherits from a Parent Class Summary Key Terms Module 17: Polymorphism 17.1: The Purpose of Polymorphism 17.2: Polymorphism Basics 17.3: Virtual Functions Summary Key Terms Module 18: Templates 18.1: Template Basics 18.2: Tricky Templating 18.3: Templates as a Problem-Solving Approach Summary Key Terms Module 19: Linked List Data Structures 19.1: Linked List Structures 19.2: Types of Linked Lists 19.3: Code a Linked List Summary Key Terms Module 20: Stacks and Queues 20.1: Stacks 20.2: Queues Summary Key Terms Module 21: Trees and Graphs 21.1: Nonlinear Data Structures 21.2: Tree Structures 21.3: Solving Problems Using Trees 21.4: Graph Structures 21.5: Solving Problems With Graphs Summary Key Terms Module 22: Algorithm Complexity and Big-O Notation 22.1: Big-O Notation 22.2: Time Complexity 22.3: Space Complexity 22.4: Complexity Calculations Summary Key Terms Module 23: Search Algorithms 23.1: Using Search Algorithms 23.2: Performing a Linear Search 23.3: Performing a Binary Search 23.4: Using Regular Expressions in Search Algorithms Summary Key Terms Module 24: Sorting Algorithms 24.1: Qualities of Sorting Algorithms 24.2: Bubble Sort 24.3: Quicksort 24.4: Merge Sort Summary Key Terms Module 25: Processor Architecture 25.1: Processor Organization 25.2: Low-Level Instruction Sets 25.3: Microprocessor Operations 25.4: High-Level Programming Languages Summary Key Terms Module 26: Data Representation 26.1: Bits and Bytes 26.2: Binary 26.3: Hexadecimal 26.4: ASCII and Unicode 26.5: Memory Allocation Summary Key Terms Module 27: Programming Paradigms 27.1: Imperative and Declarative Paradigms 27.2: The Procedural Paradigm 27.3: The Object-Oriented Paradigm 27.4: Declarative Paradigms Summary Key Terms Module 28: User Interfaces 28.1: User Interface Basics 28.2: Command-Line User Interfaces 28.3: Graphical User Interfaces 28.4: Voice User Interfaces 28.5: Virtual Environment Interfaces 28.6: Accessibility and Inclusion Summary Key Terms Module 29: Software Development Methodologies 29.1: Software Development 29.2: The Waterfall Model 29.3: The Agile Model 29.4: Coding Principles 29.5: Testing Summary Key Terms Module 30: Pseudocode, Flowcharts, and Decision Tables 30.1: Pseudocode 30.2: Flowcharts 30.3: Decision Tables Summary Key Terms Module 31: Unified Modeling Language 31.1: Purpose of Unified Modeling Language (UML) 31.2: UML Diagram Parts 31.3: Using UML to Structure Programs Summary Key Terms Glossary Index
Donate to keep this site alive
1. Disable the AdBlock plugin. Otherwise, you may not get any links.
2. Solve the CAPTCHA.
3. Click download link.
4. Lead to download server to download.