Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
Bartleby Related Questions Icon

Related questions

Question

Please complete following c++ code question

The table might display wrong value 

Complete a class so that main works with constructor, destructor, copy
constructor, operator= and move constructor. Also write method clear(row.col) which you can
see in makemeone() below.
Create a chess board with 8 x 8 spaces in a single-dimensioned array (dynamically allocate
everything so I can create a different size board if I want to). Do NOT use vector.
Each board position will be represented by an integer, where white is negative and black is
positive:
empty position = 0
white pawn = -1
black pawn =+1
white knight = -2
black knight = +2
etc.
The board should have the following values:
-4 -2 -3 -5 -6 -3 -2 -4
-1 -1 -1 -1 -1 -1 -1 -1
+1 +1 -1 -1 -1 -1 -1 -1
+4 +2 +3 +5 +6 +3 +2 +4
Chessboard makemeone() { // triggers move constructor
ChessBoard b(8,8);
b.clear(0,0); // set the top-left element = 0
return b;
int main() {
ChessBoard c(8,8);
ChessBoard c2 = c;
ChessBoard c3; // create an empty chessboard where the pointer = null
c3 = c; // use operator = to overwrite and copy c again.
NOTE: Do not worry about populating the board for anything but 8x8. You need to be able to
dynamically allocate for any size (x, y), but when populating, you only need to consider the 8x8
board.
HOO O
1OO o0
O O O
HOO
expand button
Transcribed Image Text:Complete a class so that main works with constructor, destructor, copy constructor, operator= and move constructor. Also write method clear(row.col) which you can see in makemeone() below. Create a chess board with 8 x 8 spaces in a single-dimensioned array (dynamically allocate everything so I can create a different size board if I want to). Do NOT use vector. Each board position will be represented by an integer, where white is negative and black is positive: empty position = 0 white pawn = -1 black pawn =+1 white knight = -2 black knight = +2 etc. The board should have the following values: -4 -2 -3 -5 -6 -3 -2 -4 -1 -1 -1 -1 -1 -1 -1 -1 +1 +1 -1 -1 -1 -1 -1 -1 +4 +2 +3 +5 +6 +3 +2 +4 Chessboard makemeone() { // triggers move constructor ChessBoard b(8,8); b.clear(0,0); // set the top-left element = 0 return b; int main() { ChessBoard c(8,8); ChessBoard c2 = c; ChessBoard c3; // create an empty chessboard where the pointer = null c3 = c; // use operator = to overwrite and copy c again. NOTE: Do not worry about populating the board for anything but 8x8. You need to be able to dynamically allocate for any size (x, y), but when populating, you only need to consider the 8x8 board. HOO O 1OO o0 O O O HOO
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Similar questions
Recommended textbooks for you
Text book image
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Text book image
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Text book image
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Text book image
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Text book image
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Text book image
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY