Monthly Archives: January 2024

1. Discuss and identify leader traits and attributes that are most beneficial in implementing the best decisions in an organization. 

2. Explain the differences in charismatic and transformational leadership and how both leadership styles impact organizational effectiveness.  Please note how these leadership styles affect implementing new innovative technologies.

3. Review table 8.1  note the work characteristics and the traditional versus high-performance focus, note which focus is best for strategic decisions and which is best for operational decisions.  Please explain.

• 12.1 List three design goals for a firewall.
• 12.2 List four techniques used by firewalls to control access and enforce a security policy.
• 12.3 What information is used by a typical packet filtering firewall?
• 12.4 What are some weaknesses of a packet filtering firewall?
• 12.5 What is the difference between a packet filtering firewall and a stateful inspection firewall?
• 12.6 What is an application-level gateway?
• 12.7 What is a circuit-level gateway?
• 12.9 What are the common characteristics of a bastion host?
• 12.10 Why is it useful to have host-based firewalls?
• 12.11 What is a DMZ network and what types of systems would you expect to find on such networks?
• 12.12 What is the difference between an internal and an external firewall?

Considering the importance of data in organization, it is absolutely essential to secure the data present in the database. What are the strategic and technical security measures for good database security? Be sure to discuss at least one security model to properly develop databases for organizational security. Create a diagram of a security model for your research paper.

Your paper should meet the following requirements:

• 4 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 (PEER REVIEWED) 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.

what is Design of Experiments and why it’s important, provide examples. 250+ words

1. What is multifactor authentication and what are some examples?
2. Ending all online crime is not a realistic goal, but simple steps can massively reduce the likelihood you’ll be the next victim.  Explain how multifactor authentication works.
3. List 5 reasons to turn on multifactor authentication?
4. Provide at least two additional links to articles related to multifactor authentication.

The author proposed one methodology as an example of how risk can be understood and rated fairly easily.

However, there are other methodologies, would you use the proposed methodology at your organization and explain why in comparison to other methodologies

This week, you have read about entrepreneurship in a global economy. For your written assignment this week, complete a case study of the organization you work for (use a hypothetical or “other” organization if more applicable) that will address the following prompts:

• Describe the organization’s environment, and evaluate its preparedness to go global, if not already, and it’s strategy for staying global if it is.
• Research other company’s strategy for going global and explain if this will or will not work for your company. 
• Make a recommendation for a global strategy in the organization, including a justification for your recommendations.

Submit your midterm research paper as a single document. 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.

Given the relational model below, using your ADU ID and SQL statements.

List all your courses of the last term [0.5 pt.]

List the instructors’ names of these courses in descending order [0.5 pt.]

List all courses of the last term that have no prerequisite [0.5 pt.]

List all courses of the last term with grade above ‘C’ [0.5 pt.]

Determine the CSIT department of the last term courses [1 pt.]

Define the courses of the last term that have more than one section [1 pt.]

Display the sections of the courses above that are offered in your location (‘Abu Dhabi’ or ‘Al-Ain’) [1 pt.]

Please attach your last semester schedule details for crosschecking. 

I have ready paper that i want to change only the refernces.  

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?