- We will send in 10–14 business days.
/images/books/4246593/9780763757564.jpg)
- Author: William McAllister
- Publisher: Jones & Bartlett Publishers
- ISBN-10: 076375756X
- ISBN-13: 9780763757564
- Format: 18.5 x 22.9 x 3.1 cm, softcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
With an accessible writing style and manageable amount of content, Data Structures and Algorithms Using Java is the ideal text for your course. This outstanding text correlates to the recommended syllabus put forth by the Association of Computing Machinery standard curriculum guidelines. The author has produced a resource that is more readable and instructional than any other, without compromising the scope of the ACM CS103, Data Structures and Algorithms, course material. The text's unique, student-friendly pedagogical approach and organizational structure will keep students engaged in the process of self-directed investigative discovery both inside and outside the classroom. The pedagogical features of the text, based on the author's 30 years of teaching experience, include succinct code examples, a unique common template used as the organizational basis of each chapter, the use of pseudocode to present the major algorithms developed in the text, nearly 300 carefully designed figures, and a concise review of Java.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.01:45:45
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: William McAllister
- Publisher: Jones & Bartlett Publishers
- ISBN-10: 076375756X
- ISBN-13: 9780763757564
- Format: 18.5 x 22.9 x 3.1 cm, softcover
- Language: English English
With an accessible writing style and manageable amount of content, Data Structures and Algorithms Using Java is the ideal text for your course. This outstanding text correlates to the recommended syllabus put forth by the Association of Computing Machinery standard curriculum guidelines. The author has produced a resource that is more readable and instructional than any other, without compromising the scope of the ACM CS103, Data Structures and Algorithms, course material. The text's unique, student-friendly pedagogical approach and organizational structure will keep students engaged in the process of self-directed investigative discovery both inside and outside the classroom. The pedagogical features of the text, based on the author's 30 years of teaching experience, include succinct code examples, a unique common template used as the organizational basis of each chapter, the use of pseudocode to present the major algorithms developed in the text, nearly 300 carefully designed figures, and a concise review of Java.
Reviews