0% found this document useful (0 votes)

11 views81 pages

92509656

The document provides information on various eBooks available for download, including titles related to programming with C++, practical computer concepts, and Microsoft Office. It includes links to purchase or download these eBooks in multiple formats such as PDF, ePub, and MOBI. Additionally, it contains copyright information and a detailed table of contents for the book 'Readings from Programming with C++'.

Uploaded by

zeemkrluk

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

11 views81 pages

92509656

Uploaded by

zeemkrluk

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 81

Download the Full Ebook and Access More Features - ebooknice.

com

(Ebook) Readings from Programming with C++ by Kyla

McMullen, Elizabeth Matthews, June Jamrich Parsons
ISBN 2020922802

https://ebooknice.com/product/readings-from-programming-
with-c-46254828

OR CLICK HERE

DOWLOAD EBOOK

Download more ebook instantly today at https://ebooknice.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!

(Ebook) Readings from Programming with C++ by Kyla

McMullen, Elizabeth Matthews, June Jamrich Parsons ISBN
9780357637753, 0357637755
https://ebooknice.com/product/readings-from-programming-
with-c-46254982

ebooknice.com

(Ebook) Biota Grow 2C gather 2C cook by Loucas, Jason;

Viles, James ISBN 9781459699816, 9781743365571,
9781925268492, 1459699815, 1743365578, 1925268497
https://ebooknice.com/product/biota-grow-2c-gather-2c-cook-6661374

ebooknice.com

(Ebook) Practical PC , 6th Edition by June Jamrich

Parsons, Dan Oja ISBN 0538746726

https://ebooknice.com/product/practical-pc-6th-edition-2338054

ebooknice.com

(Ebook) New perspectives comprehensive computer concepts

2016 by Parsons, June Jamrich ISBN 9781305656284,
1305656288
https://ebooknice.com/product/new-perspectives-comprehensive-computer-
concepts-2016-10123606

ebooknice.com
(Ebook) New Perspectives on Computer Concepts 2011:
Comprehensive by June Jamrich Parsons, Dan Oja ISBN
0538744812
https://ebooknice.com/product/new-perspectives-on-computer-
concepts-2011-comprehensive-2394278

ebooknice.com

(Ebook) New Perspectives on Computer Concepts 2012:

Introductory by June Jamrich Parsons, Dan Oja ISBN
1111529086
https://ebooknice.com/product/new-perspectives-on-computer-
concepts-2012-introductory-2324246

ebooknice.com

(Ebook) Practical Microsoft Office 2010 (Sam 2010

Compatible Products) by June Jamrich Parsons, Dan Oja
ISBN 0538745959
https://ebooknice.com/product/practical-microsoft-
office-2010-sam-2010-compatible-products-2390994

ebooknice.com

(Ebook) New Perspectives on Computer Concepts 2014:

Comprehensive by June Jamrich Parsons, Dan Oja ISBN
9781285096926, 1285096924
https://ebooknice.com/product/new-perspectives-on-computer-
concepts-2014-comprehensive-4427960

ebooknice.com

(Ebook) New Pespectives on Computer Concepts 2018:

Comprehensive, 20th Edition by Parsons, June Jamrich ISBN
9781305951495, 1305951492
https://ebooknice.com/product/new-pespectives-on-computer-
concepts-2018-comprehensive-20th-edition-29646918

ebooknice.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

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

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

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

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

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

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

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

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

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.

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.

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.

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.

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.

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.

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.

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.

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: [email protected] Priya’s user ID: [email protected]
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.

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

A The glassware class could have these attributes:

Class: Glassware
Attribute: Color
Attribute: Capacity
Attribute: Style

Black Boxes (1.4.6)

To drive a car, you don’t have to know exactly what goes on under the hood. The engine is essentially a “black
box” that you control using a few simple inputs such as the gas pedal, brake, and steering wheel. The details of the
engine are hidden. In computer science terminology, these details have been “abstracted away.” See Figure 1-8.

You can drive a car without

knowing the details of what’s
under the hood.

Figure 1-8 The controls for a car are an abstraction of

its detailed mechanics

In concept, a black box is anything that accepts some type of input and performs a specific process to
produce output without requiring an understanding of its internal workings. See Figure 1-9.

Something goes on inside.

Something goes in.

Something comes out.

Black box

Figure 1-9 Black box abstraction

The black-box concept of abstraction is a fundamental aspect of computer science. Think about it. C
omputer
programs are abstractions. For example, you can use a social media app without knowing anything about the
programming that makes it work. The icons that you touch on the screen abstract away the details of the under-
lying programming.
Programmers make extensive use of abstraction within programs by creating a set of instructions that func-
tions like a black box. For example, you could bundle the instructions that handle login attempts into a black
box like the one in Figure 1-10.
Programming languages also have built-in abstractions that perform standard tasks. For example, the built-in
random function generates a random number when given a range, such as 1–100. You can incorporate the random
function in a program without knowing how it works internally.

Look up stored user ID and

User ID
password.
password
Compare stored user ID and
password to entered user ID Allow or deny access
and password.
If they match, allow access.

Black box

Figure 1-10 A login abstraction

Levels of Abstraction (1.4.7)

After you get the hang of abstraction, you’ll see examples of this computational thinking concept everywhere.
Applying the correct level of abstraction to your programs may take a little practice.
A level of abstraction relates to the amount of detail that is hidden. Abstracting out too much detail can
make a program too generalized. Neglecting abstraction can produce programs that are too specific to work with
a wide variety of data. See Figure 1-11.

Too specific Just right Too abstract

Figure 1-11 Levels of abstraction

With experience, you’ll be able to identify useful abstractions and gauge the correct level of abstraction
to use.

SUMMARY
• Computational thinking techniques help programmers define problems, find solutions, delineate tasks,
and devise algorithms.
• An algorithm is a series of steps for solving a problem or carrying out a task. Programming algorithms
are the blueprints for computer programs.
• Standard algorithms exist for many computing tasks. When an algorithm does not exist, you can step
through a process manually and record the steps, or apply computational thinking techniques, such as
decomposition, pattern identification, and abstraction.
• Decomposition divides a complex problem or task into manageable units.
• Pattern identification reveals sequences and repetitive tasks that can lead to algorithm efficiencies.
• Abstraction is a key computer science concept that suppresses details, substitutes a generalization for
something specific, and allows an algorithm to work for multiple inputs.

Key Terms
abstraction computer program objects
algorithm decomposition object-oriented decomposition
attributes Functional decomposition pattern identification
classes level of abstraction programming algorithm
classification patterns methods Structural decomposition
Computational thinking modules

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

2
PROGRAMMING TOOLS
LEARNING OBJECTIVES:
2.1 PROGRAMMING LANGUAGES 2.3.5 Explain the purpose of a linker.
2.1.1 Explain the significance of the Hello World! program. 2.3.6 Associate virtual machines with Java and
bytecode.
2.1.2 Reiterate that programming languages are used to
create software. 2.3.7 Explain how an interpreter works.
2.1.3 Name some popular programming languages. 2.3.8 Differentiate between source code, bytecode,
object code, and executable code.
2.1.4 Distinguish between syntax and semantics in the
context of programming languages.
2.4 DEBUGGING TOOLS
2.1.5 Identify the key characteristics common to
2.4.1 Explain the purpose of debugging.
programming languages.
2.4.2 List common syntax errors.
2.1.6 Explain options for accessing programming
language implementations. 2.4.3 List common runtime errors.
2.1.7 Identify programming tools. 2.4.4 List common logic errors.
2.4.5 Classify program errors as syntax errors, logic
2.2 CODING TOOLS
errors, or runtime errors.
2.2.1 Define a program editor as the tool used to enter
2.4.6 Classify a debugger as utility software that allows
program code.
programmers to walk through the code of a target
2.2.2 List the types of editors that can be used for program to find errors.
coding.
2.4.7 List handy features provided by a debugger.
2.2.3 List some handy features of code editors and
explain how they help programmers create 2.5 IDEs AND SDKs
clean code.
2.5.1 List the purpose and typical features of an
2.2.4 Identify the basic structure and syntactical integrated development environment (IDE).
elements for a program written in the
2.5.2 Explain how IDEs support visual programming.
programming language you use.
2.5.3 Confirm that some IDEs are installed locally, while
2.3 BUILD TOOLS other IDEs are accessed online.
2.3.1 Explain the purpose of build tools. 2.5.4 Identify popular IDEs.
2.3.2 Explain the difference between source code and 2.5.5 List the purpose and typical features of a software
object code. development kit (SDK).
2.3.3 Describe how a compiler works. 2.5.6 Provide examples of SDK functionality.
2.3.4 Explain the purpose of a preprocessor. 2.5.7 Identify popular SDKs.

2.1 PROGRAMMING LANGUAGES

Hello World! (2.1.1)
Hola! Bonjour! Hi! Ciao! Namaste! Salaam! Nihau! Greetings like these are the first thing you learn when studying
a spoken language. Programmers have a similar starting point. It is the Hello World! program.
Hello World! is without doubt the most famous computer program of all time. It has been written in every one
of the 7001 programming languages. It is typically the first program written by aspiring programmers.

Q Take a look at the Hello World! programs in Figure 2-1. They are written in three popular
programming languages, C11, Java, and Python. What differences can you identify?

Hello World! in C++ Hello World! in Java Hello World! in Python

#include <iostream> class HelloWorld { print("Hello World!")

using namespace std; public static void main(String[] args) {
int main() System.out.println("Hello World!");
{ }
cout <<"Hello World!"; }
return 0;
}

Figure 2-1 Hello World in C11, Java, and Python

A You probably noticed the following differences:

Length: Some Hello World! programs required more instructions than others.
Punctuation: Some programs used lots of curly brackets and semicolons.
Wording: One program used the word cout where the other programs used System.out.
println and print.
Complexity: Some programs seemed easier to interpret than others.

A lot of backstory is bundled into the Hello World! program that can be applied to learning a programming
language. Let’s unbundle this famous program to discover the basics about your programming language.

Programming Language Basics (2.1.2, 2.1.3)

A programming language is a notation for specifying the steps in an algorithm that are supposed to be per-
formed by a digital device. Programming languages such as C11, Java, and Python are classified as high-level
programming languages because they provide a way for you as a programmer to compose human-readable
instructions that direct the operations performed by a computing device.
How does your programming language stack up to other popular languages and where does it shine? Check
out the list in Figure 2-2.
Using a high-level programming language, you can specify a set of instructions that correspond to the steps
in an algorithm. Each instruction is referred to as a statement. The set of statements you generate using a pro-
gramming language is called program code, or simply code. Your code can become a computer program, which
can be distributed as computer software, desktop applications, web apps, and mobile apps.

Logo Programming Where It Shines

Language

Consumer-facing web development, server-side web

JavaScript
development

Server-side web development, scripting, machine learning,

Python
data science, desktop applications, robotics

Server-side web development, desktop applications, mobile

Java
development, Internet of Things

Systems programming, embedded applications, Internet of

C
Things

Systems programming, game development, desktop

C++
applications embedded applications, robotics

PHP Server-side web development

Swift Desktop and mobile applications for Apple devices

Desktop applications, game development, virtual reality,

C#
mobile development

Ruby Server-side web development

Server-side web development, systems programming,

Go
Internet of Things

Figure 2-2 Popular programming languages

Syntax and Semantics (2.1.4)

When learning a programming language, where do you start? Programming languages have two key elements:
semantics and syntax.
Semantics refers to the meaning and validity of program statements. In a natural language, such as English,
it is perfectly fine to say, “Let’s start the game” or “Let’s start the car,” but “Let’s start the pen” doesn’t make any
sense. It is not semantically valid.
Programming languages include keywords, such as print and cout. These words are a subset of a program-
ming language’s reserved words, which are reserved for special purposes. You cannot use reserved words when
you create names for variables, functions, or classes in your programs.
One aspect of learning a programming language is to become familiar with its keywords and their use. When
learning C11, for example, you’ll need to remember that cout sends output to a display device. But if you’re
learning Java, the keyword is System.out.println. In Python the keyword is print. Figure 2-3 lists keywords
that are common to many programming languages.

Keyword Purpose
int Define a value as an integer.
float Define a value as a floating-point number.
char Define something as a letter, numeral, punctuation mark, or symbol.
class Define the characteristics of a person, place, or thing.
new Create an object based on the characteristics of a class.
if Execute program statements when a condition is true.
then
else
case Specify several alternative conditions or decisions.
switch
for Begin a section of code that repeats one or more times.
while
do
return Bring a value back from a function.
import Incorporate a prewritten code module in a program.
try Catch errors and handle them gracefully.

Figure 2-3 Keywords common to programming languages

Q Suppose you want to code a program to output “Hello World!” 10 times. What keyword could
you use?

A Figure 2-3 lists the for, while, and do keywords for specifying code that repeats one or
more times.

You’ll acquire a vocabulary of keywords for your programming language gradually. Language references
provide a list of keywords and examples of their use. You can find language references online. In fact, it is often
helpful to create or find a “cheat sheet” of keywords to keep beside your computer as you learn a new language.
The syntax of a programming language is equivalent to the grammar rules of a written language, such as
English or Cyrillic. Syntax defines the order of words and the punctuation you are required to use when compos-
ing statements.
Various programming languages use different punctuation syntax. One of the early steps in learning a
programming language is to get a handle on its syntax.
Remember the different use of punctuation in the C11, Java, and Python Hello World! programs? Take a closer
look in Figure 2-4 and notice how punctuation helps to separate and structure the statements in a C11 program.

C++ Program
Statements end with a
#include <iostream>
semicolon.
using namespace std;
int main()
{
Curly braces for (int i = 1; i <= 10, i++)
separate blocks of {
statements. These cout << "Hello World!" << endl;
braces set off the cout << "Hola Mundo!" << endl;
statements in the }
return 0; Statements between
main() function.
} braces are indented.

Figure 2-4 C++ syntax style

Like C11, Java also uses lots of punctuation. Figure 2-5 points out how the commonly used style for placing
curly braces in Java is slightly different from C11. However, either style works equally well as long as the braces
are paired. The key is consistency in the project you are working on.

Curly braces separate

blocks of statements.
Java Program Notice how the opening
class HelloWorld { brace is at the end of
public static void main(String[ ] args) { the line. This is an
System.out.println("Hello World!"); alternative style for the
System.out.println("Hola Mundo!"); placement of braces.
}
}
Statements end with a
semicolon.
Statements in a block
are indented.

Figure 2-5 Java syntax style

Python uses quite a different approach to punctuation. See if you can spot the differences in Figure 2-6.

Python Program
The colon indicates
for count in range(0, 10): the beginning of a
print("Hello World!") block of statements.
print("Hola Mundo!") Python does not use
Statements
braces.
in a block
are indented.
Pressing Enter or
Return marks the end
of a statement.

Figure 2-6 Python syntax style

In C11 and Java, statements are enclosed in a structure of curly braces and each statement ends with a semi-
colon. In contrast, Python uses indents to structure statements, and the linefeed that is generated when you press
the Enter key marks the end of a statement. Remember the punctuation style for the language that you are using.

Core Elements (2.1.5)

Although programming languages have differing syntax and semantics, they have common elements. If you look
for the ways that your programming language implements the elements in the following list, you will be well on
your way through the initial learning curve.
Variables that can be assigned values and structures
Arithmetic operators that can be used to perform calculations
Keywords that perform operations such as print or append
Data types that define values and text
Branching controls that change the sequence in which statements are executed
Repetition controls that repeat a series of statements
Syntax rules for constructing valid statements
Terminology for describing the components of a language and their functions

Your Toolbox (2.1.6, 2.1.7)

Before you can write your Hello World! program, you need access to tools for coding instructions and executing
them on a digital device. These tools are sometimes referred to as software development platforms, programming
platforms, or development environments.

Programming tools are available as system utility software that can be installed on your computer. Another
option is to use an online programming app.
Your programming toolbox includes the following essentials:
Coding tools provide a way for you to codify an algorithm.
Build tools transform your code into a binary format that a computer can execute.
Debugging tools help you test programs and track down errors.
You can acquire these programming tools as individual components, or you can look for a comprehensive
development environment. Let’s explore these tools in more detail to find out how they can help you develop
brilliant programs.

2.2 CODING TOOLS

Program Editors (2.2.1, 2.2.2, 2.2.3)
Coding tools provide you with a way to express an algorithm using the vocabulary of a programming language.
Just how much of the code you have to manually type depends on your development platform. Here are the
options:
Visual platform: You might have the option of arranging visual elements that represent various
statements, as shown in Figure 2-7.

This column contains

your program. It consists
of visual components,
each representing a
statement.

You can drag Here is the statement

Source: scratch.mit.edu

components from the left that displays “Hello

column into your World!”
program. After dragging,
you can customize the
component, like changing
“Hello!” to “Hello World!”

Figure 2-7 Visual programming

Word processor: Despite the attraction of visual programming tools, you will likely end up typing
some if not all of the statements for your programs. For that task, you could use a word processor, but
it embeds all kinds of codes for formatting and font effects which can’t be included in your high-level
code.

Text editor: A text editor such as Windows Notepad can produce plain ASCII text, but offers no
features designed to help programmers. Using a generic text editor is a bare-bones approach. There
are much better coding tools.
Code editor: A code editor is a type of text editor specially designed for entering high-level
programming code. It can help you correctly use punctuation and indents, as well as remember
variable names and ensure that you use valid keywords. Some handy features of code editors are
highlighted in Figure 2-8.

Color coding helps you

recognize keywords,
directives, and
punctuation.

Punctuation monitoring
ensures that the braces
are paired. Autocomplete displays a
list of keywords as you
begin to type.

Source: Visual Studio

Figure 2-8 Visual Studio code editor

When using a code editor, you can simply type your commands. As you type, pay attention to color coding,
autocomplete, and other helpful cues that the editor offers.

Basic Structure (2.2.4)

A programming language has structural and syntax conventions for writing code. When you become familiar with
these conventions, they will be the underlying foundation for most of the programs you create. Browse through
the following list before you try to identify the conventions in the next figure.
Comments: A comment provides an explanation of your code. At the beginning of a program, you can rou-
tinely include a comment with the program title and your name. Comments can be included anywhere in your
code to annotate aspects of the program that might not be clear to other programmers who test or modify your
code. Computers ignore comments as they are intended for documentation only.
Directives: A directive tells the computer how to handle the program rather than how to perform an algo-
rithm. For example, a directive might specify the name of an external file that is supposed to be incorporated
with the rest of your program code. Directives may begin with keywords such as #include, import, or using.
main() function: Many programming languages use main() to denote the entry point for program execution.
The line of code following main() corresponds to the first step in the algorithm you designed for a problem or
task.

Statements: Just as human-readable text is divided into sentences and paragraphs, your code should be
divided into statements and blocks. A program statement is similar to a sentence; it contains one instruction. In
languages such as C11 and Java, statements end with a semicolon. In Python, you end a statement by pressing
the Enter or Return key.
Code blocks: A code block is similar to a paragraph; it contains multiple statements that have a specific
purpose. In C++ and Java, you use braces (also known as curly brackets) to enclose code blocks. In Python, code
blocks are indented.

Q Take a look at Figure 2-9 and see if you can identify comments, directives, the main()
function, statements, and code blocks.

//Hello World! in English and Spanish

#include <iostream>
using namespace std;
int main()
{
for (int i = 1; i <= 10, i++)
{
cout << "Hello World!" << endl;
cout << "Hola Mundo!" << endl;
}
return 0;
}

Figure 2-9 Find the structural and syntax

conventions in this code

A The comment is //Hello World! in English and Spanish.

There are two directives: #include <iostream> and using namespace std.
The main() function is labeled int main().
Every line of the program is a statement.
The for..return statement is one block. The two cout statements form a block within the
for..return block.

2.3 BUILD TOOLS

The Toolset (2.3.1)
The high-level code that you produce using an editor cannot be directly executed by a computer’s micropro-
cessor. Microprocessors have a machine language instruction set based on binary codes. There is no print
instruction in the microprocessor’s instruction set, for example.

Before a program can run, your code has to be converted into machine code consisting of machine language
instructions. This executable code is stored in an executable file that can be run, processed, and executed by
the microprocessor. Build tools convert your code into a program that a computer can execute.
As a programmer, you’ll eventually want to package your programs and distribute them so that they can be
installed on a digital device and run with a click, just like the Hola Mundo! program in Figure 2-10.

Hola Mundo!

Source: Microsoft Corporation

program

Figure 2-10 Hola Mundo! installed on a Windows computer

A little background about build tools can help you understand some of the weird statements, such as
#include<iostream>, that you have to include in programs. Also, a passing knowledge of build tools such as
compilers, preprocessors, linkers, virtual machines, and interpreters will help you hold your own at late-night
parties in Silicon Valley.

Compilers (2.3.2, 2.3.3)

A compiler translates code written in one programming language into another language. The original code is
called source code, and the code a compiler produces is called object code. Object code is stored in a standalone
file that is separate from the file that holds your source code. See Figure 2-11.

Your source code Object code

Hello.cpp Hello.o

#include <iostream> 00010010 10100010

using namespace std; 10100101 11110000
int main() 01010100 10101010
Compiler conversion
{ 00101010 11010101
cout << "Hello World!"; 10101010 10001010
return 0; 10101010 10101011
} 00010101 10101011
00000001 10101010
10001010 10101010

Figure 2-11 When the compiler creates machine code, the resulting file is
executable

Q If a compiler is converting C11 code into machine code, what is the source code and what is
the object code?

A The C11 code is the source code. The machine code is the object code.

Preprocessors and Linkers (2.3.4, 2.3.5)

The journey from source code to an executable program doesn’t usually happen in one magical step. Your source
code may be analyzed by a preprocessor and combined with other code by a linker.
A preprocessor is a software utility that performs housekeeping tasks before the compiler gets to work.
Experienced programmers can creatively use preprocessors to make source programs easy to compile for vari-
ous software platforms.
For languages such as C11, even basic programs require preprocessing and preprocessor directives such
as #include<iostream> to be routinely included in the program code. After these directives are carried out
by the preprocessor, they can be ignored by the compiler.
A linker is a software utility that converts one or more object files into a binary executable file. Linking takes
place after compiling. Your source code is the main object file for linking, but you can specify additional object
files that you’ve created or that are available from third parties. When you see the keyword import, it is a clue
that an external file needs to be linked in.
Figure 2-12 can help you visualize the build process when a preprocessor and linker are involved.
Preprocessing and linking are not consistent for all programming languages. Your takeaways are:

• Several steps are required to convert your code into a file containing an executable program.
• You may have to include preprocessor directives in your code.

The preprocessor executes

directives, such as
#include<iostream>

Hola.cpp

The compiler
converts the source
code to object code
Your source
code
Hola.cpp

The linker combines

modules and generates
machine code
Source code
plus iostream
Hola.o

Hola.exe

Figure 2-12 Preprocessing, compiling, and linking the Hola Mundo! program

Virtual Machines (2.3.6)

The product of a compiler is not necessarily machine code. Some compilers convert source code into semi-
compiled code called bytecode. Software called a virtual machine converts the bytecode into machine code
as the program executes.
What’s the point of a virtual machine? The Java Virtual Machine (JVM) offers some insight. The backstory is
that an executable file designed to run on a computer with the Microsoft Windows operating system won’t work
on a computer running macOS. You could develop one version of a program for Microsoft Windows and one for
macOS. Or, you can use the Java programming language to create one version of the program and compile it to
bytecode.
You can distribute the same bytecode to Windows and Mac users. Windows users have the Windows version
of the JVM. Mac users have another version. The virtual machine software converts the bytecode into code that
works on the host platform. Figure 2-13 can help you understand how the JVM works and the value of bytecode.

Sunday, 11.—Snow on the ground. Thaw commenced in the afternoon. I

was at home.

Monday, 12.—I sat in the city council, and recommended the repeal of the
ordinances entitled "An extra ordinance for the extra case of Joseph Smith,"
"An ordinance to prevent unlawful search or seizure of persons or property,
by foreign[1] process, in the city of Nauvoo," and "An ordinance regulating
the currency;" and they were repealed accordingly. The Memorial to
Congress, passed December 21, 1843, was again read, and signed by the
councilors, aldermen, mayor, recorder, and marshal.

I instructed Councilor Orson Pratt to call all the Illinois representatives

together, and tell them our sufferings have been such that we must have that
document passed, and we will have it.

"You must go in for it. Go to John Quincy Adams and ask him to call the
delegates from Massachusetts separate from the Illinois delegation, and
demand the same. Go to Henry Clay and other prominent men. Call public
meetings in the city of Washington. Take the saloon, publish the admittance
so much per ticket, invite the members of both houses to come and hear
you, and roar upon them. You may take all my writings you think anything
of and read to them, &c., and you shall prosper in the name of God. Amen."

The recorder presented the report of the attendance of the city council, from
which it appears that I have sat with them eleven sessions, from the 14th of
October, 1843, to the 16th of January, 1844, inclusive.

Councilor Orson Pratt nominated George P. Stiles as councilor during his

absence, which was confirmed by the council.

I burned $81 of city scrip according to ordinance.

Thawing. Streets very dirty.

Tuesday, 13.—I was at home. Settled with Theodore Turley, and gave him
the deed of a lot.

Having received an invitation from Brother Joseph L. Heywood to visit

Quincy, I wrote him in reply:—

Letter:—Joseph Smith to Joseph L. Heywood—Anent a visit to Quincy.

NAUVOO, February 13, 1844.

DEAR BROTHER HEYWOOD,—I sit down at this time to

acknowledge the receipt of, and reciprocate the friendly feelings
manifest in yours of the 7th instant; and, although surrounded by a
press of business, shall take pleasure in spending a few moments to
reply.

I would take the greatest pleasure imaginable in coming down to

Quincy on a visit to see you and all my friends in your city, would
business and circumstances permit; but it would be a matter of
impossibility almost for me to leave home at the present time, in
consequence of a multitude of business which I have daily to attend to.
Moreover, wisdom and prudence seem to forbid my coming, on
account of the bitter feeling which manifests itself in various places
between this and Quincy,—not that I have any apprehensions for my
personal safety; for the same kind hand which hath hitherto been my
shield and support would save me from the power of my wicked
persecutors; but something might grow out of it which would prompt
my adversaries to get out another illegal writ, and would eventually,
probably, cost me some three or four thousand dollars, as in other
cases, and under which I have still to labor to disadvantage. Under
these considerations, therefore, I am compelled to decline paying you a
visit for the present. At the same time, in connection with Mrs. Smith, I
tender my warmest acknowledgement for the invitation.

I am pleased to hear of the prosperity of your branch, and hope it will

continue; for, although I never feel to force my doctrine upon any
person; I rejoice to see prejudice give way to truth, and the traditions
of men dispersed by the pure principles of the Gospel of Jesus Christ.
I should be please to have the privilege of forming an acquaintance
with your partner, Mr. Kimball, and his lady; and should they ever
come up this way, I hope they will call and see me.

As respects things in Nauvoo, I have nothing to say but good.

Although the mobocrats of this county breathe out their shame with a
continual foam, and threaten extermination, &c., the citizens of
Nauvoo are at peace; they fear no danger, for the report of mobs has
become so common, that the "Mormons" pay no attention to it
whatever. Each man minds his own business, and all are making
improvements as fast as they can. In fact, things in general seem
prosperous and pleasing; and I never saw a better feeling amongst the
Saints than at the present time.

My family have been somewhat sick of late, and continue so,

especially my youngest boy.

Accept, dear sir, the warmest respects of myself and Mrs. Smith, and
please present the same to your lady. In the meantime I remain your
friend and brother,

JOSEPH SMITH.

President Brigham Young returned from Bear creek settlements, where he

had been preaching for the last few days.

Wednesday, 14.—At home through the day. In the evening the assembly
room was filled by the brethren, when my "Views of the Powers and Policy
of the Government of the United States" was again read. I afterwards spoke
on the same subject at a considerable length.

Thursday, 15.—At home. A beautiful day.

I insert the following article from the Times and Seasons:—

WHO SHALL BE OUR NEXT PRESIDENT?

This is an inquiry which to us as a people is a matter of the most
paramount importance, and requires our most serious, calm, and
dispassionate reflection. Executive power, when correctly wielded, is a
great blessing to the people of this great commonwealth, and forms
one of the firmest pillars of our confederation. It watches the interests
of the whole community with a fatherly care; it wisely balances the
other legislative powers when over-heated by party spirit or sectional
feeling; it watches with jealous care our interests and commerce with
foreign nations, and gives tone and efficacy to legislative enactments.

The President stands at the head of these United States, and is the
mouth-piece of this vast republic. If he be a man of an enlightened
mind and a capacious soul,—if he be a virtuous man, a statesman, a
patriot, and a man of unflinching integrity,—if he possess the same
spirit that fired the souls of our venerable sires, who founded this great
commonwealth, and wishes to promote the good of the whole republic,
he may indeed be made a blessing to the community.

But if he prostrates his high and honorable calling to base and

unworthy purposes,—if he make use of the power which the people
have placed in his hands for their interests to gratify his ambition, for
the purpose of self-aggrandizement or pecuniary interest,—if he
meanly pander with demagogues, loses sight of the interest of the
nation, and sacrifice the Union on the altar of sectional interests or
party views, he renders himself unworthy of the dignified trust reposed
in him, debases the nation in the eyes of the civilized world, and
produces misery and confusion at home. "When the wicked rule, the
people mourn."

There is perhaps no body of people in the United States who are at the
present time more interested about the issue of the presidential contest
than are the Latter-day Saints. And our situation in regard to the two
great political parties is a most novel one. It is a fact well understood
that we have suffered great injustice from the State of Missouri, that
we have petitioned to the authorities of that state for redress in vain,
that we have also memorialized Congress under the late
administration, and have obtained the heartless reply that "Congress
has no power to redress your grievances."

After having taken all the legal and constitutional steps that we can, we
are still groaning under accumulated wrongs. Is there no power
anywhere to redress our grievances? Missouri lacks the disposition and
Congress lacks both the disposition and power (?); and thus fifteen
thousand inhabitants of these United States can with impunity be
dispossessed of their property; have their houses burned, their property
confiscated, many of their numbers murdered, and the remainder
driven from their homes and left to wander as exiles in this boasted
land of freedom and equal rights; and after appealing again and again
to the legally-constituted authorities of our land for redress, we are
coolly told by our highest tribunals, "We can do nothing for you."

We have paid hundreds of thousands of dollars into the coffers of

Congress for their lands, and they stand virtually pledged to defend us
in our rights, but they have not done it. If a man steals a dollar from his
neighbor, or steals a horse or a hog, he [the neighbor] can obtain
redress; but we have been robbed by wholesale, the most daring
murders have been committed, and we are coolly told that we can
obtain no redress. If a steamboat is set on fire on our coast by
foreigners, even when she is engaged in aiding and abetting the
enemies of that power, it becomes a matter of national interference and
legislation; or if a foreigner, as in the case of McLeod, is taken on our
land and tried for supposed crimes committed by him against our
citizens, his nation interferes, and it becomes a matter of negotiation
and legislation. But our authorities can calmly look on and see the
citizens of a county butchered with impunity: they can see two
counties dispossessed of their inhabitants, their houses burned, and
their property confiscated; and when the cries of fifteen thousand men
women and children salute their ears, they deliberately tell us that we
can obtain no redress.

Hear it, therefore, ye mobbers! Proclaim it to all the scoundrels in the

Union! Let a standard be erected around which shall rally all the
renegades of the land: assemble yourselves and rob at pleasure; murder
till you are satiated with blood; drive men, women and children from
their homes: there is no law to protect them, and Congress has no
power to redress their grievances; and the great father of the Union
(the President) has not got an ear to listen to their complaints.

What shall we do under this state of things? In the event of either of

the prominent candidates, Van Buren or Clay, obtaining the
presidential chair, we should not be placed in any better situation.

In speaking of Mr. Clay, his politics are diametrically opposed to ours.

He inclines strongly to the old school of Federalists, and as a matter of
course would not favor our cause, neither could we conscientiously
vote for him. And we have yet stronger objections to Mr. Van Buren on
other grounds. He has sung the old song of Congress—"Congress has
no power to redress your grievances."

But did the matter rest here, it would not be so bad. He was in the
presidential chair at the time of our former difficulties. We appealed to
him on that occasion, but we appealed in vain, and his sentiments are
yet unchanged.

But all these things are tolerable in comparison to what we have yet to
state. We have been informed from a respectable source that there is an
understanding between Mr. Benton, of Missouri, and Mr. Van Buren,
and a conditional compact entered into, that if Mr. Benton will use his
influence to get Mr. Van Buren elected, Van Buren when elected, shall
use his executive influence to wipe away the stain from Missouri by a
further persecution of the "Mormons," and wreaking out vengeance on
their heads, either by extermination or by some other summary
process. We could scarcely credit the statement; and we hope yet, for
the sake of humanity, that the suggestion is false: but we have too good
reason to believe that we are correctly informed.

If, then, this is the case, can we conscientiously vote for a man of this
description, and put the weapons into his hands to cut our throat with?
We cannot. And however much we might wish to sustain the
Democratic nomination, we cannot—we will not vote for Van Buren.
Our interests, our property, our lives, and the lives of our families are
too dear to us to be sacrificed at the shrine of party spirit and to gratify
party feelings. We have been sold once in the State of Missouri, and
our liberties bartered away by political demagogues, through executive
intrigue, and we wish not to be betrayed again by Benton and Van
Buren.

Under these circumstances, the question again arises, Whom shall we

support? GENERAL JOSEPH SMITH—a man of sterling worth and
integrity and of enlarged views—a man who has raised himself from
the humblest walks in life to stand at the head of a large, intelligent,
respectable, and increasing society, that has spread not only in this
land, but in distant nations,—a man whose talents and genius are of an
exalted nature, and whose experience has rendered him in every way
adequate to the onerous duty. Honorable, fearless, and energetic, he
would administer justice with an impartial hand, and magnify and
dignify the office of Chief Magistrate of this land; and we feel assured
that there is not a man in the United States more competent for the
task.

One great reason that we have for pursuing our present course is, that
at every election we have been made a political target for the filthy
demagogues in the country to shoot their loathsome arrows at. And
every story has been put into requisition to blast our fame from the old
fabrication of "walk on the water" down to "the murder of ex-
Governor Boggs." The journals have teemed with this filthy trash, and
even men who ought to have more respect for themselves—men
contending for the gubernatorial chair have made use of terms so
degrading, so mean, so humiliating, that a Billingsgate fisherwoman
would have considered herself disgraced with. We refuse any longer to
be thus bedaubed for either party. We tell all such to let their filth flow
in its own legitimate channel, for we are sick of the loathsome smell.

Gentlemen, we are not going either to "murder ex-Governor Boggs,

nor a Mormon in this state for not giving us his money," nor are we
going to "walk on the water," "nor drown a woman," nor "defraud the
poor of their property," nor send "destroying angels after General
Bennett to kill him," nor "marry spiritual wives," nor commit any other
outrageous act this election to help any party with. You must get some
other persons to perform these kind offices for you for the future. We
withdraw.

Under existing circumstances, we have no other alternative; and if we

can accomplish our object, well: if not, we shall have the satisfaction
of knowing that we have acted conscientiously, and have used our best
judgment. And if we have to throw away our votes, we had better do
so upon a worthy rather than upon an unworthy individual, who might
make use of the weapon we put in his hand to destroy us with.

Whatever may be the opinions of men in general in regard to Mr.

Smith, we know that he needs only to be known to be admired; and
that it is the principles of honor, integrity, patriotism, and philanthropy
that have elevated him in the minds of his friends; and the same
principles, if seen and known, would beget the esteem and confidence
of all the patriotic and virtuous throughout the Union.

Whatever, therefore, be the opinions of other men, our course is

marked out, and our motto henceforth will be—General Joseph Smith.

Friday, 16.—At home. This evening I spent two hours in the office. Settled
with Brother Whitney; gave him deed of several town lots, and took his
receipt in full.

Saturday, 17.—I wrote the following article:—

PACIFIC INUENDO.

The very candid, pacific, and highly creditable advice which Governor
Ford has done himself the honor to address to "the citizens of Hancock
county, Mormons and all," and which appears in the Warsaw Signal of
the 14th instant, is like the balm of Gilead, well calculated to ease the
pain which has troubled the heads and hearts of the Carthaginians,
Warsawvians, and other over-jealous bodies for weal and woe.

It certainly must be admitted, on all hands, that Governor Ford has

exalted himself as a mediator, patriot, lawyer, governor, peacemaker,
and friend of all, not only to magnify the law and make it honorable,
but also in pointing out the part of peace.

Such is what the Latter-day Saints have ever sought at the hands of
those in authority; and with an approving conscience clear as the
crystal spring, and with a laudable intention warm as the summer
zephyr, and with a charitable prayer mellow as the morning dew, it is
now our highest consolation to hope that all difficulties will cease, and
give way to reason, sense, peace, and goodwill.

The Saints, if they will be humble and wise, can now practice what
they preach, and soften by good examples, rather than harden by a
distant course of conduct, the hearts of the people.

For general information, it may be well to say that there has never
been any cause for alarm as to the Latter-day Saints. The legislature of
Illinois granted a liberal charter for the City of Nauvoo; and let every
honest man in the Union who has any knowledge of her say whether
she has not flourished beyond the most sanguine anticipations of all.
And while they witness her growing glory, let them solemnly testify
whether Nauvoo has willfully injured the country, county, or a single
individual one cent.

With the strictest scrutiny publish the facts, whether a particle of law
has been evaded or broken: virtue and innocence need no artificial
covering. Political views and party distinctions never should disturb
the harmony of society; and when the whole truth comes before a
virtuous people, we are willing to abide the issue.

We will here refer to the three last dismissals upon writs of habeas
corpus, of Joseph Smith, when arrested under the requisitions of
Missouri.

The first, in June, 1841, was tried at Monmouth, before Judge

Douglas, of the fifth judicial circuit: and as no exceptions have been
taken to that decision by the state of Missouri—but Missouri
previously entered a nolle prosequi on all the old indictments against
the Mormons in the difficulties of 1838—it is taken and granted that
decision was just!

The second, in December, 1842, was tried at Springfield before Judge

Pope in the U. S. District Court; and from that honorable discharge, as
no exceptions from any source have been made to those proceedings, it
follows as a matter of course that that decision was just!

And the third, in July, 1843, was tried at the city of Nauvoo, before the
Municipal Court of said city; and as no exceptions to that discharge
have been taken, and as the governor says there is "evidence on the
other side to show that the sheriff of Lee county voluntarily carried Mr.
Reynolds (who had Mr. Smith in custody,) to the city of Nauvoo
without any coercion on the part of any one," it must be admitted that
that decision was just!

But is any man unconvinced of the justness of these strictures relative

to the two last cases, let the astounding fact go forth, that Orrin Porter
Rockwell, whom Boggs swore was the principal in his [attempted]
assassination, and as accessory to which Mr. Smith was arrested, has
returned home, "clear of sin." In fact, there was not a witness to get up
an indictment against him.

The Messrs. Averys, who were unlawfully transported out of this state,
have returned to their families in peace; and there seems to be no
ground for contention, no cause for jealousy, and no excuse for a
surmise that any man, woman, or child will suffer the least
inconvenience from General Smith, the charter of Nauvoo, the city of
Nauvoo, or even any of her citizens.

There is nothing for a bone of contention! Even those ordinances

which appeared to excite the feeling of some people have recently
been repealed; so that if the "intelligent" inhabitants of Hancock
county want peace, want to abide by the Governor's advice, want to
have a character at home, and really mean to follow the Savior's
golden rule, "To do unto others as they would wish others to do unto
them," they will be still now, and let their own works praise them in
the gates of justice and in the eyes of the surrounding world. Wise men
ought to have understanding enough to conquer men with kindness.

"A soft answer turneth away wrath," says the wise man; and it will be
greatly to the credit of the Latter-day Saints to show the love of God,
by now kindly treating those who may have, in an unconscious
moment, done wrong; for truly said Jesus, Pray for thine enemies.

Humanity towards all, reason and refinement to enforce virtue, and

good for evil are so eminently designed to cure more disorders of
society than an appeal to arms, or even argument untempered with
friendship, and the one thing needful that no vision for the future,
guide-board for the distant, or expositor for the present, need trouble
any one with what he ought to do.

His own good, his family's good, his neighbor's good, his country's
good, and all good seem to whisper to every person—The governor
has told you what to do. Now do it.

The constitution expects every man to do his duty; and when he fails
the law urges him; or should he do too much, the same master rebukes
him.

Should reason, liberty, law, light, and philanthropy now guide the
destinies of Hancock county with as much sincerity as has been
manifested for her notoriety or welfare, there can be no doubt that
peace, prosperity, and happiness will prevail, and that future
generations as well as the present one will call Governor Ford a
peacemaker. The Latter-day Saints will, at all events, and profit by the
instruction, and call upon honest men to help them cherish all the love,
all the friendship, all the courtesy, all the kindly feelings, and all the
generosity that ought to characterize clever people in a clever
neighborhood, and leave candid men to judge which tree exhibits the
best fruit—the one with the most clubs and sticks thrown into its
boughs and the grass trodden down under it, or the one with no sticks
in it, some dead limbs, and rank grass growing under it; for by their
signs ye can know their fruit, and by the fruit ye know the trees.
Our motto, then, is Peace with all! If we have joy in the love of God,
let us try to give a reason of that joy, which all the world cannot
gainsay or resist. And may be, like as when Paul started with
recommendations to Damascus to persecute the Saints, some one who
has raised his hand against us with letters to men in high places may
see a light at noonday, above the brightness of the sun, and hear the
voice of Jesus saying, "It is hard for thee to kick against the pricks."

Intelligence is sometimes the messenger of safety. And, willing to aid

the governor in his laudable endeavors to cultivate peace and honor the
laws, believing that very few of the citizens of Hancock county will be
found in the negative of such a goodly course, and considering his
views a kind of manifesto, or olive leaf, which shows that there is rest
for the soles of the Saints' feet we give it a place in the Neighbor,
wishing it God speed, and saying, God bless good men and good
measures! And as Nauvoo has been, so it will continue to be, a good
city, affording a good market to a good country; and let those who do
not mean to try the way of transgressors, say "Amen."

The High Council met and settled several cases of difficulty betwixt
brethren.

The Anti-Mormons held a convention at Carthage, the object

being to devise ways and means of expelling the Saints from Anti-Mormon
the State. Among other resolutions was one appointing the 9th Convention at
Carthage.
of March next as the day of fasting and prayer, wherein the
pious of all orders are requested to pray to Almighty God that
He would speedily bring the false Prophet Joseph Smith to deep repentance,
or that He will make a public example of him and his leading accomplices.

The ice broke up in the river.

Sunday, 18.—Beautiful day. Southwest wind.

A very large assembly of the Saints met at the stand, near the Temple, when
I preached a lengthy discourse.
Four p.m., went to my office with Hyrum and two gentlemen from St.
Louis. Heard Dr. Richards read my correspondence with Senator Calhoun,
and Phelps read my "Views of the Power and Policy of the General
Government."

At seven, attended prayer-meeting in the assembly room.

Monday, 19.—At nine a.m. went to my office with Dr. Bernhisel, who
proposed some alterations in my views of the government. Phelps read the
same, and the doctor seemed better pleased with it than before.

To the Editor of the Neighbor:—

SIR,—I wish to say to you, as there seems to be a prospect of peace,

that it will be more love-like, more God-like, and man-like, to say
nothing about the Warsaw Signal.

If the editor breathes out that old sulphurous blast, let him go and
besmear his reputation and the reputation of those that uphold him
with soot and dirt, but as for us and all honest men, we will act well
our part, for there the honor lies.

We will honor the advice of Governor Ford, cultivate peace and

friendship with all, mind our own business, and come off with flying
colors, respected, because, in respecting others, we respect ourselves.

Respectfully, I am

JOSEPH SMITH.

A conference was held in Halifax, Halifax county, Nova Scotia, Elder

Robert Dickson, president. Two branches were represented, consisting of
thirty members, three elders, one priest, one teacher, and two deacons.

The wild geese commenced flying north.

Tuesday, 20.—At ten a.m. went to my office, where the

Twelve Apostles and some others met in council with Delegation
Brothers Mitchell Curtis and Stephen Curtis who left the from Lyman
pinery on Black River, 1st January. They were sent by Lyman Wight on
Wight and Bishop Miller to know whether Lyman should Indian Affairs.
preach to the Indians, the Menominees and Chippeways
having requested it.

The Chippeways had given Brother Wight some wampum as a token of

peace, and the brethren had given them half a barrel of flour and an ox to
keep the Indians from starving, and Wight had gone through to Green Bay
with them to make a road.

I told them to tell Brother Wight I had no counsel to give him on the
subject. He is there on his own ground and must act on his own
responsibility, and do what he thinks best in relation to the Indians,
understanding the laws and nature of the subject as well as I can here, and
he shall never be brought into difficulty about it by us.

I instructed the Twelve Apostles to send out a delegation and

investigate the locations of California and Oregon, and hunt Western
out a good location, where we can remove to after the temple Movement for
the Church
is completed, and where we can build a city in a day, and have
Contemplated
a government of our own, get up into the mountains, where
the devil cannot dig us out, and live in a healthful climate,
where we can live as old as we have a mind to.

Warm. The ice floating down the river.

A meeting of the citizens of Hancock county was held at the

court-house in Carthage. Passed a resolution that the second A Wolf Hunt
Saturday of March be appointed for a general wolf-hunt, Called for
Hancock Co.
being the same day selected by the convention of the 17th
instant for a day of fasting and prayer for my destruction.

Wednesday 21.—The Rev. Mr. De Wolfe, Episcopalian,

lectured in the assembly room in the evening. I attended and, The Prophet on
after the sermon, at his request, spoke to the people, showing the Necessity
them that to get salvation we must not only do some things, of Complete
Obedience to
but everything which God has commanded. Men may preach God.
and practice everything except those things which God
commands us to do, and will be damned at last. We may tithe mint and rue,
and all manner of herbs, and still not obey the commandments of God. The
object with me is to obey and teach others to obey God in just what He tells
us to do. It mattereth not whether the principle is popular or unpopular, I
will always maintain a true principle, even if I stand alone in it.

My Pacific Inuendo, written on the 17th instant, appeared in the Neighbor

of to-day, in connection with Governor Ford's letter of the 29th of January.

Ice left the west bank of the river, opposite the lower brick house.

Very warm and pleasant.

Council of the Twelve met in my office. I insert the minutes:—

Minutes of a Council Meeting of the Twelve.

At a meeting of the Twelve, at the mayor's office, Nauvoo, February

21, 1844, seven o'clock, p.m., Brigham Young, Parley P. Pratt, Orson
Pratt, Wilford Woodruff, John Taylor, George A. Smith, Willard
Richards and four others being present, called by previous notice, by
instruction of President Joseph Smith on the 20th instant, for the
purpose of selecting a company to explore Oregon and California, and
select a site for a new city for the Saints.

Jonathan Dunham, Phineas H. Young, David D. Yearsley, and David

Fullmer, volunteered to go; and Alphonzo Young, James Emmett,
George D. Watt, and Daniel Spencer were requested to go.

Voted the above persons to be notified to meet with the council on

Friday evening next, at the assembly room,

WILLARD RICHARDS, Clerk.

Thursday, 22.—At home.

Ice continues to run in the river. Very pleasant, cool nights.

Friday, 23.—W. W. Phelps received a letter from John Whitmer in relation
to certain records, and a book containing some of the early history of the
Church which had been written by my clerks, and was Church property, and
which had been fraudulently detained from my possession by John
Whitmer; to which Dr. Richards replied.

Met with the Twelve in the assembly room concerning the

Oregon and California Exploring Expedition; Hyrum and The Western
Sidney present. I told them I wanted an exploration of all that Exploring
Equipment.
mountain country. Perhaps it would be best to go direct to
Santa Fe. "Send twenty-five men: let them preach the Gospel
wherever they go. Let that man go that can raise $500, a good horse and
mule, a double barrel gun, one-barrel rifle, and the other smooth bore, a
saddle and bridle, a pair of revolving pistols, bowie-knife, and a good sabre.
Appoint a leader, and let them beat up for volunteers. I want every man that
goes to be a king and a priest. When he gets on the mountains he may want
to talk with his God; when with the savage nations have power to govern,
&c. If we don't get volunteers, wait till after the election."

George D. Watt said, "Gentlemen, I shall go." Samuel Bent, Joseph A.

Kelting, David Fullmer, James Emmett, Daniel Spencer, Samuel Rolfe,
Daniel Avery, and Samuel W. Richards, volunteered to go.

Saturday, 24.—At home. Had an interview with Brother Phelps at nine

o'clock.

Seth Palmer, Amos Fielding, Charles Shumway, and John S. Fullmer

volunteered to go to Oregon and California.

Fifteen hundred copies of my "Views" out of press.

Very pleasant the past two weeks; the pleasantest February I ever saw.

President Brigham Young went to Knowlton's settlement on Bear creek, and

preached.

Sunday, 25.—I preached at the temple block. Hyrum also preached.

Evening, I attended prayer-meeting in the assembly room, We
prayed that "General Joseph Smith's Views of the Powers and A Prophecy of
Policy of the United States," might be spread far and wide, Deliverance of
the Saints
and be the means of opening the hearts of the people. I gave
some important instructions, and prophesied that within five
years we should be out of the power of our old enemies, whether they were
apostates or of the world; and told the brethren to record it, that when it
comes to pass they need not say they had forgotten the saying.

Some rain in the evening; cloudy and foggy.

Monday, 26.—At home. A cold wind from the north. Rainy, dull day.

In the afternoon, held court at the Mansion. City of Nauvoo

versus Orsimus F. Botswick, on complaint of Hyrum Smith The Case of
for slanderous language concerning him and certain females Botswick
Slander of
of Nauvoo. Botswick was fined $50 and costs. Francis M.
Hyrum Smith.
Higbee, his attorney, gave notice he should appeal to the
municipal court, and then to the circuit court. I told Higbee
what I thought of him for trying to carry such a suit to Carthage—it was to
stir up the mob and bring them upon us.

Prayer-meeting in the assembly room in the afternoon. My uncle John

Smith and lady were present, were anointed, and received blessings; and in
the evening Father Morley was also blessed.

Ira S. Miles volunteered to join the mountain exploring expedition.

Tuesday, 27,—At home, Cool and clear. River clear of ice.

In the afternoon, visited the printing office.

Mailed my "Views of Powers and Policy," &c., to the President and cabinet,
supreme judges, senators, representatives, principal newspapers in the
United States, (all the German), and many postmasters and individuals.

Almon L. Fullmer and Hosea Stout volunteered to go on the Western

Exploring Expedition.
Wednesday, 28.—At home. Rainy day.

At four, p.m., steamboat General Brooke passed up the river: first boat this
season. No ice in sight.

In the evening I sent Brother Coolidge to Brother Phelps, to call the

brethren and pray for Brother Coolidge's sick child, as he thought it could
not live till morning. Elder John Taylor and others prayed for him.

Dr. Alphonzo Young published an appeal to his native state of Tennessee,

giving a history of our Missouri troubles, and asking the influence of that
state to obtain redress.

The Neighbor of to-day publishes the following:—

FOR PRESIDENT, JOSEPH SMITH.

Having now raised the name of our General and Prophet to the head of
our columns, it becomes us, as Latter day Saints, to be prudent and
energetic in the cause that we pursue, and not let any secondary
influences control our minds or govern our proceedings.

The step that we have taken is a bold one, and requires our united
efforts, perseverance, and diligence; but important as it may be, it is no
greater than others have taken, and they have conceived that they had a
right, without molestation, to pursue that course, and to vote for that
man whose election they in their wisdom thought would be most
conducive to the public weal.

As American citizens, then we presume that all will concede to us this

right; and whatever may be their views respecting the policy of such a
step, they will acknowledge that we act legally, justly, and
constitutionally in pursuing our present course.

Some have nominated Henry Clay, some Colonel Johnson, others John
C. Calhoun, others Daniel Webster, and others Martin Van Buren.
Those several committees, unquestionably thought that they had each
of them made the wisest selection in naming the man of their choice.
They selected their several candidates because they thought they were
the wisest, the greatest statesmen, and the most competent to fill the
presidential chair, whilst they severally thought that the other
candidates were incompetent.

We have governed by the same principles; and if others think they

have made the wisest selection, so do we. If others think they have
nominated the greatest statesman, so do we; and while those several
committees think that none of the nominations made are so good as
their own, we think that the man of our choice is the most able, the
most competent, the best qualified, and would fill the Presidential
chair with greater dignity to the nation; and that his election would be
conducive of more happiness and prosperity at home and abroad than
that of any other man in these United States.

This is a thing that we, as Latter-day Saints, know; and it now

devolves upon us as an imperative duty to make others acquainted with
the same things, and to use all our influence at home and abroad for
the accomplishment of this object.

Mr. Smith is not so generally known personally as are several of the

above-named candidates; and although he has been much spoken of as
a man, he has been a great deal calumniated and misrepresented, and
his true character is very little known.

It is for us to take away this false coloring; and by lecturing, by

publishing, and circulating his works, his political views, his honor,
integrity and virtue, to stop the foul mouth of slander, and present him
before the public in his own colors, that he may be known, respected,
and supported.

Thomas S. Edwards volunteered to join the exploring expedition to the

Rocky Mountains.

Thursday, 29.—Called at my office, and gave Brother Phelps the Zanesville

Gazette of January 31, containing the speech of Cassius M. Clay, delivered
in Scott county, Kentucky, December 30, 1843, on annexing
Texas to the United States; and instructed him to reply to the A Reply
same, and gave him the subject matter, and directed the Sketched to
Cassius M.
manner I wished it done; and then rode out with Porter
Clay.
Rockwell.

The steamer Ohio went up the river.

Moses Smith and Rufus Beach volunteered to join the Oregon exploring
expedition.

Friday, March 1.—Very frosty night; showery day, west wind.

Spent the day in counseling.

Letters from the elders show a rapid progress of the work of the Lord in
different parts of the Union. Elder John E. Page has gone to Washington for
the purpose of proclaiming to the rulers of our nation the principles of
eternal truth. By a letter received from him, we learn he has been preaching
and baptizing in Boston and vicinity.

The High Council to the Saints in Nauvoo.

The High Council of the Church of Jesus Christ of Latter-day Saints at

Nauvoo to the Saints of this [Nauvoo] Stake, greeting.

BELOVED BRETHREN,—Realizing as we do, the importance of the

work in which we are engaged, we deem it expedient to lay before you
such matters from time to time as in our opinion will be beneficial to
the Saints, and the spirit in us may seem to require.

We would remind our brethren, the elders, who have at sundry times
been sent forth as flaming heralds, messengers of the everlasting
Gospel, who proclaim a message of salvation to their fellow-men,
thereby gathering and bringing up to Zion the scattered elect of God, to
be taught more perfectly he principles of salvation; that whilst their
message is abroad we have had our mission to remain at Nauvoo and
to participate with the Saints in the blessing of poverty, if such it may
be called; amid sickness and distress, in the vexations and turmoils of
the unruly and ungodly, for which no man has paid us, for days, weeks,
months, and years; that our time has been spent in endeavoring to
settle difficulties, set in order the things needful to salvation; in trying
to reconcile and cement the feelings of our brethren to each other in
the spirit of the Gospel; whilst at times, circumstances of a more
painful nature have been presented.

Individuals have been brought before us charged with high crimes in

violation of the laws of heaven, on whom much patient exertion in the
labors of love have by us been bestowed, to reclaim them from the
error and evil of their doings.

We regret to have it to say that in some instances our efforts have been
fruitless; for after we have found in them an obstinate and unyielding
spirit to the principles of right, we have (reluctantly) been compelled
to sever them from the Church as withered branches.

Such persons not unfrequently manifest their wickedness by their

trifling with and bidding defiance to all and every good rule, regulation
and law, set forth for the guidance of all Saints.

One single trait of their depravity is frequently manifested by their

going to some ignorant elder and getting re-baptized into the Church,
not having first made the least satisfaction (as was required) to such as
they have injured.

We have to say that baptism in such cases is not valid and cannot
profit. We here continue to say; let such expelled person first be
reconciled to his injured brother, and bring forth fruit mete for
repentance; or, in case of dissatisfaction with our decision, take an
appeal and reverse it, if found wrong.

Expelled persons not complying with these rules (which are in

accordance with the order of heaven), whom we have been once
necessitated to withdraw fellowship from, cannot be restored in any
illegal way; and we would say that all such clandestine entering into
the Church is climbing up some other way, and that such persons can
only be considered as thieves and robbers. We would also remind the
elders that it is improper for them to re-baptize any such expelled
persons while they remain thus obstinate; and that it will subject them
to censure, and bring them to trial before a proper tribunal of the
Church.

We therefore hope, for the future, that certain officious, forward-

feeling elders will be more prudent in such cases hereafter.

We remain yours in the bonds of the new and everlasting covenant,

WILLIAM MARKS,

CHARLES C. RICH,

Presidents.

Samuel Bent, L. Dunbar Wilson,

David Fullmer, Thomas Grover,

Newell Knight, Leonard Soby,

James Allred, Alpheus Cutler,

George W. Harris, Aaron Johnson,

William Huntington, Sen., Henry G. Sherwood,

Counselors.

Hosea Stout, Clerk.

The Times and Seasons of March 1st presents my name to the public as
candidate for president of the United States.

Jonathan Dunham filed his bonds with the recorder, and took the oath of
office as wharf-master of the city of Nauvoo.
Elder Wilford Woodruff very sick; the 37th anniversary of his birthday.

Saturday, 2.—Ten a.m. held Mayor's court. Reproved Elder S. B. Stoddard

for giving appearance of evil in attempting to be bail for Orsimus F.
Boswick. Brother Stoddard afterwards explained to my satisfaction.

President Brigham Young visited Macedonia, accompanied by his brother,

L. D. Young, and preached there on the Sabbath.

Sunday, 3.—Ground covered with snow. Attended prayer-meeting in the

evening.

Monday, 4.—I suggested the name of James Arlington Bennett, of Long

Island, as a candidate for Vice-President.

At early candle-light, the First Presidency, Twelve Apostles, temple

committee, and others, met in council.

I insert the minutes.

Minutes of a Council Meeting—Twelve and Temple Committee.

George Coray came in, and said he was sent by Lyman Wight to get
sheep, &c, to carry to the Pine country, to receipt for them, or agree to
pay lumber.

President Joseph suggested that it was best to let the Nauvoo House
remain as it is until the temple is completed, as we need the temple
more than anything else.

Elder Haws said there was some dissatisfaction about being sent from
the Pinery without accounts, &c., and could not have credit on tithing,
and one month at the Pinery is only called fifteen days here.

President Joseph told them that they should have their number of days
in full. "We will let the Nauvoo house stand until the temple is done,
and we will put all our forces on the Temple, turn our lumber towards
the Temple, and cover it in this fall, and sell the remainder to get
blasting powder, fuse, rope, steel, &c."
And when the temple is completed, no man shall pass the threshold till
he has paid five dollars; and every stranger shall pay five dollars
towards liquidating the cash debts on the Temple, and I will not have
the house dirtied.

Let Woodworth go to the pinery, take the things wanted, and bring
back the lumber, and his wages go on as usual.

Let a special conference be called on the 6th of April, and all the elders
called home who can come. Let the people of this city come together
on Thursday, at nine o'clock in the morning. After two or three
lectures, we will call on the people to fill up the boxes with liberal
contributions, to procure cash materials for the temple.

I instructed a letter to be written to James Arlington Bennett to consult him

on the subject of nominating him for Vice-President. I here insert the letter:
—

Letter—Willard Richards to James Arlington Bennett—The Matter of

Bennett Becoming Candidate for Vice-President of U. S.

NAUVOO, March 4, 1844.

DEAR GENERAL,—Yours of the 1st of February, was duly received,

and produced the most pleasing sensations among your friends here,
and especially with the Prophet, who said, "Tell General Bennett I am
perfectly satisfied with his explanation; and as to temper, I had not
even thought of it."

You suggest that Brother Joseph's correspondence with Mr. Calhoun

would appear in some degree to contradict the noble sentiments
expressed in that able document to yourself; but if you will notice that
his communication to you was written as an individual, and that to Mr.
Calhoun as the voice of the people he represents, I think you will
discover no discrepancy; but if so, tell me particulars without delay,
and you shall have an explanation.
I have recently mailed to you General Smith's "Views of the Powers
and Policy of the Government of the United States," which were drawn
forth in consequence of his friends selecting him as a candidate for the
next Presidency, which he very reluctantly acquiesced in, and it seems
would not, only to support a favorite maxim—"The people must
govern;" but having once been prevailed upon to suffer his name to go
abroad as a candidate, it is desirable to him of course, as to every
patriot, that those who have brought him forward should use all
honorable means to sustain him in the canvass; and if I had not felt
disposed to uphold him before the people, I never would have been the
first to urge his nomination; and during the short space since his name
has been published, his friends have been astonished at the flood of
influence that is rolling through the Western States in his favor, and in
many instances where we might have least expected it.

I need not assert what the wisest of the wise admit without argument—
that General Smith is the greatest statesman of the 19th century. Then
why should not the nation secure to themselves his superior talents,
that they may rise higher and higher in the estimation of the crowned
heads of the nations and exalt themselves through his wisdom?

Your friends here consider your letter about the Governorship of

Illinois just like every man in your quarter, mere sport, child's sport;
for who would stoop to the play of a single State, when the whole
nation was on the board?—a cheaper game!

General Smith says, if he must be President, Arlington Bennett must be

Vice-President. To this his friends are agreed—agreed in everything;
and in this consists our power: consequently, your name will appear in
our next paper as our candidate for Vice-President of the United States.
You will receive our undivided support, and we expect the same in
return for General Smith for the Presidency; and we will go it with the
rush of a whirlwind, so peaceful, so gentle, that it will not be felt by
the nation till the battle is won.

Dear General, if glory, honor, force, and power in righteous principles

are desired by you, now is your time. You are safe in following the
counsel of that man who holds communion with heaven; and I assure
you, if you act well your part, victory's the prize.

Brother Arlington, look well to "General Smith's Views," and his letter
to Calhoun, and comprehend him fully. Say to the New York Herald,
now is the time for your exaltation; raise your standard high, sound
your trumpet long and loud, support General Smith and myself at the
next election; and when we are exalted, you shall not be forgotten.

Hold forth no false shadows to honest men; yet though there is but one
best piece to the fatted calf, yet there are many good slices; therefore
you will not forget the "Advertiser," "Niles Register," "Globe," &c.,
&c.

Get up an electoral ticket—New York, New Jersey, Pennsylvania, and

any other state within your reach. Open your mouth wide, and God
shall fill it. Cut your quill, and the ink shall flow freely.

Commence at your own mansion and stay not, only for electioneering
purposes, till by some popular route you reach Nauvoo; and if you
preach Mormonism it will help you. At every stage, tavern, boat and
company, expose the wickedness of Martinism in saying, if he is
elected President, he will annihilate the Mormons, and proclaim the
sycophancy of the candidates generally, and uphold Joseph against
every aspersion and you shall triumph gloriously.

We have many things to say to you, which we must keep till we see
you face to face.

All is right at Nauvoo. We are now fitting out a noble company to

explore Oregon and California, and progressing rapidly with the great
Temple, which we expect to roof this season, though there is yet a
chance at the eleventh hour for you to bring in your thousand, and
secure your "penny."

On the 6th of April is our special conference at Nauvoo. I wish you

could be here on that occasion, but the time is too short. From that
period our Elders will go forth by hundreds or thousands and search
the land, preaching religion and politics; and if God goes with them,
who can withstand their influence?

My words are the words of your friends here—Come and see us.
Brother Joseph's, Young's, and Bernhisel's respects to you. Mrs.
Richards' kind respects with mine to yourself and love to all yours.

Most respectfully yours,

WILLARD RICHARDS.

The temple committee proposed to establish a powder manufactory.

Footnotes:

1. That is, process outside of the city government.

CHAPTER X.
URGING THE BUILDING OF THE
TEMPLE—TENDERS OF PEACE TO
MISSOURI—PROPHET'S DISCOURSE
ON ELIAS, ELIJAH, MESSIAH—LYMAN
WIGHT'S PROPOSAL OF A SOUTHWEST
MOVEMENT FOR THE CHURCH.

Tuesday, March 5, 1844.—I saw Hyrum Kimball at Bryant's store, and gave
him a lecture on his resisting the ordinances of the city, by telling the
captains of the steamboats they need not pay wharfage, &c.

Rode out with Emma.

At two, p.m., met with the City Council. I copy the minutes:—

Special Session of the City Council.

March 5, 1844, 2 p.m.

Names of members called. Quorum present.

Mayor stated that he had called the council, because that when the
wharf-master called on the steamboats for wharfage, the officers of the
boats declined paying, assigning as a reason that Hyrum Kimball and
— Morrison had told them that they owned the land, and they need
pay no wharfage to the city; and he called the council to know their
views on the subject, as he had told Hyrum Kimball that he should see
the ordinances executed; and if the boats did not pay, he should blow
them up and all those who upheld them in resisting the ordinances.
Every measure is taken to palsy the hands of the officers of the city;
and I want to know how to remedy the evil, or whether I shall abandon
the ordinances, &c.
Alderman Harris said that it was the mayor's duty to enforce the
ordinances of the city, and that no man has a right to build a wharf
without leave from the city council.

Councilor Phelps suggested the propriety of licensing those who

owned wharves to collect a tax for the landing of the boat.

Alderman Wells concurred.

Mayor said the land on the water's edge was a street.

Alderman Wells suggested the propriety of having the street worked as

soon as may be.

Councilor Phelps said, if Water street extended round the city, then
Kimball had been constructing a nuisance.

Mayor spoke in explanation, and said that Kimball said, if the city
would make a wharf, he would give up what he had done.

Councilor Orson Spencer said he wished the mayor to execute the law
of the city.

Councilor Brigham Young concurred.

Councilor W. W. Phelps proposed that Water street be worked the

whole length.

Councilor Taylor said, "I go in for executing the laws of the city."

Marshal stated that Morrison said he had a bond for a deed to low-
water mark, and the city could not take his personal rights, and he
objected to the boats paying wharfage.

Councilor Orson Pratt said, if Kimball or Morrison or any one else has
built wharves since that street was laid out, they could get no damages.

Councilor Daniel Spencer considered the ordinance passed good, and

it ought to be enforced.
Councilor Hyrum Smith, believed it was our duty to stand up to the
ordinances.

Moved by Brigham Young that the city council instruct the Mayor to
order the supervisor to open Water street from Joseph Smith's store
north to the north line of the city.

Councilor Phelps approved of the motion, that the road might be

cleared from rafts, and the rafts might also pay license.

Councilor Warrington said the upper stone house was in the street.

Mayor said that was the greatest nuisance there was in the street.

Councilor Orson Spencer was in favor [i.e., of the motion to open

Water street.] Motion carried unanimously.

The governor having refused to issue commissions to the aldermen-

elect of the city, Councilor Whitney inquired who were aldermen.

The mayor explained that if the governor refuses to grant a

commission, it does not disqualify the officer elect from acting in his
office; consequently, there is no virtue in the commission, but the
virtue of the office consists in the election.

Councilor Young thought they were aldermen all the time or none of
the time.

Mayor said he wanted all the aldermen to be added to the city council.

Alderman Wells said he considered the election made the aldermen,

and not the commission.

Mayor said if he had been elected alderman and filed his bonds, he
would act as councilor and magistrate.

Noah Packard sent a memorial to the governor, senate, and

house of representatives of Massachusetts, his native state, Packard's
Memorial to
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade

Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.

Let us accompany you on the journey of exploring knowledge and

personal growth!

ebooknice.com

Get Java Programming (MindTap Course List), 10th Edition Joyce Farrell PDF ebook with Full Chapters Now
100% (4)
Get Java Programming (MindTap Course List), 10th Edition Joyce Farrell PDF ebook with Full Chapters Now
66 pages
Mastering Non-Functional Requirements
From Everand
Mastering Non-Functional Requirements
Sameer Paradkar
5/5 (1)
Moodle 3.x Developer's Guide
From Everand
Moodle 3.x Developer's Guide
Ian Wild
No ratings yet
Digital Marketing: The Science and Magic of Digital Marketing Can Help You Become a Successful Marketing Professional (English Edition)
From Everand
Digital Marketing: The Science and Magic of Digital Marketing Can Help You Become a Successful Marketing Professional (English Edition)
Rajan Gupta
No ratings yet
Web Testing with Cypress: Run End-to-End tests, Integration tests, Unit tests across web apps, browsers and cross-platforms (English Edition)
From Everand
Web Testing with Cypress: Run End-to-End tests, Integration tests, Unit tests across web apps, browsers and cross-platforms (English Edition)
Lev Gelfenbuim
No ratings yet
Form 5A8 Curriculum Vitae (CV) For Each Proposed Professional Staff
No ratings yet
Form 5A8 Curriculum Vitae (CV) For Each Proposed Professional Staff
3 pages
Comptia Network+ In 21 Days N10-006 Study Guide: Comptia 21 Day 900 Series, #3
From Everand
Comptia Network+ In 21 Days N10-006 Study Guide: Comptia 21 Day 900 Series, #3
C.V.Conner, Ph.D.
No ratings yet
UDT - Unified Diagnostic Tool: Turin - Italy
100% (2)
UDT - Unified Diagnostic Tool: Turin - Italy
50 pages
38729
No ratings yet
38729
41 pages
Get Readings from Programming with C++ 1st Edition Kyla Mcmullen free all chapters
100% (4)
Get Readings from Programming with C++ 1st Edition Kyla Mcmullen free all chapters
66 pages
Download Full Readings from Programming with C++ 1st Edition Kyla Mcmullen PDF All Chapters
No ratings yet
Download Full Readings from Programming with C++ 1st Edition Kyla Mcmullen PDF All Chapters
40 pages
39400
No ratings yet
39400
43 pages
Download Complete Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF PDF for All Chapters
100% (6)
Download Complete Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF PDF for All Chapters
66 pages
Instant Ebooks Textbook Readings From Programming With C++ 1st Edition Kyla Mcmullen - Ebook PDF Download All Chapters
100% (8)
Instant Ebooks Textbook Readings From Programming With C++ 1st Edition Kyla Mcmullen - Ebook PDF Download All Chapters
23 pages
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF instant download
100% (1)
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF instant download
62 pages
39400
No ratings yet
39400
51 pages
Readings from Programming with C++ 1st Edition Kyla Mcmullen - The ebook is ready for download to explore the complete content
100% (1)
Readings from Programming with C++ 1st Edition Kyla Mcmullen - The ebook is ready for download to explore the complete content
51 pages
Readings from Programming with C++ 1st Edition Kyla Mcmullen - Download the ebook now and read anytime, anywhere
100% (1)
Readings from Programming with C++ 1st Edition Kyla Mcmullen - Download the ebook now and read anytime, anywhere
62 pages
Instant Download Readings From Programming With C++ 1st Edition Kyla Mcmullen - Ebook PDF PDF All Chapters
100% (13)
Instant Download Readings From Programming With C++ 1st Edition Kyla Mcmullen - Ebook PDF PDF All Chapters
59 pages
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF 2024 scribd download
100% (8)
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF 2024 scribd download
59 pages
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF instant download
100% (2)
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF instant download
74 pages
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF download
100% (3)
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF download
47 pages
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF instant download
100% (1)
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF instant download
68 pages
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF instant download
100% (1)
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDF instant download
74 pages
Readings from Programming with C++ 1st Edition Kyla Mcmullen All Chapters Instant Download
100% (2)
Readings from Programming with C++ 1st Edition Kyla Mcmullen All Chapters Instant Download
31 pages
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDFpdf download
100% (3)
Readings from Programming with C++ 1st Edition Kyla Mcmullen - eBook PDFpdf download
43 pages
(Ebook) An Introduction to Programming with C++ by Diane Zak ISBN 9781285860114, 128586011X instant download
No ratings yet
(Ebook) An Introduction to Programming with C++ by Diane Zak ISBN 9781285860114, 128586011X instant download
59 pages
Java Programming (MindTap Course List), 10th Edition Joyce Farrell - eBook PDF pdf download
100% (2)
Java Programming (MindTap Course List), 10th Edition Joyce Farrell - eBook PDF pdf download
77 pages
Java Programming (MindTap Course List), 10th Edition Joyce Farrell - eBook PDF download
100% (1)
Java Programming (MindTap Course List), 10th Edition Joyce Farrell - eBook PDF download
56 pages
Java Programming (MindTap Course List), 10th Edition Joyce Farrell - eBook PDF instant download
100% (2)
Java Programming (MindTap Course List), 10th Edition Joyce Farrell - eBook PDF instant download
75 pages
Full Java Programming (MindTap Course List), 10th Edition Joyce Farrell - Ebook PDF PDF All Chapters
100% (8)
Full Java Programming (MindTap Course List), 10th Edition Joyce Farrell - Ebook PDF PDF All Chapters
51 pages
Java Programming (MindTap Course List), 10th Edition Joyce Farrell - eBook PDF 2024 scribd download
100% (6)
Java Programming (MindTap Course List), 10th Edition Joyce Farrell - eBook PDF 2024 scribd download
66 pages
39392
No ratings yet
39392
53 pages
Fundamentals Of Python: Data Structures 2nd Edition Kenneth A. Lambert - Download the ebook today and own the complete content
100% (1)
Fundamentals Of Python: Data Structures 2nd Edition Kenneth A. Lambert - Download the ebook today and own the complete content
58 pages
Data Communication and Computer Networks: A Business User's Approach, 9th Edition Jill West download pdf
No ratings yet
Data Communication and Computer Networks: A Business User's Approach, 9th Edition Jill West download pdf
51 pages
Download Complete Data Communication and Computer Networks: A Business User's Approach, 9th Edition Jill West PDF for All Chapters
67% (3)
Download Complete Data Communication and Computer Networks: A Business User's Approach, 9th Edition Jill West PDF for All Chapters
51 pages
Fundamentals of Python: First Programs, 2nd Edition Kenneth A. Lambert - The full ebook with complete content is ready for download
100% (5)
Fundamentals of Python: First Programs, 2nd Edition Kenneth A. Lambert - The full ebook with complete content is ready for download
58 pages
Download full Fundamentals Of Python: Data Structures 2nd Edition Kenneth A. Lambert ebook all chapters
100% (1)
Download full Fundamentals Of Python: Data Structures 2nd Edition Kenneth A. Lambert ebook all chapters
46 pages
Immediate download Fundamentals Of Python: Data Structures 2nd Edition Kenneth A. Lambert ebooks 2024
100% (2)
Immediate download Fundamentals Of Python: Data Structures 2nd Edition Kenneth A. Lambert ebooks 2024
55 pages
New Perspectives on HTML 5 and CSS 8th Edition Patrick M. Carey - eBook PDF instant download
100% (2)
New Perspectives on HTML 5 and CSS 8th Edition Patrick M. Carey - eBook PDF instant download
79 pages
New Perspectives on HTML 5 and CSS 8th Edition Patrick M. Carey - eBook PDF pdf download
100% (9)
New Perspectives on HTML 5 and CSS 8th Edition Patrick M. Carey - eBook PDF pdf download
55 pages
Fundamentals Of Python: Data Structures 2nd Edition Kenneth A. Lambert pdf download
100% (1)
Fundamentals Of Python: Data Structures 2nd Edition Kenneth A. Lambert pdf download
60 pages
Fundamentals Of Python: Data Structures 2nd Edition Kenneth A. Lambert - eBook PDF instant download
100% (2)
Fundamentals Of Python: Data Structures 2nd Edition Kenneth A. Lambert - eBook PDF instant download
78 pages
Magento 2 Development Essentials: Get up and running with Magento 2 to create custom solutions, themes, and extensions effectively
From Everand
Magento 2 Development Essentials: Get up and running with Magento 2 to create custom solutions, themes, and extensions effectively
Fernando J Miguel
5/5 (1)
Secrets to List Building
From Everand
Secrets to List Building
B. Vincent
No ratings yet
Magento 2 Theme Design - Second Edition
From Everand
Magento 2 Theme Design - Second Edition
Fernando J Miguel
5/5 (2)
Generative Deep Learning with Python: Unleashing the Creative Power of AI by Mastering AI and Python
From Everand
Generative Deep Learning with Python: Unleashing the Creative Power of AI by Mastering AI and Python
Cuantum Technologies LLC
No ratings yet
CompTIA Network+ Practice Tests: Exam N10-007
From Everand
CompTIA Network+ Practice Tests: Exam N10-007
Craig Zacker
No ratings yet
Comptia A+ 220-902 Q & A Study Guide: Comptia 21 Day 900 Series, #4
From Everand
Comptia A+ 220-902 Q & A Study Guide: Comptia 21 Day 900 Series, #4
C.V.Conner, Ph.D.
No ratings yet
Android Studio Cookbook: Design, test, and debug your apps using Android Studio
From Everand
Android Studio Cookbook: Design, test, and debug your apps using Android Studio
Mike van Drongelen
4/5 (1)
Build Gamified Websites with PHP and jQuery
From Everand
Build Gamified Websites with PHP and jQuery
Detrick DeBurr
No ratings yet
Comptia A+ 220-901 Q & A Study Guide: Comptia 21 Day 900 Series, #2
From Everand
Comptia A+ 220-901 Q & A Study Guide: Comptia 21 Day 900 Series, #2
C.V.Conner, Ph.D.
5/5 (2)
Keyshot 3D Rendering
From Everand
Keyshot 3D Rendering
Jei Lee Jo
No ratings yet
PySide GUI Application Development - Second Edition
From Everand
PySide GUI Application Development - Second Edition
Jaganmohan Gopinath
No ratings yet
Microsoft 365 Administration Cookbook: Enhance your Microsoft 365 productivity to manage and optimize its apps and services
From Everand
Microsoft 365 Administration Cookbook: Enhance your Microsoft 365 productivity to manage and optimize its apps and services
Nate Chamberlain
No ratings yet
Instant BrainShark
From Everand
Instant BrainShark
Daniel Li
No ratings yet
Symantec Certification: Find out how to pass Symantec exams and get certifications focusing only on the exam tests. Real Practice Test With Detailed Screenshots, Answers And Explanations
From Everand
Symantec Certification: Find out how to pass Symantec exams and get certifications focusing only on the exam tests. Real Practice Test With Detailed Screenshots, Answers And Explanations
David Mayer
No ratings yet
Chatgpt Prompt ENGINEERING
From Everand
Chatgpt Prompt ENGINEERING
VIKAS KUMAR
No ratings yet
Learning Yii Testing
From Everand
Learning Yii Testing
Matteo Pescarin
1/5 (1)
My Life as a Digital Transformation Leader
From Everand
My Life as a Digital Transformation Leader
Adhitya Bhogra
No ratings yet
CompTIA Project+ Practice Tests: Exam PK0-004
From Everand
CompTIA Project+ Practice Tests: Exam PK0-004
Brett J. Feddersen
No ratings yet
Touchpad Plus Ver. 4.0 Class 5: Windows 10 & MS Office 2019
From Everand
Touchpad Plus Ver. 4.0 Class 5: Windows 10 & MS Office 2019
Nidhi Gupta
No ratings yet
SimplyNUCProductBrief-NUC7i7DNFE
No ratings yet
SimplyNUCProductBrief-NUC7i7DNFE
2 pages
Spring Boot Junit With Mockito: 1. Application-Test - Properties
No ratings yet
Spring Boot Junit With Mockito: 1. Application-Test - Properties
9 pages
Chapter-II Enumerators: Universal Turing Machine
No ratings yet
Chapter-II Enumerators: Universal Turing Machine
13 pages
IGCSE Curriculum Guide 2017-19 PDF
No ratings yet
IGCSE Curriculum Guide 2017-19 PDF
33 pages
PPT on Machine Learning
No ratings yet
PPT on Machine Learning
13 pages
Java Memory Management
No ratings yet
Java Memory Management
38 pages
Quiz
No ratings yet
Quiz
6 pages
Kovair Software Recruitment Drive on 4th March'2025 for 2025 Graduating Batch
No ratings yet
Kovair Software Recruitment Drive on 4th March'2025 for 2025 Graduating Batch
17 pages
Intro To WServices
No ratings yet
Intro To WServices
26 pages
4G HOSR-X2 Formulae Amendment (2022-11-08) (v1.2) (Final)
No ratings yet
4G HOSR-X2 Formulae Amendment (2022-11-08) (v1.2) (Final)
7 pages
CNSS Security Model (Cont.) Most Challenging To Protect
No ratings yet
CNSS Security Model (Cont.) Most Challenging To Protect
32 pages
Azure Workloads For Windows Virtual Desktop v1.0 - Datasheet
No ratings yet
Azure Workloads For Windows Virtual Desktop v1.0 - Datasheet
2 pages
cs_catalog
No ratings yet
cs_catalog
120 pages
A Laboratory-Centered Approach To Introducing Engineering Students To Electric Circuit and Electric Systems Concepts
No ratings yet
A Laboratory-Centered Approach To Introducing Engineering Students To Electric Circuit and Electric Systems Concepts
6 pages
Lecture Note 2 - Information Technology
No ratings yet
Lecture Note 2 - Information Technology
48 pages
C23 (C Standard Revision) - Wikipedia
No ratings yet
C23 (C Standard Revision) - Wikipedia
9 pages
Dragon Wave Harmony Compact Plus Setup
No ratings yet
Dragon Wave Harmony Compact Plus Setup
9 pages
Query Optimization in Hibernate: by Singaram
No ratings yet
Query Optimization in Hibernate: by Singaram
20 pages
h18153 Dell Powerstore Replication Technologies
No ratings yet
h18153 Dell Powerstore Replication Technologies
52 pages
ETSI 5G PoC White Paper No 4 v3.1
No ratings yet
ETSI 5G PoC White Paper No 4 v3.1
63 pages
Dell Emc Vxrail 7.0 Vsan Stretched Cluster Planning Guide: February 2021
No ratings yet
Dell Emc Vxrail 7.0 Vsan Stretched Cluster Planning Guide: February 2021
11 pages
Python Unit-1
No ratings yet
Python Unit-1
22 pages
Lesson 5 Advance Spreadsheet Skills
No ratings yet
Lesson 5 Advance Spreadsheet Skills
17 pages
Auth0 Bluetooth Sig Case Study
No ratings yet
Auth0 Bluetooth Sig Case Study
11 pages
Andrew Treadway - Software Engineering For Data Scientists (MEAP V03) - Manning Publications (2023)
100% (1)
Andrew Treadway - Software Engineering For Data Scientists (MEAP V03) - Manning Publications (2023)
319 pages
Event Handling in Java Fa
No ratings yet
Event Handling in Java Fa
10 pages
AcquirerMerchant 3DS QRG 9.06.18
No ratings yet
AcquirerMerchant 3DS QRG 9.06.18
2 pages
A Comparative Case Study of Linux and Windows XP
No ratings yet
A Comparative Case Study of Linux and Windows XP
14 pages

92509656

Uploaded by

92509656

Uploaded by

Download the Full Ebook and Access More Features - ebooknice.

(Ebook) Readings from Programming with C++ by Kyla

Download more ebook instantly today at https://ebooknice.com

Start reading on any device today!

(Ebook) Readings from Programming with C++ by Kyla

(Ebook) Biota Grow 2C gather 2C cook by Loucas, Jason;

(Ebook) Practical PC , 6th Edition by June Jamrich

(Ebook) New perspectives comprehensive computer concepts

(Ebook) New Perspectives on Computer Concepts 2012:

(Ebook) Practical Microsoft Office 2010 (Sam 2010

(Ebook) New Perspectives on Computer Concepts 2014:

(Ebook) New Pespectives on Computer Concepts 2018:

C++ KYLA McMULLEN

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

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,

prefacexiii Build Tools 22

Module 8 Pass by Reference 161

Function Basics 146 Dealing with Exceptions 189

Module 17 The Find Method 346

Key Terms 318

Asymptotic Analysis 397 Quicksort 438

Search Algorithms 411 Microprocessor Operations 462

Binary-Hex-Binary Conversions 481 Speech Synthesis 516

Flowcharts 548 UML Diagram Parts 558

Welcome to Readings from Programming with C11.

MindTap Overview MindTap Features

Connect to the site’s login page.

Figure 1-1 Steps for two-factor authentication

• A recipe for baking brownies

Programming Algorithms (1.1.2, 1.1.3, 1.1.5)

“Good” Algorithms (1.1.6, 1.1.7)

Is there input? Yes.

Get the last number in the series (10).

Figure 1-2 Is this a good algorithm?

Selecting and Creating Algorithms (1.1.8, 1.1.9, 1.1.10)

Account balance Deposits

Figure 1-3 A mobile banking app handles many

Structural Decomposition (1.2.2, 1.2.3, 1.2.4, 1.2.7)

Passcode/challenge Account Payments and

Fingerprint Mobile check

Figure 1-4 Structural decomposition diagram

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

Here are some tips for creating a structural decomposition diagram:

Functional Decomposition (1.2.5)

Verify login attempts

Verify password Verify PIN

Look up Compare Look up Generate

Figure 1-5 Functional decomposition diagram

Object-Oriented Decomposition (1.2.6)

Attribute: Valid user ID

Figure 1-6 Object-oriented decomposition diagram

Dependencies and Cohesion (1.2.8)

1.3 PATTERN IDENTIFICATION

Q Try the algorithm yourself. What is your answer?

Repetitive Patterns (1.3.3)

Q How many repetition patterns do you recognize?

Classification Patterns (1.3.4, 1.3.5)

Add ____________________ 1 1 to get a sum.

Classes and Objects (1.4.4, 1.4.5)

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

A The glassware class could have these attributes:

Black Boxes (1.4.6)

You can drive a car without

Figure 1-8 The controls for a car are an abstraction of

Something goes on inside.

Something goes in.

Something comes out.

Figure 1-9 Black box abstraction

Look up stored user ID and

Figure 1-10 A login abstraction

Levels of Abstraction (1.4.7)

Too specific Just right Too abstract

Figure 1-11 Levels of abstraction

prefacexiii Build Tools 22