Savitch (2nd Edition) Cross-References
[Return to Math 10 Homepage]
Prenote
This cross-reference list was updated during August and September 1998,
and revised to correspond to the second edition of Savitch.
It was updated again when the numbering of the sections of the notes
was changed in December 1998.
There may be some instances of
where the revised pagination of the lastest edition was incorrectly
added. Suggestions for updates, additions, and corrections will
always be accepted!
Introductory Notes: Notes N1
- Types of Program Errors, Sav: 1.4, pp 28-30
Contents: Notes N2
- Introduction to C++, Sav: 1.1, 1.2, 1.3A, pp 2-20
- Identifiers, Sav: 2.1, p 39
- Reserved Words, Sav: 2.1, p 42
- C++ Program Skeleton, Sav: 1.3, p 25
- Comments: Sav: 2.5, p 91
- Output, Sav: 2.2, p 48-54
- Sample Program
Contents: Notes N3
- Variables and Types, Sav: 2.3, pp 57-62
- Variable Declaration, Sav: 2.1, p 42
- Initialization, Sav: 2.1, pp 46-47
- Constants, Sav: 2.1, p 45
- Arithmetic Operations and "Assignments", Sav: 2.1, 2.3, pp 44, 64
- Increment/Decrement Operators, Sav: 2.4, pp 84-86
- Output Values, Sav: 2.2, pp 48-52
- Another Sample Program
- Operator Precedence, Sav: 2.3, p 66; App 2, pp 862-63
- Type Conversions and "Casts", Sav: 3.2, pp 112-14
- Integers and Division, Sav: 2.3, p 65 (cf. Sav: App 3, p 864 ASCII codes)
- Variable Field Width in cout Statements, Sav: 2.2, p 52;
5.2, p 232-40
- Programming Style, Sav: 2.5, pp 90--91
Contents: Notes N4
- Code Blocks, Sav: 7.2, p 384-87
- Introduction to Repetition, Sav: 7.3, pp 395-99
- Loops--Repetitions (Counted)
- Sample Program
- Boolean Values -- Logical Values, Sav: 2.3, p 62; 2.4, pp 71-78;
7.1, pp 358ff; 5.3, p 257 (NOTE, 7.1, p 364 and App 10, p 883)
- More on for Loops
- WARNING about for Loop, Sav: 7.3, p 399
- Nested for Loops, Sav: 7.4, pp 411ff
- Assigment Statement Shortcuts, Sav: 2.3, p 69
Contents: Notes N5
- Input Functions, Sav: 1.3, p 22-23
- Example
- Input and Output Directed to/from Data Files by Code, Sav: 5.1, p 217-21
- The cin.ignore Function (not in Savitch)
Contents: Notes N6
- Multiple Alternatives
- switch Example, Sav: 7.2, p 377 ff
- Functions -- Standard, Sav: 3.2, pp 107, 111, App 4, p 865ff
- More on Programming Style
- ---1. const, Sav: 2.5, pp 92-95
- ---2. Elegance and Efficiency
- ---3. Modularity, cf. Sav: 4.3, p 190-93
Contents: Notes N7
- C/C++ Functions (Procedures), Sav: 3.3, pp 116ff; 4.1, pp 168ff
- Calling Process
- Location of Function Code
- Sample Program with Functions
- Variable "Scoping", Sav: 3.5, p 139-42
- Programming Hints
- Caution
Contents: Notes N8
- Parameters and Functions, Sav: 3.3, p 116-18
- Parameter Types and Uses, Sav: 3.3, p 121; 4.2, pp 176-89
- Changes in the Function Header Statement
- Addresses of Variables and Variable Parameters, Sav: 4.2, p 176
- Examples
- Warnings, Sav: 3.3, p 123
- Function Examples
- Notes
- Functions with File Parameters
- Prototype Declaration, Sav: 3.3, p 119
- Reason for Parameters
Contents: Notes N9
- Functions, Sav: 3.3, p 116
- Function Heading
- Examples
- Prototypes for Functions, Sav: 3.3, pp 119ff, 121
- Functions versus Procedures, Sav: 4.1, pp 168ff
Contents: Notes N10
- Decisions
- if, Sav: 2.4, pp 70-73
- Examples
- Joining Boolean Expressions, Sav: 2.4, pp 73-76, 7.1, p 360
- Boolean Operator Precedence, Sav: 7.1, p 361
Contents: Notes N11
- Looping Indefinitely
- While Loop. Sav: 2.4, p 80-83
- do ... while Loops, Sav: 2.4, p 83-87
- Differences and Notes
- Unknown Input, Sav: 5.3, p 257
- Loop Problem Re-Visisted
Contents: Notes N12
- Arrays, Sav: 9.1, pp 512ff; 10.2, pp 610ff
- Arrays as Parameters, Sav: 9.2, pp 526-28; 10.2, p 612
- Uses of Arrays
- Examples: Bubblesort, cf. Sav: 13.1, p 757
- Selection Sort, Sav: 9.3, p 555ff
- Example: Selectionsort
- Analysis of a Problem
Contents: Notes N13
- Introduction to Arrays of char, Sav: 10.1, pp 588, 599, 603
- String Functions and Operations, Sav: 10.1, pp 594-95
Contents: Notes N14
- Introduction to Record Types, Sav: 6.1, 6.2, pp 292 ff, 307
- class Definition, Sav: 6.1, p 298
- Using Record Type Variables
- Record Variable Assignments
- Inheritance, Sav: 15.1, 15.2, p 816ff; 5.4, pp 268ff
Contents: Notes N15
- More on C++ Classes, Sav: 6.2, pp 305-27
- Alternative Location for Function Code
- Constructors and Destructors, Sav: 6.2, pp 328-37, 11.3, pp 684ff
Contents: Notes N16
- Introduction To Abstract Data Types and Stacks
- Stacks as ADTs, Sav: 14.2, pp 800-806
- Using Stacks
- Simple Examples
- Stacks and Order
- Representing Stacks (Implementations)
- Array Implementation of a Stack in C++
- Coding Member Functions
- Testing for an Empty Stack
- Push
- Pop
- Peek
- Example
Contents: Notes N17
- Searching, cf. Sav: 9.3, pp 549ff
- Linear Search
- Presupposition about the Code
- Linear Search Code
- Binary Search, cf. Sav: 12.3, pp 725ff
- Example
- Binary Search Code
- Brief Analysis
Contents: Notes N18
- Conditional Operator (not in Savitch)
- Example
Contents: Notes N19
- Back to C++: Preliminary, Sav: 12.1, 12.2, 12.3, pp 702-47
- Recursion
- Fibonacci Numbers Sample C++ Code
- Reverse Example
- Procedure Example
Contents: Notes N20
- Introduction to Abstract Data Types: Pointers, Sav: 11.1, p 654ff
- Concepts and Definitions: Part 1 -- Lists, Sav: 14.1, p 784ff
- Concepts and Definitions: Part 2 -- Trees (Not in Sav)
- Defining Pointer Types in C/C++
- Using Pointer Variabes
- Allocating Space for Nodes
- Example
- Recursion and List Generation
- Trees and Traversals, i.e., "Visiting" Nodes
- Traversing Unbalanced Trees
- Sample Program -- MP10A
Contents: Notes N21
- Overloading Functions, Sav: 3.6, pp 150-58
- Example of Overloaded Functions
- Another Example of Overloaded Functions
- Overloading Operators, Sav: 8.1, pp 458-63
- Example of Overloaded Operators
Contents: Notes N22
- Pointers and Arrays, Sav: 11.2, pp 669-77
- Example
- Dynamically Allocating Arrays
- Deleting Dynamically Allocated Arrays
- Revised Example
Contents: Notes N23
- Background "Problem", Sav: 13.1, pp 750ff; 13.2, pp 762ff
- Simple Example: Swap in Template Format
- Template Version of Exchange Sort
- Limits to Templates
- Complete Example
- Caveat
Contents: Notes N24
Notes N24 contains materials about machine level programming, which
is not addressed in Savitch in any detail. There is a reference to
machine level programming in sec. 1.1, p 9.
Contents: Notes S1, S2, S3
Notes S1, S2, S3 contain material regarding the relationship of
computers and technology to ethical and societal concerns. There
is no material in Savitch corresponding to these topics.
Contents: Notes M1
- friend Attribute, Sav: 8.1, p 438ff
- static Attribute for Function Variables (not in Savitch)
- const Attribute for Function Parameters, Sav: 8.1, pp 453-57
- Parameters to main
Contents: Notes M2, M3
Notes M2 (C standard i/o) contains materials regarding the
standard C input and output functions, scanf and printf.
This material is not convered in Savitch.
Notes M3 (Linked List implementation of Stacks) is covered in
Savitch, 14.2, pp 800-806.
Notes M3 (Header Files and Separate Compilation) is covered in
Savitch, 8.2, pp 478ff.
This page is maintained by Dennis C. Smolarski, S.J.
dsmolarski@math.scu.edu
© Copyright 1998 Dennis C. Smolarski, SJ, All rights reserved.
Last changed: 9 December 1998. Minor changes: 8 June 1999 and 3 July 2001.