Exploring Computer Science with SchemeSpringer Science & Business Media, 17 thg 4, 2013 - 582 trang The aim of this textbook is to present the central and basic concepts, techniques, and tools of computer science. The emphasis is on presenting a problem-solving approach and on providing a survey of all of the most important topics covered in computer science degree programmes. Scheme is used throughout as the programming language and the author stresses a functional programming approach which concentrates on the creation of simple functions that are composed to obtain the desired programming goal. Such simple functions are easily tested individually. This greatly helps in producing programs that work right first time. Throughout, the author presents techniques to aid in the writing of programs and makes liberal use of boxes which present "Mistakes to Avoid." Many programming examples are discussed in detail which illustrate general approaches to programming. These 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 the readers test their understanding of the material and develop some ideas in greater depth. As a result this text will make an ideal first course for all students coming to computer science for the first time. |
Nội dung
| 1 | |
| 2 | |
| 3 | |
| 4 | |
| 6 | |
1 | 10 |
Advanced Uses of Functions | 11 |
Problem Solving and Problem Abstraction | 13 |
10 | 241 |
Repetition Through Iteration | 243 |
6 | 252 |
Advanced Uses of Functions | 260 |
4 | 268 |
5 | 281 |
6 | 282 |
2 | 290 |
Operating Systems | 14 |
programs that model expert behavior in a specific task | 15 |
5 | 20 |
1 | 22 |
4 | 29 |
3 | 35 |
6 | 49 |
The Basic Data Structure | 61 |
555 | 65 |
Exercises | 80 |
Conditionals | 103 |
4 | 109 |
6 | 117 |
2 | 136 |
7 | 138 |
4 | 142 |
35 | 150 |
7 | 160 |
8 | 167 |
7 | 169 |
8 | 174 |
3 | 175 |
5 | 181 |
using lists to represent hierarchically ordered information | 188 |
30 | 196 |
Functionals | 198 |
8 | 201 |
3 | 205 |
3 | 215 |
Poker revisited yet again | 225 |
39 | 229 |
Input and Output | 231 |
Ấn bản in khác - Xem tất cả
Thuật ngữ và cụm từ thông dụng
a-list actions algorithm append apply arguments assembly language atom attribute brew.rating Brickskeller call-with-current-continuation car and cdr CD-list Chapter compiler cond null condition cons cell count-atoms create current-list data structure database define degrees move forward digits dotted lists element of list empty list error evaluated example exit expr expr-list expression frame pointer func function call function that takes fuzzy sets global variable input job-times list-ref loop map lambda memory meters my-list node num1 num2 operating system output pair parameter parse tree parsing Pat Metheny perform position problem pseudo code recursive call recursive functions relation represent rest rest-of-number result Return true return value returns a list robot Scheme selector set1 set2 solution sorted-list stack sublists subseq symbol tail recursive takes a list temp tion tree tuple Write a function yellow block zero