Boost your Grades with us today!
MAT 2051 Unit 5 Assignment 2: Algorithms and Time Complexity
MAT 2051 Unit 5 Assignment 2 Algorithms and Time Complexity
Algorithms and Time Complexity
In algorithm development, the time and space required for algorithm completion is paramount. As users, we know that when a computer process takes too long, we try to avoid it. This truth encourages all IT and computer-based companies to produce faster products and services.
For this assignment, write a one- to two-page paper that includes all required algorithms and pseudocode describing the time and space complexity of algorithms. Include the following:
Answer the following questions:
What is time complexity?
What is space complexity?
Compare and contrast polynomial time algorithms and nondeterministic polynomial (NP) time algorithms (one paragraph minimum).
Provide an example of an algorithm for each worst-case run times:
O( n).
O(nk). Note that this is called polynomial-time, where k is any number greater than 1.
NP-time.
Hint: Quick sort is an algorithm that runs in O(nlog n) time.
Review the Algorithms and Time Complexity Scoring Guide to understand how the assignment will be graded.
Given a graph with n edges, what is the time complexity of finding a Euler path? Is this a polynomial time algorithm? Explain and show all work and the graph. Hint: Include the algorithm and pseudocode.
Given a graph with n edges, can one find a minimum Hamiltonian cycle (TSP) in polynomial time? Has anyone ever proved that a polynomial time algorithm does not exist for this problem? Explain your answers and show the graph. Hint: Consider NP complete problems.
Offer one example of an IT or computer application that can be modeled as the TSP problem. This must be at least one paragraph.
Your calculations and work must be shown. Include references to any resources you use to complete the assignment.
Review the Graph Applications and the Traveling Sales Person Scoring Guide to understand how the assignment will be graded.
MAT 2051 Unit 5 Assignment 2 Algorithms and Time Complexity Grading Rubric
Performance Category | 100% or highest level of performance
100% 16 points |
Very good or high level of performance
88% 14 points |
Acceptable level of performance
81% 13 points |
Inadequate demonstration of expectations
68% 11 points |
Deficient level of performance
56% 9 points
|
Failing level
of performance 55% or less 0 points |
Total Points Possible= 50 | 16 Points | 14 Points | 13 Points | 11 Points | 9 Points | 0 Points |
Scholarliness
Demonstrates achievement of scholarly inquiry for professional and academic topics. |
Presentation of information was exceptional and included all of the following elements:
|
Presentation of information was good, but was superficial in places and included all of the following elements:
|
Presentation of information was minimally demonstrated in all of the following elements:
|
Presentation of information is unsatisfactory in one of the following elements:
|
Presentation of information is unsatisfactory in two of the following elements:
|
Presentation of information is unsatisfactory in three or more of the following elements
|
16 Points | 14 Points | 13 Points | 11 Points | 9 Points | 0 Points | |
Application of Course Knowledge
Demonstrate the ability to analyze and apply principles, knowledge and information learned in the outside readings and relate them to real-life professional situations |
Presentation of information was exceptional and included all of the following elements:
|
Presentation of information was good, but was superficial in places and included all of the following elements:
|
Presentation of information was minimally demonstrated in the all of the following elements:
|
Presentation of information is unsatisfactory in one of the following elements:
|
Presentation of information is unsatisfactory in two of the following elements:
|
Presentation of information is unsatisfactory in three of the following elements
|
10 Points | 9 Points | 6 Points | 0 Points | |||
Interactive Dialogue
Initial post should be a minimum of 300 words (references do not count toward word count) The peer and instructor responses must be a minimum of 150 words each (references do not count toward word count) Responses are substantive and relate to the topic. |
Demonstrated all of the following:
|
Demonstrated 3 of the following:
|
Demonstrated 2 of the following:
|
Demonstrated 1 or less of the following:
|
||
8 Points | 7 Points | 6 Points | 5 Points | 4 Points | 0 Points | |
Grammar, Syntax, APA
Points deducted for improper grammar, syntax and APA style of writing. The source of information is the APA Manual 6th Edition Error is defined to be a unique APA error. Same type of error is only counted as one error. |
The following was present:
AND
AND
|
The following was present:
AND/OR
AND/OR
|
The following was present:
AND/OR
AND/OR
|
The following was present:
AND/OR
AND/OR
|
The following was present:
AND/OR
AND/OR
AND/OR
|
The following was present:
AND/OR
AND/OR
|
0 Points Deducted | 5 Points Lost | |||||
Participation
Requirements |
Demonstrated the following:
|
Failed to demonstrate the following:
|
||||
0 Points Lost | 5 Points Lost | |||||
Due Date Requirements | Demonstrated all of the following:
A minimum of one peer and one instructor responses are to be posted within the course no later than Sunday, 11:59 pm MT. |
Demonstrates one or less of the following.
A minimum of one peer and one instructor responses are to be posted within the course no later than Sunday, 11:59 pm MT. |