Homework Answers

 For the experiment Taru has N buckets (numbered from 1,2,3..N) which all are initially empty. She has M number of queries. Each query represents an integer that is of 4 types. Query 1: Fill all the buckets with water •Query 2: Empre even valued buckets (2, 4, 6 N) Query 3: Empty all odd number buckets (1, 3, 5, N). •Query 4: Empty all the buckets (1,2,3. N). You have to return the number of buckets that are filled after performing M queries,using fillbucket function

given the following code what is the value of cities[3]

String cities[] = new String[5];

  cities[0] = "North bay";

  cities[1] = "Windsor";

  cities[2] = "Kitchener";

  cities[3] = "Kingston";

  cities[4] = "Ottawa";

Given the following How many elements are in the array die3

 int die1[] = {1,0,2,0,3,1};

 int die2[] = {2,1,0,4,0,3};

 int die3[] = {3,0,3,0,3,4};

 int die4[] = {2,0,1,0,3,5};

 int die5[] = {1,0,2,0,3,4};

 int die6[] = {4,0,1,2,3,2};

  int dice[][] = {die1,die2,die3,die4,die5,die6};

How to execute this using vector

#include <cmath>

#include <iomanip>

#include <iostream>

using namespace std;

int fibo(int n);

int main() {

string header = " Index Fibonacci number Fibonacci quotient Deviation";

double lim = (1.0 + sqrt(5.0)) / 2.0;

int fib_sequence[21];

for (short i = 0; i < 21; i++) {

fib_sequence[i] = fibo(i);

}

cout << header << endl;

for (short i = 0; i < 20; i++) {

double q = (double)fib_sequence[i + 1] / (double)fib_sequence[i];

cout << setw(5) << i << setw(15) << fib_sequence[i] << setw(20) << fixed

<< setprecision(10) << q << setw(20) << scientific << setprecision(3)

<< lim - q << endl;

}

return 0;

}

int fibo(int n) {

if (n <= 1)

return n;

return fibo(n - 1) + fibo(n - 2);

}