[计算机程序设计艺术 英文版] Procedure for Reading This Set of Books

Procedure for Reading

This Set of Books

1.Begin reading this procedure , unless you have already begun to read it.Continue to follow the steps faithfully.(The general form of this procedure and its accompanying flow chart will be used throughout this book.)

2.Read the Notes on he Exercises , on pages xv-xvii.

3.Set N equal to 1.

4.Begin reading Chapter N. Do not read the quotations that appear at the beginning of th chapter.

5.Is the subject of the chapter intereting to you ? If so , go to step 7; if not, go to step 6.

6.Is N<= 2 ? If not , go to step 16 ; if so , scan through the chapter anyway . ( Chapters 1 and 2 contain important introductory material and also a review of basic programming techniques. You should at least skim over the sections on notation and about MIX.)

7.Begin reading the next section of the chapter ; if you have already reached the end of the chapter , however , go to step 16.

8.Is section number marked with "*" ? If so, you may omit this section on first reading (it covers a rather specialixed topic that is interesting but not essential ); go back to step 7.

9.Are you mathematically inclined ? If math is all Greek to you , go to step 11 ; otherwise proceed to step 10

10.Check the mathematical derivations made in this section (and report errors to the author). Go to step 12.

11.If the current section if full of mathematical computations , you had better omit reading the derivations. However , you should become familiar with the basic results of the section ; they are usually stated near the beginning ,or in slanted type right at the very end of the hard parts.

12.work the recommended exercises in this section in accoredance with the hints giben in the Notes on the Exercises ( which you read in step 2 ).

13.After you have worked on the exercises to your satisfaction , check your answers with the answers printed in the corresponding answer section at the rear of the book ( if any answer appears for that problem ). Also read the answers to the exercises you did not have time to work . Note : In most cases it is reasonable to read the answer to exercise n before working on exercise n+1 , so steps 12 - 13 are usually done simultaneously .

14.Are you tired ? If not , go back to step 7 .

15.Go to sleep . Then wake up , and go back to step 7.

16.Increase N by one . If N = 3,5,7,9,11,or 12,begin the next volume of this set of books .

17.If N is less than or equal to 12 , go back to step 4.

18.Congratulations . Now try to get your friends to purchase a copy of Volume 1 and to start reading it . Also , go vack to step 3 .

--------------------------------------------

小结:初步入门,为了理解中国以外的世界,不然,就像个井底之蛙

--------------------------------------------

时间: 2024-10-12 14:12:20

[计算机程序设计艺术 英文版] Procedure for Reading This Set of Books的相关文章

[计算机程序设计艺术 英文版] NOTES ON THE EXERCISES

NOTES ON THE EXERCISES THE EXERCISES in this set of books have been designed for self-study as well as classroom study. It is difficult, if not impossible, for anyone to learn a subject purely by reading about it, without applying the information to

《计算机程序设计艺术》pdf

下载地址:网盘下载 内容简介 编辑 本书作者D. E. Knuth是在计算机学界十分著名的学者,在本领域享有很高权威和盛名,他的这部著作是无数计算机专业人员的学习教材和参考读物,也是许多专业研究工作者经常阅读的经典.本书已被翻译为几十种文字在世界各地出版,英文原版书在国外已经是第11次印刷. 该书1999年底被American Scientist列为20世纪最佳12部学术专著之一(与狄拉克的量子力学.爱因斯坦的相对论.曼德布罗特的分形论.鲍林的化学键.罗素和怀特海德的数学原理.冯诺意曼和摩根斯坦

计算机程序设计艺术(第一卷) 基本算法 第3版pdf

下载地址:网盘下载 内容简介  · · · · · · <计算机程序设计艺术>系列著作对计算机领域产生了深远的影响.这一系列堪称一项浩大的工程,自1962年开始编写,计划出版7卷,目前已经出版了4卷.<美国科学家>杂志曾将这套书与爱因斯坦的<相对论>等书并列称为20世纪最重要的12本物理学著作.目前Knuth正将毕生精力投入到这部史诗性著作的撰写中.想了解本书最新信息,请访http://www-cs-faculty.stanford.edu/~knuth/taocp.h

计算机程序设计艺术+第3卷:排序与查找(第二版)pdf

下载地址:网盘下载 第3卷的头一次修订对经典计算机排序和查找技术做了最全面的考察.它扩充了第1卷对数据结构的处理,以将大小数据库和内外存储器一并考虑:遴选了精心核验的计算机方法,并对其效率做了定量分析.第3卷的突出特点是对"最优排序"一节的修订和对排列论与通用散列法的讨论. Donald.E.Knuth(唐纳德.E.克努特,中文名高德纳)是算法和程序设计技术的先驱者,是计算机排版系统TEX和METAFONT的发明者,他因这些成就和大量创造性的影响深远的著作(19部书和160篇论文)而誉

计算机程序设计艺术+第2卷:半数值算法(第三版)pdf

下载地址:网盘下载 本书是国内外业界广泛关注的7卷本<计算机程序设计艺术>第2卷的最新版.本卷对半数值算法领域做了全面介绍,分"随机数"和"算术"两章.本卷总结了主要算法范例及这些算法的基本理论,广泛剖析了计算机程序设计与数值分析间的相互联系,其中特别值得注意的是作者对随机数生成程序的重新处理和对形式幂级数计算的讨论. 本书附有大量习题和答案,标明了难易程度及数学概念的使用. 本书内容精辟,语言流畅,引人入胜,可供从事计算机科学.计算数学.计算技术诸方面

计算机程序设计艺术+第1卷:基本算法(第三版)pdf

下载地址:网盘下载 第1卷首先介绍编程的基本概念和技术,然后详细讲解信息结构方面的内容,包括信息在计算机内部的表示方法.数据元素之间的结构关系,以及有效的信息处理方法.此外,书中还描述了编程在模拟.数值方法.符号计算.软件与系统设计等方面的初级应用.此第3版增加了数十项简单但重要的算法和技术,并根据当前研究发展趋势在数学预备知识方面做了大量修改. 下载地址:网盘下载 原文地址:https://www.cnblogs.com/cf3276625841/p/9310622.html

湖南省第七届大学生计算机程序设计竞赛 RMQ with Shifts (线段树)

RMQ with Shifts 时间限制:1000 ms  |  内存限制:65535 KB 难度:3 描述     In the traditional RMQ (Range Minimum Query) problem, we have a static array A. Then for each query (L, R) (L<=R), we report the minimum value among A[L], A[L+1], -, A[R]. Note that the indic

湖南省第十届大学生计算机程序设计竞赛:酷酷的单词

1505: 酷酷的单词 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 237 Solved: 88 [Submit][Status][Web Board] Description 输入一些仅由小写字母组成的单词.你的任务是统计有多少个单词是"酷"的,即每种字母出现的次数都不同. 比如ada是酷的,因为a出现2次,d出现1次,而1和2不同.再比如,banana也是酷的,因为a出现3次,n出现2次,b出现1次.但是,bbacccd不是酷的,因

2016年湖南省第十二届大学生计算机程序设计竞赛---Parenthesis(线段树求区间最值)

原题链接 http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1809 Description Bobo has a balanced parenthesis sequence P=p1 p2…pn of length n and q questions. The i-th question is whether P remains balanced after pai and pbi  swapped. Note that questions ar