Last week we discussed “seven hats” so why are we discussing “eight hats” this week. As our concepts and theories evolve, we adapt our assessments to fit the new model. Kirk’s (2012) “eight hats of data visualization design” was influenced by Edward de Bono’s six thinking hats. However, last week we discussed “seven hats.” What changed from Kirk’s 2012 book to his 2016 book? This week we will discuss the similarities and differences of Kirk’s (2012, 2016) hats
Database Storage
In Weeks 1-5, you will be working on gathering information in a Database Management Plan that will culminate in Week 6 in a 20-minute presentation (10-12 slides) to explain how to staff and run the organization’s database administration.
The presentation will provide recommendations to an organization regarding how to develop a plan for the maintenance of databases that store business data and use in business analytics.
Create 700-word entry in your Database Management Plan. You will use information from this entry in your presentation due in Week 6. Ensure you:
- Assess the best way to organize data into your database.
- Distinguish how organizational data can be used in the most effective way through developing a database.
- Describe the relationship model and conceptual design to be used.
Submit your assignment.
cryptographic attack
Malicious individuals have discovered several methods to attack and defeat cryptosystems. It’s important that understand the threats posed by cryptographic attacks to minimize the risks to your network systems.
Identify one cryptographic attack and how you can protect against it.
The paper requires
- Explain, define, or analyze the topic in detail
- Please cite properly in APA 7
- Use scholarly references
- Minimum of 2 pages
ERM WK3 -S
Q1. 275 words
From your research, discuss whether or not your organization has ISO 27001 certification. Outside of overall protection from cyber-attacks, describe, in detail, some other benefits your organization will achieve in obtaining this certification. If your company does not have this certification, how can they go about obtaining it?
Present your discussion post as if you were presenting to senior leaders of your company.
Q2. SEPARATE DOCUMENT —- Research paper – 5 full pages
Readings:
Lopes, M., Guarda, T. & Oliveira, P. (2019). How ISO 27001 Can Help Achieve GDPR Compliance. 2019 14th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1-6. https://ieeexplore.ieee.org/document/8760937?arnumber=8760937
Al-Ahmad, W., & Mohammad, B. (2013). Addressing Information Security Risks by Adopting Standards. International Journal of Information Security Science, 2(2), 28–43.
The above article readings give a good discussion and look at some of the frameworks that are used to manage risk within organizations and enterprises. One of the readings this week provided an introduction and comparison of different frameworks. As with anything, there are going to be strengths and weaknesses to all approaches.
please address the following in a properly formatted research paper:
- Do you think that ISO 27001 standard would work well in the organization that you currently or previously have worked for? If you are currently using ISO 27001 as an ISMS framework, analyze its effectiveness as you perceive in the organization.
- Are there other frameworks mentioned has been discussed in the article that might be more effective?
- Has any other research you uncover suggest there are better frameworks to use for addressing risks?
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 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. The UC Library is a great place to find resources.
- 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.
the time complexity of algorithms.
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?
Assignment
Managerial Challenge
US Airways (American Airlines) owns a piece of land near the Pittsburgh International Airport. The land originally cost US Airways $375,000. The airline is considering building a new training center on this land. US Airways determined that the proposal to build the new training center is acceptable if the original cost of the land is used in the analysis, but the proposal does not meet the airline’s project acceptance criteria if the land cost is above $850,000. Assume the labor and raw materials total $1,720,000. A developer recently offered US Airways $2.5 million for the land. What is the economic profit, opportunity cost, and should US Airways (American Airlines) build the training center at this location? (Chapter 8 Economic Cost)
Submission Details:
- Response should be no more than 250 words
- Include the appropriate calculation
- Follow the APA style of writing with in-text citations and a reference list if necessary.
. Read Articles:
“U.S. Car Business in Major Shift”
U. S. Car Business Article.pdf
“Car Making in America”
Information System for Business
Chapter 2 – Study Questions 1-10, Exercise 2, Lab 2 (Information Systems for Business and Beyond) Submit the above homework in one document.
5
Homework
Chapter 2 Paper: Discuss why the IT organizational structure is an important concept to understand. Also, discuss the role of IT in the overall business strategy. (Information Technology and Organizational Learning Textbook)
The above submission should be one page in length and adhere to APA formatting standards.
**Remember the page length does not include the APA cover page or any references**
Please find the below link for textbook reference: