Overview
This week, we’ll cover in more detail some features of C++ that we presented in our earlier introduction to C++. This includes:
- output manipulation
- pointers and addresses,
- reference variables and pass-by-reference,
- C++ templates, and
- overloaded operators.
We’ll also write a node class for use with singly-linked lists.
If there’s a discrepancy between any dates, grade weights, or policies between what’s stated in videos and the syllabus, the syllabus prevails.
Learning objectives
By the end of this module, you will be able to:
- use pointers and dereference pointers in your C++ code,
- pass variables to a function by reference,
- use templates to implement generic functions that can be instantiated to work with specific types,
- overload operators,
- manipulate the
iostream, and - understand and explain singly-linked lists.
To achieve this module’s objectives, complete the following:
Read: Essential Algorithms, pp. 55–65 covering singly-linked lists (Chapter 3, sections Basic Concepts through Sorted Linked Lists).
Read / view the following content and complete any comprehension checks:
- Output manipulation
- Pointers and addresses
- Reference variables
thisis a pointer- The arrow (
->) operator - What exactly does a pointer store?
- C++ templates
- Overloading operators
- Linked lists
- Node class
Project #1
You should have started Project #1. Don’t delay! Information about the dataset you wish to use for Project 1 and all subsequent projects is due Thursday 2023-09-07 11:59 PM ET.
Original author: Clayton Cafiero < [given name] DOT [surname] AT uvm DOT edu >
No generative AI was used in producing this material. This was written the old-fashioned way.
All materials copyright © 2020–2023, The University of Vermont. All rights reserved.