Suppose we implement the += operator as shown in the following. What goes wrong with b += b ? void bag::operator +=(const bag& addend) // Library facilities used: cassert { size_type i; // An array index assert(size( ) + addend.size( ) <= CAPACITY); for (i = 0; i < addend.used; ++i) { data[used] = addend.data[i]; ++used; } } Group of answer choices If we activate b += b, then the private member variable size is the same variable as addend.size. The size( ) + addend.size( ) is less than CAPACITY. So the program after the assert statement will be executed. If we activate b += b, then the private member variable size is the same variable as addend.size. The size( ) + addend.size( ) is larger than CAPACITY. So the program after the assert statement will not have chance to be executed. If we activate b += b, then the private member variable used is the same variable as addend.used. Each iteration of the loop adds 1 to used, and hence addend.used is also increasing, and the loop will be terminated earlier than expected. If we activate b += b, then the private member variable used is the same variable as addend.used. Each iteration of the loop adds 1 to used, and hence addend.used is also increasing, and the loop never ends. There is no problem at all.
Suppose we implement the += operator as shown in the following. What goes wrong with b += b ? void bag::operator +=(const bag& addend) // Library facilities used: cassert { size_type i; // An array index assert(size( ) + addend.size( ) <= CAPACITY); for (i = 0; i < addend.used; ++i) { data[used] = addend.data[i]; ++used; } } Group of answer choices If we activate b += b, then the private member variable size is the same variable as addend.size. The size( ) + addend.size( ) is less than CAPACITY. So the program after the assert statement will be executed. If we activate b += b, then the private member variable size is the same variable as addend.size. The size( ) + addend.size( ) is larger than CAPACITY. So the program after the assert statement will not have chance to be executed. If we activate b += b, then the private member variable used is the same variable as addend.used. Each iteration of the loop adds 1 to used, and hence addend.used is also increasing, and the loop will be terminated earlier than expected. If we activate b += b, then the private member variable used is the same variable as addend.used. Each iteration of the loop adds 1 to used, and hence addend.used is also increasing, and the loop never ends. There is no problem at all.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Suppose we implement the += operator as shown in the following. What goes wrong with b += b ?
void bag::operator +=(const bag& addend)
// Library facilities used: cassert
{
size_type i; // An array index
assert(size( ) + addend.size( ) <= CAPACITY);
for (i = 0; i < addend.used; ++i)
{
data[used] = addend.data[i];
++used;
}
}
Group of answer choices
If we activate b += b, then the private member variable size is the same variable as addend.size. The size( ) + addend.size( ) is less than CAPACITY. So the program after the assert statement will be executed.
If we activate b += b, then the private member variable size is the same variable as addend.size. The size( ) + addend.size( ) is larger than CAPACITY. So the program after the assert statement will not have chance to be executed.
If we activate b += b, then the private member variable used is the same variable as addend.used. Each iteration of the loop adds 1 to used, and hence addend.used is also increasing, and the loop will be terminated earlier than expected.
If we activate b += b, then the private member variable used is the same variable as addend.used. Each iteration of the loop adds 1 to used, and hence addend.used is also increasing, and the loop never ends.
There is no problem at all.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-engineering and related others by exploring similar questions and additional content below.Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY