Data Structures In Algorithms and Application in C ++ By Sahani

Key Features: Gradual development of C++ features not found in C. The C++ features are introduced on an as needed basis so that the course focus does not become \"programming in C++.\" Allows students with either a background in C or C++ to be able to comprehend topics in this book. Data Structure Application sections found at the end of each chapter in Part 2 of the book. The value of each data structure is illustrated through the use of several applications drawn from a variety of areas. Students immediately see that each structure will be useful to them in their future work. Algorithm Application sections found in each design method chapter. The first section of each of these chapters describes the design method. The remaining sections apply the method to solve real world applications. Allows students to compare the efficiency of the solution resulting from the design method and some other methods. \"Bird\'s Eye View\" Chapter Openers. Provides a brief overview of the topics covered in the chapter together with the new C++ features used. Table of Content: Part I Preliminaries 1 Programming in C++ 2 Program Performance Part II Data Structures 3 Data Representation 4 Arrays and Matrices 5 Stacks 6 Queues 7 Skip Lists and Hashing 8 Binary and Other Trees 9 Priority Queues 10 Tournament Trees 11 Search Trees 12 Graphics Part III Algorithm-Design Methods 13 The Greedy Method 14 Divide-and-Conquer 15 Dynamic Programming 16 Backtracking