C++实验报告模板
- 格式：doc
- 大小：34.00 KB
- 文档页数：7
/*
Pre: The user supplies an initial configuration of living cells.
Post: The program prints a sequence of pictures showing the changes in
the configuration of living cells according to the rules for
else cout << ' ';
cout << endl;
}
cout << endl;
}
int Life::neighbor_count(int row, int col)
/*
Pre: The Life object contains a configuration, and the coordinates
{
case 2:
new_grid[row][col] = grid[row][col]; // Status stays the same.
break;
case 3:
new_grid[row][col] = 1; // Cell is now alive.
break;
default:
new_grid[row][col] = 0; // Cell is now dead.
the game of Life.
Uses: The class Life and its methods initialize(), print(), and
update(); the functions instructions(), user_says_yes().
*/
{
Life configuration;
int neighbor_count(int row, int col);
};
/**********************************下面是life.cpp***************************/
#include "stdafx.h"
#include <iostream>
return count;
}
void Life::update()
/*
Pre: The Life object contains a configuration.
Post: The Life object contains the next generation of configuration.
*/
实验XX(例：一)：实验名称
一、实验目的
1.了解线性表（List）的逻辑结构特性，以及这种特性在计算机内的两种存储结构：数组和链表。
2.重点是线性表的基本操作在两种存储结构上的实现；其中以链表的操作为侧重点；并进一步学习面向对象的程序设计方法。
3.进一步掌握面向对象的程序设计方法，提高程序设计能力。
二、实验内容（代码）
// TheLifeOfGame.cpp :定义控制台应用程序的入口点。//
#include "stdafx.h"
#include "life.h"
#include <iostream>
using namespace std;
void instructions()
/*Pre: None.
}
}
三、实验结果
四、总结
（软件设计与实现过程种的经验与体会，进一步的改进设想，可再加入哪些部分？哪些部分可删除？哪些部分可合并？哪些可降低复杂度？怎样设计能提高其可复用性？多思考，多总结，才能不断提高程序设计能力。）
#include "life.h"
using namespace std;
void Life::print()
/*Pre: The Life object contains a configuration.
Post: The configuration is written for the user.*/
grid[row][col] = 1;
else
cout << "Column " << col << " is out of range." << endl;
else
cout << "Row " << row << " is out of range." << endl;
cin >> row >> col;
{
int row, col;
int new_grid[maxrow + 2][maxcol + 2];
for (row = 1; row <= maxrow; row++)
for (col = 1; col <= maxcol; col++)
switch (neighbor_count(row, col))
for (j = col - 1; j <= col + 1; j++)
count += grid[i][j]; // Increase the count if neighbor is alive.
count -= grid[row][col]; // A cell is not its own neighbor.
<< 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;
if (initial_response)
cout << " (y,n)? " << flush;
else
cout << "Respond with either y or n: " << flush;
do
{ // Ignore white space.
c = cin.get( );
} while (c == '/n' || c == ' ' || c == '/t');
#endif _LIFE_H
const int maxrow = 20, maxcol = 60; // grid dimensions
class Life
{
public:
void initialize();
void print();
void update();
private:
int grid[maxrow + 2][maxcol + 2]; // Allow two extra rows and columns.
*/
{
int row, col;
for (row = 0; row <= maxrow+1; row++)
for (col = 0; col <= maxcol+1; col++)
grid[row][col] = 0;
cout << "List the coordinates for living cells." << endl;
{
int row, col;
cout << "/nThe current Life configuration is:" <<endl;
for (row = 1; row <= maxrow; row++) {
for (col = 1; col <= maxcol; col++)
if (grid[row][col] == 1) cout << '*';
configuration.print();
cout << "Continue viewing new generations? " << endl;
}
}
/****************************下面是life.h源码***********************/
#ifndef _LIFE_H
cout << "Terminate the list with the the special pair -1 -1" << endl;
cin >> row >> col;
while (row != -1 || col != -1)
{
if (row >= 1 && row <= maxrow)
if (col >= 1 && col <= maxcol)
initial_response = false;
Pre: The user supplies an initial configuration of living cells.
Post: The program prints a sequence of pictures showing the changes in
the configuration of living cells according to the rules for
else cout << ' ';
cout << endl;
}
cout << endl;
}
int Life::neighbor_count(int row, int col)
/*
Pre: The Life object contains a configuration, and the coordinates
{
case 2:
new_grid[row][col] = grid[row][col]; // Status stays the same.
break;
case 3:
new_grid[row][col] = 1; // Cell is now alive.
break;
default:
new_grid[row][col] = 0; // Cell is now dead.
the game of Life.
Uses: The class Life and its methods initialize(), print(), and
update(); the functions instructions(), user_says_yes().
*/
{
Life configuration;
int neighbor_count(int row, int col);
};
/**********************************下面是life.cpp***************************/
#include "stdafx.h"
#include <iostream>
return count;
}
void Life::update()
/*
Pre: The Life object contains a configuration.
Post: The Life object contains the next generation of configuration.
*/
实验XX(例：一)：实验名称
一、实验目的
1.了解线性表（List）的逻辑结构特性，以及这种特性在计算机内的两种存储结构：数组和链表。
2.重点是线性表的基本操作在两种存储结构上的实现；其中以链表的操作为侧重点；并进一步学习面向对象的程序设计方法。
3.进一步掌握面向对象的程序设计方法，提高程序设计能力。
二、实验内容（代码）
// TheLifeOfGame.cpp :定义控制台应用程序的入口点。//
#include "stdafx.h"
#include "life.h"
#include <iostream>
using namespace std;
void instructions()
/*Pre: None.
}
}
三、实验结果
四、总结
（软件设计与实现过程种的经验与体会，进一步的改进设想，可再加入哪些部分？哪些部分可删除？哪些部分可合并？哪些可降低复杂度？怎样设计能提高其可复用性？多思考，多总结，才能不断提高程序设计能力。）
#include "life.h"
using namespace std;
void Life::print()
/*Pre: The Life object contains a configuration.
Post: The configuration is written for the user.*/
grid[row][col] = 1;
else
cout << "Column " << col << " is out of range." << endl;
else
cout << "Row " << row << " is out of range." << endl;
cin >> row >> col;
{
int row, col;
int new_grid[maxrow + 2][maxcol + 2];
for (row = 1; row <= maxrow; row++)
for (col = 1; col <= maxcol; col++)
switch (neighbor_count(row, col))
for (j = col - 1; j <= col + 1; j++)
count += grid[i][j]; // Increase the count if neighbor is alive.
count -= grid[row][col]; // A cell is not its own neighbor.
<< 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;
if (initial_response)
cout << " (y,n)? " << flush;
else
cout << "Respond with either y or n: " << flush;
do
{ // Ignore white space.
c = cin.get( );
} while (c == '/n' || c == ' ' || c == '/t');
#endif _LIFE_H
const int maxrow = 20, maxcol = 60; // grid dimensions
class Life
{
public:
void initialize();
void print();
void update();
private:
int grid[maxrow + 2][maxcol + 2]; // Allow two extra rows and columns.
*/
{
int row, col;
for (row = 0; row <= maxrow+1; row++)
for (col = 0; col <= maxcol+1; col++)
grid[row][col] = 0;
cout << "List the coordinates for living cells." << endl;
{
int row, col;
cout << "/nThe current Life configuration is:" <<endl;
for (row = 1; row <= maxrow; row++) {
for (col = 1; col <= maxcol; col++)
if (grid[row][col] == 1) cout << '*';
configuration.print();
cout << "Continue viewing new generations? " << endl;
}
}
/****************************下面是life.h源码***********************/
#ifndef _LIFE_H
cout << "Terminate the list with the the special pair -1 -1" << endl;
cin >> row >> col;
while (row != -1 || col != -1)
{
if (row >= 1 && row <= maxrow)
if (col >= 1 && col <= maxcol)
initial_response = false;
