My Account Details

ISBN10: 0070308683 | ISBN13: 9780070308688

Step 1 . Download Adobe Digital Editions to your PC or Mac desktop/laptop.
Step 2. Register and authorize your Adobe ID (optional). To access your eBook on multiple devices, first create an Adobe ID at account.adobe.com. Then, open Adobe Digital Editions, go to the Help menu, and select "Authorize Computer" to link your Adobe ID.
Step 3. Open Your eBook. Use Adobe Digital Editions to open the file. If the eBook doesn’t open, contact customer service for assistance.
This powerful study tool is the best tutor you can have if you want top grades and thorough understanding of the fundamentals of computing with C++, the computing language taught at 83% of all colleges. This student-friendly study guide leads you step-by-step through the entire computer science course, giving you 420 problems with fully worked solutions and easy-to-follow examples for every new topic. You get complete explanations of data abstraction, recursion, Standard C++ container classes, searching, sorting algorithms, and other complex concepts, simplified and illustrated so they're easy to grasp. You also get additional practice problems to solve on your own, working at your own speed. This superb study guide covers the entire course, from logic to libraries. If you're taking introduction to computer science, this book will be your best friend. It's perfect for independent study, too!
Introduction to Computing. Logic. Control Structures. Algorithms. Text Processing. Arrays. Data Abstraction. Inheritance. Polymorphism. Containers. Recursion. Mathematical Induction. Sorting. Complexity Analysis. Hash Tables. Linked Lists. Trees. External Structures. Graphs. Simultation. Appendices: A: C++ Syntax. B: Standard C++ Libraries. C: C++ Syntax. D: Logarithms. E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
Control Structures. Algorithms. Text Processing. Arrays. Data Abstraction. Inheritance. Polymorphism. Containers. Recursion. Mathematical Induction. Sorting. Complexity Analysis. Hash Tables. Linked Lists. Trees. External Structures. Graphs. Simultation. Appendices: A: C++ Syntax. B: Standard C++ Libraries. C: C++ Syntax. D: Logarithms. E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
Text Processing. Arrays. Data Abstraction. Inheritance. Polymorphism. Containers. Recursion. Mathematical Induction. Sorting. Complexity Analysis. Hash Tables. Linked Lists. Trees. External Structures. Graphs. Simultation. Appendices: A: C++ Syntax. B: Standard C++ Libraries. C: C++ Syntax. D: Logarithms. E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
Data Abstraction. Inheritance. Polymorphism. Containers. Recursion. Mathematical Induction. Sorting. Complexity Analysis. Hash Tables. Linked Lists. Trees. External Structures. Graphs. Simultation. Appendices: A: C++ Syntax. B: Standard C++ Libraries. C: C++ Syntax. D: Logarithms. E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
Polymorphism. Containers. Recursion. Mathematical Induction. Sorting. Complexity Analysis. Hash Tables. Linked Lists. Trees. External Structures. Graphs. Simultation. Appendices: A: C++ Syntax. B: Standard C++ Libraries. C: C++ Syntax. D: Logarithms. E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
Recursion. Mathematical Induction. Sorting. Complexity Analysis. Hash Tables. Linked Lists. Trees. External Structures. Graphs. Simultation. Appendices: A: C++ Syntax. B: Standard C++ Libraries. C: C++ Syntax. D: Logarithms. E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
Sorting. Complexity Analysis. Hash Tables. Linked Lists. Trees. External Structures. Graphs. Simultation. Appendices: A: C++ Syntax. B: Standard C++ Libraries. C: C++ Syntax. D: Logarithms. E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
Hash Tables. Linked Lists. Trees. External Structures. Graphs. Simultation. Appendices: A: C++ Syntax. B: Standard C++ Libraries. C: C++ Syntax. D: Logarithms. E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
Trees. External Structures. Graphs. Simultation. Appendices: A: C++ Syntax. B: Standard C++ Libraries. C: C++ Syntax. D: Logarithms. E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
Graphs. Simultation. Appendices: A: C++ Syntax. B: Standard C++ Libraries. C: C++ Syntax. D: Logarithms. E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
Appendices: A: C++ Syntax. B: Standard C++ Libraries. C: C++ Syntax. D: Logarithms. E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
C: C++ Syntax. D: Logarithms. E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
E: Factorials, Permutations, and Combinations. F: Stirling's Formula. G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
G: Catalan Numbers. H: Counting Principles. I: Recurrence Relations. J: References.
I: Recurrence Relations. J: References.
Need support? We're here to help - Get real-world support and resources every step of the way.