编程原理与实践：第六版习题解答

需积分: 2 150 浏览量更新于2024-08-01 收藏 3.51MB PDF 举报

"数据结构与程序设计第六版习题答案" 在《数据结构与程序设计》第六版的习题中，我们关注的是编程原则、生命游戏（Game of Life）的演变以及编程风格。这些问题旨在深化对编程基础的理解，包括数据结构的运用、程序逻辑的分析以及代码的整洁度。 1.2 THE GAME OF LIFE（生命游戏）生命游戏是由约翰·康威提出的一种模拟生物系统的游戏，其中细胞根据简单的规则演化。习题要求手动计算图1.1中给出的配置在五代内的演变。这个问题涉及逻辑推理和模式识别，通过用两种不同颜色的棋子标记当前状态和下一状态的细胞，我们可以观察细胞的生死规律。 (a) 图形保持稳定。 (b) ... (c) ... (d) 图形保持稳定。 (e) ... (f) 图形自我重复。 (g) ... (h) ... (i) 图形自我重复。 (j) ... (k) ... (l) 图形自我重复。每个配置的结果需要依据生命游戏的规则来判断，这些规则包括： 1. 如果一个细胞周围有三个活细胞，它将在下一轮生存。 2. 如果一个活细胞周围少于两个或多于三个活细胞，它将死亡（因孤独或拥挤）。 3. 所有其他情况，细胞保持其当前状态。 1.3 PROGRAMMING STYLE（编程风格）编程风格是编写高质量、易读、易维护代码的关键。在实现以下项目时，我们需要定义合适的类和方法： (a) 电话簿程序：可以定义两个类，`Phone_book` 和 `Person`。`Phone_book` 类的方法可能包括 `look_up_name`（查找名字）、`add_person`（添加联系人）、`remove_person`（移除联系人）。`Person` 类的方法可能包含 `Look_up_number`（查找号码），同时，两个类都需要初始化和打印对象的方法。这样的设计使得程序具有良好的结构，便于管理和扩展。以上内容仅展示了《数据结构与程序设计》第六版习题的一部分，但可以看出，这些问题涵盖了从基本的逻辑运算到面向对象设计的原则，这些都是成为一名优秀程序员所必须掌握的技能。通过解答这些问题，学习者能深化对编程概念的理解，提高问题解决能力，并培养良好的编程习惯。

16 Chapter 1 • Programming Principles

{

Life configuration;

instructions();

configuration.initialize();

configuration.print(cout);

bool command;

do {

configuration.update();

configuration.print(cout);

cout << "Continue viewing without changes? " << endl;

if (!(command = user_says_yes())) {

cout << "Do you want to quit? " << flush;

if (user_says_yes()) command = false;

else {

cout << "Do you want help? " << flush;

if (user_says_yes()) instructions();

cout << "Do you want to make any changes? " << flush;

if (user_says_yes()) configuration.edit();

command = true;

}

} while (command);

cout << "Do you want to save the final position to file? " << flush;

if (user_says_yes()) {

char name[1000];

cout << "Give the save file name: " << flush;

cin >> name;

ofstream f(name);

configuration.print(f);

}

const int maxrow = 20, maxcol = 60; // grid dimensions

class Life {

public:

void initialize();

void print(ostream &f);

void update();

void edit();

private:

int grid[maxrow + 2][maxcol + 2]; // Allow two extra rows and columns.

int neighbor_count(int row, int col);

bool step_mode;

};

void Life::edit()

/* Post: User has edited configuration, and/or step mode */

{

cout << "Do you want to switch the step mode? " << flush;

if (user_says_yes()) step_mode = !step_mode;

cout << "Do you want to change the configuration? " << flush;

if (!user_says_yes()) return;

Section 1.5 • Program Maintenance 19

for (row = 1; row <= maxrow; row++) {

if (!from_file) cout << row <<":"<<flush;

for (col = 1; col <= maxcol; col++) {

if (from_file) f.get(c);

else cin.get(c);

if (c == ’\n’ || c == ’$’) break;

if (c != ’ ’) grid[row][col] = 1;

else grid[row][col] = 0;

}

if (c == ’$’) break;

if (from_file) while (c != ’\n’) f.get(c);

else while (c != ’\n’) cin.get(c);

}

void instructions()

Pre: None.

Post: Instructions for using the Life program have been printed.

{

cout << "Welcome to Conway’s game of Life." << endl;

cout << "This game uses a grid of size "

<< maxrow << " by " << maxcol << " in which" << endl;

cout << "each cell can either be occupied by an organism or not." << endl;

cout << "The occupied cells change from generation to generation" << endl;

cout << "according to the number of neighboring cells which are alive."

<< endl;

}

P2. Addafeaturetothefunctioninitializesothatitcan,attheuser’soption,eitherreaditsinitialconﬁguration

from the keyboard or from a ﬁle. The ﬁrst line of the ﬁle will be a comment giving the name of the

conﬁguration. Each remaining line of the ﬁle will correspond to a row of the conﬁguration. Each line

will contain

x in each living position and a blank in each dead position.

Answer

See project P1.

P3.

Add a feature to the Life program so that, at termination, it can write the ﬁnal conﬁguration to a ﬁle in a

format that can be edited by the user and that can be read in to restart the program (using the feature of

Project P2).

Answer

See project P1. The program subdirectories contain a ﬁle of test data called FILE.

P4.

Add a feature to the Life program so, at any generation, the user can edit the current conﬁguration by

inserting new living cells or by deleting living cells.

Answer

See project P1.

P5.

Add a feature to the Life program so, if the user wishes at any generation, it will display a help screen

giving the rules for the Life game and explaining how to use the program.

Answer

See project P1.

P6.

Add a step mode to the Life program, so it will explain every change it makes while going from one

generation to the next.

Answer

See project P1.

20 Chapter 1 • Programming Principles

P7.

Use direct cursor addressing (a system-dependent feature) to make the Life method print update the

conﬁguration instead of completely rewriting it at each generation.

Answer

The changes required are system dependent and have not been implemented.

P8.

Use different colors in the Life output to show which cells have changed in the current generation and

which have not.

Answer

The changes required are system dependent and have not been implemented.

1.6 CONCLUSIONS AND PREVIEW

Programming Projects 1.6

P1. A magic square is a square array of integers such that the sum of every row, the sum of every column,

and sum of each of the two diagonals are all equal.

(a) Write a program that reads a square array of integers and determines whether or not it is a magic square.

(b) Write a program that generates a magic square by the following method. This method works only when

the size of the square is an odd number. Start by placing 1 in the middle of the top row. Write down

successive integers 2, 3,

...along a diagonal going upward and to the right. When you reach the top row

(as you do immediately since 1 is in the top row), continue to the bottom row as though the bottom row

were immediately above the top row. When you reach the rightmost column, continue to the leftmost

column as though it were immediately to the right of the rightmost one. When you reach a position that

is already occupied, instead drop straight down one position from the previous number to insert the new

one.

Answer

#include "../../c/utility.h"

#include "../../c/utility.cpp"

#include "square.h"

#include "square.cpp"

int main()

{

cout << "Magic Square Program" << endl << endl;

cout << "Enter a square of integers:" << endl;

Square s;

s.read();

if (s.is_magic()) cout << "That square is magic!" << endl;

else cout << "That square is not magic." << endl;

cout << endl << endl << "Generatinga5x5magic square:" << endl;

cout << "--------------------------------" << endl << endl;

s.generate(5);

s.print();

cout << endl << endl << "Generatinga7x7magic square:" << endl;

cout << "--------------------------------" << endl << endl;

s.generate(7);

s.print();

}

const int max_size = 9;

class Square {

public:

void read();

void print();

bool is_magic();

void generate(int n);

剩余675页未读，继续阅读

hbo1989

粉丝: 0
资源: 2

编程原理与实践：第六版习题解答

数据结构 朱战力 习题解答 数据结构 朱战力 习题解答

[详细完整版]数据结构六.pdf

《数据结构》课后习题答案.doc

"C 程序设计第三版课后习题答案及解析

《C语言程序设计第四版课后习题答案完整版及基础知识总结》

循环结构程序设计要点

数据结构与算法基础

数据结构与算法入门

数据结构与算法的关系

【数据结构与算法可视化】

最新资源

数据结构朱战力习题解答数据结构朱战力习题解答