Exploring computer science with Scheme
Author(s)
Bibliographic Information
Exploring computer science with Scheme
(Undergraduate texts in computer science)
Springer, 1997
- alk. paper
Available at 16 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes index
Description and Table of Contents
Description
A presentation of the central and basic concepts, techniques, and tools of computer science, with the emphasis on presenting a problem-solving approach and on providing a survey of all of the most important topics covered in degree programmes. Scheme is used throughout as the programming language and the author stresses a functional programming approach to create simple functions so as to obtain the desired programming goal. Such simple functions are easily tested individually, which greatly helps in producing programs that work correctly first time. Throughout, the author aids to writing programs, and makes liberal use of boxes with "Mistakes to Avoid." Programming examples include: * abstracting a problem; * creating pseudo code as an intermediate solution; * top-down and bottom-up design; * building procedural and data abstractions; * writing progams in modules which are easily testable. Numerous exercises help readers test their understanding of the material and develop ideas in greater depth, making this an ideal first course for all students coming to computer science for the first time.
Table of Contents
1 Introduction to Computer Science.- 2 Problem Solving and Problem Abstraction.- 3 Programming the Computer.- 4 Lists: The Basic Data Structure.- 5 Conditionals.- 6 Repetition Through Recursion.- 7 Data Structures.- 8 Functionals.- 9 Input and Output.- 10 Repetition Through Iteration.- 11 Advanced Uses of Functions.- 12 Database Management Systems.- 13 Compilers and Interpreters.- 14 Operating Systems.- 15 Artificial Intelligence.- 16 Soft Computing: Fuzzy Logic, Neural Networks, and Genetic Algorithms.- Colophon.
by "Nielsen BookData"