Reference no: EM131132008
Computer Programs
You currently work in an algorithm development group for a large multimedia, mobile device corporation. Your group has been tasked with creating an app that will play an audio file backwards (from end to beginning rather than the standard beginning to end). Because this app is likely to be used on a mobile device, your group figures that this algorithm should use as little memory and space as possible. Your group has therefore decided to construct this reversal order algorithm such that it is an "in-place" algorithm. This simply means that the audio file will be loaded to memory and reversed using the same memory locations (because you must use memory sparingly).
Assignment
Part 1: Before attempting this implementation, you choose to develop a simple prototype version of this algorithm in C++. Specifically, you will build an in-place, order reversal algorithm. This algorithm will take as an input an array of ints and will reverse the order of the elements in the array, in place (essentially using only the memory in the array). For example, if the array contains five elements [1,2,3,4,5], the output of the algorithm will be [5,4,3,2,1]. Comment your program.
Part 2: Using this prototype, you will analyze the time complexity and space complexity of your algorithm in the worst case. Specifically, for time complexity, count the number of steps for each line of code, and write down the total lines executed as a mathematical expression where n is the size of the input array. For space complexity, write an expression for the number of memory locations and components that are required for algorithm in the worst case. (Assume that each int is one location.)
Part 3: Program a method or class that will track the true runtime of your algorithm. Find the true runtime of your algorithm using arrays of varying sizes (e.g., n = 500, n = 1,500, and n= 2,500) using your new tool. Plot, on a Cartesian plane, the runtime of your algorithm as a function of the size of the input array, n.
|
Compare and contrast holism versus reductionism
: The paper will be five pages: (a) Describe Holism - 2 pages, (b) Describe Reductionism - 2 pages, (c) Compare and contrast Holism versus Reductionism - 1 page.
|
|
Obtain an unbiased estimator
: We first assume σi2 = σ2 for all i. Obtain the OLS estimator of β, which we denote β^, and find E(β^) and var(β^). Using your answer in part (a), obtain an unbiased estimator of var(β^)
|
|
Discuss the difference between male and female serial killer
: Serial killers are some of the most studied criminals. - Discuss the difference between male and female serial killers.
|
|
Inversion count for an array
: Inversion Count for an array indicates - how far the array is from being sorted. If array is already sorted then inversion count is 0.
|
|
Develop a simple prototype version of the given algorithm
: Before attempting this implementation, you choose to develop a simple prototype version of this algorithm in C++. Specifically, you will build an in-place, order reversal algorithm.
|
|
Journalize the issuance of the preferred stock
: Acker Inc. issues 5,000 shares of $100 par value preferred stock for cash at $130 per share. Journalize the issuance of the preferred stock.
|
|
Calculate the minimum mean-square error
: Find the estimator g(Y) of X, in terms of F, that minimizes the mean square error MSB: = E[(X - g{Y))2],
|
|
What steps might a board of directors take to ensure
: Information asymmetry lies at the heart of the ethical dilemma that managers, stockholders, and bondholders confront when companies initiate management buyouts or swap debt for equity. Comment on this statement. What steps might a board of directors ..
|
|
Journalize the two treasury stock transactions
: On September 1, it sells 300 shares of the treasury stock for cash at $11 per share. Journalize the two treasury stock transactions.
|