All posts by : chebby

This week’s written activity is a three- part activity. You will respond to three separate prompts but prepare your paper as one research paper. Be sure to include at least one UC library source per prompt, in addition to your textbook (which means you’ll have at least 4 sources cited). 

Start your paper with an introductory paragraph.

Prompt 1 “Data Warehouse Architecture” (2-3 pages): Explain the major components of a data warehouse architecture, including the various forms of data transformations needed to prepare data for a data warehouse. Also, describe in your own words current key trends in data warehousing. 

Prompt 2 “Big Data” (2-3 pages): Describe your understanding of big data and give an example of how you’ve seen big data used either personally or professionally. In your view, what demands is big data placing on organizations and data management technology? 

Prompt 3 “Green Computing” (2-3 pages):  One of our topics in Chapter 13 surrounds IT Green Computing. The need for green computing is becoming more obvious considering the amount of power needed to drive our computers, servers, routers, switches, and data centers. Discuss ways in which organizations can make their data centers “green”. In your discussion, find an example of an organization that has already implemented IT green computing strategies successfully. Discuss that organization and share your link. You can find examples in the UC Library.

Conclude your paper with a detailed conclusion section. 

The paper needs to be approximately 7-10 pages long, including both a title page and a references page (for a total of 9-12 pages). Be sure to use proper APA formatting and citations to avoid plagiarism.

Your paper should meet the following requirements:

• Be approximately seven to ten 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, the course textbook, and at least three scholarly journal articles to support your positions, claims, and observations, in addition to your textbook. The UC Library is a great place to find supplemental 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

Could it be ready today before 10:30 pm?

The purpose of this programming project is to explore process synchronization. This will be accomplished by writing a program to solve the bounded buffer problem using monitor concept. Your program must be written using C or C++ and you are required to use the Pthread libraries. 

Bounded buffer is used to enable multiple producers and consumers processes to share memory. A producer can place items into the buffer only if the buffer has a free memory location to store the item. A producer cannot add items to a full buffer. A consumer can remove items from the buffer if the buffer is not empty. A consumer must wait to consume items if the buffer is empty. The “items” stored in this buffer will be integers. Your producer processes will have to insert random numbers into the buffer. The consumer processes will consume a number. 

Assessing risks involved in an organization IT

I have two questions that need graphs to be drawn in R language. I will provide data set and problem statement and format of the paper. Will need 2 scripts for graphs and a paper with 3 pages.

Some people believe those under 21 serving in the military should be allowed to drink alcohol even if non-military citizens are not. The crux of the argument is, “if I am old enough to die for my country, I am old enough to drink.” Still, America’s Founding Fathers clearly believed the military, as an extension of the government, should serve the people rather than the other way around, so, one could argue, military members should be held, not only to the same standards as non-military citizens, but to an even higher standard.

·  For the assignment this week, write a 500-750 word paper arguing whether military personnel should or should not receive rights and/or liberties not afforded to non-military citizens. In the paper, include the opposing position along with your rebuttal (of that opposing position).

·  For instance, if you wrote a paper arguing that military personnel should receive rights not afforded to non-military citizens (and why), then the rebuttal would be that military personnel should not receive rights not afforded to non-military citizens (and why).

·  Note: A rebuttal is a form of evidence that is presented to contradict other evidence that has been presented by an adverse party

 Company Overview of United Health group

The page should include  the industry they are in and a general overview of the organization and also the history.

The paper must adhere to APA guidelines including Title and Reference pages.

Use the Academic Writer Tutorial: Basics of Seventh Edition APA Style website to learn more about APA style.

• References should be 2016 or later.
• Each source should be cited in the body of the paper to give credit where due. Per APA, the paper should use a 12-point Time New Roman font, should be double spaced throughout, and the first sentence of each paragraph should be indented .5 inches.

One Page is required

Discussion: 
1. How do you describe the importance of data in analytics? Can we think of analytics without data? Explain.
2. Considering the new and broad definition of business analytics, what are the main inputs and outputs to the analytics continuum?
3. Where do the data for business analytics come from? What are the sources and the nature of those incoming data?
4. What are the most common metrics that make for analytics-ready data?

Exercise:

12: Go to data.gov—a U.S. government–sponsored data portal that has a very large number of data sets on a wide variety of topics ranging from healthcare to education,
climate to public safety. Pick a topic that you are most passionate about. Go through the topic- specific information and explanation provided on the site.
Explore the possibilities of downloading the data, and use your favorite data visualization tool to create your own meaningful information and visualizations.
 

Be sure to include an APA cover page and include at least two APA formatted references (and APA in-text citations) to support the work this week.
 

1 .Do you think there are security issues with hardware too, or software-based security (anti-malware, monitoring, etc.) is enough?

2. Have you have instanced where your USB flash drive works well with some systems but does not work with other systems (Windows, Linux, car MP3 player, IoT devices. etc)?

3. Another frequent situation is that you cannot copy a big file (say 6GB) onto some disks even though you have plenty of free space on the disk. 

If you never had such experience, many of us have. If you have, please, describe it. What may cause such situations? What could be a way to resolve each of those situations? What may be a tradeoff that comes with your solution?

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?