Data Structure and Algorithm in C++ (Fourth Edition)

Adam Drozdek

Published by Course Technology/Cengage Learning India, 2013
Used / Softcover / Quantity Available: 0
Available From More Booksellers
View all  copies of this book

About the Book

We're sorry; this specific copy is no longer available. Here are our closest matches for Data Structure and Algorithm in C++ (Fourth Edition) by Adam Drozdek.

Description:

MEANINGFUL CASE STUDIES REINFORCE KEY CONCEPTS WITH MEMORABLE, PRACTICAL APPLICATIONS. Dynamic case studies in most of this edition`s chapters further highlight key concepts while providing insights into a broad range of practical data structures implementation. EXTENSIVE THEORETICAL ANALYSIS ENABLES YOU TO SEAMLESSLY INTEGRATE ALGORITHMS WHILE ENCOURAGING ABSTRACT THINKING. This edition`s well-developed theoretical analysis centers on both the complexity and efficiency of algorithms to help you cultivate your students` strong abstract-thinking skills with an approach that enables you to seamlessly integrate algorithms into your course. ABUNDANCE OF MEANINGFUL C++ CODE EXAMPLES ILLUSTRATE THE IMPORTANCE OF DATA STRUCTURES. Manageable examples of C++ code throughout this edition reinforce the practical importance of data structures as readers work to design, implement, test, or maintain virtually any software system. CLEAR PRESENTATION OF RECURSION CLARIFIES THIS FREQUENTLY CONFUSING TOPIC. Author Adam Drozdeck draws from his extensive teaching experience to offer a precise, class-tested presentation of recursion within the context of the run-time stack. The author carefully shows the changes at each step of the run-time stack to provide a clear, illustrative hook for students to grasp. APPROACH EMPHASIZES INFORMATION-HIDING AND OTHER ADVANCED ENCAPSULATIONAND DECOMPOSITION PRINCIPLES. This comprehensive edition provides students with a solid foundation in data structures while exploring more progressive topicssuch as information-hiding principles to advance encapsulation and decompositionthat underscore today`s current design and implementation paradigm. 1. Object-Oriented Programming Using C++. 2. Complexity Analysis. 3. Linked Lists. 4. Stacks and Queues. 5. Recursion. 6. Binary Trees. 7. Multiway Trees. 8. Graphs. 9. Sorting. 10. Hashing. 11. Data Compression. 12. Memory Management. 13. String Matching. Appendix A: Computing BIG-O. Appendix B: Algorithms in the Standard Template Appendix C: NP-Completeness Printed Pages: 808. Bookseller Inventory #

About this title:

Book ratings provided by Goodreads:
3.75 avg rating
(57 ratings)

Synopsis: Paperback International Edition ... Same contents as in the US edition at Low Cost !!

"About this title" may belong to another edition of this title.

Bibliographic Details

Title: Data Structure and Algorithm in C++ (Fourth ...
Publisher: Course Technology/Cengage Learning India
Publication Date: 2013
Binding: Softcover
Book Condition: New
Edition: 4th edition.

Top Search Results from the AbeBooks Marketplace

1.

Adam Drozdek
Published by Cengage Learning Publishers (2013)
ISBN 10: 8131521265 ISBN 13: 9788131521267
New Paperback Quantity Available: 1
Seller:
BookVistas
(New Delhi, DELHI, India)
Rating
[?]

Book Description Cengage Learning Publishers, 2013. Paperback. Condition: New. Special 20% discount on this book. Seller Inventory # InEx-9788131521267

More information about this seller | Contact this seller

Buy New
US$ 11.98
Convert Currency

Add to Basket

Shipping: US$ 9.73
From India to U.S.A.
Destination, Rates & Speeds

2.

Adam Drozdek
Published by Course Technology/Cengage Learning India (2013)
ISBN 10: 8131521265 ISBN 13: 9788131521267
New Softcover Quantity Available: > 20
Seller:
BookVistas
(New Delhi, DELHI, India)
Rating
[?]

Book Description Course Technology/Cengage Learning India, 2013. Softcover. Condition: New. 4th edition. MEANINGFUL CASE STUDIES REINFORCE KEY CONCEPTS WITH MEMORABLE, PRACTICAL APPLICATIONS. Dynamic case studies in most of this edition`s chapters further highlight key concepts while providing insights into a broad range of practical data structures implementation. EXTENSIVE THEORETICAL ANALYSIS ENABLES YOU TO SEAMLESSLY INTEGRATE ALGORITHMS WHILE ENCOURAGING ABSTRACT THINKING. This edition`s well-developed theoretical analysis centers on both the complexity and efficiency of algorithms to help you cultivate your students` strong abstract-thinking skills with an approach that enables you to seamlessly integrate algorithms into your course. ABUNDANCE OF MEANINGFUL C++ CODE EXAMPLES ILLUSTRATE THE IMPORTANCE OF DATA STRUCTURES. Manageable examples of C++ code throughout this edition reinforce the practical importance of data structures as readers work to design, implement, test, or maintain virtually any software system. CLEAR PRESENTATION OF RECURSION CLARIFIES THIS FREQUENTLY CONFUSING TOPIC. Author Adam Drozdeck draws from his extensive teaching experience to offer a precise, class-tested presentation of recursion within the context of the run-time stack. The author carefully shows the changes at each step of the run-time stack to provide a clear, illustrative hook for students to grasp. APPROACH EMPHASIZES INFORMATION-HIDING AND OTHER ADVANCED ENCAPSULATIONAND DECOMPOSITION PRINCIPLES. This comprehensive edition provides students with a solid foundation in data structures while exploring more progressive topicssuch as information-hiding principles to advance encapsulation and decompositionthat underscore today`s current design and implementation paradigm. 1. Object-Oriented Programming Using C++. 2. Complexity Analysis. 3. Linked Lists. 4. Stacks and Queues. 5. Recursion. 6. Binary Trees. 7. Multiway Trees. 8. Graphs. 9. Sorting. 10. Hashing. 11. Data Compression. 12. Memory Management. 13. String Matching. Appendix A: Computing BIG-O. Appendix B: Algorithms in the Standard Template Appendix C: NP-Completeness Printed Pages: 808. Seller Inventory # 77668

More information about this seller | Contact this seller

Buy New
US$ 19.30
Convert Currency

Add to Basket

Shipping: US$ 9.73
From India to U.S.A.
Destination, Rates & Speeds

3.

Adam Drozdek
Published by Course Technology/Cengage Learning India (2013)
ISBN 10: 8131521265 ISBN 13: 9788131521267
New Softcover Quantity Available: > 20
Seller:
Sanctum Books
(New Delhi, DELHI, India)
Rating
[?]

Book Description Course Technology/Cengage Learning India, 2013. Softcover. Condition: New. 4th edition. MEANINGFUL CASE STUDIES REINFORCE KEY CONCEPTS WITH MEMORABLE, PRACTICAL APPLICATIONS. Dynamic case studies in most of this edition`s chapters further highlight key concepts while providing insights into a broad range of practical data structures implementation. EXTENSIVE THEORETICAL ANALYSIS ENABLES YOU TO SEAMLESSLY INTEGRATE ALGORITHMS WHILE ENCOURAGING ABSTRACT THINKING. This edition`s well-developed theoretical analysis centers on both the complexity and efficiency of algorithms to help you cultivate your students` strong abstract-thinking skills with an approach that enables you to seamlessly integrate algorithms into your course. ABUNDANCE OF MEANINGFUL C++ CODE EXAMPLES ILLUSTRATE THE IMPORTANCE OF DATA STRUCTURES. Manageable examples of C++ code throughout this edition reinforce the practical importance of data structures as readers work to design, implement, test, or maintain virtually any software system. CLEAR PRESENTATION OF RECURSION CLARIFIES THIS FREQUENTLY CONFUSING TOPIC. Author Adam Drozdeck draws from his extensive teaching experience to offer a precise, class-tested presentation of recursion within the context of the run-time stack. The author carefully shows the changes at each step of the run-time stack to provide a clear, illustrative hook for students to grasp. APPROACH EMPHASIZES INFORMATION-HIDING AND OTHER ADVANCED ENCAPSULATIONAND DECOMPOSITION PRINCIPLES. This comprehensive edition provides students with a solid foundation in data structures while exploring more progressive topicssuch as information-hiding principles to advance encapsulation and decompositionthat underscore today`s current design and implementation paradigm. 1. Object-Oriented Programming Using C++. 2. Complexity Analysis. 3. Linked Lists. 4. Stacks and Queues. 5. Recursion. 6. Binary Trees. 7. Multiway Trees. 8. Graphs. 9. Sorting. 10. Hashing. 11. Data Compression. 12. Memory Management. 13. String Matching. Appendix A: Computing BIG-O. Appendix B: Algorithms in the Standard Template Appendix C: NP-Completeness Printed Pages: 808. Seller Inventory # 77668

More information about this seller | Contact this seller

Buy New
US$ 28.95
Convert Currency

Add to Basket

Shipping: US$ 8.84
From India to U.S.A.
Destination, Rates & Speeds