Describe how an algorithm with linear time complexity behaves.
Name:
Homework 5
Question 1 [7 pts]
Describe how an algorithm with linear time complexity behaves.
Describe how an algorithm with exponential time complexity behaves.
Question 2 [7 pts]
Describe time and space complexity of an algorithm. Explain the relationship between them.
Question 3 [7 pts]
Describe polynomial time ( P) and nondeterministic polynomial time ( NP) algorithms. What is the difference between them? Give examples to each.
Question 4 [7 pts]
What is an NP-complete problem? Describe the factoring problem that the RSA algorithm is based on.
Question 5 [7 pts]
Which of the following statements are correct?
· Quadratic time complexity is a type of polynomial complexity
· Superpolynomial time complex algorithms are harder to solve than algorithms with exponential time complexity.
· Trying to find the 128-bit key of a cipher text encrypted with AES is a problem with exponential complexity
· Factoring problem that RSA is using is not probably an NP-complete problem.
Collepals.com Plagiarism Free Papers
Are you looking for custom essay writing service or even dissertation writing services? Just request for our write my paper service, and we'll match you with the best essay writer in your subject! With an exceptional team of professional academic experts in a wide range of subjects, we can guarantee you an unrivaled quality of custom-written papers.
Get ZERO PLAGIARISM, HUMAN WRITTEN ESSAYS
Why Hire Collepals.com writers to do your paper?
Quality- We are experienced and have access to ample research materials.
We write plagiarism Free Content
Confidential- We never share or sell your personal information to third parties.
Support-Chat with us today! We are always waiting to answer all your questions.
