#include #include using namespace std; void PrintSize(vector numsList) { cout << numsList.size() << "items" << endl; } int main() { } int currval; vector intList (3); PrintSize(intList); cin >> currval; while (currval >= 0) { } Type the program's output intList.push_back(currval); cin >> currval; PrintSize(intList); intList.clear(); PrintSize(intList); return 0; Input 1234-1 Output |

#include #include using namespace std; void PrintSize(vector numsList) { cout << numsList.size() << "items" << endl; } int main() { } int currval; vector intList (3); PrintSize(intList); cin >> currval; while (currval >= 0) { } Type the program's output intList.push_back(currval); cin >> currval; PrintSize(intList); intList.clear(); PrintSize(intList); return 0; Input 1234-1 Output |

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

#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&…
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; };
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<
#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;}
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".
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…
#include <iostream>#include <vector>using namespace std; void PrintVectors(vector<int> numsList) { unsigned int i; for (i = 0; i < numsList.size(); ++i) { cout << numsList.at(i) << " "; } cout << endl;} int main() { vector<int> numsList; int userInput; int i; for (i = 0; i < 3; ++i) { cin >> userInput; numsList.push_back(userInput); } numsList.erase(numsList.begin()+1); numsList.insert(numsList.begin()+1, 102); numsList.insert(numsList.begin()+1, 100); PrintVectors(numsList); return 0;} Not all tests passed clearTesting with inputs: 33 200 10 Output differs. See highlights below. Special character legend Your output 33 100 102 10 Expected output 100 33 102 10 clearTesting with inputs: 6 7 8 Output differs. See highlights below. Special character legend Your output 6 100 102 8 Expected output 100 6 102 8 Not sure what I did wrong but the the 33…
Given the following struct definition; #define MAX 20 typedef struct{ int items[MAX]; int count;}Array;Define the functions:void addItem(Array *a, int item); // adds item to the arrayvoid printArray(Array a); // displays elements of itemsint isFull(Array a); //returns 1 if the items is full; 0 if otherwiseint isEmpty(Array a); //returns 1 if the items is empty; 0 if otherwise
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 =…
#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;}
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…