Question

Summer II 2020 - Data Structures and Algorithms (COSC-2336-01W) In the linked-list based bag implementation, we demonstrated the functionalities, such as, add, remove, and list. This assignment is to extend the functionalities of the bag with other operations average, min, and max, You need to extend the Bag class (under Wk 2, BagLinked_List.cpp) with the following methods: -int Bag::min( ), is to find minimum of items of the bag. -int Bag::max( ), is to find maximum of items of the bag -float Bag::ave(), is to find average of the items of the bag. After expanding the Bag class with these functions, demonstrate their functionalities with a similar to: Create a bag A with the items 8, 4, 5, 6, 1, 3; and create another bag, B, with the items 4, 6, 9, 2. Then show that cout << A.min() <<""<< A.max() << ""<< A.ave (): cout << B.min() <<""<< B.max() << ""<< B.ave (); Note that the code shared on D2L is using a struct to keep string variable. You need to change it to keep int variables instead.

Answer 1

C++ Program:

There are two bags A and B - Following operation are performed.

1. Minimum element in the list

2. Maximum element in the list

3. Average of the list

Implementation of C++ program -

// Program to find smallest and largest 
// elements in the singly linked list.

// header files 
#include <bits/stdc++.h> 
using namespace std; 

// Linked list node
struct node { 
        int data; 
        struct node* next; 
}; 

// This Function returns the largest element from the linked list. 
int largestElement(struct node* head) 
{ 
        // Declaration of variable
        int max = INT_MIN; 

        // Loop for finding the maximum value in the linked list
        while (head != NULL) { 

                if (max < head->data) 
                        max = head->data; 
                head = head->next; 
        } 
        return max; 
} 

// This Function returns smallest element in the linked list. 
int smallestElement(struct node* head) 
{ 
        // Declaration of variable 
        int min = INT_MAX; 

        // Loop for finding the minimum value in the linked list
        while (head != NULL) { 

                // If min is greater then head->data then 
                // assign value of head->data to min 
                // otherwise node point to next node. 
                if (min > head->data) 
                        min = head->data; 

                head = head->next; 
        } 
        return min; 
} 

float avgOfNodes(struct node* head) 
{ 
    // if head = NULL 
    if (!head) 
        return -1; 
  
    int count = 0; // Initialize count 
    int sum = 0; 
    float avg = 0.0; 
  
    struct node* current = head; // Initialize current 
    while (current != NULL) { 
        count++; 
        sum += current->data; 
        current = current->next; 
    } 
  
    // calculate average 
    avg = (double)sum / count; 
  
    return avg; 
} 

// This Function inserts the element in the linked list. 
void push(struct node** head, int data) 
{ 
        // Allocate dynamic memory for newNode. 
        struct node* newNode = (struct node*)malloc(sizeof(struct node)); 

        // Assign the data to the newNode. 
        newNode->data = data; 

        // head node. 
        newNode->next = (*head); 

        // newNode become the headNode. 
        (*head) = newNode; 
} 

// Display linked list. 
void printList(struct node* head) 
{ 
        while (head != NULL) { 
                printf("%d -> ", head->data); 
                head = head->next; 
        } 
        cout << "NULL" << endl; 
} 

// Driver program to test the functions 
int main() 
{ 
        // Start with empty list 
        struct node* A = NULL; 
    struct node* B = NULL;

        push(&A, 25); 
        push(&A, 34); 
        push(&A, 13); 
        push(&A, 42); 
        push(&A, 97); 

    push(&B, 25); 
        push(&B, 34); 
        push(&B, 43); 
        push(&B, 12); 
        push(&B, 37); 
        cout << "Linked list  A is : " << endl; 

        // Print the list 
        printList(A); 
        

        cout << "Maximum element in linked list:"; 
    cout << largestElement(A) << endl; 


        cout << "Minimum element in linked list:"; 
    cout << smallestElement(A) << endl; 

    cout << "Average of List A = " << avgOfNodes(A)<<endl;
    
    cout << "Linked list  B is : " << endl;
    // Print the list 
        printList(B); 

        cout << "Maximum element in linked list:"; 
    cout << largestElement(B) << endl; 


        cout << "Minimum element in linked list:"; 
    cout << smallestElement(B) << endl; 

    cout << "Average of List B = " << avgOfNodes(B);



        return 0; 
} 

Output:

input Output wucLUT LUVUL OU TOOTD Linked list Ais : 97 -> 42 -> 13 -> 34 -> 25 -> NULL Maximum element in linked list:97 Minimum element in linked list:13 Average of List A = 42.2

input Output Linked list B is : 37 -> 12 -> 43 -> 34 -> 25 -> NULL Maximum element in linked list:43 Minimum element in linked list:12 Average of List B = 30.2 Success #stdin #stdout Os 4364KB

Thanks!

Keep Chegging.