CONCRETE ABSTRACTIONS offers students a hands-on, abstraction-based experience of thinking like a computer scientist. This text covers the basics of programming and data structures, and gives first-time computer science students the opportunity to not only write programs, but to prove theorems and analyze algorithms as well. Students learn a variety of programming styles, CONCRETE ABSTRACTIONS offers students a hands-on, abstraction-based experience of thinking like a computer scientist. This text covers the basics of programming and data structures, and gives first-time computer science students the opportunity to not only write programs, but to prove theorems and analyze algorithms as well. Students learn a variety of programming styles, including functional programming, assembly-language programming, and object-oriented programming (OOP). While most of the book uses the Scheme programming language, Java is introduced at the end as a second example of an OOP system and to demonstrate concepts of concurrent programming.
Concrete Abstractions: An Introduction to Computer Science Using Scheme
CONCRETE ABSTRACTIONS offers students a hands-on, abstraction-based experience of thinking like a computer scientist. This text covers the basics of programming and data structures, and gives first-time computer science students the opportunity to not only write programs, but to prove theorems and analyze algorithms as well. Students learn a variety of programming styles, CONCRETE ABSTRACTIONS offers students a hands-on, abstraction-based experience of thinking like a computer scientist. This text covers the basics of programming and data structures, and gives first-time computer science students the opportunity to not only write programs, but to prove theorems and analyze algorithms as well. Students learn a variety of programming styles, including functional programming, assembly-language programming, and object-oriented programming (OOP). While most of the book uses the Scheme programming language, Java is introduced at the end as a second example of an OOP system and to demonstrate concepts of concurrent programming.
Compare
Tst –
Joe –
Sky –
Samantha –
Richard –
Finn Kuusisto –
Wade McReynolds –
Rajkumar –
Alejandro Pulver –
notv –
James Mccarron –
Himanshu –
sva –
Dnyaneshwer Pendurkar –
Andy Legkiy –
Rajasekaran –
Delilah –
J –
rev –
Robert –
David –
Fernando Meyer –
OhNancy –
Sergei –
hyacinth –
Prahlad –
Mohamed Badawi –
Bharat –
Sushma Rayanagoudar –
Andrew –
Arturo –
Amr Farid –
Joe Antognini –