CS301 ASSIGNMENT NO. 1 FALL 2022 || 100% RIGHT SOLUTION || DATA STRUCTURES || BY VuTech

CS301 ASSIGNMENT NO. 1 FALL 2022

KINDLY, DON’T COPY PASTE

CS301 ASSIGNMENT NO. 1 FALL 2022 || 100% RIGHT SOLUTION || DATA STRUCTURES || BY VuTech

SEND WHATSAPP OR E-MAIL FOR ANY QUERY

0325-6644800

kamranhameedvu@gmail.com 

 Visit Website For More Solutions

www.vutechofficial.blogspot.com

Instructions

Please read the following instructions carefully before submitting the assignment solution:

It should be clear that your assignment will not get any credit/marks if:

o        Assignment is submitted after due date.

o        Submitted assignment does not open or file is corrupt.

o        Assignment is copied (From internet/students). 

Recommended Tools

• Dev C++

Assignment Submission Instructions

You have to submit only code “.cpp” file on the assignments interface from your LMS account.

Assignment submitted in any other (.doc, .pdf, image, etc.) format will not be accepted and will be scaled with zero marks. No excuse will be accepted on submitting solution file in any other format.

For any query related to assignment, please contact cs301@vu.edu.pk. 

Problem Statement:

You are required to make a program using C++ language to implement singly linked list. Your will create a linked list of random numbers and display last asked elements of linked list on the console (command prompt). Following are the detailed requirements.

1. Decide the size of linked list
1. Generate a random number between 15 to 20 and use it as size of linked list. Every time the program will be executed a different number should be generated.
2. Fill/create the linked list with random numbers in range 1 to 100.
3. Display the last few elements of linked list on console.
1. The number of last few elements will be entered by user.
4. If user will enter 5 then display last five elements of linked list. If the user will enter 8 then display last eight elements of linked list.

 

Important Instructions:

You need to fulfill the following requirements while solving the assignment task.

1.      Use only user defined classes for Node and List, the use of struct is not allowed.

2.      The structure of Node and List classes should be similar to the structure given below. If you will create extra data members then your marks will be deducted.

3.      User will enter the no. of elements he wants to see, so your application should display entered no. of last elements. 

4.      An animated gif file is attached with assignment file. This animation contains the procedure to select last elements of your choice. Once you have selected the elements of your choice then you can display them easily.

Lectures Covered: Lecture # 1 - 8 Due Date: Monday, December 05, 2022.

SOLUTION

#include <stdio.h>

#include <bits/stdc++.h>

#include <stdlib.h>

#include <time.h>

#include <iostream>

using namespace std;

int skip_till;

int count_no=1;

int no_last_elem_vu;

int printRandoms(int lower, int upper,

int count)

{

int i;

for (i = 0; i < count; i++) {

int num = (rand() %

(upper - lower + 1)) + lower;

return num;

}

}

struct Node {

    int data;

    Node* next;

};

class LinkedList {

  private:

    Node* head;

  public:

    LinkedList(){

      head = NULL;

    }

 

    void push_back(int newElement) {

      Node* newNode = new Node();

      newNode->data = newElement;

      newNode->next = NULL; 

      if(head == NULL) {

        head = newNode;

      } else {

        Node* temp = head;

        while(temp->next != NULL)

          temp = temp->next;

        temp->next = newNode;

      }    

    }

    void PrintList() {

      Node* temp = head;

      if(temp != NULL) {

     

        cout<<endl;

        

        

        while(temp != NULL) {

        if (skip_till<=no_last_elem_vu){

         

        cout<<"Element "<<count_no<<" ";

        count_no=count_no+1;

          cout<<temp->data<<" "<<endl;

          temp = temp->next;

             while (skip_till != 0) { 

             

      skip_till=skip_till-1;}

        } else {

      skip_till=skip_till-1;

      temp = temp->next;}

    }

        

        cout<<endl;

      } 

    }    

};

 

int main() {

  LinkedList MyList;

int lower = 15, upper = 20, count = 1;

int random_length_linked;

srand(time(0));

printRandoms(lower, upper, count);

random_length_linked= printRandoms(lower, upper, count);

skip_till = random_length_linked;

cout << "Randomly generated list size : "<<random_length_linked<<endl;

for (int i = 0; i < random_length_linked; i++) {

int random_fill_linked= printRandoms(1, 100, 1);

cout<<random_fill_linked<<" inserted into linked list"<<endl;

   MyList.push_back(random_fill_linked);

 

}

cout << "Enter no. of last few elements want to see: ";

cin>>no_last_elem_vu;

   

  MyList.PrintList();

return 0;

}

KINDLY, DON’T COPY PASTE

SUBSCRIBE, SHARE, LIKE AND COMMENTS FOR MORE UPDATES

SEND WHATSAPP OR E-MAIL FOR ANY QUERY

0325-6644800

kamranhameedvu@gmail.com