Ask question

Ask question

All categories

2 years ago

7

_______ consists of the analysis tools, technologies, and processes by which marketers dig out meaningful patterns in big data

to gain customer insights and gauge marketing performance.

Computers and Technology

1 answer:

Salsk061 [2.6K]2 years ago

7 0

I think it's value chain analysis.

You might be interested in

(20 points). Some matrixes have very special patterns, for example, in the following matrix, the numbers in the first row are eq

Nostrana [21]

Answer:

#include <iostream>

using namespace std;

void matrix(){

int row = 5, col = 6;

int myarr[row][col];

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

for (int x = 0; x < 6; x++){

if (i == 0){

myarr[i][x] = (x+1)*(x+1);

}else if ( x == 0){

myarr[i][x] = (i+1)*(i+1)*(i+1);

} else if ( i == x){

myarr[i][x] = (i+1);

} else{

myarr[i][x] = myarr[i-1][x] + myarr[i][x-1];

}

}

}

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

for (int x = 0; x < 6; x++){

cout<< myarr[i][x] << " ";

}

cout<< "\n";

}

}

int main(){

matrix();

}

Explanation:

The C++ source code defines a two-dimensional array that has a fixed row and column length. The array is a local variable of the function "matrix" and the void function is called in the main program to output the items of the array.

3 0

2 years ago

Which of the following is true about a hot site?

swat32

Answer:

Option(d) is the correct answer to the given question.

Explanation:

A hot site is a place off site in which the task of a corporation could restart during a massive failure.The hot site seems to have all the needed equipment for such the corporation to schedule the normal activities, such as phone jacks, replacement data, laptops, and linked devices.

The main objective of hot sites provide an useful backup mechanism for any corporation that wishes to pursue its business in the presence of exceptional circumstances or events.
All the others options are not related to hot site that's why they are incorrect option.

8 0

3 years ago

(Financial application: compound value) Suppose you save $100 each month into savings account with an annual interest rate of 5%

Nostrana [21]

Solution:

initial = float(eval(input('Enter the monthly saving amount: ')))

x = (1 + 0.00417)

month_one = initial * x

month_two = (initial + month_one) * x

month_three = (initial + month_two) * x

month_four = (initial + month_three) * x

month_five = (initial + month_four) * x

month_six = (initial + month_five) * x

print('The sixth month value is: '+str(month_six))

Don't forget the saving amount, and initialize the balance with that amount. Inside the loop, work out and add the interest and then add the saving amount for the next month.

balance = 801

for month in range(6):

balance = balance * (1.00417)

print(balance)

7 0

3 years ago

Research the design basis threat (DBT) in terms of Cybersecurity for an organization of your choice. Discuss what the Cybersecur

tiny-mole [99]

A Design Basis Threat (DBT) is known to be a characteristics of any given or potential insider and also those of external adversaries, that may try to have or gain unauthorized removal or sabotage, against a physical protection system that was set up designed and evaluated.

<h3>What are Cybersecurity objectives?</h3>

Cybersecurity aims are:

To protect computer system,
To protect networks,
To protect software programs from such cyber attacks.

Note that a lot of digital attacks are targeted at accessing, changing, or deleting sensitive information as well as others.

Learn more about IT from

brainly.com/question/1276995

#SPJ1

3 0

1 year ago

We have said that the average number of comparisons need to find a target value in an n-element list using sequential search is

bija089 [108]

Answer:

Part a: If the list contains n elements (where n is odd) the middle term is at index (n-1)/2 and the number of comparisons are (n+1)/2.

Part b: If the list contains n elements (where n is even) the middle terms are at index (n-2)/2 & n/2 and the number of comparisons are (n+2)/2.

Part c: The average number of comparisons for a list bearing n elements is 2n+3/4 comparisons.

Explanation:

Suppose the list is such that the starting index is 0.

Part a

If list has 15 elements, the middle item would be given at 7th index i.e.

there are 7 indices(0,1,2,3,4,5,6) below it and 7 indices(8,9,10,11,12,13,14) above it. It will have to run 8 comparisons to find the middle term.

If list has 17 elements, the middle item would be given at 8th index i.e.

there are 8 indices(0,1,2,3,4,5,6,7) below it and 8 indices(9,10,11,12,13,14,15,16) above it.It will have to run 9 comparisons to find the middle term.

If list has 21 elements, the middle item would be given at 10th index i.e.

there are 10 indices (0,1,2,3,4,5,6,7,8,9) below it and 10 indices (11,12,13,14,15,16,17,18,19,20) above it.It will have to run 11 comparisons to find the middle term.

Now this indicates that if the list contains n elements (where n is odd) the middle term is at index (n-1)/2 and the number of comparisons are (n+1)/2.

Part b

If list has 16 elements, there are two middle terms as one at would be at 7th index and the one at 8th index .There are 7 indices(0,1,2,3,4,5,6) below it and 7 indices(9,10,11,12,13,14,15) above it. It will have to run 9 comparisons to find the middle terms.

If list has 18 elements, there are two middle terms as one at would be at 8th index and the one at 9th index .There are 8 indices(0,1,2,3,4,5,6,7) below it and 8 indices(10,11,12,13,14,15,16,17) above it. It will have to run 10 comparisons to find the middle terms.

If list has 20 elements, there are two middle terms as one at would be at 9th index and the one at 10th index .There are 9 indices(0,1,2,3,4,5,6,7,8) below it and 9 indices(11,12,13,14,15,16,17,18,19) above it. It will have to run 11 comparisons to find the middle terms.

Now this indicates that if the list contains n elements (where n is even) the middle terms are at index (n-2)/2 & n/2 and the number of comparisons are (n+2)/2.

Part c

So the average number of comparisons is given as

((n+1)/2+(n+2)/2)/2=(2n+3)/4

So the average number of comparisons for a list bearing n elements is 2n+3/4 comparisons.

6 0

2 years ago