Discussion Assignment Unit 2 Data Structures

Discussion Assignment

---

For the following problems, develop your own answers and post your answers to the discussion forum. Review the responses of at least 3 of your peers. If you find that your peer has come up with a different answer than your own, engage your peer in a dialogue to compare notes to determine where the problem lies. If you have discovered a different way of understanding the problem or solving the problem share your approach with your peers. The objective of this assignment is to collaboratively learn and develop correct results for each of the problems. Asymptotic analysis is a difficult concept to master as such we will all benefit by understanding each others perspectives. 1. Suppose that algorithm A takes 1000n³steps and algorithm B takes 2ⁿstepsfor a problem of size n. For what size of problem is algorithm A faster than B (meaning algorithm A has fewer steps than B)? In your answer describe not only what the answer is but how you arrived at the answer. 2. Give the upper bound (big O notation) that you can for the following code fragment, as a function of the initial value of n. for(int i = 0; i for(int j = 0; j //do swap stuff, constant time } } Do you think that the lower bound is likely to be the same as the answer you gave for the upper bound? In your response state why or why not. Required Sources Must be 100% original - No plagiarism! - Unique) The papers should be at least 300 words long with proper formatting and use of APA standards for citation. Please let's make sure we use complete APA (list of sources and in-text citations) in all assignments of this course, to safeguard and promote academic integrity. Chapter 3: Algorithm Analysis inA Practical Introduction to Data Structures and Algorithm Analysisby Clifford A. Shaffer. Supplemental Video Lectures MIT (Analysis of Algorithms Video Lecture Part 1) URL:http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/lecture-1-administrivia-introduction-analysis-of-algorithms-insertion-sort-mergesort/ MIT (Analysis of Algorithms Video Lecture Part 2) URL:http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/

Attachments:

discussion-fo....docx