This text takes a fairly rigorous, hands-on, and abstraction-based approach to teaching the basics of programming and data structures, using Scheme as the language of implementation. The authors feel strongly that since computer scientists not only write programs but also prove theorems and analyze algorithms, this book should provide first-year students the opportunity to do these things as well, and experience at first hand how computer scientists think. In addition, students learn a variety of programming models (called paradigms), including both assembly-language and object-oriented programming (OOP). Although most of the book uses Scheme, Java is introduced at the end as a second language to demonstrate concepts of OOP and concurrent programming.
This text takes a fairly rigorous, hands-on, and abstraction-based approach to teaching the basics of programming and data structures, using Scheme as the language of implementation. The authors feel strongly that since computer scientists not only write programs but also prove theorems and analyze algorithms, this book should provide first-year students the opportunity to do these things as well, and experience at first hand how computer scientists think. In addition, students learn a variety of programming models (called paradigms), including both assembly-language and object-oriented programming (OOP). Although most of the book uses Scheme, Java is introduced at the end as a second language to demonstrate concepts of OOP and concurrent programming.
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Illustrationen
Maße
Höhe: 241 mm
Breite: 197 mm
Gewicht
ISBN-13
978-0-534-95211-2 (9780534952112)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
1. Computer Science and Programming. 2. Recursion and Induction. 3. Iteration and Invariants. 4. Orders of Growth and Tree recursion. 5. Higher Order Procedures. 6. Compound Data and Data Abstraction. 7. Lists. 8. Trees. 9. Generic Operations. 10. Implementing Programming Languages. 11. Computers with Memory. 12. Dynamic Programming. 13. Object Based Abstractions. 14. Object Oriented Programming. Appendix A. Non-standard extensions to Scheme Non-Standard Procedures and Features of Scheme. B. The R4RS Scheme Standard.