Question

Array List Operations For an array based list, (A) If the Length operation associated with an unsorted list returns 15, and we then call the Delete operation for the list, pass it a value that matches the 7th item in the list: 1). What is the index of the component that is deleted? 2). What is the index of the component that takes its place? 3). What does the Length operation return after deletion? 4). How many components in the list change their position as a result of the deletion? (B) If the above questions are applied to a sorted list, what are the answers? (C) BONUS Points: use code and results to verify your answers of A. Submission Requirements: 1. Describe the computing process as detailed as possible for questions A and B 2. For Question C (Bonus, optional), take a few screenshots of your source code and results as pictures 3. Combine A, B, and Cinto one single PDF file in the final submission. File name: YourEmail D-A2.pdf.

Please do this in C++

Please do this in C++

Answer 1

A)

1. 6
2. 7
3. 14
4. 8

B)

1. 6
2. 7
3. 14
4. 8

C)

Code:

#include <iostream>

#include <list>

#include <iterator>

#include <cstdlib>

#include <ctime>

using namespace std;

//function for printing the elements in a list

void showlist(list <int> g)

{

                list <int> :: iterator it;

                for(it = g.begin(); it != g.end(); ++it)

                                cout << *it << "\t";

                cout << '\n';

}

int main()

{

                list <int> demolist1, demolist2;

srand(time(NULL));

                for (int i = 0; i < 15; ++i)

                {

    int k = rand()%50 + 1;

                                demolist1.push_back(k);

    demolist2.push_back(k);

                }

showlist(demolist1);

                cout << "Size before deletion = " << demolist1.size() << endl;

list<int>::iterator itr1 = demolist1.begin();

advance(itr1, 6);

demolist1.erase(itr1);

cout << "After deleting 7th item: \n ";

showlist(demolist1);

                cout << "Size after deletion = " << demolist1.size() << endl;

                cout << "\n\n\nSorted List: \n";

                demolist2.sort();

                showlist(demolist2);

                cout << "Size before deletion = " << demolist2.size() << endl;

list<int>::iterator itr2 = demolist2.begin();

advance(itr1, 6);

demolist2.erase(itr2);

cout << "After deleting 7th item:\n ";

showlist(demolist2);

                cout << "Size after deletion = " << demolist2.size() << endl;

                return 0;

}

Output:

13 43 26 11 30 Size before deletion = 15 After deleting 7th item: 43 26 11 30 Size after deletion = 14 1957 1957 37 37 74 74 36 36 13 43120 9 11 1 30 22 21 34 96 11 13 19 21 26 30 34 36 37 43 51 57 72 74 96 Sorted List: 11 13 19 21 Size before deletion = 15 After deleting 7th item: 11 13 19 21 Size after deletion = 14 26 30 36 37 43 51 57 72 74 96 Press any key to continue ...