Part 1Data Storage, Retrieval, Sorting Algorithms, Time Complexity

In computer systems, the storage, retrieval, and communication of data occurs frequently and therefore must be optimized and fast. In some instances, it is best to store a list of numbers in some order (for example, in an increasing or decreasing order), to make the retrieval of some of the data very fast (for example, the maximum value).

 

1. The name of the faster sorting algorithm is the tournament sort. How is this faster sorting algorithm achieved?
2. Given a list of n numbers, what is the worst case times for the insertion sort algorithm and the tournament sort algorithm?
3. In the insertion sort and the tournament sort algorithms, what discrete structures are used to store the data? Explain.
4. How does the use of the tree structure provide the framework for a tournament sort?
5. What is a divide-and-conquer algorithm? Is this a divide-and-conquer algorithm?

 

Part 2

 

Linear Programming, Reduction, and Max Flow Networks

(attachment goes along with part 2)

 

To better understand linear programs and reductions, write a two- to three-page paper that addresses the following questions:

1. What is a linear program? Explain in at least one paragraph. Feel free to show an example.
2. What are constraints in linear programming problems? Offer at least one example.
3. What is an optimization problem? Offer an example and explain.
4. What is a reduction (specifically, changing one problem into another)? Provide an example. You may use the Internet to locate an example.
5. Given Example 10.4.4 and Theorem 10.4.5 in the textbook, explain how you would transform the matching problem into a maximal flow problem. (attached)
6. Once you complete question 5, use the already known linear program that solves the maximal flow problem. Show all of your work and how you are doing the reduction.

Show all of your work and include references for resources you use to complete the assignment.

Hint 1: Transform the matching problem into a matching network, and then find the maximal flow to this network.

Hint 2: The goal here is to learn that, while problems might appear different, they are often the same. Knowing how to transform a new problem into a known problem can save a lot of solving time. Use the Internet and your textbook.

 

Part 3Disaster and Incident Recovery Planning

Using the required readings and any other resources you might find helpful, write a paper regarding development of an effective approach to disaster and incident recovery planning within the project organization. Be sure to cover the following topics:

1. Identify the high-level tasks that would be appropriate to include in an effective disaster and incident recovery plan.
2. Identify the roles that are appropriate for participation in a disaster and incident recovery planning team.
3. Differentiate between disaster recovery, business continuity planning, and incident response.
4. Develop a strategy for disaster and incident recovery as a component of an effective security management plan.
5. Exhibit proficiency in writing, critical thinking, and use of APA 6th edition formatting of references and citations.

Attachments:

• 1511861178-mat2051u9a2.docx