Pick a topic below and post your reply. Your response should be at least 500 words and appropriately cites your resources.
Topics:
Please see attachment
Design and write an algorithm to find all the common elements in two sorted lists of numbers. For example, for the lists 2, 5, 5, 5 and 2, 2, 3, 5, 5, 7, the output should be 2, 5, 5. What is the maximum number of comparisons your algorithm makes if the lengths of the two given lists are m and n, respectively?
Fall 2020 CIS 606 Midterm
You have to TYPE your answers and use a tool to draw figures. Save them in a file called mid.pdf. The cover page should contain your picture, name and your grail’s login id. Use the following command on grail to submit it BEFORE noon on Oct 20 (EST):
turnin -c cis606s -p mid mid.pdf
WARNING: Finding the solutions from Internet or discussing with any other person will be considered as CHEATING.
1. Write True or False at the beginning of your answer and give an explanation for each of the following statements.
(a) ( 9 points) (True or False)
5n+5 = O(5n)
(b) ( 9 points) (True or False)
In the algorithm SELECT which uses the median of medians, the input elements are divided into groups of 5. The algorithm can still work in linear time if they are divided into groups of 9.
(c) ( 9 points) (True or False)
Finding a closest pair of points in 2 dimensions would be harder (in terms of time complexity) if the distance between 2 points (x1, y1) and (x2, y2) were defined as
|x1 − x2| + |y1 − y2|.
Solve the following recurrence by making a change of variables.
T (n) = 8T (√n) + 1
3. ( 15 points)
Using Figure 6.3 as a model, illustrate the operation of BUILD-MAX-HEAP on the array A = h3, 2, 15, 9, 70, 18, 5, 33, 8i.
4. ( 10 points)
Trace in detail how the OS Select(T.root, 18) operates on the following RB tree T .
Given two arrays A[1..n] and B[1..n], the elements in the array A are sorted in de- scending order and the elements in the array B are sorted in ascending order. Consider the problem of finding the median of all 2n elements in A and B.
(a) Design an algorithm with merging. What is the running time of your algorithm?
(b) Design an efficient recursive algorithm based on the prune-and-search approach.
You may use a figure to illustrate your algorithm. Give the recurrence relation for the time complexity of your algorithm. Solve your recurrence using the master theorem.
Input: array P [1..n] and array Q[1..n], where n is power of 2.
Output: array R[1..(2n − 1)]
Two binary operators and ⊕ will be used for calculations. Both are associative. The operation is distributive over ⊕ and has higher precedence than ⊕.
The operator will be used to calculate each pair of operands P [i], 1 ≤ i ≤ n, and Q[j], 1 ≤ j ≤ n (i.e. one operand in P and the other in Q). The result of P [i] Q[j] will be accumulated into R[i + j − 1] by using the ⊕ operation.
The following is a loop-based algorithm:
for i = 1 to n
for j = 1 to n
R[i + j − 1] = R[i + j − 1] ⊕ P [i] Q[j]
endfor endfor
For example, given P [1..4] and Q[1..4], the output result R[1..7] will be:
R[1] = P [1] Q[1]
R[2] = P [1] Q[2] ⊕ P [2] Q[1]
R[3] = P [1] Q[3] ⊕ P [2] Q[2] ⊕ P [3] Q[1]
R[4] = P [1] Q[4] ⊕ P [2] Q[3] ⊕ P [3] Q[2] ⊕ P [4] Q[1] R[5] = P [2] Q[4] ⊕ P [3] Q[3] ⊕ P [4] Q[2] R[6] = P [3] Q[4] ⊕ P [4] Q[3] R[7] = ⊕ P [4] Q[4]
Use the Divide and Conquer approach to develop an efficient algorithm which uses fewer operations. You may draw a figure to illustrate your idea. Give the recurrence relation for the time complexity of your algorithm. Solve your recurrence using the master theorem.
Hint: Split the array P [1..n] into two subarrays A[1..n ] and B[1..n ]. Also split the
2 2
array Q[1..n] into two subarrays C[1..n ] and D[1..n ].
2 2
Compare different Ensemble methods with appropriate examples.
Kirk (2016) tells us that data adjustments affects what data is displayed and presentation adjustments affects how the data is displayed. Each of the adjustments involve specific features. Data adjustments include: Framing, Navigating, Animating, Sequencing, and Contributing. Presentation adjustments include: Focusing, Annotating, and Orientating. Select one feature and expand on it.
Please make sure you have an initial post (about 200 words) and a comment/post to one of your friends’ posts.
Question 1:
Compare and contrast predictive analytics with prescriptive and descriptive analytics. Use examples.
Question 2:
Discuss the process that generates the power of AI and discuss the differences between machine learning and deep learning.
-each question with 500 words and 2 references in apa format
Chapter 15 – According to Crocker and Smallwood, cloud computing represents one of the most significant paradigms shifts in information technology (IT) history, due to an extension of sharing an application-hosting provider that has been around for many years, and was common in highly regulated vertical industries like banks and health care institutions. The author’s knowledge from their research continues to assert that, the impetus behind cloud computing lies in the idea that it provides economies of scale by spreading costs across many client organizations and pooling computing resources while matching client computing needs to consumption in a flexible, real-time version.
Q1: Even with this great news about the benefits of cloud computing applications, the authors have warned the business user community regarding the dangers associated with cloud computing applications. Please identify and name these grave dangers/risks that pose as concerns, and briefly support your discussion.
Chapter 16 – Microsoft’s SharePoint server product dramatically altered the content and records management (RM) markets. Crocker (2015), edited by Smallwood research indicated that previous to SharePoint solutions were somewhat cumbersome, managed large quantities of documents, and required extensive implementation efforts for each business application. Given all its stated capabilities, SharePoint may be used effectively to help business organizations to govern their information. However, in order to achieve those benefits, the implementing organizations must take a structured approach to the deployment of its SharePoint environment.
Q2: Our case study authors have indicated that, for SharePoint deployments, “an ounce of prevention truly is worth a pound of cure.” Why is that? From our chapter reading, identify and briefly state why the authors were inclined to believe so?
Discuss why business use cryptography?
It must be at least 450 words and have references.
No plagiarism and no grammar mistakes and need APA format.
properly cite the references.
7 pages
