All posts by : chebby

Students will create a Disaster Recovery Plan for either the organization they work for or one they wish to work for in the future.  The plan will follow the template/example provided.

 Test out the Google App Engine – Quickstart for Python 2 Standard Environment

This quick start shows you how to create a small App Engine application that displays a short message. 

 You will need to analyze asymmetric and symmetric encryption.  Evaluate the differences between the two of them and which one that you would determine is the most secure.  The writing assignment requires a minimum of two written pages to evaluate history.  You must use a minimum of three scholarly articles to complete the assignment.  The assignment must be properly APA formatted with a separate title and reference page.  

Please read the above description carefully. Thank you.

Researchers from the School of BioSciences have requested our help with one of their

experiments. They are performing behavioural experiments with zebrafish. At any one instance in

time there are a large number of zebrafish in the aquarium. For their particular experiment, the

biologist take a snapshot of the aquarium and then need to find the longest series of zebrafish such

the length of each fish along the horizontal direction in the aquarium is increasing. They also need

to know the number of zebra fish in this series.

For example, the snapshot of the aquarium resulted in fish lengths of [2, 5, 3, 7, 11, 1, 12, 4, 15, 14, 6, 16].

One possible longest series of increasing lengths in this case is [2, 3, 7, 11, 12, 14, 16] with 7 zebrafish.

We say one possible longest series of increasing lengths here because it is not necessarily unique.

For example, the length 14 in the output could be replaced with 15: [2, 3, 7, 11, 12, 15, 16] and also

be valid.

In this question you will consider algorithms for finding the longest series of increasing lengths

via the function LongestIncreasingLengths(A[0, · · · , n − 1]), as well as the size of this output

array.

(a) [1+2+1 = 4 Marks] Consider a recursive algorithm:

i [1 Mark]Write down a recurrence relation for the function LongestIncreasingLengths.

ii [2 Marks] Using this recurrence relation, write a recursive algorithm in pseudocode for

LongestIncreasingLengths that only calculates the array size of the longest series of

increasing lengths. You do not need to output the actual array containing the longest

series of increasing lengths in this part of the question. For the example above with input

A = [2, 5, 3, 7, 11, 1, 12, 4, 15, 14, 6, 16], the output should just be 7. The pseudocode should

be about 10 lines of code.

iii [1 Mark] What is the time complexity of this recursive algorithm? Justify your answer.

(b) [5+1+1 = 7 Marks]

i [5 Marks] Building on from your recursive algorithm in part (a), write down a dynamic

programming implementation in pseudocode for the function

LongestIncreasingLengths(A[0, · · · , n − 1]) to find the longest series of increasing

lengths. This should also output the size of the longest series of increasing lengths. The

pseudocode should be about 20 lines of code.

ii [1 Mark] Explain how the recurrence relation used for your dynamic programming imple-

mentation involves overlapping instances.

iii [1 Mark] What is the time complexity of your algorithm and how much auxiliary space

was required. Justify your answer.

(c) [1+2 = 3 Marks] The time complexity of the recursive algorithm for LongestIncreasingLengths

was exponential, while the dynamic programming algorithm lead to a polynomial

time complexity (note, you need to determine that polynomial above). Here we will investigate

an algorithm for the function LongestIncreasingLengths that has a time complexity of

O(n log n).

Consider building a set of arrays for the input array A[0, · · · , n − 1]. As we scan along A, we

will compare A[i] with the final element in each array in this set. This comparison will satisfy

the following conditions:

(1) If A[i] is smaller than the final element in each array, start a new array of size 1 with A[i].

(2) If A[i] is larger than the final element in each array, copy the longest array and append

A[i] to this new array.

(3) If A[i] is in between, find the array with the final element that is greater than A[i] and

replace that element with A[i].

i [1 Mark] Write down the set of arrays that satisfy these rules for the input array

A = [0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15].

ii [2 Marks] Building from these conditions, explain how an algorithm for the function

LongestIncreasingLengths could run with time complexity O(n log n). You may make

use any algorithm introduced in the lectures to help you with your explanation. Note: you

do not have to write this algorithm in pseudocode. We are expecting that you write a short

paragraph or a short list of bullet points describing the important steps of the algorithm

to explain the time complexity.

Hint: what if you only consider the final elements of this set of arrays as a single array?

Part 1 : Research paper 

What are baseline security requirements that should be applied to the design and implementation of applications, databases, systems, network infrastructure, and information processing when considering cloud computing within an enterprise risk management framework?

Your paper should meet the following requirements:

• Be approximately four to six pages in length, not including the required cover page and reference page.
• Follow APA7 guidelines. Your paper should include an introduction, a body with fully developed content, and a conclusion.
• Support your answers with the readings from the course and at least two scholarly journal articles to support your positions, claims, and observations, in addition to your textbook. The UC Library is a great place to find resources.

Part 2 : discussion ( 500 words including 2 responses )

• What are some of the potential risks involved with cloud computing?
• Does the research and model in this article propose a viable solution to cloud-based risk management?

Please make your initial post and two response posts substantive. A substantive post will do at least two of the following:

• Ask an interesting, thoughtful question pertaining to the topic
• Answer a question (in detail) posted by another student or the instructor
• Provide extensive additional information on the topic
• Explain, define, or analyze the topic in detail
• Share an applicable personal experience
• Provide an outside source (for example, an article from the UC Library) that applies to the topic, along with additional information about the topic or the source (please cite properly in APA 7)
• Make an argument concerning the topic

In 300 words,

Use the Web to search for methods to prevent XSS attacks.

Write a brief description of more than one method.

Use your own words and supply references.

Include references, no copy-paste.

C++ coding assignment

Please see the attachments for the instruction of this assignment

I need an A work

Thank you

Check Attachment!!

HELLO, You gotta use the Linux system for the homework and answer all the questions. If you could help me quick

Topic :Cloud computing infrastructure and cloud security 

In security research, there are three specific areas such as trusted computing, information-centric security, and privacy-preserving models.

Cloud Security protects the data from leakage, theft, disaster, and deletion. With the help of tokenization, VPNs, and firewalls, we can secure our data. Cloud Security is a vast topic and we can use it for more research. The number of organizations using cloud services is increasing. There are some security measures, which will help to implement the cloud security-

Accessibility

Integrity

Confidentiality

Topic: Cloud computing infrastructure and cloud security: 

Abstract:

Background of the problem

Outline of the problem

Research questions minimum three 

Literature review: 4 pages 

Methodology – 1 page

Conclusion

use APA 7th edition only for references