All categories

3 years ago

Which of the following actions might contribute to recommendations you see online?

Computers and Technology

1 answer:

kati45 [8]3 years ago

6 0

Answer:

Rating a favorite movie on a digital streaming site, (Option A is correct)

Explanation:

Rating a favorite movie on a digital streaming site might contribute to recommendations you see online such as on videos streaming site. After viewing the movie, you rate the movie to like or dislike, or rate on five stars. Your this rating might contribute to recommendation for others. If a movie has a very low rating, it means that this movie is not recommended for you than the movie which has the highest rating by people. For example, most probably you like to watch the movie on streaming site that has the highest numbers of likes and views

Other actions might not contribute toward recommendation:

Searching an item using the search engine might not contribute toward the recommendation you see online. Because when you search in a search engine, you may not rate the item you are searching for in it.

Furthermore, purchasing a new t shire from an online retailer may not contribute toward recommendation because you purchased the t-shirt and may not rate it.

All of the above option is only acceptable, when all options allow you to rate online or recommend online. Therefore, only first option allow you to rate your favorite movie on a digital streaming site that might contribute towards recommendation you see online.

You might be interested in

Implement a C program to solve the 15-puzzle problem using the A* search algorithm.

fomenos

Answer:

#include<stdio.h>

#include<conio.h>

int m=0,n=4;

int cal(int temp[10][10],int t[10][10])

{

int i,j,m=0;

for(i=0;i < n;i++)

for(j=0;j < n;j++)

{

if(temp[i][j]!=t[i][j])

m++;

}

return m;

}

int check(int a[10][10],int t[10][10])

{

int i,j,f=1;

for(i=0;i < n;i++)

for(j=0;j < n;j++)

if(a[i][j]!=t[i][j])

f=0;

return f;

}

void main()

{

int p,i,j,n=4,a[10][10],t[10][10],temp[10][10],r[10][10];

int m=0,x=0,y=0,d=1000,dmin=0,l=0;

clrscr();

printf("\nEnter the matrix to be solved,space with zero :\n");

for(i=0;i < n;i++)

for(j=0;j < n;j++)

scanf("%d",&a[i][j]);

printf("\nEnter the target matrix,space with zero :\n");

for(i=0;i < n;i++)

for(j=0;j < n;j++)

scanf("%d",&t[i][j]);

printf("\nEntered Matrix is :\n");

for(i=0;i < n;i++)

{

for(j=0;j < n;j++)

printf("%d\t",a[i][j]);

printf("\n");

}

printf("\nTarget Matrix is :\n");

for(i=0;i < n;i++)

{

for(j=0;j < n;j++)

printf("%d\t",t[i][j]);

printf("\n");

}

while(!(check(a,t)))

{

l++;

d=1000;

for(i=0;i < n;i++)

for(j=0;j < n;j++)

{

if(a[i][j]==0)

{

x=i;

y=j;

}

//To move upwards

for(i=0;i < n;i++)

for(j=0;j < n;j++)

temp[i][j]=a[i][j];

if(x!=0)

{

p=temp[x][y];

temp[x][y]=temp[x-1][y];

temp[x-1][y]=p;

}

m=cal(temp,t);

dmin=l+m;

if(dmin < d)

{

d=dmin;

for(i=0;i < n;i++)

for(j=0;j < n;j++)

r[i][j]=temp[i][j];

}

//To move downwards

for(i=0;i < n;i++)

for(j=0;j < n;j++)

temp[i][j]=a[i][j];

if(x!=n-1)

{

p=temp[x][y];

temp[x][y]=temp[x+1][y];

temp[x+1][y]=p;

}

m=cal(temp,t);

dmin=l+m;

if(dmin < d)

{

d=dmin;

for(i=0;i < n;i++)

for(j=0;j < n;j++)

r[i][j]=temp[i][j];

}

//To move right side

for(i=0;i < n;i++)

for(j=0;j < n;j++)

temp[i][j]=a[i][j];

if(y!=n-1)

{

p=temp[x][y];

temp[x][y]=temp[x][y+1];

temp[x][y+1]=p;

}

m=cal(temp,t);

dmin=l+m;

if(dmin < d)

{

d=dmin;

for(i=0;i < n;i++)

for(j=0;j < n;j++)

r[i][j]=temp[i][j];

}

//To move left

for(i=0;i < n;i++)

for(j=0;j < n;j++)

temp[i][j]=a[i][j];

if(y!=0)

{

p=temp[x][y];

temp[x][y]=temp[x][y-1];

temp[x][y-1]=p;

}

m=cal(temp,t);

dmin=l+m;

if(dmin < d)

{

d=dmin;

for(i=0;i < n;i++)

for(j=0;j < n;j++)

r[i][j]=temp[i][j];

}

printf("\nCalculated Intermediate Matrix Value :\n");

for(i=0;i < n;i++)

{

for(j=0;j < n;j++)

printf("%d\t",r[i][j]);

printf("\n");

}

for(i=0;i < n;i++)

for(j=0;j < n;j++)

{

a[i][j]=r[i][j];

temp[i][j]=0;

}

printf("Minimum cost : %d\n",d);

}

getch();

}

Explanation:

7 0

3 years ago

Find the number of times a value appears in a list, and create a new list that contains the index positions where the value occu

Maru [420]

Answer:

Program :

list_1=[]#take the empty list.

size=int(input("Enter the size of the list: "))#take the size of the list from the user

for x in range(size): #for loop which insert the elemnt on the list.

list_1.append(int(input("Enter the "+str(x+1)+" element of the list: ")))#take the user input and insert the element.

element=int(input("Enter the element to be searched: "))#it take the elemnt to search.

loc=1#intialize the location value.

count=0

for x in list_1:#for loop to check the element.

if(x==element): #check the element.

print(loc,end=", ")#print the location of the element.

count=count+1

loc=loc+1

if(count==0):

print("The element is not present on the list")#print when elemnt are not present.

Output:

If the user input 5 for the size and 1,2,3,4,5 for the list and 5 for the element, then it will print 5.

Explanation:

The above code is in python language which is used to take the size for the list, then take the value to add on the list.
Then the element is entered from the user to search on the list.
Then the element is searched on the list with the help of for loop.
It prints the location when the element is matched.

3 0

3 years ago

What is the most common way to obtain new software?.

Lera25 [3.4K]

Today, the most common way to get new software is to download it from the Internet. Applications like Microsoft Office and Adobe Photoshop can now be purchased and downloaded right to your computer. You can also install free software this way.

6 0

2 years ago

What are the principles of creating a visual design

iren2701 [21]

Contrast, Balance, Emphasis, Movement, White Space, Proportion, Hierarchy, Repetition, Rhythm, Pattern, Unity, and Variety.

8 0

3 years ago

A weakness of a system, process, or architecture that could lead to compromised information or unauthorized access is known as a

Anna11 [10]

Answer: vulnerability

Explanation:

3 0

2 years ago