All posts by : chebby

1. **Research Paper**

Discusses strategy and how ERM can be integrated with an organization’s overall strategy. Prepare a research paper on some of the various issues, protocols, methods, frameworks you found and discuss how – if possible – organizations can use ERM as strategy. It is perfectly acceptable if you deem ERM cannot be used as strategy, just back up your claim with scholarly research and justifications.

 paper should meet these requirements: 

Be approximately to six pages in length, not including the required cover page and reference page.

Follow APA 7 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. 

Be clearly and well-written, concise, and logical, using excellent grammar and style techniques. You are being graded in part on the quality of your writing.

2. **Discussion**

Do you think that ERM is necessary in the contemporary organization and why?

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?

Answer the following questions in a cohesive and comprehensive essay. 

• What is the difference between the “DELETE” and “TRUNCATE” commands?
• What is the difference between the “WHERE” clause and the “HAVING” clause?
• What is the difference between “Primary Key” and “Unique Key”?

Click the link above to submit your completed assignment.

Requirements:

• A minimum of 350 words. 
• Use APA format. 
  • Times New Roman 12 pt font, double spaced with 1″ margins.

Due is August 24th.

1. Select one of the three scenarios studied for assignment 7.1. 
2. How would the situation and conclusions change if that scenario were approach from one of the two other methodological approaches than it was.

450 words with intext references and 3 main references

Situation: participating honestly in a conversation in a difficult art succeeding is the sign of a skilful creator of actors knowledge

Methodology approach: Actor’s or System’s approach

Misleading Data Project

Directions:

Explain why you think the data visualizations could be misleading.  There are four prompts (data visualizations)  Each prompt (added in the attachment) should be addressed and completed in a minimum of 200 words.  Citations are not required for this assignment but be sure to include as much detail as possible to illustrate your thinking.

The Assessment is available as an attached word for reference.

Complete your assessment using the downloadable assessment document and submit your completed assessment.

Que 1:  Discuss this statement: “Internationalization is a relevant strategic option for high-tech venture expansion and growth.” What makes this statement true? What facts support this statement? – Almost 1 page

Que 2:  Discuss this statement: “The application of financial theory to new venturing has uniquely defining characteristics that differentiates it from classical corporate finance.” What makes this statement true? What are the defining characteristics? – Almost 1 page

Que 3:  Read the attached case study and write 2 and a half-page summary analysis and answer the Case Study Questions.  

Note: My assignments will need actual references from EBSCO host, google scholar, and semantic scholar With a website link at the end.  Only use APA 7th edition. Que 3 needs to be in separate document. I have also attached APA 7th edition format for your reference. Please review and create the paper accordingly. 

In 300 words

Describe each of the elements of a Business Continuity Plan (BCP). 

Include references, no copy-paste strictly.  

Select from the following list four (4) topics and discuss. Use only 70-words max per topic to discuss and present your answer. The discussion questions this week are from Chapter 8  (Jamsa, 2013). Chapter 8 topics:

• Define and describe virtualization.
• Defend the following statement: Virtualization is not a new concept within computer science.
• Describe the various types of virtualization.
• List the pros and cons of virtualization.
• Discuss the attributes of applications that are not well suited for virtualization.
• List reasons why companies should virtualize.
• List the benefits of blade servers.
• Define and describe the hypervisor.
• Define and describe green computing.
• Describe the concept of the desktop on-demand, and include the benefits of such a system.

NOTE: You are required to use at least two-peer reviewed sources (besides your textbook) to answer the above questions. 

Please complete 7.3 questions