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

 

Go  to the website: https://epic.org/privacy/litigation/ which focuses on civil rights issues and privacy. Pick a case.

Using WORD, in you OWN WORDS, write an ORIGINAL brief essay of 300 words or more  :

  • Summarize the case
  • Give your opinion of the decision.
  • Describe how the case deals with the material in this chapter

Note your Safe Assign score. Continue submitting until your Safe Assign score is less than 25. You have three attempts to complete your assignment.

Attach your WORD doc and then hit SUBMT.

CS

1.   Do you believe that all data should be encrypted? Many computing professionals think this is a good idea. But a small number of computing experts feel that no data should be encrypted—that all data and software should be openly available to anyone who wants it. Explain your answer (whether you believe all data should or should not be encrypted). (2-3 paragraphs)

2.  In this module, you learned that random numbers (or, at least, pseudorandom numbers) are essential in cryptography, but it is extremely difficult even for powerful hardware and software to generate them. Go online and conduct research on random number generators. What are the different uses of these tools besides cryptography? How do they work? Explain your answer using your own words in 2-3 paragraphs. 

NO PLAGIARISM 

Organization leader and Decision making – Research Paper

Note : Please write Research paper in APA 7 format 

This week’s journal article was focused on how information and communication innovation drives change in educational settings. The key focus of the article was how technology-based leadership has driven the digital age.  Also, that the role of technology leadership incorporates with the Technology Acceptance Model (TAM).In this paper, address the following key concepts:

  1. Define TAM and the components.
  2. Note how TAM is impacting educational settings.
  3. Give an overview of the case study presented and the findings.

Be sure to use the UC Library for scholarly research. Google Scholar is also a great source for research.  Please be sure that journal articles are peer-reviewed and are published within the last five years.The paper should meet the following requirements:

  • 3-5 pages in length (not including title page or references)
  • APA guidelines must be followed.  The paper must include a cover page, an introduction, a body with fully developed content, and a conclusion.
  • A minimum of five peer-reviewed journal articles.

The writing should be clear and concise.  Headings should be used to transition thoughts.  Don’t forget that the grade also includes the quality of writing. 

Linux Implementation Proposal: Migration Proposal Presentation

 

Faster Computing has contacted Go2Linux and requested a brief  proposal presentation for migrating its systems from Windows to Linux.  The company is specifically interested in seeing the following  information:

  • Based on your current understanding of Faster Computing’s business, what are some potential benefits of Linux?
     
  • The company is aware that many different Linux derivatives exist. Which would Go2Linux recommend, and why?
     
  • Are there graphical interfaces available for the Linux workstations  that would provide similar functionality to Windows? Some users are  concerned about working with a command-line interface.
     
  • What steps will be required to migrate the systems from Windows to Linux?
     
  • What tools are available on Linux for the servers to provide file sharing, web servers, and email servers?
     

The deliverable for this phase of the project is a three- to  five-slide PowerPoint narrated presentation. For each slide, you will  embed your own audio recording as if you were presenting the content to  the Faster Computing team. Faster Computing has not yet committed to the  project, so this should be presented as a proposal. 

The presentation should be visually appealing; inclusion of at least  one image that supports the content and adds value to the proposal is  required. You must cite at least two quality sources.

Creating website using infinity free(I will provide the username and password)

Create web pages for your database using PHP. You should have one page that will return all the information from the database. You should create additional pages that will allow you to do various queries of your database. You should be able to retrieve and insert data; also include functionality to delete data from your database. I will be looking for these features. Feel free to handle those functions however you feel is best for your project. 

Create an html form that will allow you to enter in new information for the database. The information should be handled by a PHP script that will take the data and input it into the database. 

The interface doesn’t have to look real pretty at this point. That will be done in the next phase. If you want to go ahead and make things look nice, feel free to do so.

If you have not yet created a home page, create a separate home page that contains links to each of the web pages you create to access your database.  Your database (must have a minimum of two tables) is not to be displayed on the home page; be creative on this page.   On each of the database pages create a button (link) to go back to the home page. Your project must have more than one page; your home page should have links to other pages to perform operations on the database.  Some appropriate picture or image should be on the home page that relates to you project.  Make your project look as professional as possible.  You may want to show it during a interview.

Create a text file in which to store hyperlinks to your home page and PHP scripts.  Turn in this file to the appropriate submission box.

Business Intellegence

 Provide a reflection of at least 500 words (or 2 pages double spaced) of how the knowledge, skills, or theories of this course have been applied, or could be applied, in a practical manner to your current work environment. If you are not currently working, share times when you have or could observe these theories and knowledge could be applied to an employment opportunity in your field of study.