编程原理与实践：超越语言的解题方法

需积分: 10 36 浏览量更新于2024-07-23 收藏 1.84MB PDF 举报

"编程原理" 《编程原理》这本书旨在为读者/学生提供一种结构化的方法，以便使用计算机解决各种问题。这本书的独特之处在于它的语言独立性，它教授解决问题的步骤和工具，而不是专注于特定的编程语言。因此，配套的《编程实践：Pascal》一书也一同提供，以供实际操作练习。在学习编程原理的过程中，书中可能包含了大量的示例和详尽的解释。作者鼓励读者根据自己的需求和工作习惯，挑选最适用的部分进行学习。这不仅有助于个人化的学习路径，也能提升学习效率。提及到的"CodeWarrior Principles of Programming"可能是当时流行的一款集成开发环境（IDE），即Metrowerks CodeWarrior，它在1993年至1995年间由Metrowerks公司及其授权方持有版权。由于CodeWarrior在发布时可能存在的最后时刻变更，书中的一些信息可能已经过时，因此读者需要查阅随产品附带的最新发布说明文件以获取最准确的信息。 Metrowerks CodeWarrior不仅是IDE，还包含了一些商标，如“Metrowerks”、“Software at Work”、“CodeWarrior”、“PowerPlant”和“PowerPlant Constructor”，这些都是Metrowerks公司的注册商标。同时，书中强调了所有软件和文档都受到光盘小册子中的许可协议约束，未经Metrowerks公司书面许可，不得以任何形式复制或传输。此外，书中的版权声明还提醒我们，所有其他商标和注册商标均属于各自所有者的财产。这表明，尽管《编程原理》提供了编程的基础知识，但它也与特定的软件工具和技术环境紧密相连，读者需要意识到技术的快速发展和知识产权的重要性。通过《编程原理》的学习，读者不仅可以掌握编程的基本概念和方法，还能了解到如何在实际开发环境中应用这些原理。而《编程实践：Pascal》则提供了将理论付诸实践的机会，帮助读者巩固编程技能，形成良好的编程习惯。这两本书的结合使用，对于初学者来说是一条全面而有效的学习路径。

16 Chapter 1 A Road Map

The Road Ahead

In this section, we give a brief summary of what is in each chapter of the

Principles of Programming. A synopsis of each chapter is presented so that you

can visualize the road ahead.

• Chapter 2, Problem Solving and Computers, contains an overview of

problem solving with a computer. It introduces the idea of formulating

the solution to a problem into a set of precisely defined actions—an

algorithm. It also emphasizes that problem solving without method is

doomed, and introduces a seven step problem solving method that will

help you design, write, and run computer programs. An algorithm is

expressed in a form that can be communicated with both people and

computers through the use of a programming language and you are

shown examples an algorithm expressed in different programming

languages.

• Chapter 3, Algorithms, gives a more detailed introduction to

algorithms and discusses their necessary and desirable properties. This

chapter shows that algorithms can be represented in different ways: in

English sentences, as formulas, tables, in various graphical forms, or in

pseudocode—a stylized English that is similar to a programming

language.

• Chapter 4, Algorithm Structure, is an introduction to the construction of

algorithms using four basic blocks—forms—that are interconnected in a

simple way. The Four Fundamental Forms, Sequence, Selection,

Repetition, and Invocation are studied in some detail, including the

way in which they can be put together to create complete algorithms.

A number of examples based on everyday experiences is used to

illustrate the various forms.

• Chapter 5, Algorithm Behavior, discusses the dynamic behavior of

algorithms. A representation of the data manipulated by programs is

used to illustrate the concept of variables. The execution of various

algorithms is traced step by step in order to show how variables

operate and how their data values are changed.

• Chapter 6, Bigger Blocks, expands on the concepts introduced in

Chapter 5. In particular, this chapter shows how programs can be

made more general by using data obtained from outside the computer.

The construction of more complex algorithms, always based on

interconnects of the Four Fundamental Forms, is also demonstrated.

• Chapter 7, Better Blocks, describes in detail the concept of

subprograms. Invocations are examined to show how the various steps

of the algorithm are executed and the various ways in which data are

passed between calling program and called subprograms.

• Chapter 8 Data Structures shows that data are usually more than

simple values. Most data are more complex than that and have some

structure. In this chapter, three basic data structures are introduced:

Section 1.2 Introduction to The Principles of Programming 17

arrays, records, and sets. Arrays are groupings of homogeneous items

that are accessed by their position in the group. Records are groupings

of possibly heterogeneous items that are accessed by using names for the

individual items. Sets are collections of distinct homogeneous items

whose only property is whether they are in the group or not. This

chapter also explores the concept of an abstract data type, seen as a

class of data, defined through its values and operations.

• Chapter 9 Algorithms to Run With: The primary purpose of this

chapter is to provide more extensive examples of how to use the data

structures introduced in Chapter 8. At the same time, the chapter

introduces a number of standard algorithms that are used frequently in

programs. These algorithms are particularly concerned with sorting—

the arranging of data into a specific sequence—and searching—the

retrieval of specific data from a collection. Other ways of arranging

data (like stacks, queues, and trees) are also described. Finally, a way

of building dynamic data structures by way of pointers, is introduced.

• Chapter 10 Seven Step Method: In this final chapter, we return to the

seven step method for solving a problem on a computer that was

introduced in Chapter 2. The method is completely revised with a

complete example illustrating each step. Another complete example is

developed from start to finish..

Signs Along the Road

Although each chapter constitutes a stage in our learning journey, introducing

new topics and conventions while expanding on others, the same basic pattern is

followed:

1. Each chapter begins with a Preview that gives a summary of the

material that will be presented in the chapter. This will give you an

idea of what to expect and introduce you to the major concepts in the

chapter.

2. Next, the actual material of the chapter is provided, where the major

topics are divided into sections. Since the emphasis through each

chapter is that we learn best by example, each section has many

examples illustrating the topic being presented.

3. Following this, a Review of the material contained in the chapter is

presented in a “top ten” format. This will serve to remind you of what

you have learned and nudge you to go back and reread anything that

you have forgotten.

4. Next, a Glossary of the major terms introduced in that chapter is

provided.

5. Finally, each chapter ends with a set of Problems to solve. This is one

of the most important parts of each chapter. There are always a few

problems for which the solutions are provided in an appendix at the

18 Chapter 1 A Road Map

end of the book (Solutions Appendix). You are encouraged to try your

hand at these before looking at the solutions. In any case, programming

is an intensely practical skill that can only be acquired by practice.

Remember: “Practice makes perfect!”

Apart from following a similar pattern, each chapter uses many signs to

visually illustrate important points and concepts. The most frequently used

visual aids are note (or tip) boxes. An example is provided below.

Note: This is a tip or note box. Inside this box, important information and

tips can be found.

This is a note in

margin which

directs you to

useful

information.

In addition to tip boxes, when a paragraph briefly touches upon a subject which

is covered in more detail in another chapter, a reference is provided in the left

margin.

1.3 Computers

A Low Level View

As you progress, you’ll use the computer to do more and more complex things.

It’s always nice and sometimes even actually useful to know more about the

tools you use, so we’ll take a look here at computers.

Most computers, big or small, have the same basic capabilities: they can input

(“read”) data from an external device and store it for later use, they can

manipulate the stored data by executing the instructions that constitute a

program and they can output (“ write”) results onto an external device.

You do not need to know many details on computers in order to program them,

just as you don’t need to know many details about carburetors or transmissions in

order to drive cars. Of course, knowledge of these details may be useful, but is

not always necessary. It is only when trying to make the best and most efficient

use of computers that these details become important.

Computers differ in details, but they have a common structure. They can be

viewed as comprising four units: a processing unit, a memory unit, an input unit

and an output unit. These units are not always physically separate, but it is

useful to view them functionally this way as in Figure 1.1.

A Memory Unit stores information that can be retrieved, modified and

processed. It not only stores the data that the program will process, but also

the actual instructions of the program. This concept of a “stored program” is

extremely important, for it makes the computer into a general purpose machine

where changing the program in memory literally changes the behavior of the

machine.

Section 1.3 Computers 19

Figure 1.1 A simple computer

Memory

Input Output

Processing Unit

controls the

computer, performs

operations on data

stores information

The memory can be thought of as a collection of pigeon holes, each referenced by

a number, its “address”, just as a house number is used to reference a particular

house in a street. Each of these pigeon holes can contain an item of data or an

instruction from the program. If an item of data or an instruction is too big for a

single pigeon hole, it is split across a group of adjacent pigeon holes.

The Processing Unit has two distinct functions:

• To “control” the behavior of the entire computer, and

• To perform operations on data such as arithmetic operations and

comparisons of values.

The part of the processing unit that performs the operations on the data is often

called an ALU, arithmetic and logic unit. The processing unit maintains control

through the use of a few special purpose pigeon holes called registers. The

control part has a program register, which contains the address of the

program’s instruction that is currently being executed and an instruction register

containing this instruction. The ALU also contains working registers where the

actual operations on the data are performed.

The Input and Output Units serve either to input information (from keyboards

or from files on disks) into the memory, or to output information (to printers or

graphic displays) from the memory.

Systems and Their Environments

If the physical computer as represented in Figure 1.1 were all you had, you

would find it very hard to do much with it! In order to be able to use a computer,

you need a number of programs to make it work: these programs constitute the

software part of the computer without which the hardware does not do

anything. Also, the user of a computer is the one to tell the computer what task

to do. For these reasons, a computer is not considered by itself, but always in

relation to its environment.

In order to put computers into a proper perspective, let’s describe a Computer

System. The system shown in Figure 1.2 is a large one so that we can introduce a

lot of new terms; smaller personal computers are, of course, much simpler. In the

large computing system, notice that the computer is one small component (in the

center). This is generally referred to as the central processor unit, or CPU.

剩余525页未读，继续阅读

devilnero

粉丝: 0
资源: 6

编程原理与实践：超越语言的解题方法

Principle of Programming Language Design程序语言设计的原则

Programming Languages Principles and Practices, 3rd Edition

Principles of Programming Languages

POPL 2013-Annual Symposium on Principles of Programming Languages 2013

POPL 2012-Annual Symposium on Principles of Programming Languages 2012

POPL 2012-Annual Symposium on Principles of Programming Languages 2012论文集

POPL 2011-Annual Symposium on Principles of Programming Languages 2011论文集

POPL 2010-Annual Symposium on Principles of Programming Languages 2010论文集（proceedings of POPL 2010）

Principles of programming languages by Gilles Dowek (auth.) (z-lib.org).pdf

Principles of constraint programming

最新资源