100% found this document useful (1 vote)
127 views

PDF Readings from Programming with C++ 1st Edition Kyla Mcmullen download

Mcmullen

Uploaded by

kolevmahaam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
127 views

PDF Readings from Programming with C++ 1st Edition Kyla Mcmullen download

Mcmullen

Uploaded by

kolevmahaam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 55

Download Full Version ebook - Visit ebookmeta.

com

Readings from Programming with C++ 1st Edition


Kyla Mcmullen

https://ebookmeta.com/product/readings-from-programming-
with-c-1st-edition-kyla-mcmullen-2/

OR CLICK HERE

DOWLOAD NOW

Discover More Ebook - Explore Now at ebookmeta.com


Instant digital products (PDF, ePub, MOBI) ready for you
Download now and discover formats that fit your needs...

Start reading on any device today!

Readings from Programming with C++ 1st Edition Kyla


Mcmullen

https://ebookmeta.com/product/readings-from-programming-with-c-1st-
edition-kyla-mcmullen/

ebookmeta.com

Mnemonics for Radiologists and FRCR 2B Viva Preparation A


Systematic Approach Aug 15 2013 _ 1908911956 _ CRC Press
1st Edition Yoong
https://ebookmeta.com/product/mnemonics-for-radiologists-and-
frcr-2b-viva-preparation-a-systematic-approach-
aug-15-2013-_-1908911956-_-crc-press-1st-edition-yoong/
ebookmeta.com

Ergodic theory geometry and dynamics 1st Edition C


Mcmullen

https://ebookmeta.com/product/ergodic-theory-geometry-and-
dynamics-1st-edition-c-mcmullen/

ebookmeta.com

Open educational resources and open pedagogy in Lebanon


and South Africa 1st Edition Jako Olivier & Fawzi Baroud
(Editors)
https://ebookmeta.com/product/open-educational-resources-and-open-
pedagogy-in-lebanon-and-south-africa-1st-edition-jako-olivier-fawzi-
baroud-editors/
ebookmeta.com
Frontiers of Supercomputing II Karyn R. Ames (Editor)

https://ebookmeta.com/product/frontiers-of-supercomputing-ii-karyn-r-
ames-editor/

ebookmeta.com

Building Web Applications with .NET Core 2.1 and


JavaScript: Leveraging Modern JavaScript Frameworks -
Second Edition Philip Japikse
https://ebookmeta.com/product/building-web-applications-with-net-
core-2-1-and-javascript-leveraging-modern-javascript-frameworks-
second-edition-philip-japikse/
ebookmeta.com

Blender Basics Classroom Tutorial Book Based on the


Blender 2 7X series 5th Edition James Chronister

https://ebookmeta.com/product/blender-basics-classroom-tutorial-book-
based-on-the-blender-2-7x-series-5th-edition-james-chronister/

ebookmeta.com

Feudal Institutions as Revealed in the Assizes of Romania:


The Law Code of Frankish Greece Peter W. Topping (Editor)

https://ebookmeta.com/product/feudal-institutions-as-revealed-in-the-
assizes-of-romania-the-law-code-of-frankish-greece-peter-w-topping-
editor/
ebookmeta.com

Edexcel AS and A Level Modular Mathematics Core


Mathematics C4 eBook edition Edexcel GCE Modular Maths
Keith Pledger
https://ebookmeta.com/product/edexcel-as-and-a-level-modular-
mathematics-core-mathematics-c4-ebook-edition-edexcel-gce-modular-
maths-keith-pledger/
ebookmeta.com
Reeds VHF DSC Handbook 1st Edition Sue Fletcher

https://ebookmeta.com/product/reeds-vhf-dsc-handbook-1st-edition-sue-
fletcher/

ebookmeta.com
Programming with

C++ KYLA McMULLEN


Elizabeth matthews
June Jamrich Parsons

Australia • Brazil • Canada • Mexico • Singapore • United Kingdom • United States

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
This is an electronic version of the print textbook. Due to electronic rights restrictions,
some third party content may be suppressed. Editorial review has deemed that any suppressed
content does not materially affect the overall learning experience. The publisher reserves the right
to remove content from this title at any time if subsequent rights restrictions require it. For
valuable information on pricing, previous editions, changes to current editions, and alternate
formats, please visit www.cengage.com/highered to search by ISBN#, author, title, or keyword for
materials in your areas of interest.

Important Notice: Media content referenced within the product description or the product
text may not be available in the eBook version.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Readings from Programming with C++ © 2022 Cengage Learning, Inc.
Kyla McMullen, Elizabeth Matthews, WCN: 02-300
June Jamrich Parsons
Unless otherwise noted, all content is © Cengage.
SVP, Higher Education Product Management:
ALL RIGHTS RESERVED. No part of this work covered by the copyright herein
Erin Joyner
may be reproduced or distributed in any form or by any means, except as
VP, Product Management: Thais Alencar permitted by U.S. copyright law, without the prior written permission of the
copyright owner.
Product Team Manager: Kristin McNary

Associate Product Manager: Tran Pham For product information and technology assistance, contact us at
Cengage Customer & Sales Support, 1-800-354-9706
Product Assistant: Tom Benedetto
or support.cengage.com.
Learning Designer: Mary Convertino

Senior Content Manager: Maria Garguilo For permission to use material from this text or product, submit all requests
online at www.cengage.com/permissions.
Digital Delivery Lead: David O’Connor

Technical Editor: John Freitas Library of Congress Control Number: 2020922802

Developmental Editor: Lisa Ruffolo ISBN: 978-0-357-63775-3

Vice President, Marketing – Science, Technology,


Cengage
& Math: Jason Sakos
200 Pier 4 Boulevard
Senior Director, Marketing: Michele McTighe Boston, MA 02210
USA
Marketing Manager: Cassie L. Cloutier

Marketing Development Manager: Cengage is a leading provider of customized learning solutions with
Samantha Best employees residing in nearly 40 different countries and sales in more than
125 countries around the world. Find your local representative at
Product Specialist: Mackenzie Paine
www.cengage.com.
IP Analyst: Ashley Maynard
To learn more about Cengage platforms and services, register or access
IP Project Manager: Cassidie Parker your online learning solution, or purchase materials for your course, visit
www.cengage.com.
Production Service: SPi Global
Notice to the Reader
Designer: Erin Griffin Publisher does not warrant or guarantee any of the products described

Cover Image Source: echo3005/ShutterStock.com herein or perform any independent analysis in connection with any of the
product information contained herein. Publisher does not assume, and
expressly disclaims, any obligation to obtain and include information other
than that provided to it by the manufacturer. The reader is expressly warned
to consider and adopt all safety precautions that might be indicated by the
activities described herein and to avoid all potential hazards. By following
the instructions contained herein, the reader willingly assumes all risks in
connection with such instructions. The publisher makes no representations or
warranties of any kind, including but not limited to, the warranties of fitness
for particular purpose or merchantability, nor are any such representations
implied with respect to the material set forth herein, and the publisher takes
no responsibility with respect to such material. The publisher shall not be
liable for any special, consequential, or exemplary damages resulting, in
whole or part, from the readers’ use of, or reliance upon, this material.

Printed in Mexico
Print Number: 01 Print Year: 2020

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Brief Contents

prefacexiii Module 17
Polymorphism 309
Module 1
Computational Thinking 1 Module 18
Templates 319
Module 2
Programming Tools 15 Module 19
Linked List Data Structures 333
Module 3
Literals, Variables, and Constants 35 Module 20
Stacks and Queues 353
Module 4
Numeric Data Types and Expressions 49 Module 21
Trees and Graphs 371
Module 5
Character and String Data Types 63 Module 22
Algorithm Complexity and Big-O Notation 395
Module 6
Decision Control Structures 83 Module 23
Search Algorithms 411
Module 7
Repetition Control Structures 103 Module 24
Sorting Algorithms 427
Module 8
Arrays 125 Module 25
Processor Architecture 455
Module 9
Functions 145 Module 26
Data Representation 469
Module 10
Recursion 165 Module 27
Programming Paradigms 491
Module 11
Exceptions 185 Module 28
User Interfaces 507
Module 12
File Operations 205 Module 29
Software Development Methodologies 525
Module 13
Classes and Objects 231 Module 30
Pseudocode, Flowcharts, and Decision Tables 541
Module 14
Methods 245 Module 31
Unified Modeling Language 557
Module 15
Encapsulation 271
GLOSSARY 569
Module 16 Index 583
Inheritance 291

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Table of Contents

prefacexiii Build Tools 22


The Toolset 22
Module 1 Compilers 23
COMPUTATIONAL THINKING 1 Preprocessors and Linkers 24
Virtual Machines 25
Algorithms2 Interpreters 26
Algorithm Basics 2 Debugging Tools 27
Programming Algorithms 2 Programming Errors 27
“Good” Algorithms 3 Syntax Errors 28
Selecting and Creating Algorithms 4 Runtime Errors 29
Decomposition4 Semantic Errors 29
Decomposition Basics 4 Debugging Utilities 30
Structural Decomposition 5 IDEs and SDKs 32
Functional Decomposition 6 Integrated Development Environments 32
Object-Oriented Decomposition 7 Software Development Kits 32
Dependencies and Cohesion 7
Summary 33
Pattern Identification 8
Key Terms  34
Pattern Identification Basics 8
Repetitive Patterns 8
Module 3
Classification Patterns 9
Abstraction9 LITERALS, VARIABLES, AND
Abstraction Basics 9 CONSTANTS35
Classes and Objects 10
Literals36
Black Boxes 11
Numeric Literals 36
Levels of Abstraction 12
Character and String Literals 37
Summary12 Tricky Literals 38
Key Terms  13 Variables and Constants 38
Variables 38
Module 2 Constants 40
PROGRAMMING TOOLS 15 The Memory Connection 41
Assignment Statements 41
Programming Languages 16 Declaring Variables  41
Hello World! 16 Initializing Variables 42
Programming Language Basics 16 Assigning Variables 43
Syntax and Semantics 17
Input and Output 44
Core Elements 19
Your Toolbox 19 Input to a Variable  44
Output from a Variable 46
Coding Tools 20
Program Editors 20 Summary 46
Basic Structure 21 Key Terms  47

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Table of Contents v

Module 4 Module 6
Numeric Data Types and Decision Control
Expressions 49 Structures 83
Primitive Data Types 50 If-Then Control Structures 84
Data Types 50 Control Structures 84
Primitive Data Types 50 Decision Logic 85
Composite Data Types 51 If-Then Structures 85
Numeric Data Types 52 Relational Operators 87
Integer Data Types 52 The Equal Operator 87
Floating-Point Data Types 53 Using Relational Operators 88
Mathematical Expressions 54 Boolean Expressions and Data Types 89
Arithmetic Operators 54 Multiple Conditions 91
Order of Operations 56 If-Then-Else Structures 91
Compound Operators 56 Nested-If Structures 93
Numeric Data Type Conversion 58 Else If Structures 96
Convert Integers and Floating-Point Numbers 58 Fall Through 97
Rounding Quirks 59 Conditional Logical Operators 100
Formatting Output 60 The AND Operator 100
Formatted Output 60 The OR Operator 101
Formatting Parameters 60 Summary 102
Summary 62 Key Terms 102
Key Terms 62

Module 7
Module 5 Repetition Control
CHARACTER AND STRING DATA TYPES 63 Structures 103
Character Data Types 64 Count-Controlled Loops 104
Working with Character Data 64 Loop Basics 104
Character Memory Allocation 65 Control Statements 105
Digits 66 For-Loops 105
Character Output Format 67 User-Controlled Loops 108
Character Manipulation 68
Counters and Accumulators 109
String Data Types 69 Loops That Count 109
Working with String Data 69 Loops That Accumulate 111
Escape Characters 70
String Indexes 71
Nested Loops 112
Loops Within Loops 112
String Functions 72
Inner and Outer Loops 113
String Manipulation 72
String Length 72 Pre-Test Loops 116
Change Case 73 While-Loops 116
Find the Location of a Character 74 Infinite Loops 117
Retrieve a Substring 75 Breaking Out of Loops 118
Concatenation and Typecasting 76 Post-Test Loops 120
Concatenated Output 76 Do-Loops 120
Concatenated Variables 77 Test Conditions and Terminating
Coercion and Typecasting 78 Conditions 123
Summary 80 Summary 124
Key Terms 81 Key Terms 124

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
vi Programming with C++

Module 8 Pass by Reference 161


Namespaces 162
Arrays 125
Summary 163
Array Basics 126
Key Terms 163
Magic Rectangles 126
Array Characteristics 127
Array Use Cases 128 Module 10
One-Dimensional Arrays 128 Recursion 165
Initialize Numeric Arrays 128
Key Components of Recursion 165
Initialize String Arrays 130
The Recursive Mindset 165
Array Input and Output 130 Recursion Basics 167
Output an Array Element 130 When to Use Recursion 171
Index Errors 131
Using Recursion to Solve Complex
Traverse an Array 132
Problems 171
Input Array Elements 133
Designing Recursive Structures 171
Array Operations 135 Linear Recursion 174
Change an Array Element 135 Branching Recursion 175
Find an Array Element 135
Managing Memory during Recursion 179
Sum Array Elements 137
Memory Management 179
Two-Dimensional Arrays 137 Stable Recursion 182
Two-Dimensional Array Basics 137
Summary 183
Initialize a Two-Dimensional Array 138
Output a Two-Dimensional Array 139 Key Terms 183
Sum Array Columns and Rows 141
Summary 143 Module 11
Key Terms 144 Exceptions 185
Defining Exceptions 185
Module 9 Errors in Code 185
Functions 145 Exception Types 187

Function Basics 146 Dealing with Exceptions 189


Function Classifications 146 Handling Others’ Exceptions 189
Programmer-Defined Functions 146 Try and Catch Blocks 189
Flow of Execution 147 Using Exceptions 198
Function Advantages 147 Throwing Exceptions 198
Void Functions 148 When to Bail 202
Void Function Basics 148 Summary 203
Function Pseudocode 149
Key Terms 203
Functions with Parameters 150
Function Parameters 150
Module 12
Function Arguments 150
The Handoff 152 File Operations 205
Return Values 153 File Input and Output 206
Return Values 153 The Purpose of Files 206
Return Type 156 Anatomy of a File 210
Function Signature 157 File Usage 212
Scope 157 Processing a File 214
Scope Basics 157 Accessing Files 214
Pass by Value 160 Streaming and Buffering 214

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Table of Contents vii

Reading from a File 216 Method Cascading and Method Chaining 263
Opening a File for Reading 216 Calling Multiple Methods on the Same Object 263
Reading from a File 218 Using Constructors 266
Closing a File 222 Specifying How to Construct an Object 266
Closing Files after Use 222 Constructing an Object from Another Object 268
Trying to Close a File 222 Summary 269
Creating and Writing New Files 222
Key Terms 269
Creating a File 222
Opening a File for Writing 223 Module 15
Writing to and Appending a File 224
Anticipating Exceptions 228 Encapsulation 271
Summary 229 Components of Class Structure 271
Key Terms 230 Data Hiding 271
Designing Objects 273
Self-Reference Scope 276
Module 13 Accessor and Mutator Context 277
Classes and Objects 231 Viewing Data from an Object 277
Classes in Object-Oriented Programming 232 Changing Data in an Object 278
Representing the Real World with Code 232 Using Constructors 280
Using Classes 232 Parameters and Arguments 280
Class Components 233 Default Parameters and Constructor
Using Objects 236 Overloading 281
Creating Objects 236 Encapsulation Enforcement
Objects as Variables 238 with Access Modifiers 283
Object-Oriented Features and Principles 238 Access Modifiers 283
Using Static Elements in a Class 239 Public Variables and Methods 283
Private Variables and Methods 284
Static Member Variables 239
Static Methods 240 Interfaces and Headers 286
Static Classes 241 Interfaces 286
Characteristics of Objects Programming an Interface 287
in Object-Oriented Programs 242 Summary 290
Object Identity 242 Key Terms 290
Object State 242
Object Behavior 243 Module 16
Summary 244 Inheritance 291
Key Terms 244 Using Inheritance 291
Creating Classes from Other Classes 291
Module 14 Family Trees in OOP 292
Methods 245 Levels of Access 295
Necessary Components for Inheritance 296
Using Methods 245
Defining a Parent Class 296
Why Use Methods? 245 Defining a Child Class 297
Anatomy of a Method 251
Creating a Child Class That Inherits
Using Methods 251
from a Parent Class 298
Changing the Default Behavior
Inheritance Syntax 298
of an Object 255 Customizing Behavior 301
Using Objects as Regular Variables 255
Overloading Methods 258 Summary 307
Setting One Object to Equal Another 262 Key Terms 307

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
viii Programming with C++

Module 17 The Find Method 346


The Insert Method 347
Polymorphism 309
Summary 350
The Purpose of Polymorphism 309
Key Terms 351
Flexibility While Coding 309
Dynamic Binding Under the Hood 314
Polymorphism Basics 314 Module 20
Classes Within Classes 314 Stacks and Queues 353
Objects as Other Objects 315 Stacks 353
Virtual Functions 316 Stack Basics 353
Anticipating Customization 316 Stack Use Cases 355
Abstract Classes 317 Built-in Stacks 356
Summary 318 Code a Stack 357

Key Terms 318


Queues 362
Queue Basics 362
Module 18 Queue Use Cases 363
Code a Queue 364
Templates 319
Summary 369
Template Basics 319
Key Terms 369
Data Abstraction 319
Template Structure and Use 322
Module 21
Tricky Templating 328
Advanced Templating 328
Trees and Graphs 371
Templated Objects as Arguments 330 Nonlinear Data Structures 371
Templates as a Problem-Solving Linear versus Nonlinear Structures 371
Approach 331 Nonlinear Building Blocks 373
Designing a Template 331 Tree Structures 373
When to Use Templates 331 Tree Basics 373
Summary 331 Tree Properties 376
Trees as Recursive Structures 376
Key Terms 332
Solving Problems Using Trees 379
Module 19 Tree Applications 379
Linked List Data Data Storage in Trees 380
Graph Structures 387
Structures 333
Graph Basics 387
Linked List Structures 334 Directed and Undirected Graphs 388
Data Structure Selection 334 Solving Problems with Graphs 388
Data Structure Implementation 335 Graph Applications 388
Linked List Basics 336 Computing Paths 389
Types of Linked Lists 337
Summary 394
Singly Linked Lists 337
Doubly Linked Lists 338 Key Terms 394
Circular Linked Lists 339
Linked List Characteristics 339 Module 22
Code a Linked List 342 Algorithm Complexity
The Node Class 342 and Big-O Notation 395
The LinkedList Class 343
The Append Method 343 Big-O Notation 396
Linked List Traversal 345 Algorithm Complexity 396

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Table of Contents ix

Asymptotic Analysis 397 Quicksort 438


Asymptotic Notation 398 Defining the Quicksort Algorithm 438
Time Complexity 398 Quicksort Properties 446
Big-O Metrics 398 Merge Sort 447
Constant Time 399 Defining the Merge Sort Algorithm 447
Linear Time 399 Merge Sort Properties 453
Quadratic Time 400
Summary 454
Logarithmic Time 401
Key Terms 454
Space Complexity 403
Memory Space 403 Module 25
Constant Space Complexity 404
Linear Space Complexity 404 Processor Architecture 455
Complexity Calculations 405 Processor Organization 456
Line-by-Line Time Complexity 405 Integrated Circuits 456
Combine and Simplify 406 Moore’s Law 458
A Mystery Algorithm 407 CPUs 458
Low-Level Instruction Sets 459
Summary 409
Microprocessor Instruction Sets 459
Key Terms 409 RISC and CISC 460
Machine Language 460
Module 23 Assembly Language 461

Search Algorithms 411 Microprocessor Operations 462


Processing an Instruction 462
Using Search Algorithms 412 The Instruction Cycle 462
Search Basics 412 High-Level Programming Languages 464
Performing a Linear Search 413 Evolution 464
Looking for a Needle in a Haystack 413 Teaching Languages 465
Evaluating Search Time 416 The C Family 465
Web Programming Languages 466
Performing a Binary Search 416 Characteristics 466
Shrinking the Search Space 416 Advantages and Disadvantages 467
Implementing Binary Search 418
Summary 467
Using Regular Expressions
Key Terms 468
in Search Algorithms 423
Specifying a Search Pattern 423 Module 26
Regular Expression Search Operators 423
Data Representation 469
Summary 426
Bits and Bytes 470
Key Terms 426
Digital Data 470
Bits 471
Module 24 Bytes 472
Sorting Algorithms 427 Binary 474
Binary Numbers 474
Qualities of Sorting Algorithms 428 Binary to Decimal 475
Ordering Items 428 Decimal to Binary 476
Time Complexity in Sorting Algorithms 428 Binary Addition 477
Sorting Properties 430 Negative Numbers 478
Bubble Sort 431 Hexadecimal 480
Defining the Bubble Sort Algorithm 431 Colors 480
Bubble Sort Properties 437 Hexadecimal Numbers 481

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
x Programming with C++

Binary-Hex-Binary Conversions 481 Speech Synthesis 516


Hex-Decimal Conversion 482 Designing Programs for Voice User Interfaces 517
Information Density 483 Virtual Environment Interfaces 517
ASCII and Unicode 483 Virtual Environments 517
ASCII 483 Virtual Environment Interface Components 518
Extended ASCII 484 Programming the Virtual Interface 519
Unicode 485 Accessibility and Inclusion 520
Memory Allocation 486 Accessibility Guidelines 520
Memory and Storage 486 Inclusive Design 521
Storage Devices 487 Summary 524
Memory 487
Key Terms 524
Summary 489
Key Terms 489
Module 29
Software Development
Module 27
Methodologies 525
Programming Paradigms 491
Software Development 526
Imperative and Declarative Paradigms 492
The Software Development Life Cycle 526
Think Outside the Box 492
Efficiency, Quality, and Security 527
The Procedural Paradigm 493 The Waterfall Model 528
Procedural Basics 493
Structured Analysis and Design 528
Characteristics of Procedural Programs 494
Waterfall Advantages and Disadvantages 529
Procedural Paradigm Applications 496
The Agile Model 530
The Object-Oriented Paradigm 497
Incremental Development 530
Objects, Classes, and Methods 497
Agile Methodologies 530
Characteristics of Object-Oriented Programs 499
Agile Advantages and Disadvantages 531
Object-Oriented Applications 501
Coding Principles 532
Declarative Paradigms 501
Efficient Coding 532
Declarative Basics 501
Modularized Code 533
Characteristics of the Declarative
Clean Coding 534
Paradigm 504
Secure Coding 534
Applications for Declarative Paradigms 504
Success Factors 536
Summary 505 Testing 536
Key Terms 505 Levels of Testing 536
Unit Testing 537
Module 28 Integration Testing 538
System Testing 539
User Interfaces 507 Acceptance Testing 539
User Interface Basics 508 Regression Testing 539
UI and UX 508 Summary 540
UI Components 508
Key Terms 540
Selecting a UI 510
Command-Line User Interfaces 510
Module 30
Command-Line Basics 510
Command-Line Program Design 510 Pseudocode, Flowcharts,
Graphical User Interfaces 512 and Decision Tables 541
GUI Basics 512 Pseudocode 542
GUI Program Design 514
From Algorithms to Pseudocode 542
Voice User Interfaces 515 Pseudocode Basics 544
Voice Interface Basics 515 Pseudocode Guidelines 545
Speech Recognition 515 Writing Pseudocode 547

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Table of Contents xi

Flowcharts 548 UML Diagram Parts 558


Flowchart Basics 548 Class Diagram Basics 558
Drawing Flowcharts 548 Use Case Diagram Basics 559
Flowchart Tools 549 Sequence Diagrams 561
Decision Tables 551 Using UML to Structure Programs 562
Decision Table Basics 551 UML Associations 562
List the Conditions 551 Translating UML to Code 564
List All Possible Alternatives 552 Summary 568
Specify Results and Rules 552
Interpret Rules 553 Key Terms 568
Optimize the Rules 554
Check for Completeness and Accuracy 555
GLOSSARY 569
Summary 555
index 583
Key Terms 556

Module 31
Unified Modeling Language 557
Purpose of Unified Modeling
Language (UML) 557
Communicating Ideas to Other Programmers 557

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Preface

Welcome to Readings from Programming with C11.


This text includes the stand-alone lessons and read-
C11 Version
ings from MindTap for Programming with C11 and is We recommend downloading the latest version of
intended to be used in conjunction with the MindTap C11 before beginning this text. C1114 was used to
Reader for a complete learning experience. test all C11 code presented in the module figures.

MindTap Overview MindTap Features


Programming with C 11 presents conceptual, lan- In addition to the readings included within this text,
guage-agnostic narrative with language-specific assets, the MindTap includes the following:
ungraded C11 coding Snippets, language-agnostic test Course Orientation: Custom videos and readings pre-
banks, and additional instructor resources. The goal of pare students for the material and coding experiences
this digital product is to develop content around the they will encounter in their course.
concepts that are essential for understanding Com-
Videos: Animated videos demonstrate new program-
puter Science from a language-agnostic perspective.
ming terms and concepts in an easy-to-understand for-
Learners will gain a foundational understanding of
mat, increasing student confidence and learning.
procedural programming, computer science concepts,
and object-oriented programming. Instructors have Coding Snippets: These short, ungraded coding activities
identified the need for language-agnostic, conceptual are embedded within the MindTap Reader and provide
content that can be paired with hands-on practice in students an opportunity to practice new programming
a specific language. This 31-module text is designed to concepts “in-the-moment.” Additional language-specific
provide that conceptual content paired with language- “bridge content” helps transition the student from con-
specific examples and hands-on learning activities in ceptual understanding to application of C11 code.
C11. Language-specific Examples: Figures within the nar-
rative illustrate the application of general concepts in
C11 code.
Course Objectives:
• Develop a foundational knowledge of
coding principles, vocabulary, and core Instructor & Student Resources
concepts. Additional instructor and student resources for
• Use new foundational knowledge to this product are available online. Instructor assets
learn C11 programming skills. include an Instructor’s Manual, Teaching Online
• Practice emerging coding skills in a low- Guide, ­PowerPoint® slides, and a test bank powered
risk environment. by ­Cognero®. Student assets include source code
• Apply learned concepts and skills to files and coding Snippets ReadMe. Sign up or sign in
assignments/activities that mimic real- at www.cengage.com to search for and access this
world experiences and environments. product and its online resources.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
About the Authors

Dr. Kyla McMullen is a tenure-track faculty member published research in the areas of procedural genera-
in the University of Florida’s Computer & Information tion, video game enjoyment factors, and freshwater
Sciences & Engineering Department, specializing in algae identification with HCI.
Human-Centered Computing. Her research interests June Jamrich Parsons is an educator, digital book
are in the perception, applications, and development pioneer, and co-author of Texty and McGuffey Award-
of 3D audio technologies. Dr. McMullen has authored winning textbooks. She co-developed the first com-
over 30 manuscripts in this line of research and is the mercially successful multimedia, interactive digital
primary investigator for over 2 million dollars’ worth textbook; one that set the bar for platforms now
of sponsored research projects. being developed by educational publishers. Her
Dr. Elizabeth A. Matthews is an Assistant Professor of career includes extensive classroom teaching, prod-
Computer Science at Washington and Lee University. uct design for eCourseware, textbook authoring for
She has taught computer science since 2013 and has Course Technology and Cengage, Creative Strategist
been an active researcher in human–computer inter- for MediaTechnics Corporation, and Director of Con-
action and human-centered computing. Matthews has tent for Veative Virtual Reality Labs.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Acknowledgments

The unique approach for this book required a ­seasoned friends who help me to remain sane, remind me of who
team. Our thanks to Maria Garguilo who ushered the I am, and never let me forget whose I am.
manuscripts through every iteration and kept tight Elizabeth Matthews: I want to thank my parents,
rein on the schedule; to Mary E. Convertino who sup- Drs. Geoff and Robin Matthews, for their support and
plied her expertise in learning design; to Lisa R
­ uffolo understanding in my journey. I would also like to thank
for her excellent developmental edit; to Courtney my advisor, Dr. Juan Gilbert, for seeing my dream to
Cozzy who coordinated the project; to Kristin McNary the end. Finally, I would like to thank my cats, Oreo
for her leadership in Cengage’s computing materials; and Laptop, who made sure that writing this book was
to Rajiv Malkan (Lone Star College) for his instruc- interrupted as often as possible.
tional input; to Wade Schofield (Liberty University) June Jamrich Parsons: Computer programming can
for his reviewing expertise; and to John Freitas for his be a truly satisfying experience. The reward when a
meticulous code review. It was a pleasure to be part program runs flawlessly has to bring a smile even
of this professional and talented team. We hope that to the most seasoned programmers. Working with
instructors and students will appreciate our efforts three programming languages for this project at the
to provide this unique approach to computer science same time was certainly challenging but provided
and programming. insights that can help students understand com-
Kyla McMullen: Above all things, I would like to thank putational thinking. I’ve thoroughly enjoyed work-
God for giving me the gifts and talents that were uti- ing with the team to create these versatile learning
lized to write this book. I would like to thank my amaz- resources and would like to dedicate my efforts to
ing husband Ade Kumuyi for always being my rock, my mom, who has been a steadfast cheerleader for
sounding board, and biggest cheerleader. I thank my me throughout my career. To the instructors and stu-
parents, Rita and James McMullen for all of their sacri- dents who use this book, my hope is that you enjoy
fices to raise me. Last but not least, I thank my spirited programming as much as I do.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
MODULE

1
COMPUTATIONAL
THINKING
LEARNING OBJECTIVES:
1.1 ALGORITHMS 1.2.3 Differentiate the concepts of algorithms and
decomposition.
1.1.1 Define the term “algorithm” as a series of steps for
solving a problem or carrying out a task. 1.2.4 Identify examples of structural decomposition.
1.1.2 State that algorithms are the underlying logic for 1.2.5 Identify examples of functional decomposition.
computer programs. 1.2.6 Identify examples of object-oriented decomposition.
1.1.3 Define the term “computer program.” 1.2.7 Provide examples of decomposition in technology
1.1.4 Provide examples of algorithms used in everyday applications.
technology applications. 1.2.8 Explain how dependencies and cohesion relate to
1.1.5 Confirm that there can be more than one algorithm decomposition.
for a task or problem and that some algorithms 1.3 PATTERN IDENTIFICATION
may be more efficient than others.
1.3.1 Define the term “pattern identification” as a technique
1.1.6 Explain why computer scientists are interested in for recognizing similarities or characteristics among
algorithm efficiency. the elements of a task or problem.
1.1.7 List the characteristics of an effective algorithm. 1.3.2 Identify examples of fill-in-the-blank patterns.
1.1.8 Write an algorithm for accomplishing a simple, 1.3.3 Identify examples of repetitive patterns.
everyday technology application.
1.3.4 Identify examples of classification patterns.
1.1.9 Write an alternate algorithm for an everyday
technology task. 1.3.5 Provide examples of pattern identification in the real
world and in technology applications.
1.1.10 Select the more efficient of the two algorithms you
have written. 1.4 ABSTRACTION
1.2 DECOMPOSITION 1.4.1 Define the term “abstraction” as a technique for
generalization and for simplifying levels of complexity.
1.2.1 Define the term “decomposition” as a technique for
dividing a complex problem or solution into smaller 1.4.2 Explain why abstraction is an important computer
parts. science concept.
1.2.2 Explain why decomposition is an important tool for 1.4.3 Provide an example illustrating how abstraction can
computer scientists. help identify variables.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
2 PROGRAMMING WITH C++

1.4.4 Provide examples of technology applications that 1.4.6 Explain how the black box concept is an
have abstracted or hidden details. implementation of abstraction.
1.4.5 Provide an example illustrating the use of a class as 1.4.7 Identify appropriate levels of abstraction.
an abstraction of a set of objects.

1.1 ALGORITHMS
Algorithm Basics (1.1.1, 1.1.4)
A password might not be enough to protect your online accounts. Two-factor authentication adds an extra layer
of protection. A common form of two-factor authentication sends a personal identification number (PIN) to your
cell phone. To log in, you perform the series of steps shown in Figure 1-1.

Connect to the site’s login page.


Enter your user ID.
Enter your password.
Wait for a text message containing a PIN
to arrive on your smartphone.
On the site’s the login page, enter the PIN.

Figure 1-1 Steps for two-factor authentication

The procedure for two-factor authentication is an example of an algorithm. In a general sense, an algorithm
is a series of steps for solving a problem or carrying out a task.
Algorithms exist for everyday tasks and tasks that involve technology. Here are some examples:

• A recipe for baking brownies


• The steps for changing a tire
• The instructions for pairing a smart watch with your phone
• The payment process at an online store
• The procedure for posting a tweet

Programming Algorithms (1.1.2, 1.1.3, 1.1.5)


Algorithms are also an important tool for programmers. A programming algorithm is a set of steps that speci-
fies the underlying logic and structure for the statements in a computer program. You can think of programming
algorithms as the blueprints for computer programs.
A computer program is a set of instructions, written in a programming language such as C++, Python, or
Java, that performs a specific task when executed by a digital device. A computer program is an implementation
of an algorithm.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Module 1 Computational Thinking 3

Q Programming algorithms tell the computer what to do. Can you tell which of these algorithms
is a programming algorithm?
Algorithm 1: Algorithm 2:
Connect to the website’s login page. Prompt the user to enter a user ID.
Enter your user ID. Prompt the user to enter a password.
Enter your password. Make sure that the user ID and password match.
Wait for a text message containing a PIN to If the user ID and password match:
arrive on your smartphone. Generate a random PIN.
On the website’s login page, enter the PIN. Send the PIN to user’s phone.
Prompt the user to enter the PIN.
If the PIN is correct:
Allow access.

A Algorithm 1 is not a programming algorithm because it outlines instructions for the user.
Algorithm 2 is a programming algorithm because it specifies what the computer is supposed
to do. When you formulate a programming algorithm, the instructions should be for the
computer, not the user.

There can be more than one programming algorithm for solving a problem or performing a task, but some
algorithms are more efficient than others.

Q Here are two algorithms for summing the numbers from 1 to 10. Which algorithm is more
efficient?
Algorithm 1: Algorithm 2:
Add 1 1 2 to get a total. Get the last number in the series (10).
Repeat these steps nine times: Divide 10 by 2 to get a result.
Get the next number. Add 10 1 1 to get a sum.
Add this number to the total. Multiply the result by the sum.

A Both algorithms contain four instructions, but Algorithm 2 is more efficient. You can use it to
amaze your friends by quickly calculating the total in only four steps. Algorithm 1 is also four
lines long, but two of the instructions are repeated nine times. Counting the first step, that’s
19 steps to complete this task!

“Good” Algorithms (1.1.6, 1.1.7)


Computer scientists are interested in designing what they call “good” algorithms. A good algorithm tends
to produce a computer program that operates efficiently, quickly, and reliably. Good algorithms have these
characteristics:
Input: The algorithm applies to a set of specified inputs.
Output: The algorithm produces one or more outputs.
Finite: The algorithm terminates after a finite number of steps.
Precise: Each step of the algorithm is clear and unambiguous.
Effective: The algorithm successfully produces the correct output.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
4 PROGRAMMING WITH C++

When formulating an algorithm, you can easily check to make sure it satisfies all the criteria for a good algo-
rithm. You can see how these criteria apply to an algorithm in Figure 1-2.

Is there input? Yes.

Get the last number in the series (10).


Divide 10 by 2 to get a RESULT. Are the steps precise and
Add 10 + 1 to get a SUM. unambiguous? Yes.
Multiply the RESULT by the SUM to
Does the algorithm terminate? Does the algorithm produce
produce a total.
Yes, after the fourth step. the correct output?
Yes, it is 55.
Is there output? Yes.

Figure 1-2 Is this a good algorithm?

Selecting and Creating Algorithms (1.1.8, 1.1.9, 1.1.10)


Before coding, programmers consider various algorithms that might apply to a problem. You can come up with
an algorithm in three ways:
Use a standard algorithm. Programmers have created effective algorithms for many computing
tasks, such as sorting, searching, manipulating text, encrypting data, and finding the shortest path.
When you are familiar with these standard algorithms, you can easily incorporate them in programs.
Perform the task manually. When you can’t find a standard algorithm, you can formulate an
algorithm by stepping through a process manually, recording those steps, and then analyzing their
effectiveness.
Apply computational thinking techniques. Computational thinking is a set of techniques designed
to formulate problems and their solutions. You can use computational thinking techniques such as
decomposition, pattern identification, and abstraction to devise efficient algorithms. Let’s take a look
at these techniques in more detail.

1.2 DECOMPOSITION
Decomposition Basics (1.2.1)
A mobile banking app contains many components. It has to provide a secure login procedure, allow users to
manage preferences, display account balances, push out alerts, read checks for deposit, and perform other tasks
shown in Figure 1-3.
The algorithm for such an extensive app would be difficult to formulate without dividing it into smaller parts,
a process called decomposition. When devising an algorithm for a complex problem or task, decomposition can
help you deal with smaller, more manageable pieces of the puzzle.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Module 1 Computational Thinking 5

Fraud alerts

Change user
Secure login
preferences

Account balance Deposits

iStock.com/vector.S
Pay bills Withdrawals

Transfer money

Figure 1-3 A mobile banking app handles many


interacting tasks

Structural Decomposition (1.2.2, 1.2.3, 1.2.4, 1.2.7)


The first step in decomposition is to identify structural units that perform distinct tasks. Figure 1-4 illustrates
how you might divide a mobile banking app into structural units, called modules.

Mobile banking

Passcode/challenge Account Payments and


Secure login
question changes management transfers

Two-factor
Balances Bill pay
authentication

Fingerprint Mobile check


Alerts
sign-in deposits

Direct Money
deposits transfers

Figure 1-4 Structural decomposition diagram

Structural decomposition is a process that identifies a hierarchy of structural units. At the lowest levels
of the hierarchy are modules, indicated in yellow in Figure 1-4, that have a manageable scope for creating
algorithms.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
6 PROGRAMMING WITH C++

Q Which module of the hierarchy chart is not fully decomposed?


A The module for modifying passwords and challenge questions could be further decomposed
into two modules: one module that allows users to change their passwords and one for
changing their challenge questions.

Here are some tips for creating a structural decomposition diagram:

• Use a top-down approach. The nodes at the top break down into component parts in the nodes below them.
• Label nodes with nouns and adjectives, rather than verbs. For example, “Account management” is the
correct noun phrase, rather than a verb phrase, such as “Manage accounts.”
• Don’t worry about sequencing. Except for the actual login process, the components in a mobile bank-
ing system could be accessed in any order. This is a key difference between an algorithm and decom-
position. An algorithm specifies an order of activities, whereas decomposition specifies the parts of
a task.

Functional Decomposition (1.2.5)


Functional decomposition breaks down modules into smaller actions, processes, or steps. Figure 1-5 illustrates
a functional decomposition of the two-factor authentication module.

Verify login attempts

Verify password Verify PIN

Validate Compare
Generate Send PIN
Prompt for Prompt for user ID and Prompt user user-entered Handle
one-time to
user ID password password for PIN PIN to mismatches
PIN mobile
match generated PIN

Look up Compare Look up Generate


stored entered Handle user text Nodes in green are
user ID and date with mismatches mobile message specific enough to
password stored data number with PIN become steps in an
algorithm.

Nodes in yellow
require further
decomposition.

Figure 1-5 Functional decomposition diagram

Notice how the levels of the functional decomposition diagram get more specific until the nodes in the lowest
levels begin to reveal instructions that should be incorporated in an algorithm.
Here are some tips for constructing functional decomposition diagrams and deriving algorithms from them:

• Label nodes with verb phrases. In contrast to the nodes of a structural decomposition diagram, the
nodes of a functional decomposition are labeled with verb phrases that indicate “what” is to be done.
• Sequence from left to right. Reading left to right on the diagram should correspond to the sequence in
which steps in the algorithm are performed.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Module 1 Computational Thinking 7

Object-Oriented Decomposition (1.2.6)


Another way to apply decomposition to a module is to look for logical and physical objects that a computer
program will manipulate. Figure 1-6 illustrates an object-oriented decomposition of the two-factor authentica-
tion module.

Each node
represents an
object.
PIN generator
Methods
Login screen Attribute: One-time PIN describe what an
object can do.
Attribute: Entered user ID Method: Generate random PIN
Attribute: Entered password Method: Send PIN to mobile
number
Method: Display login boxes
Method: Verify entered user ID
and password
Method: Verify PIN
Method: Handle mismatches

Valid user

Attribute: Valid user ID


Attribute: Valid password Attributes
Attribute: Mobile number describe an
object.

Figure 1-6 Object-oriented decomposition diagram

An object-oriented decomposition does not produce a hierarchy. Instead it produces a collection of objects
that can represent people, places, or things.
Tips for object-oriented decomposition:

• Node titles are nouns. Each node in the object-oriented decomposition diagram is labeled with a noun.
• Attributes are nouns. A node can contain a list of attributes, which relate to the characteristics of an object.
• Methods are verb phrases. An object can also contain methods, which are actions that an object can
perform. You may need to devise an algorithm for each method.
• Sketch in connection arrows. Connection arrows help you visualize how objects share data.

Dependencies and Cohesion (1.2.8)


You might wonder if there is a correct way to decompose a problem or task. In practice, there may be several
viable ways to apply decomposition, but an effective breakdown minimizes dependencies and maximizes cohe-
sion among the various parts.
The principles of decomposition are:

• Minimize dependencies. Although input and output may flow between nodes, changing the instructions
in one module or object should not require changes to others.
• Maximize cohesion. Each object or module contains attributes, methods, or instructions that perform a
single logical task or represent a single entity.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
8 PROGRAMMING WITH C++

1.3 PATTERN IDENTIFICATION


Pattern Identification Basics (1.3.1, 1.3.2)
The Amaze-Your-Friends math trick for quickly adding numbers from 1 to 10 is very simple:
Get the last number in the series (10).
Divide 10 by 2 to get a result.
Add 10 1 1 to get a sum.
Multiply the result by the sum.

Q Try the algorithm yourself. What is your answer?


A If your math is correct, your answer should be 55.

Now, what if the challenge is to add the numbers from 1 to 200? That algorithm looks like this:
Get the last number in the series (200).
Divide 200 by 2 to get a result.
Add 200 1 1 to get a sum.
Multiply the result by the sum.
Notice a pattern? This fill-in-the-blank algorithm works for any number:
Get the last number in the series (____________________).
Divide ____________________ by 2 to get a result.
Add ____________________ 1 1 to get a sum.
Multiply the result by the sum.
The process of finding similarities in procedures and tasks is called pattern identification. It is a useful com-
putational thinking technique for creating algorithms that can be used and reused on different data sets. By recog-
nizing the pattern in the Amaze-Your-Friends math trick, you can use the algorithm to find the total of any series
of numbers.

Repetitive Patterns (1.3.3)


In addition to fill-in-the-blank patterns, you might also find repetitive patterns as you analyze tasks and problems.
Think about this algorithm, which handles logins to a social media site:
Get a user ID.
Get a password.
If the password is correct, allow access.
If the password is not correct, get the password again.
If the password is correct, allow access.
If the password is not correct, get the password again.
If the password is correct, allow access.
If the password is not correct, get the password again.
If the password is correct, allow access.
If the password is not correct, lock the account.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Module 1 Computational Thinking 9

Q How many repetition patterns do you recognize?


A Two lines are repeated three times:
If the password is not correct, get the password again.
If the password is correct, allow access.

Recognizing this repetition, you can streamline the algorithm like this:
Get a password.
Repeat three times:
If the password is correct, allow access.
If the password is not correct, get the password again.
If the password is correct, allow access.
If the password is not correct, lock the account.

Classification Patterns (1.3.4, 1.3.5)


Everyone who subscribes to a social media site has a set of login credentials. Here are Lee’s and Priya’s:
Lee’s login credentials: Priya’s login credentials:
Lee’s user ID: LeezyBranson@gmail.com Priya’s user ID: PriyaMontell@gmail.com
Lee’s password: MyCat411 Priya’s password: ouY52311v
Lee’s mobile number: 415-999-1234 Priya’s mobile number: 906-222-0987
The series of attributes that define each user’s login credentials have a pattern of similarities. Each user
has three attributes: a user ID, a password, and a mobile number. By recognizing this pattern, you can create a
template for any user’s login credentials like this:
User ID: ____________________
Password: ____________________
Mobile number: ____________________
You can often discover classification patterns in the attributes that describe any person or object. Identify-
ing classification patterns can help you design programs that involve databases because the template identifies
fields, such as User ID, that contain data.
Classification patterns also come in handy if you want to design programs based on the interactions among
a variety of objects, rather than a step-by-step algorithm. In some programming circles, templates are called
classes because they specify the attributes for a classification of objects. For example, people classified as social
media subscribers have attributes for login credentials. Vehicles classified as cars have attributes such as color,
make, model, and VIN number. Businesses classified as restaurants have a name, hours of operation, and a menu.

1.4 ABSTRACTION
Abstraction Basics (1.4.1, 1.4.2, 1.4.3)
Think back to the Amaze-Your-Friends math trick. By identifying a pattern, you formulated a general algorithm
that works for a sequence of any length, whether it is a sequence of 1 to 10 or 1 to 200.
Get the last number in the series (____________________).
Divide ____________________ by 2 to get a result.

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
10 PROGRAMMING WITH C++

Add ____________________ 1 1 to get a sum.


Multiply the result by the sum.
In this algorithm, the blank line is an abstraction that represents the last number in the sequence. An abstraction
hides details, simplifies complexity, substitutes a generalization for something specific, and allows an algorithm to
work for multiple inputs.
Abstraction is a key element of computational thinking and helps programmers in a multitude of ways.
If you’ve programmed before, you’ll recognize that in the Amaze-Your-Friends algorithm, the blanks could
become a variable with a name such as last_number. Result and sum are also variables because they represent
values that change depending on the numbers in the sequence
Get the last_number
Divide last_number by 2 to get a result.
Add last_number 1 1 to get a sum.
Multiply the result by the sum.
A variable is an abstraction because rather than representing a specific number, it can be used to represent
many different numbers.

Classes and Objects (1.4.4, 1.4.5)


Abstraction has uses other than identifying variables. It is important for understanding how to represent real-
world and conceptual objects. Remember the pattern you discovered for social media login credentials? With a
little modification, it becomes a template that can be applied to any subscriber:
Class: LoginCredentials
Attribute: user_ID
Attribute: user_password
Attribute: mobile_number
The LoginCredentials class is an abstraction that contains a set of attributes. The class was formed by
abstracting away, or removing, details for any specific subscriber.
Abstractions are handy for any programs that deal with real-world objects in addition to technology objects,
such as login credentials.

Q Can you envision a class that’s an abstraction of the collection of objects shown in Figure 1-7?
Budnyi/Shutterstock.com

12 oz water glass 5 oz martini glass 8 oz wine glass 10 oz water goblet

Figure 1-7 Abstract the details from this collection of glassware

Copyright 2022 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Another Random Document on
Scribd Without Any Related Topics
outside which they are not to be seen. This adds very much to the
interest of slow travelling, as it keeps you constantly on the watch,
and you are rewarded by always seeing something fresh. The trying
thing about it is that if you do not buy the thing you want directly you
see it, most likely you will never have another chance.
It is amusing to watch the harvesting of the peanuts which is now
going on. Owing to the clayey nature of the soil, it is impossible to
sieve them as in Shantung, so whole families establish themselves
in a field, attended by their poultry and pigs, which are picketed out
over the surface of the ground. This has been already dug up and
cleared by the gatherers, but the family gleans what has been
overlooked, and the poultry and pigs again glean what they may
have left. Little Chinese children sit in baskets, but at a very tender
age they begin to share the toils of their elders. It is astonishing to
see the loads of salt, coal, or firewood which some of these tiny
creatures manage to carry with a manly energy. There must be a
good deal of country life in this district, for there are numbers of nice-
looking farms situated on the hilltops (as in the sketch of “Sunlight
and Mist”), surrounded by haystacks and vegetable gardens and
clumps of the useful bamboo. The bamboo seems to be used for
every possible purpose, and many of the implements made from it
are as ingenious as they are simple. Take, for instance, the rake; one
end of the bamboo rod is split, the ends bent, and a tiny bit of plaiting
spreads the prongs out fan shape. A greater variety of baskets, too,
is made from bamboos than I have ever seen elsewhere, and they
are used for a much larger number of purposes than at home.
As we plodded along the rice-fields one morning, after about an
hour’s walk we came to a wayside booth, where our men stopped for
their first snack of food, and some particularly fresh-looking eggs
tempted us to join their meal. The salesman proceeded to poach
them, and would have added sugar if we had not stopped him.
Declining chopsticks, I was provided with a nice little pottery spoon,
and my friend took possession of a saucer about the size of a penny
(commonly used for sauce) for the same purpose. Long strings of
mules passed us, carrying taxes in the shape of small basket-loads
of bullion, accompanied by a military escort. The leading mules were
gaily decorated with flags, showing that they were on government
duty. The road was bad and slippery, and our men soon decided to
shorten the day’s journey by one-third, which we declined to allow,
having already spared their strength by walking for several hours; we
agreed, however, to shorten the stage to a certain extent. The
natural result was that we found a horrible inn with only two tiny
rooms at our disposal, an inner one being already occupied by
several people. We agreed to remain there only on one condition—
that these people should be put elsewhere; and we found the three
cells were more than filled by ourselves and our staff. There were no
windows, but there was plenty of ventilation. The house was like a
large barn, the end of which was divided off by a thin partition, in the
centre of which was a round door. This part was again subdivided
into three cubicles. The outer part of the barn was like a big
restaurant, and after a while the many inhabitants rolled themselves
up like sausages in the wadded quilts provided by the inn, and
bestowed themselves as comfortably as might be on tables or
benches, and comparative silence reigned for a few hours. Happily,
the rain stopped, for there was quite enough open space in the roof
above my head and in the walls for us to study astronomy had it
been a clear night. We found it unnecessary to have our pan of
charcoal taken out at nights, for there was always a lovely breeze to
carry away any fumes there might be.
In this district the beds are made of straw, covered with a
bamboo matting, and are not uncomfortable; but we always felt
happier when we got a plain wooden bedstead like a large, low table.
We passed a night at an interesting large town called Shun King
Fu, and were greatly charmed with the lovely silks we saw being
made there, and the silver work. Everywhere the people were busy
with the various processes of silk-making. Hand-looms, of course,
are used, and we saw the most exquisite golden shades of silk in all
stages of manufacture. It is, however, never sold in its natural golden
colour, or white (as that is the Chinese mourning), unless some
European succeeds in getting hold of a piece in its unfinished state.
Some of the natural dyes are wonderfully brilliant, but unfortunately
none of them seemed to be fast colours. The red and yellow
vegetable dyes and indigo are grown in the province of Szechwan,
but, sad to say, aniline dyes have been introduced, and are
becoming more and more common.
The missionaries who were entertaining us kindly sent out to a
silk merchant to bring pieces for us to select from, as it is not very
usual for ladies to go out shopping in this city. When we had chosen
what we wanted, the silk had to be weighed, instead of measured, to
ascertain what the price was. The merchant, who brought lovely
embroidery silks for sale, had neat little scales in a case with which
to weigh the skeins. A long discussion as to the price ensued, as it
had gone up since our hosts bought similar silks a month before, and
no valid reason could be produced for the change. Of course the
system of bargaining is universal, and we were thankful to have
some one to tell us what the price ought to have been and to do the
bargaining for us. Next the silversmith was summoned, and he
brought a trayful of various silver ornaments, ready to be inlaid with
kingfishers’ feathers. This is an art peculiar to China; in fact, no one
but a Chinaman would have the patience requisite for doing it. The
effect is that of the most brilliant, iridescent, blue-green enamel, and
usually beads or red-coloured glass or coral are introduced instead
of jewels. It is particularly effective when combined with jade. This
jewelry was also sold by weight, and we had to leave our purchases
to be “feathered” and sent after us, as everything of that sort is only
made to order. Brides frequently wear a sort of crown made of silver
and kingfishers’ feathers, which looks extremely effective. There are
some fine examples of this work in the Chinese Section of the South
Kensington Museum.
We were told that we must make an early start next day, as it
was a very long stage—between thirty and thirty-five miles—so we
were up betimes, and ready at six o’clock. Luck was decidedly
against us. First one of the coolies said he was ill and could not go,
so another had to be got, which delayed us nearly an hour. The
morning was very grey, and a cold drizzle soon set in. My chair-
bearers fell down even before we got outside the city, and the road
became more and more sticky every moment. The men hate cold
water, and had to walk round every puddle, which took up a great
deal of time. The ground is composed of a particularly sticky clay,
which is perhaps the reason why not only the cattle but also the
funny little black pigs wear straw sandals when they travel.
After our chairs had been upset more than once we decided that
it was less unpleasant to walk, and the soldiers came valiantly to the
rescue when the road was specially difficult, as in the case of long
flights of slippery steps. Sometimes they gave us a hand, and
sometimes they clutched an elbow to save us. The descriptions of
slippery places and the perils of the road, as given in the Book of
Psalms, were perpetually before our mental vision. Nothing could
more accurately describe Chinese roads in wet weather. The coolies
tied little metal things on to their sandals, which was somewhat of a
help, but we felt almost thankful when at midday the rain settled into
a steady downpour; for, though it was rather dreary, it was less
slippery. There were a large number of chairs on the road, and some
as important-looking as our own. This was the only bit of the journey
when we travelled like mandarins, but we lacked the smart military
uniforms of the mandarins’ coolies; ours were the most disreputable,
ragged-looking crew, and much less satisfactory as carriers than
those we had in Shantung or Yünnan. In the nine days that we had
been travelling from Wanhsien we had only once met a four-bearer
chair, but now we were nearing the capital—Chengtu—the road was
much more crowded with traffic of all sorts. The last stage of the
journey is through comparatively level country. After a breakneck
descent from the mountains we entered the plain in which Chengtu
is situated. It is about ninety miles in length by forty broad, and has
been well described as a garden. Colonel Manifold estimates that it
contains a population of 1700 to the square mile, and there are
seventeen cities in it. The old familiar groan of wheelbarrows greeted
our ears once more, though the type is slightly different here from
that of Shantung; they are much smaller and only accommodate one
person, or (as we frequently saw) one fat pig, lying on his back, with
his legs in the air. The seat is immediately behind the wheel, and it
looks decidedly comic to see a woman, wearing tight pink trousers,
with a leg cocked jauntily on either side of the wheel.
SUNLIGHT AND MIST IN THE MOUNTAINS

In this part of the country we passed through villages much more


frequently, and the people had a busier air. There are markets held
every few days in one or other of the villages, so that we continually
met people coming from them laden with their spoils. They kept
passing us on the road wearing paper caps over their hats, and on
inquiry we learnt that this was done to preserve their pristine
freshness. The fields were full of people weeding, and they looked
very comfortable, seated on their little stools, and with warming-pans
between their feet; for it was the week before Christmas, and the
weather was growing cold. The minute kind of care the peasants
here give to their crops is most interesting, each individual plant in a
field being carefully attended to and manured. Each member of a
family seems to share in the toil and to have implements suited to his
or her size, some of them the “cutest” little weapons imaginable. The
people look well fed and attended to, but their clothing is often a
network of rags, and their houses are singularly dark and forbidding.
If there is any scarcity through unfavourable crops, they suffer
immediately and acutely, as agriculture is the most important
industry of the province. The men have such long pipes that they
frequently use them as walking-sticks. Often the women came round
and smilingly interrogated us. Then we went through an amusing
dumb conversation of the most friendly sort. The subject is usually
the same—feet—and they never fail to admire our English boots, if
not our feet. We, on our side, express much admiration of the
exquisite embroidery of their shoes, though we do not admire their
feet. Everywhere they seem to think we must be doctors, and they
come and explain what a pain they have in the region of the
digestion. We administer a harmless and comforting dose of ginger,
and they swallow it with the utmost faith, which we hope may cause
it to be doubly efficacious. In any case it is a sign of our goodwill,
and establishes a friendly feeling among the people, and I do not see
that it can do any harm.
We reached Chengtu on the morning of the fourteenth day, and
spent a full hour wandering in search of the English missionary’s
house, on whose kind hospitality we were reckoning; for there are
many missions in this large city, and our men at once made for the
most imposing, which, needless to say, is American.
It may seem strange to people at home to hear that travellers
habitually swoop down on missions, often without even giving notice
beforehand, and are invariably welcomed with courtesy and
kindness. Travelling in China would be a much more difficult matter
than it is if it were not for the ungrudging helpfulness and hospitality
of the missionaries. Those to whom we had been directed were
unable to take us in, on account of illness, but had made
arrangements for us to be entertained at the Friends’ mission, and
helped us in many other ways.
CITY GATE, CHENGTU
CHAPTER XV
Chengtu

C
HENGTU is unquestionably the cleanest city in China, and
probably is the most progressive and enlightened of any
purely native city. The streets are broad and well kept, and
the foreigner can walk anywhere without the slightest fear of
molestation. At almost every street corner there is a policeman, and
many of them have sentry-boxes. They are neatly dressed in a sort
of European uniform, and are decidedly clean and civil. They wear a
kind of small black sailor-hat, and the smarter ones wear black
thread gloves of native manufacture and carry stout walking-sticks.
Altogether, they are the best type of police we met. There are no
beggars with their hideous whine and incomparable dirt. This is a
magnificent triumph for the head magistrate, as a few years ago they
numbered twenty thousand in Chengtu; but he was determined to
put an end to the system, and has entirely succeeded. We met a
large school of boys neatly dressed, and were told that these were
the children of the beggars, whom he had collected into a large
school, where they are taught trades at the expense of the
municipality.
On the day of our arrival a kind friend offered to take us round
the city. For the first time since leaving Shanghai, we found we could
go on a real shopping expedition, and we had a glorious afternoon of
it. It would be hard to find a more fascinating place than Chengtu for
shopping. The curio shops had much that was attractive, though
nothing of any great value. We were told that we must proceed with
great caution if we wished to get things at a reasonable price; and
fortunately we were able to discuss in an unknown tongue, which
was a great advantage to us in dealing with the shopkeepers. Our
method of procedure was as follows:—firstly, to look with interest at
all the things we did not want, such as a baby’s feeding-bottle or old
beer-bottles; secondly, to point out all the flaws in anything that we
did want, turning up our noses till they were nearly out of joint;
thirdly, to ask the prices of many things, and to exclaim “Ai-ah” in an
incredulous tone on hearing the price of the things that we wanted to
purchase. Then we named a price about five times below what was
asked. Finally we left the shop and strolled away up the street, while
our kind friend further discussed the matter with the shopkeeper, we
having previously arranged with him in English how high we were
willing to go. On an average we got the things at about half the price
named originally, but sometimes we got them considerably cheaper.
There was not much old china to be seen, but a few bronzes and a
good deal of interesting brass, mostly modern. Chengtu is a great
place for the manufacture of horn things, especially lanterns, which
are most ingeniously constructed. The sheets of horn are joined by
being melted together, and Hosie gives a most interesting
description in his trade report of the way that these and other things
are made in Chengtu. There is a great manufacture of masks, and of
whole heads of the same kind, which are painted brilliant colours,
especially pink. In another street it is interesting to watch the sacred
money being made. Outside each shop a tree trunk is set up about
six feet high; the top of it is carved to form a mould, the shape of a
silver shoe. Into this the paper—made from bamboo or rice straw—is
beaten into shape with a hammer by a man standing upon the
counter in order to reach up to it. The basket-shops, too, are most
enticing, and here they make the largest baskets I have ever seen,
about four feet high and about two yards in diameter. This is the
place from which loofah comes; it is the inside of a peculiar kind of
melon. Chengtu is the great trade centre, too, for spices and musk,
furs, &c., which come from Tibet; but the great trade of the place is in
silks, as in the days of Marco Polo—and these were brought to the
house another day for us to see. The figured crêpe de Chine was
beautiful, and the shades were different from those to be seen at
home. I got a lovely figured brocade at about 3s. 9d. per yard, and
crêpe de Chine at 1s. 6d. You can see these silks being woven in
numbers of the dark-looking houses, and the design is made by a
person sitting above the loom, almost in the roof. Another charming
industry is that of ribbons and braids, which are made on the most
ingenious little machines. The people sit outside their doors working
at them, as you see the women with their lace bobbins in European
countries.
The people seem a poor, cheerful, thrifty folk, and there is an air
of prosperous activity throughout the whole city. Many parts of it are
extremely picturesque, and there are beautiful trees of various kinds
shading the wide thoroughfares. In the evening our attention was
attracted by tall poles, with lights placed so high up that they could
have been of no possible use to anybody. We found that they were
put up by pious persons to light the “orphan spirits”—that is to say, to
show the way home to people who had died away from their own
city.
The following day we visited the famous Buddhist monastery,
enclosed by a wall above which rose lofty trees. Passing through the
fine entrance, we faced a large gilt Buddha in a narrow shrine; back
to back with this, and divided off by a thin partition, was another
figure of the Buddha, facing the court. Here the Abbot received us
most courteously, and sent for his secretary to show us round. The
accompanying diagram shows the ordinary sort of arrangement both
of temples and monasteries. The temples generally form a group of
buildings separated from one another by courts one behind the other
in a straight line, the principal buildings forming the ends, and minor
buildings running along the sides of the courts. The hall of meditation
of the monks was an imposing room with seats along the walls, on
which the monks sit cross-legged, looking very much like Buddhas.
Everything was beautifully clean in the dining-hall, which was filled
with long tables, on which three bowls and a pair of chopsticks were
placed at intervals for each monk. In the kitchen we saw an
enormous boiler, where over a bushel of rice is cooked for each
meal, to supply the appetites of a hundred and fifty monks. A large
wooden fish acts as a gong for summoning the monks to meals, and
another gong is used to summon them to tea.
PLAN OF MONASTERY, CHENGTU

One of the monks looked as if he had been recently branded for


sainthood with nine marks about the size of threepenny-bits,
symmetrically dotted over his skull. Hackmann gives an interesting
description of the way this is done in his book Der Buddhismus. The
candidate for sainthood has small pieces of incense fastened on to
his shaven head by means of resin. These are lighted and allowed to
burn into the flesh, while a chant is kept up by the other monks, and
the sufferer has some one to press his temples with his thumbs to
relieve the pain.
BUDDHIST MONASTERY

At the end of the third courtyard we were taken into a lofty


temple, where the Abbot’s throne faced the doorway. A gilt Buddha,
with fruit and flowers placed on a table, formed a sort of altar in front
of it. Round doorways, without doors, led to guest-rooms on either
side of this hall, and we were hospitably entertained in one with tea
and cakes. By permission of the Abbot, I returned next day to make
a sketch of this picturesque interior, and in this sketch the doorway is
shown, which is very characteristic of Szechwan architecture. Many
of the inns in this province have circular doorways and windows. The
Abbot came and talked with us very politely, and on inquiry I learnt
that a most beautiful painting of lotus blossoms in black and white,
which hung over the doorway, was by a celebrated artist, and had
been presented to the monastery by a pious worshipper. The Abbot
sat down and began discussing our respective religions, which he
said were exactly the same. While agreeing as to their fundamental
principle being the same, I felt unable to discuss their differences,
being somewhat inattentive, I fear, owing to my endeavour to get on
with the sketch as rapidly as possible. Next the Abbot was sure we
must be hungry, though we had just been regaled with excellent
sweets and tea, and, despite our refusing it, he insisted on sending
us some of the meal to which he had been summoned. A monk soon
appeared with bowls of vermicelli and greens. It was not unpalatable,
and much easier to manage with chopsticks than might be
supposed, as the bowl is held close to the mouth and the food
shovelled in with chopsticks aided by suction. At intervals the
novices came in to worship, and prostrated themselves before the
altar. Most of the monks were dressed in pretty silver-grey robes, but
some in the orthodox orange, and the Abbot wore a blue cloak. It
was certainly an attractive community, a great contrast to those we
saw in Peking.
Educationally Chengtu stands in the front rank of Chinese cities.
Everywhere there are schools and colleges established on the new
lines, and more are being built. The people are so enthusiastic that
they have rather overshot the mark, it may be thought. In order to
facilitate the girls’ going to school they are being dressed as boys, so
that they may pass through the streets unnoticed to attend the
various schools which have been started for them. One girl came to
a friend of mine to seek admission to her school, and not only did the
European take her for a boy (telling her the boys’ school was on the
other side of the road), but so also did the Chinese gatekeeper, who
insisted she had come to the wrong place. At the recent athletic
sports the students put up a notice that no lady with bound feet
would be admitted to the ground, and we hear that this notice is now
being put up everywhere throughout the empire on such occasions.
Anti-foot-binding is certainly making good progress among the upper
classes, and we even saw a shoe-shop with large shoes for ladies
prominently displayed on the counter. Nowhere else have we seen
this.
There is a large military medical college at which there are three
French doctors. Their presence is not altogether agreeable to the
Chinese, and when one retired recently the officials took the
opportunity of suggesting that he should not be replaced. They said
that they could not afford his salary. How great must have been their
disappointment when they were informed that their new professor
had already arrived, and that the French authorities were quite
willing to pay for him! Foreign competition in China has its funny
side, but I marvel at the way the Chinese endure it.
The University is an interesting but eminently unpicturesque
place, and the students are cramming Western subjects in a way to
cause intellectual dyspepsia. As everywhere in China, English is the
main subject, and they have a professor from Cambridge, with two
English assistants and a Dane. French, German, and Japanese are
also taught, and there is only one professor for Chinese classics.
Sunday is a holiday, and many students spend the week-end at
home. The walls of the class-rooms are nearly all window, but it is in
no ways disturbing to Chinese students to have any number of
spectators, or to be able to see into the adjoining class-rooms. Each
study is occupied by three or four students, and the studies are
simply partitioned corridors with a passage down the centre and a
railing on either side of it, instead of walls. The dining-rooms are like
outdoor restaurants with a roof over them, and the students sit four
at a table. The fees for the year, including everything, are thirty
dollars (about £3. 10s.). Many students are very anxious to study in
England, but cannot possibly raise the necessary funds; and until
proper arrangements are made to look after them when they do
come, it is hardly a desirable plan. America is far ahead of us in this
respect, and England would do well to follow her example.
Everything is in our favour at present, and it might be of the utmost
value as regards the development of China, and the commercial
interests of England, to seize the opportunity of educating some of
her ablest scholars. A Chinese gentleman told me that students
returning from England are very apt to be full of bumptiousness
because they have come out head of their class in English schools,
while they have failed to assimilate what they have learnt. We spent
an evening with some students, answering questions about the
different countries we had visited. They wanted to know about the
government, the religious and general conditions of other lands.
Naturally the questions covered far too big an area to admit of
satisfactory answers, but probably the men would have been willing
to listen all night, if we had been willing to go on talking. They were
most interested to hear the reasons why we admire China and the
points of superiority which it possessed.
MILITARY YAMEN
On the last day of the year the Viceroy and the Tartar general
sent presents to all the foreign community. Their visiting-cards were
brought in, and a list of the presents which were waiting outside—
hams, pigeons, ducks, fruits, and sweetmeats. We went outside to
see them, and found the presents displayed on trays on the top of
large boxes, or hung round them. It is customary to select about two
things; visiting-cards are sent back with the remainder, and a small
present of money is given to the servants who bring the gifts. They
replace what has been selected from a supply inside the box, and
then carry them on to the next house. We went to see the Tartar
general’s yamen in the Manchu city, a very pretty spot embowered in
trees, and quite typical of Chinese official buildings. The inscription
over the entrance is “Yamen of the greatest General,” and on the
doors and walls are highly coloured pictures of the tutelary gods, two
celebrated generals of the T’Ang dynasty (a.d. 618 to 905); one is
white-faced, and the other red-faced. These pictures are repeated all
along the wall, and also on the doorways of the inner courtyard,
which in the sketch appears in the background. They are singularly
ugly, but as the pictures of the door-gods are seen on the houses of
all, even the poorest, the sketch of them may not be devoid of
interest. On private houses some of them are quite little papers like
advertisements, while again some of the private houses have large
gilt figures covering the whole doors. One day we went outside the
city to visit a fine temple, and came to a place where there is a road
on which you can drive in carriages. This is the only place in the
province where there is a carriage, but we did not have the privilege
of seeing it. The walls are broad enough and smooth enough on the
top to make a splendid carriage drive—four or five vehicles might
easily drive abreast—and as they are ten miles round, it would really
be a fine promenade. In the spring the view must be very beautiful,
for there is a range of snowy mountains in the distance, and many
branches of the Min River water the intervening plain. During the
whole week that we spent at Chengtu we never saw the mountains,
on account of the mist; but it was not hard to imagine the beauty of
the place when the flowers are out and the brilliant butterflies
hovering round them.
We took part in an interesting event while we were staying here
—the purchase of land for a Christian university. Heavy bundles of
silver “tings” had to be weighed before the payment was settled.
Four different missionary societies have each agreed to build a
college and to provide a certain number of qualified teachers. It is
also proposed that Etonians should furnish a hostel. This university
scheme for the west seems likely to be the forerunner of one also in
the east of the empire, but the latter will be on more ambitious lines.
We were sorrier when the time came for us to leave Chengtu
than we were to resume our journey on any other occasion. We had
decided to go by river to Kiating, despite the fact that it was very low;
and as we left the city we came to the wall where the new barracks
are situated, and saw some soldiers doing the goose-step. Others
were jumping into a trench, where nearly every one landed on all-
fours. There was very great hesitation before they dared leap at all.
The city is enclosed by one of the branches of the river, and we had
not to go very far outside the wall before we reached the point where
our boat was moored.
CHAPTER XVI
The Min River

W
E reached the riverside—it looked merely a stream—and
found our boat, with the luggage already aboard, looking
most unpromising, despite the efforts of our men. It was a
small river craft about eight feet broad. Bamboo matting not more
than five feet high formed our house-room, with a few planks for a
door in front. Fragments of matting made a partial screen in the
centre. The floor was of a rudimentary character, just a few boards
with large gaps between them, through which one could study the
depth of water over which our luggage was precariously poised on
low props. In order to prevent all our small things from dropping
through the floor, we spread over it our invaluable sheets of oil-
cotton (a kind of waterproof largely used everywhere in China), and
fastened up a curtain at each end of the tiny boat to secure a small
amount of privacy. There was just space for our two carrying-chairs
and our mattresses. One of the chairs we used as a wardrobe, and
the other as a store-cupboard. The bamboo chairs we had procured
at the penitentiary of Chengtu, despite the advice of our friends, as
we found sedan-chairs very irksome, and decided that open ones
would be more comfortable and enable us to see the country better.
With long fur coats and foot muffs we felt that we could brave the
cold, and there was always the resource of walking if we got too
chilly. We never for a moment regretted our decision, and we found
that the men carried the open chairs far better than the heavy closed
ones. We profited at once by the exchange, as they were able to be
used for going to Mount Omi, and we were carried some distance up
the mountain. Under the seat was a box in which we could carry all
our small things, and the coolies hung their coats, hats, &c., on the
back.
As our room was so small we sat mostly on the floor, so as to
have everything within reach without getting up. The cooking was a
somewhat difficult matter, as the brazier on which it was done was
only six inches in diameter, and rather apt to burn a hole in the floor
if it was heated sufficiently to do any cooking. We were glad of its
warmth, as the weather was very cold. Chopsticks were evidently the
correct fireirons, and are just the right size to match the charcoal.
With practice I got fairly expert at making palatable dishes, as
naturally the range of the menu was much limited. From this time
onward I did all the cooking, and I cannot help attributing to this fact
mainly the excellent health we enjoyed throughout the whole journey.
It was on his way from Chang Te to Mount Omi that the
unfortunate Lieutenant Brooke was murdered by Lolos about a year
later than we were there. We were strongly warned about the care
requisite in dealing with Lolos, and told that it was imprudent even to
mention the name in public, as it is considered a term of reproach. It
was suggested that we should spell it if desirous of speaking of
them. Their country is marked on the maps as “Independent Lolos,”
and covers about 11,000 square miles: no Chinaman dare penetrate
into it without the safe-conduct of a Lolo. Their speech, dress,
customs, religion, and laws are entirely different from those of the
Chinese. No one has yet come into sufficiently close contact with
them to ascertain even approximately the number of Lolo tribes in
existence at the present time, speaking different dialects. What was
true at the time that Baber explored Western Szechwan is equally
true to-day—that practically nothing is known about them. He gives a
graphic description of the Lolos whom he met, which I quote at
length: “They are far taller than the Chinese; taller probably than any
European people. During the journey we must have met hundreds of
them, but we never saw one who could be called, even from an
English standard, short or undersized. They are almost without
exception remarkably straight-built, with thin muscular limbs. Their
chests are deep, as becomes mountaineers: the speed and
endurance with which they scale their native mountains is a prodigy
and a proverb for the Chinese. Their handsome oval faces, of a
reddish brown among those most exposed to the weather, are
furnished with large, level eyes, prominent but not exaggerated

You might also like