Cloud computing: The term cloud can be defined as the process that led the computers resources to be accessed anytime anywhere over the internet. The cloud can be represented as the elastic leasing of the various computer resources that are known as the pooled resources that can be accessed over the internet. Data security of cloud: In cloud computing, users who put their information on the cloud, will be relived about storage and maintenance. Here, the data integrity is more challenging. Some of the challenges of data security measures that reduces threats in cloud computing are: Confidentiality – Data is visible only to the legal or authorized users. The information cannot be accessed by third party. Access controllability – It is nothing but the owner of the particular information can create selective restrictions for others to access data. Integrity – It is nothing but maintaining information with exactness and wholeness of data. The information must be stored properly and it should not be damaged or modified illegally.

Question

Want to see the full answer?

Answer 1

Question

Chapter 7.8, Problem 6SGDQ

Program Plan Intro

Cloud computing:

The term cloud can be defined as the process that led the computers resources to be accessed anytime anywhere over the internet. The cloud can be represented as the elastic leasing of the various computer resources that are known as the pooled resources that can be accessed over the internet.

Data security of cloud:

In cloud computing, users who put their information on the cloud, will be relived about storage and maintenance. Here, the data integrity is more challenging. Some of the challenges of data security measures that reduces threats in cloud computing are:

Confidentiality – Data is visible only to the legal or authorized users. The information cannot be accessed by third party.

Access controllability – It is nothing but the owner of the particular information can create selective restrictions for others to access data.

Integrity – It is nothing but maintaining information with exactness and wholeness of data. The information must be stored properly and it should not be damaged or modified illegally.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

7. Long-Distance CallsA long-distance provider charges the following rates for telephone calls: Rate Category Rate per MinuteDaytime (6:00 a.m. through 5:59 p.m.) $0.07Evening (6:00 p.m. through 11:59 p.m.) $0.12Off-Peak (midnight through 5:59 a.m.) $0.05Write a GUI application that allows the user to select a rate category (from a set of radio buttons), and enter the number of minutes of the call into an Entry widget. An info dialog box should display the charge for the call.

Name and Address The Name and Address Problem Write a GUI program that displays your name and address when a button is clicked. The program’s window should appear as the sketch on the left side of Figure 13-61 when it runs. When the user clicks the Show Info button, the program should display your name and address, as shown in the sketch on the right of the figure.

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…