Complete the expand () function template. The template takes a reference to aunique_ptr pointing to an array and doubles the size of the array.memory.cpp1 #include 2 #include 3 #include 4 using namespace std;template void expand(unique_ptr& a, int size){789101112 }1314int main()15 {16unique_ptr a{new int[5]{ 10, 1, 5, 6, 4 }};1718expand (a, 5); // resize to hold 10 elements1920for (int i = 5; i < 10; i++) { a[i] = (i + 1) * (i + 1); }21cout « "a->{" « a[0];for (int i = 1; i < 10; i++) { cout « ",cout « "}" « endl;}2223« a[i]; }2425

Complete the expand() function template. The template takes a reference to a unique_ptr pointing to an array and doubles the size of the array. memory.cpp 1 #include 2 #include 3 #include 4 using namespace std; 5 template void expand(unique_ptr& a, int size) 8 7 { 10 11 12 } 13 14 int main() 15 { 16 17 unique_ptr a{new int[5]{ 10, 1, 5, 6, 4 }}; 18 expand(a, 5); // resize to hold 10 elements 19 20 21 for (int i = 5; i < 10; i++) { a[i] = (i + 1) * (i + 1); } 22 cout « "a->{" « a[0]; for (int i = 1; i < 10; i++) { cout « ", " « a[i]; } cout « "}" << endl; 23 24 25 }

Complete the expand() function template. The template takes a reference to a unique_ptr pointing to an array and doubles the size of the array. memory.cpp 1 #include 2 #include 3 #include 4 using namespace std; 5 template void expand(unique_ptr& a, int size) 8 7 { 10 11 12 } 13 14 int main() 15 { 16 17 unique_ptr a{new int[5]{ 10, 1, 5, 6, 4 }}; 18 expand(a, 5); // resize to hold 10 elements 19 20 21 for (int i = 5; i < 10; i++) { a[i] = (i + 1) * (i + 1); } 22 cout « "a->{" « a[0]; for (int i = 1; i < 10; i++) { cout « ", " « a[i]; } cout « "}" << endl; 23 24 25 }

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

C++ Programming Redesign your class myArray using class templates so that the class can be used in any application that requires arrays to process data. #include <iostream>#include "myArray.h" using namespace std; int main(){myArray list1(5);myArray list2(5); int i; cout << "list1 : ";for (i = 0; i < 5; i++)cout << list1[i] << " ";cout << endl; cout << "Enter 5 integers: ";for (i = 0; i < 5; i++)cin >> list1[i];cout << endl; cout << "After filling list1: "; for (i = 0; i < 5; i++)cout << list1[i] << " ";cout << endl; list2 = list1;cout << "list2 : ";for (i = 0; i < 5; i++)cout << list2[i] << " ";cout << endl; cout << "Enter 3 elements: "; for (i = 0; i < 3; i++)cin >> list1[i];cout << endl; cout << "First three elements of list1: ";for (i = 0; i < 3; i++)cout << list1[i] << " ";cout << endl; myArray list3(-2, 6); cout <<…
#include <iostream>#include <cstdlib>#include <time.h>#include <chrono> using namespace std::chrono;using namespace std; void randomVector(int vector[], int size){ for (int i = 0; i < size; i++) { //ToDo: Add Comment vector[i] = rand() % 100; }} int main(){ unsigned long size = 100000000; srand(time(0)); int *v1, *v2, *v3; //ToDo: Add Comment auto start = high_resolution_clock::now(); //ToDo: Add Comment v1 = (int *) malloc(size * sizeof(int *)); v2 = (int *) malloc(size * sizeof(int *)); v3 = (int *) malloc(size * sizeof(int *)); randomVector(v1, size); randomVector(v2, size); //ToDo: Add Comment for (int i = 0; i < size; i++) { v3[i] = v1[i] + v2[i]; } auto stop = high_resolution_clock::now(); //ToDo: Add Comment auto duration = duration_cast<microseconds>(stop - start); cout << "Time taken by function: " << duration.count()…
Status: A Moving to the next question prevents changes to this answer. Question 15 Write the C function that will create an instance of the structure for the dynamic array defined below and initialize the fields in the structure to reflect than space for 20 values have been allocated in the dynam The function's parameter must match the call shown below. typedef struct dynArrStruct int* int int /* pointer to the dynamic array / amount of space currently allocated for the dynamic array */ 1* number of values currently stored in the dynamic array arr; allocated; inuse; } dynArr; */ void main(){ dynArr *al; al = create (); /* write the function to match this call */ For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). BIUS Preformatted *O自Q Terminal 10pt AV E E E E 田田田田田田図因田田 Ť {} dynArrStruct create(unsigned n){ dynArrStruct* matrix; matrix = malloc(sizeof(matrix)); matrix->allocated%-Dn%3; matrix->inUse%3D0%3B matrix->arr=malloc(sizeof(int *)*n); for (int…
// MichiganCities.cpp - This program prints a message for invalid cities in Michigan. // Input: Interactive // Output: Error message or nothing #include <iostream> #include <string> using namespace std; int main() { // Declare variables string inCity; // name of city to look up in array const int NUM_CITIES = 10; // Initialized array of cities string citiesInMichigan[] = {"Acme", "Albion", "Detroit", "Watervliet", "Coloma", "Saginaw", "Richland", "Glenn", "Midland", "Brooklyn"}; bool foundIt = false; // Flag variable int x; // Loop control variable // Get user input cout << "Enter name of city: "; cin >> inCity; // Write your loop here // Write your test statement here to see if there is // a match. Set the flag to true if city is found. // Test to see if city was not found to determine if // "Not a city in Michigan" message should be printed.…
#include <iostream> #include<string.h> //user-defined functions question! using namespace std; struct Books { char title[50]; char author[50]; char subject[100]; int book_id; }; int main() { double array1[5]= {13.768,4.0,88.7689,9.12,}; struct Books Book1; strcpy( Book1.title, "C++ Programming"); strcpy( Book1.author, "D.S Malik"); strcpy( Book1.subject, "C++ basics"); Book1.book_id = 6495407; ////Block#1////// int x=4; for (x; x>=0; x--){ cout<<array1[x]<<endl; //////////////////////////////// } cout<<"///////////////////////"<<endl; ////end of Block#1////// ////Block#2////// int sum=0, i=0; for (i; i<5; i++){ cout<<static_cast<int>(array1[i])<<" "; sum= sum+array1[i]; cout<<sum<<endl; } cout<< "final value of sum="<<" "<<sum<<endl; cout<< "the average value ="<<" " <<sum/5 <<endl; cout<<"//////////////////////"<<endl; //
C++
#include <iostream> #include<string.h> //user-defined functions question! using namespace std; struct Books { char title[50]; char author[50]; char subject[100]; int book_id; }; int main() { double array1[5]= {13.768,4.0,88.7689,9.12,}; struct Books Book1; strcpy( Book1.title, "C++ Programming"); strcpy( Book1.author, "D.S Malik"); strcpy( Book1.subject, "C++ basics"); Book1.book_id = 6495407; ////Block#1////// int x=4; for (x; x>=0; x--){ cout<<array1[x]<<endl; //////////////////////////////// } cout<<"///////////////////////"<<endl; ////end of Block#1////// ////Block#2////// int sum=0, i=0; for (i; i<5; i++){ cout<<static_cast<int>(array1[i])<<" "; sum= sum+array1[i]; cout<<sum<<endl; } cout<< "final value of sum="<<" "<<sum<<endl; cout<< "the average value ="<<" " <<sum/5 <<endl; cout<<"//////////////////////"<<endl; //
matrix = {{1,2},{4,5}} this in c++
//main.cpp file #include <iostream> #include "helper.h" #include "sorting.h" using namespace std; int main() { unsigned int size; cout << "Enter the size of the array: "; cin >> size; int* Array = new int[size]; unsigned int choice = 0; do { fillRandom(Array, size); cout << "Choose your sorting algorithm:" << endl; cout << "1. Bubble Sort" << endl; cout << "2. Selection Sort" << endl; cout << "3. Insertion Sort" << endl; cout << "4. Merge Sort" << endl; cout << "5. Quick Sort" << endl; cout << "6. Shell Sort" << endl; //Optional cout << "Enter 0 to exit" << endl; cout << "Your choice: "; cin >> choice; cout << "Unsorted Array: "; print(Array, size); /***************************** TODO: Implement what you will do with the choice*****************************/ cout << "Sorted Array: "; print(Array, size); } while(choice!=0); delete [] Array; return 0; }…
#include <iostream>using namespace std;double median(int *, int);int get_mode(int *, int);int *create_array(int);void getinfo(int *, int);void sort(int [], int);double average(int *, int);int getrange(int *,int);int main(){ int *dyn_array; int students; int mode,i,range;float avrg;do{cout << "How many students will you enter? ";cin >> students;}while ( students <= 0 );dyn_array = create_array( students );getinfo(dyn_array, students);cout<<"\nThe array is:\n";for(i=0;i<students;i++)cout<<"student "<<i+1<<" saw "<<*(dyn_array+i)<<" movies.\n";sort(dyn_array, students);cout << "\nthe median is "<<median(dyn_array, students) << endl;cout << "the average is "<<average(dyn_array, students) << endl;mode = get_mode(dyn_array, students);if (mode == -1)cout << "no mode.\n";elsecout << "The mode is " << mode << endl;cout<<"The range of movies seen is…
C++ Code Write three statements to print the first three elements of array runTimes. Follow each statement with a newline. Ex: If runTimes = {800, 775, 790, 805, 808}, print:800 775 790 code: #include <iostream>using namespace std; int main() { const int NUM_ELEMENTS = 5; int runTimes[NUM_ELEMENTS]; int i; for (i = 0; i < NUM_ELEMENTS; ++i) { cin >> runTimes[i]; } /* Your solution goes here */ return 0;}
Arrays write a C++ program that will declare two static arrays where each will hold the contents of a file (random.txt) of 200 integer values. Sorting Using the two arrays, call a private member function that uses the bubble sort algorithm to sort one of the arrays in ascending order. The function should count the number of exchanges it makes. Display this value. The program should then call a private member function that uses the selection sort algorithm to sort the other array. It should also count the number of exchanges it makes. Display this value. Searching Next, call a private member function that uses the linear search program to locate the value 869. The function should keep a count of the number of comparisons it makes until it finds the value. Display this value The program then should call a private member function that uses the binary search algorithm to locate the same value. It should also keep count of the numbers of comparisons it makes. Display this…