×
Listen to your teachers when they tell you WHAT to do. But more importantly, think about it later and ask yourself WHY they told you to do it.
--Your friends at LectureNotes
Close

Arithmetic Reasoning

by Johncy EstibeiroJohncy Estibeiro
Type: NoteViews: 4Uploaded: 2 months ago

Share it with your friends

Suggested Materials

Leave your Comments

Contributors

Johncy Estibeiro
Johncy Estibeiro
Accelerated C++ Practical Programming by Example by Andrew Koenig and Barbara E. Moo Addison-Wesley, 2000 ISBN 0-201-70353-X Pages 336 Second Printing Table of Contents
Contents Chapter 0 Getting started 0.1 Comments 0.2 #include 0.3 The main function 0.4 Curly braces 0.5 Using the standard library for output 0.6 The return statement 0.7 A slightly deeper look 0.8 Details Chapter 1 Working with strings 1.1 Input 1.2 Framing a name 1.3 Details Chapter 2 Looping and counting 2.1 2.2 2.3 2.4 2.5 2.6 2.7 The problem Overall structure Writing an unknown number of rows Writing a row The complete framing program Counting Details Chapter 3 Working with batches of data 3.1 Computing student grades 3.2 Using medians instead of averages 3.3 Details Chapter 4 Organizing programs and data 4.1 4.2 4.3 4.4 4.5 4.6 Organizing computations Organizing data Putting it all together Partitioning the grading program The revised grading program Details Chapter 5 Using sequential containers and analyzing strings 5.1 5.2 5.3 5.4 5.5 5.6 5.7 5.8 5.9 Separating students into categories Iterators Using iterators instead of indices Rethinking our data structure for better performance The list type Taking strings apart Testing our split function Putting strings together Details Chapter 6 Using library algorithms 6.1 6.2 6.3 6.4 6.5 Analyzing strings Comparing grading schemes Classifying students, revisited Algorithms, containers, and iterators Details Chapter 7 Using associative containers 7.1 7.2 7.3 7.4 7.5 7.6 Containers that support efficient look-up Counting words Generating a cross-reference table Generating sentences A note on performance Details Chapter 8 Writing generic functions
8.1 8.2 8.3 8.4 8.5 What is a generic function? Data-structure independence Input and output iterators Using iterators for flexibility Details Chapter 9 Defining new types 9.1 9.2 9.3 9.4 9.5 9.6 9.7 Student_info revisited Class types Protection The Student_info class Constructors Using the Student_info class Details Chapter 10 Managing memory and low-level data structures 10.1 10.2 10.3 10.4 10.5 10.6 10.7 Pointers and arrays String literals revisited Initializing arrays of character pointers Arguments to main Reading and writing files Three kinds of memory management Details Chapter 11 Defining abstract data types 11.1 11.2 11.3 11.4 11.5 11.6 The Vec class Implementing the Vec class Copy control Dynamic Vecs Flexible memory management Details Chapter 12 Making class objects act like values 12.1 12.2 12.3 12.4 12.5 12.6 12.7 A simple string class Automatic conversions Str operations Some conversions are hazardous Conversion operators Conversions and memory management Details Chapter 13 Using inheritance and dynamic binding 13.1 13.2 13.3 13.4 13.5 13.6 13.7 Inheritance Polymorphism and virtual functions Using inheritance to solve our problem A simple handle class Using the handle class Subtleties Details Chapter 14 Managing memory (almost) automatically 14.1 14.2 14.3 14.4 14.5 Handles that copy their objects Reference-counted handles Handles that let you decide when to share data An improvement on controllable handles Details Chapter 15 Revisiting character pictures 15.1 Design 15.2 Implementation 15.3 Details Chapter 16 Where do we go from here? 16.1 Use the abstractions you have 16.2 Learn more Appendix A Language details A.1 Declarations A.2 Types A.3 Expressions A.4 Statements
Appendix B Library summary B.1 Input-output B.2 Containers and iterators B.3 Algorithms

Lecture Notes