Introduction to Computer Science with C++

1. COMPUTER SCIENCE, COMPUTER ARCHITECTURE, AND COMPUTER LANGUAGES. Computer Science: A Preview. Computer Architecture. Computer Languages. 2. PROBLEM SOLVING FUNDAMENTALS: DATA TYPES AND OUTPUT. Program Development - Top-Down Design. Writing Programs. Data Types and Output. 3. MORE PROBLEM SOLVING FUNDAMENTALS: CALCULATION AND INPUT. Arithmetic in C++. Using Variables. Input. String Variables. Using Constants. Library Functions. Type Compatibility and Type Conversion. 4. SUBPROGRAMS: FUNCTIONS FOR PROBLEM SOLVING. Program Design. User-Defined Functions. Parameters. Functions as Subprograms. Scope of Identifiers. Programmer-Defined Libraries. SELECTION STATEMENTS. Boolean Expressions. if Statements. if. .. else Statements. Nested and Extended if Statements. switch Statements. Assertions. 5. REPETITION STATEMENTS. Classifying Loops. The for Loop. while Loops. do. .. while Loops. Loop Verification (Optional). Nested Loops. Repetition and Selection. 6. FILES. Streams and Stream Processing. Using Functions with Files. Character Input and Output. 7. BUILDING STRUCTURED DATA: STRUCTS AND CLASSES. The Struct Data Type. Introduction to User-Defined Classes. Object-Oriented Programming and Software Maintenance. A Rational Number Class. Derived Classes and Inheritance. 8. BUILDING STRUCTURED DATA: ARRAYS. Arrays. Using Arrays. Array Parameters and Functions. Sorting and Searching an Array. Two-Dimensional Arrays. Safe Arrays: Vectors. Strings. Safe Arrays: Matrices. 9. ALGORITHM ANALYSIS: SPACE AND TIME CONSIDERATIONS. Designing Programs: A Look Back and a Look Ahead. Simple Sorting Algorithms. Which Sort Is Best? A Big-O Analysis. The Time/Space Trade-off: Pointer Sort and Radix Sort. Simple Search Algorithms. 10. DATA ABSTRACTION AND OBJECT-ORIENTED SOFTWARE ENGINEERING. Ordered Collections. Sorted Collections. One-key Tables. Two-key Tables. Revisiting the Analysis Phase of the Software Engineering Life Cycle. Revisiting the Design Phase of the Software Engineering Life Cycle. Revisiting the Implementation and Testing Phases of the Software Engineering Life Cycle. 11. LINKED LISTS. The Need for Linked Lists. The Concept of a Linked List. Defining the Linked List ADT as a C++ Class. Pointers and the Management of Computer Memory. Using a Linked List to Implement a One-Key Table. 12. STACKS AND QUEUES. The Stack Abstract Data Type and Its Implementation. An Application of Stacks: Parsing and Evaluating Arithmetic Expressions. The Queue Abstract Data Type: Its Use and Implementations. 13. RECURSION. Controlling Simple Iteration with Recursion. Weaving More Complex Recursive Patterns. Recursion, Trial-and-Error Backtracking, and Generalized Nested Loops. 14. BINARY TREES, GENERAL TREES, AND GRAPHS. General Trees and Binary Trees as Abstract Data Types. Linked Implementation of a Binary Tree. Binary Search Tree Implementation of a One-Key Table. Linear Implementation of the Binary Tree Abstract Data Type. General Trees.