1       Software Engineering Principles                                      

1.1      The Software Process 

1.2      Program Design          

1.3      Verification of Software Correctness  

2  Data Design and Implementation                                        

2.1      Different Views of Data 

2.2      Abstraction and Built-In Types 

2.3      Higher-Level Abstraction and the C++ Class Type     

2.4      Object-Oriented Programming 

2.5      Constructs for Program Verification    

3  ADT Unsorted List                                                              

3.1      Lists     

3.2      Abstract Data Type Unsorted List       

3.3      Pointer Types   

3.4      Implementing class UnsortedType as a Linked Structure      

3.5      Comparison of Algorithms       

3.6   Comparing Unsorted List Implementations        

4  ADT Sorted List                                                                  

4.1      Abstract Data Type Sorted List         

4.2      Dynamically Allocated Arrays  

4.3      Implementing the Sorted List as a Linked Structure   

4.4      Comparison of Unsorted and Sorted List ADT Algorithms     

4.5      Bounded and Unbounded ADTs          

5  ADTs Stack and Queue                                                     

5.1      Stacks  

5.2      Implementing a Stack as a Linked Structure5.2          

5.3      Queues 

5.4      Implementing a Queue as a Linked Structure 

6  Lists Plus                                                                         

6.1   More about Generics: C++ Templates   

6.2      Circular Linked Lists    

6.3      Doubly Linked Lists      

6.4      Linked Lists with Headers and Trailers           

6.5      Copy Structures           

6.6      A Linked List as an Array of Records  

6.7      Polymorphism with Virtual Functions  

6.8      A Specialized List ADT 

7  Programming with Recursion                                             

7.1      What Is Recursion?     

7.2      The Classic Example of Recursion     

7.3      Programming Recursively       

7.4      Verifying Recursive Functions 

7.5      Writing Recursive Functions   

7.6      Using Recursion to Simplify Solutions 

7.7      Recursive Linked List Processing       

7.8      A Recursive Version of Binary Search 

7.9      Recursive Versions of InsertItem and DeleteItem       

7.10    How Recursion Works 

7.11    Tracing the Execution of Recursive Function Insert   

7.12    Debugging Recursive Routines           

7.13    Removing Recursion   

7.14    Deciding Whether to Use a Recursive Solution          

8  Binary Search Trees                                                           

8.1      Trees    

8.2      Logical Level    

8.3      Application Level          

8.4      Implementation Level   

8.5      Recursive Binary Search Tree Operations     

8.6      Iterative Insertion and Deletion 

8.7      Comparing Binary Search Trees and Linear Lists      

8.8      A Nonlinked Representation of Binary Trees   

 

9  Priority Queues, Heaps, Graphs, and Sets                       

9.1      ADT Priority Queue      

9.2      Heaps   

9.3      Graphs 

9.4      Sets       

 

10  Sorting and Searching Algorithms                                   

10.1    Sorting  

10.2    Searching         

10.3    Hashing 

10.4    Radix Sort