Pages

CS301 ASSIGNMENT NO. 1 SPRING 2023 || 100% RIGHT SOLUTION || DATA STRUCTURES || BY VuTech

CS301 ASSIGNMENT NO. 1 SPRING 2023 || 100% RIGHT SOLUTION || DATA STRUCTURES || BY VuTech

CS301 ASSIGNMENT NO. 1 SPRING 2023 || 100% RIGHT SOLUTION || DATA STRUCTURES || BY VuTech 

KINDLY, DON’T COPY PASTE

SUBSCRIBE, SHARE, LIKE AND COMMENTS FOR MORE UPDATES


SOLUTION

#include <iostream>

#include <vector>


int main() {

    std::vector<int> vuId;


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

        int numericChar;

        std::cout << "Enter NUMERIC characters of your vu id\n";

        std::cin >> numericChar;

        vuId.push_back(numericChar);

    }


    std::vector<int> oddList;

    std::vector<int> evenList;


    for(int i = 0; i < vuId.size(); i++) {

        if(vuId[i] % 2 == 0) {

            evenList.push_back(vuId[i]);

        } else {

            oddList.push_back(vuId[i]);

        }

    }


    std::cout <<"\n******OUTPUT******"<< std::endl;

    std::cout << "Odd List\n" << std::endl;

    for(int i = 0; i < oddList.size(); i++) {

        std::cout <<"  List Element  "<< oddList[i] << std::endl;

    }


    std::cout << "Even List\n" << std::endl;

    for(int i = 0; i < evenList.size(); i++) {

        std::cout <<"  List Element  "<< evenList[i] << std::endl;

    }


    std::vector<int> mergedList;

    mergedList.insert(mergedList.end(), oddList.begin(), oddList.end());

    mergedList.insert(mergedList.end(), evenList.begin(), evenList.end());


    std::cout << "Merged List\n" << std::endl;

    for(int i = 0; i < mergedList.size(); i++) {

        std::cout <<"  List element  "<< mergedList[i] << std::endl;

    }


    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
Visit Website For More Solutions
www.vutechofficial.blogspot.com