Data Structures and Algorithm Analysis in Java 3rd edition Mark A. Weiss - Solutions

Discover comprehensive solutions to questions from "Data Structures and Algorithm Analysis in Java, 3rd Edition" by Mark A. Weiss. Access an extensive collection of answers online, including a detailed answers key and solutions manual. Explore solved problems with step-by-step answers, providing in-depth understanding and clarity. Our platform offers a free download of the solutions PDF, featuring a robust test bank and chapter solutions. Perfect for instructors, the instructor manual complements this essential textbook. Enhance your learning experience with our questions and answers resource, ensuring success in mastering data structures and algorithms.

What chart sub-types are available for the stock chart in Excel? Explain how you interpret the data markers on each of the sub-types.
How does a radar chart differ from other charts? Give an example of when you would consider using a radar chart.
Define a bubble chart and explain what type of data is suitable for plotting on a bubble chart.
How do sparklines differ from charts?
What are the three steps involved in using the INSERT tab to create a chart?
How do you change the chart type of an existing chart?
What are the differences and similarities between a line chart and an X Y (Scatter) chart? When should you use each one?
Explain the difference between the data points in a line chart and an X Y (Scatter) chart.
True or False. 1. The lookup_value of a HLOOKUP function can be a continuous cell range. 2. In a VLOOKUP formula with a TRUE lookup type, the lookup table referenced must be in ascending order to retrieve the correct value. 3. The result_vector of a LOOKUP function must be sorted in ascending
What is the difference between the LOOKUP function and the VLOOKUP or HLOOKUP function?
The delivery charges used in the Delivery worksheet are as follows:€¢ For orders under $10, there is a $6 delivery fee.€¢ Orders of at least $10 but less than $40 have a $7.50 delivery fee.€¢ Orders over $40 are delivered free of charge.Create a lookup table for the
Explain the difference between the lookup table in cells A3:E4 of the Grades worksheet and the lookup table in cells A6:E7 in the same worksheet.
Match the information below1. Function to calculate value of the end of a financial transaction2. Function to calculate the interest percentage per period of a financial transaction3. Function to calculate the value at the beginning of a financial transaction4. Function to calculate the number of
List and describe the steps you would take to create a structured list of data from a text file that contains values stored on separate lines.
How does Excel store date and time values?
List and describe the four areas of a PivotTable report.
Describe the steps you would take to import XML data as an XML Table in Excel.
How do you import an XML map into a workbook and map its elements into the worksheet?
What are the advantages and disadvantages of using the Subtotal tool to analyze data?
List and describe the eight available options when using the AutoFilter feature in an Excel Table.
What is the primary advantage of storing data in a database and importing that data into Excel?
Explain the steps you must take to import data stored in an Access database into Excel.
What is the Query Wizard and when would you use it?
Compare break-even analysis and sensitivity analysis.
Explain how you must vary the setup of a two-variable data table to run a simulation.
How does a data table help you perform what-if analysis?
What is the difference between a one-variable data table and a two-variable data table? When would you use each type of data table?
When should you create a scenario instead of a data table? Give an example of a business situation that could best be analyzed with scenarios.
What is a scenario in Solver?
What are the types of Solver reports? What information is described in an answer report? What is the difference between a binding status and a not binding status? What is slack?
What is an infeasible solution? What steps can you take to attempt to change an infeasible solution into a feasible solution?
What is an unbounded solution?
What is the difference between a linear function and a nonlinear function?
Describe the steps for saving a Solver model. What is the advantage of saving a Solver model?
What is an assignment problem?
What are the three required parameters of a Solver model and what do they represent?
What are two advantages of creating a constraints table in a worksheet that includes a Solver model?
What is the advantage of linking the constraints in the Solver Parameters dialog box to values in a constraints table in the worksheet?
What is the difference between a policy constraint and a physical constraint? Give one example of each type of constraint.
What are the five comparison operators that you can use in Solver?
When should you include integer constraints in a Solver model? What is the disadvantage of using an integer constraint?
What is a decision support system?
What are false positives and false negatives, and which are harder to detect in worksheets?
What is a macro? How could you use one in an Excel workbook?
Identify three ways to run a macro in Excel.
What is a data validation rule? When would you use the Circle Invalid Data feature?
What is the difference between an input message and an error alert in the context of Excel data validation?
Explain the two basic steps you must perform to protect the contents of a worksheet.
Describe two methods to document information in a workbook.
What is 2100 (mod 5)?
Let Fi be the Fibonacci numbers as defined in Section 1.2. Prove the following:a. ΣN−2i=1 Fi = FN − 2b. FN < ϕN, with ϕ = (1 + √5)/2c. Give a precise closed-form expression for FN.
Prove the following formulas:a.b.
C allows statements of the form #include filename which reads filename and inserts its contents in place of the include statement. Include statements may be nested; in other words, the file filename may itself contain an include statement, but, obviously, a file can't include itself in any chain.
Write a recursive method that returns the number of 1's in the binary representation of N. Use the fact that this is equal to the number of 1's in the representation of N/2, plus 1, if N is odd.
Prove the following formulas: a. log X < X for all X > 0 b. log(AB) = B log A
Evaluate the following sums:a. Σ∞i=0 1/4ib. Σ∞i=0 i/4ic. Σ∞i=0 i2/41d. Σ∞i=0 iN/4i
Estimate NΣi=[N/2] 1/i
Order the following functions by growth rate: N, √N, N1.5, N2, N logN, N log logN, N log2 N, N log(N2), 2/N, 2N, 2N/2, 37, N2 logN, N3. Indicate which functions grow at the same rate.
Determine, for the typical algorithms that you use to perform calculations by hand, the running time to do the following: a. Add two N-digit integers. b. Multiply two N-digit integers. c. Divide two N-digit integers.
An algorithm takes 0.5 ms for input size 100. How long will it take for input size 500 if the running time is the following (assume low-order terms are negligible): a. Linear b. O(N logN) c. Quadratic d. Cubic
An algorithm takes 0.5 ms for input size 100. How large a problem can be solved in 1 min if the running time is the following (assume low-order terms are negligible):a. linearb. O(N logN)c. quadraticd. cubic
How much time is required to compute f (x) = ΣNi=0 aixi: a. Using a simple routine to perform exponentiation? b. Using the routine in Section 2.4.4?
Give an efficient algorithm to determine if there exists an integer i such that Ai = I in an array of integers A1 < A2 < A3 < · · · < AN. What is the running time of your algorithm?
Suppose T1(N) = O(f (N)) and T2(N) = O(f (N)). Which of the following are true? a. T1(N) + T2(N) = O(f (N)) b. T1(N) − T2(N) = o(f (N)) c. T1(N) / T2(N) = O(1) d. T1(N) = O(T2(N))
a. Write a program to determine if a positive integer, N, is prime.b. In terms of N, what is the worst-case running time of your program? (You should be able to do this in O(√N).)c. Let B equal the number of bits in the binary representation of N. What is the value of B?d. In terms of B, what is
The Sieve of Eratosthenes is a method used to compute all primes less than N. We begin by making a table of integers 2 to N. We find the smallest integer, i, that is not crossed out, print i, and cross out i, 2i, 3i, . . . . When i > √N, the algorithm terminates. What is the running time of this
Show that X62 can be computed with only eight multiplications.
Write the fast exponentiation routine without recursion.
Give a precise count on the number of multiplications used by the fast exponentiation routine.
Programs A and B are analyzed and found to have worst-case running times no greater than 150N log2 N and N2, respectively. Answer the following questions, if possible: a. Which program has the better guarantee on the running time, for large values of N (N > 10,000)? b. Which program has the better
A majority element in an array, A, of size N is an element that appears more than N/2 times (thus, there is at most one). For example, the array3, 3, 4, 2, 4, 4, 2, 4, 4has a majority element (4), whereas the array3, 3, 4, 2, 4, 4, 2, 4does not. If there is no majority element, your program should
The input is an N by N matrix of numbers that is already in memory. Each individual row is increasing from left to right. Each individual column is increasing from top to bottom. Give an O(N) worst-case algorithm that decides if a number X is in the matrix.
Design efficient algorithms that take an array of positive numbers a, and determine: a. the maximum value of a[j] + a[i], with j ≥ i. b. the maximum value of a[j] - a[i], with j ≥ i. c. the maximum value of a[j] * a[i], with j ≥ i. d. the maximum value of a[j] / a[i], with j ≥ i.
Why is it important to assume that integers in our computer model have a fixed size?
Which function grows faster: N log N or N1+ε / √log N, ε > 0?
Suppose that line 15 in the binary search routine had the statement low = mid instead of low = mid + 1. Would the routine still work?
Suppose that lines 15 and 16 in algorithm 3 (Fig. 2.7) are replaced by15......................int maxLeftSum = maxSubSum( a, left, center - 1 );16......................int maxRightSum = maxSubSum( a, center, right );Would the routine still work?
The inner loop of the cubic maximum subsequence sum algorithm performs N(N+1)(N+2)/6 iterations of the innermost code. The quadratic version performs N(N + 1)/2 iterations. The linear version performs N iterations. What pattern is evident? Can you give a combinatoric explanation of this phenomenon?
Prove that for any constant, k, logk N = o(N).
Find two functions f (N) and g(N) such that neither f (N) = O(g(N)) nor g(N) = O(f (N)).
In a recent court case, a judge cited a city for contempt and ordered a fine of $2 for the first day. Each subsequent day, until the city followed the judge's order, the fine was squared (that is, the fine progressed as follows:$2, $4, $16, $256, $65, 536, . . .).a. What would be the fine on day
For each of the following six program fragments: a. Give an analysis of the running time (Big-Oh will do). b. Implement the code in Java, and give the running time for several values of N. c. Compare your analysis with the actual running times. (1) sum = 0; for( i = 0; i < n; i++ ) sum++; (2) sum =
Suppose you need to generate a random permutation of the first N integers. For example, {4, 3, 1, 5, 2} and {3, 1, 4, 2, 5} are legal permutations, but {5, 4, 1, 2, 1} is not, because one number (1) is duplicated and another (3) is missing. This routine is often used in simulation of algorithms. We
Complete the table in Figure 2.2 with estimates for the running times that were too long to simulate. Interpolate the running times for these algorithms and estimate the time required to compute the maximum subsequence sum of 1 million numbers. What assumptions have you made?
You are given a list, L, and another list, P, containing integers sorted in ascending order. The operation printLots(L,P) will print the elements in L that are in positions specified by P. For instance, if P = 1, 3, 4, 6, the elements in positions 1, 3, 4, and 6 in L are printed. Write the
Provide an implementation of a removeAll method for the MyLinkedList class. Method removeAll removes all items in the specified collection given by items from the MyLinkedList. Also provide the running time of your implementation. The method signature for you to use is slightly different than the
Assume that a singly linked list is implemented with a header node, but no tail node, and that it maintains only a reference to the header node. Write a class that includes methods to a. Return the size of the linked list b. Print the linked list c. Test if a value x is contained in the linked
Repeat Exercise 3.11, maintaining the singly linked list in sorted order. Assume that a singly linked list is implemented with a header node, but no tail node, and that it maintains only a reference to the header node. Write a class that includes methods to a. Return the size of the linked list b.
Add support for a ListIterator to the MyArrayList class. The ListIterator interface in java.util has more methods than are shown in Section 3.3.5. Notice that you will write a listIterator method to return a newly constructed ListIterator, and further, that the existing iterator method can return a
Add support for a ListIterator to the MyLinkedList class, as was done in Exercise 3.13. Add support for a ListIterator to the MyArrayList class. The ListIterator interface in java.util has more methods than are shown in Section 3.3.5. Notice that you will write a listIterator method to return a
An alternative to providing a ListIterator is to provide a method with signatureIterator reverseIterator( ) that returns an Iterator, initialized to the last item, and for which next and hasNext are implemented to be consistent with the iterator advancing toward the front of the list, rather than
For MyLinkedList, implement addFirst, addLast, removeFirst, removeLast, getFirst, and getLast by making calls to the private add, remove, and getNode routines, respectively.
Rewrite the MyLinkedList class without using header and tail nodes and describe the differences between the class and the class provided in Section 3.5.
Swap two adjacent elements by adjusting only the links (and not the data) using: a. Singly linked lists. b. Doubly linked lists.
An alternative to the deletion strategy we have given is to use lazy deletion. To delete an element, we merely mark it deleted (using an extra bit field). The number of deleted and nondeleted elements in the list is kept as part of the data structure. If there are as many deleted elements as
Write a program to evaluate a postfix expression.
a. Write a program to convert an infix expression that includes (, ), +, -, *, and / to postfix. b. Add the exponentiation operator to your repertoire. c. Write a program to convert a postfix expression to infix.
Write routines to implement two stacks using only one array. Your stack routines should not declare an overflow unless every slot in the array is used.
a. Propose a data structure that supports the stack push and pop operations and a third operation findMin, which returns the smallest element in the data structure, all in O(1) worst-case time. b. Prove that if we add the fourth operation deleteMin which finds and removes the smallest element, then
Show how to implement three stacks in one array.

Showing 200 - 300 of 575

Data Structures and Algorithm Analysis in Java 3rd edition Mark A. Weiss - Solutions

Step by Step Answers