Check1ALLLEURE#include #include using namespace std;void PrintSize(vector numsList) {cout << numsList.size() << "items" << endl;int main() {Nextint currVal;vector intList (2);PrintSize(intList);cin >> currval;while (currVal >= 0) {}Type the program's outputintList.push_back(currval);cin >> currval;PrintSize(intList);intList.clear();PrintSize(intList);return 0;CS Scanned with Calin cannerJanviantarsInput12345-1OutputFeedback?口口。

Import the required libraries i.e. iostream and vector. Declare a function called PrintSize which…

#include #include using namespace std; void PrintSize(vector numsList) { cout << numsList.size() <<< items" << endl; } int main() { } int currval; vector intList (2); PrintSize(intList); cin >> currval; while (currval >= 0) { intList.push_back(currval); cin >> currval; } PrintSize(intList); intList.clear(); PrintSize(intList); return 0; Input 12345-1 Output

#include #include using namespace std; void PrintSize(vector numsList) { cout << numsList.size() <<< items" << endl; } int main() { } int currval; vector intList (2); PrintSize(intList); cin >> currval; while (currval >= 0) { intList.push_back(currval); cin >> currval; } PrintSize(intList); intList.clear(); PrintSize(intList); return 0; Input 12345-1 Output

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 17PE

See similar textbooks

Similar questions

C++ Program #include <iostream>#include <cstdlib>#include <ctime>using namespace std; int getData() { return (rand() % 100);} class Node {public: int data; Node* next;}; class LinkedList{public: LinkedList() { // constructor head = NULL; } ~LinkedList() {}; // destructor void addNode(int val); void addNodeSorted(int val); void displayWithCount(); int size(); void deleteAllNodes(); bool exists(int val);private: Node* head;}; // function to check data exist in a listbool LinkedList::exists(int val){ if (head == NULL) { return false; } else { Node* temp = head; while (temp != NULL) { if(temp->data == val){ return true; } temp = temp->next; } } return false;} // function to delete all data in a listvoid LinkedList::deleteAllNodes(){ if (head == NULL) { cout << "List is empty, No need to delete…
Student Name: 8) Consider the following ciass definitions. public class LibraryID{ private String name; // Person's name private int ID; // Person's library ID # private ArrayList Books; // Loaned books public LibraryID (String n, int num) { name = n; ID = num; Books = new ArrayList(); } public int getID () { return ID; } public String getName() { return name; } /* CheckOut () and ReturnBook () methods not shown */ Complete the following override method, contained in the LibraryID class. Two LibraryID's are considered the same if their ID numbers are the same. public boolean equals (Object other) { if (other == null){ return false;} LibraryID o = (LibraryID) other; 9) Assuming the code written in 8 is correct, write the call to compare LibraryID one and two inside the if statement. LibraryID one = new LibraryID("Mankind", 106); LibraryID two = new LibraryID ("Mick Foley", 106); if System.out.println("ID's belong to the same person"); else System.out.println("ID's belong to the…
struct ID { int x; int y; }; struct name { ID r; }; int main() { name a[2]; for (int i=0;i<2;i++) { a[i).r.x=i; a[i].r.y=i+1; } for(int i=0;i<2;i++) cout<
struct remove_from_front_of_vector { // Function takes no parameters, removes the book at the front of a vector, // and returns nothing. void operator()(const Book& unused) { (/// TO-DO (12) ||||| // // // Write the lines of code to remove the book at the front of "my_vector". // // Remember, attempting to remove an element from an empty data structure is // a logic error. Include code to avoid that. //// END-TO-DO (12) /||, } std::vector& my_vector; };
#include<bits/stdc++.h>using namespace std; // Class representing music dataclass Song {public:string musicName, musicDescription;};// Function to take input for music descriptionSong addDescription(){Song s1;cout<<"Enter the Music name : ";cin>>s1.musicName;cout<<"Enter the Music description : ";cin>>s1.musicDescription;return s1;} // Function to write music object details into a txt filevoid storeInfoToDatabase(Song s){ofstream fileObject;// Opening the file in append modefileObject.open("Database.txt", ios::app);fileObject << s.musicName;fileObject << " ";fileObject << s.musicDescription;fileObject << "\n";} // Driver Functionint main(){Song s = addDescription();storeInfoToDatabase(s);cout<<"Data written into file succesfully...";return 0;}
#include <iostream> using namespace std;struct Triple{int row, col, value;}; class Matrix; class MatrixNode{friend class Matrix;friend istream& operator>>(istream&, Matrix&);private:MatrixNode *down, *right;bool head;union{MatrixNode *next;Triple triple;};MatrixNode(bool, Triple*);}; MatrixNode::MatrixNode(bool b, Triple *t){head = b;if (b){right = down = this;}else triple = *t;};class Matrix{friend istream& operator>>(istream&, Matrix&);public:~Matrix();MatrixNode*private:MatrixNode *headnode;}; Matrix::~Matrix(){// Return all nodes to the av list, which is a chain linked// via the right field.// av is a static variable pointing to the first of the av list.if (!headnode )return; // no nodes to deleteMatrixNode *x = headnode->right; headnode->right = av;av = headnode; // return headnode while (x != headnode) { // return nodes by rowsMatrixNode *y = x->right;x->right = av;av = y;x = x->next; // next row}headnode = 0;} istream&…
#include <iostream> using namespace std;struct Triple{int row, col, value;}; class Matrix; class MatrixNode{friend class Matrix;friend istream& operator>>(istream&, Matrix&);private:MatrixNode *down, *right;bool head;union{MatrixNode *next;Triple triple;};MatrixNode(bool, Triple*);}; MatrixNode::MatrixNode(bool b, Triple *t){head = b;if (b){right = down = this;}else triple = *t;};class Matrix{friend istream& operator>>(istream&, Matrix&);public:~Matrix();MatrixNode*private:MatrixNode *headnode;}; Matrix::~Matrix(){// Return all nodes to the av list, which is a chain linked// via the right field.// av is a static variable pointing to the first of the av list.if (!headnode )return; // no nodes to deleteMatrixNode *x = headnode->right; headnode->right = av;av = headnode; // return headnode while (x != headnode) { // return nodes by rowsMatrixNode *y = x->right;x->right = av;av = y;x = x->next; // next row}headnode = 0;} istream&…
C++ Code /////// #include <iostream> class BTNode {public:int item;BTNode *left;BTNode *right;BTNode(int i, BTNode *l=nullptr, BTNode *r=nullptr):item(i),left(l),right(r){}}; BTNode *root = nullptr; void insert(int i) {//implement code here} int main(){insert (5);insert (10);insert (1);if (root){std::cout << "root = " << root->item << std::endl;if (root->left)std::cout << "root->left = " << root->left->item << std::endl;if (root->right)std::cout << "root->right = " << root->right->item << std::endl;}return 0;}
C++ ProgrammingActivity: Deque Linked List Explain the flow of the main code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow. SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS int main(int argc, char** argv) { DLLDeque* deque = new DLLDeque(); int test; cin >> test; //Declarations int tempnum; int num; int sum; int count; bool addfirst = false; bool addlast = false; bool remfirst = false; bool remlast = false; switch (test) { case 0: //Implementation do{ cin >> num; if(num == 0){ break; } //Reset tempnum = num; count = 0; sum = 0; addfirst = false; addlast = false; remfirst = false; remlast =…
C++ User Defined Vector Class that is a vector of strings called myStringVector. This needs to be a class and have the following member functions: - Default constructor - Initializing with a list of values ex) myStringVector vec1 { "My", "string", "vector"}; - Copy constructor - Copy assignment ex) myVec1 = myVec2; - Copy construction ex) myStringVector myVec1 = myVec2; - A function to return the number of elements ex) int vecSize = myVec1.size();
LOVELY PROFESSIONAL UNIVERSITY Academic Task No. 1 School : of Computer Science and Engineering Name of the faculty member_Ms. Gauri Mathur_ Course Code: CSE202 Faculty of: Technology and Sciences Course Title: Object Oriented Programming Program: Max. Marks: 30 Term: Is Rubric Applicable: No Date of Allotment: 26/02/2021 Date of Submission: 09/03/2021 Important Guidelines: 1. All questions in this Academic Task are compulsory. 2. It is mandatory to attempt all questions of the assignment in your own handwriting on A4 size sheets/pages with a blue colour ink pen. Any other mode of attempt (typed or printed codes or table) except hand written/drawn will not be accepted/considered as valid submission(s) under any circumstances. 3. Every attempted sheet/page should carry clear details of student such as Name, Registration number, Roll number, Question number and Page number. The page numbers should be written clearly on the bottom of every attempted sheet in a prescribed format as: for…
Data Structure & Algorithum java program Do the following: 1) Add a constructor to the class "LList" that creates a list from a given array of objects.2) Add a method "addAll" to the "LList" class that adds an array of items to the end of the list. The header of the method is as follows, where "T" is the generic type of the objects in the list. 3) Write a Test/Driver program that thoroughly tests all the methods in the class "LList".