Executable C++ program shown in Figure Q2(c) is executing insertion and deletion algorithms by using array data structure. Write the complete output after the program execution. #include using namespace std; class InsDel private: int Array(]; public: void gen_array(); void disp_array(); void insertion (int ,int ); void deletion (int ); } ; void InsDel::gen_array() for (int i = 0; i < 8; i++) { Array(i] - i*2; void InsDel::disp_array () for (int i = 0; i < 8; i++) cout « "Arr[" « i « "]: " « Array[i] « endl; Continue.…
Executable C++ program shown in Figure Q2(c) is executing insertion and deletion algorithms by using array data structure. Write the complete output after the program execution. #include using namespace std; class InsDel private: int Array(]; public: void gen_array(); void disp_array(); void insertion (int ,int ); void deletion (int ); } ; void InsDel::gen_array() for (int i = 0; i < 8; i++) { Array(i] - i*2; void InsDel::disp_array () for (int i = 0; i < 8; i++) cout « "Arr[" « i « "]: " « Array[i] « endl; Continue.…
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
![Executable C++ program shown in Figure Q2(c) is executing insertion and deletion
algorithms by using array data structure. Write the complete output after the program
execution.
#include <iostream>
using namespace std;
class InsDel
{
private:
int Array[];
public:
void gen_array();
void disp_array();
void insertion (int ,int );
void deletion (int );
};
void InsDel::gen_array ()
{
for (int i = 0; i < 8; i++)
{
Array[i] = i*2;
void InsDel::disp_array ()
for (int i = 0; i < 8; i++)
{
cout « "Arr[" « i « "]: " « Array[i] « endl;
Continue...](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbc6db75e-61c3-4acb-8c52-798b7abc4132%2Fcd2682ca-cc84-41cf-bfd0-bb0c3af01f87%2F17wjr9r_processed.png&w=3840&q=75)
Transcribed Image Text:Executable C++ program shown in Figure Q2(c) is executing insertion and deletion
algorithms by using array data structure. Write the complete output after the program
execution.
#include <iostream>
using namespace std;
class InsDel
{
private:
int Array[];
public:
void gen_array();
void disp_array();
void insertion (int ,int );
void deletion (int );
};
void InsDel::gen_array ()
{
for (int i = 0; i < 8; i++)
{
Array[i] = i*2;
void InsDel::disp_array ()
for (int i = 0; i < 8; i++)
{
cout « "Arr[" « i « "]: " « Array[i] « endl;
Continue...
![...Continue
void InsDel::insertion (int pos_insert, int val_insert)
int i;
for (i = 8-1; i > pos_insert; i--)
Array(i] = Array[i-1];
Array[i] - val_insert;
void InsDel::deletion (int pos_delete)
int i;
for (i = pos_delete; i < 8-1; i++)
{
Array[i] - Array[i+1];
Array[i] = 0;
int main()
InsDel jujukan;
jujukan.gen_array ();
jujukan.disp_array();
cout «"\n\n\n";
cout « "insertion: \n";
jujukan.insertion (5,100);
jujukan.disp_array();
cout <<"\n\n\n";
cout <« "Deletion: \n";
jujukan.deletion (2);
jujukan.disp_array();
return O;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbc6db75e-61c3-4acb-8c52-798b7abc4132%2Fcd2682ca-cc84-41cf-bfd0-bb0c3af01f87%2F6ol9z4c_processed.png&w=3840&q=75)
Transcribed Image Text:...Continue
void InsDel::insertion (int pos_insert, int val_insert)
int i;
for (i = 8-1; i > pos_insert; i--)
Array(i] = Array[i-1];
Array[i] - val_insert;
void InsDel::deletion (int pos_delete)
int i;
for (i = pos_delete; i < 8-1; i++)
{
Array[i] - Array[i+1];
Array[i] = 0;
int main()
InsDel jujukan;
jujukan.gen_array ();
jujukan.disp_array();
cout «"\n\n\n";
cout « "insertion: \n";
jujukan.insertion (5,100);
jujukan.disp_array();
cout <<"\n\n\n";
cout <« "Deletion: \n";
jujukan.deletion (2);
jujukan.disp_array();
return O;
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
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