Java Software Structures Designing And Using Data Structures 4th Edition John Lewis, Joe Chase - Solutions

Modify the postfix program from Chapter 3 so that it uses the LinkedStack class instead of the ArrayStack class.
Explain what will happen if the steps depicted in Figure 4.5 are reversed.Figure 4.5 front
Complete the implementation of the LinkedStack class by providing definitions for the peek, size, isEmpty, and toString methods.
Explain what will happen if the steps depicted in Figure 4.4 are reversed.
Explain what would happen to the algorithms and the time complexity of an array implementation of the stack if the top of the stack were at position 0.
Create a graphical application that provides a button for push and pop from a stack, a text field to accept a string as input for push, and a text area to display the contents of the stack after each operation.
Draw an example using the five integers (12, 23, 1, 45, 9) of how a stack could be used to reverse the order (9, 45, 1, 23, 12) of these elements.
Implement a class called reverse that uses a stack to output a set of elements input by the user in reverse order.
In the postfix expression evaluation example, the two most recent operands are popped when an operator is encountered so that the subexpression can be evaluated. The first operand popped is treated as the second operand in the subexpression, and the second operand popped is the first. Give and
Implement an infix-to-postfix translator using stacks.
Show how the undo operation in a word processor can be supported by the use of a stack. Give specific examples and draw the contents of the stack after various actions are taken.
Implement an integer adder using three stacks.
What should be the time complexity of the isEmpty(), size(), and toString() methods?
There is a data structure called a drop-out stack that behaves like a stack in every respect except that if the stack size is n, when the n+1 element is pushed, the first element is lost. Implement a drop-out stack using an array. A circular array implementation would make sense.
Given the resulting stack X from the previous exercise, whatwould be the result of each of the following?a. Y = X.peek();b. Y = X.pop(); Z = X.peek();c. Y = X.pop(); Z = X.peek();
The array implementation in this chapter keeps the top variable pointing to the next array position above the actual top of the stack. Rewrite the array implementation such that stack[top] is the actual top of the stack.
Hand trace an initially empty stack X through the following operations:X.push(new Integer(4));X.push(new Integer(3));Integer Y = X.pop();X.push(new Integer(7));X.push(new Integer(2));X.push(new Integer(5));X.push(new Integer(9));Integer Y = X.pop();X.push(new Integer(3));X.push(new Integer(9));
Modify the solution to the postfix expression evaluation problem so that it checks for the validity of the expression that is entered by the user. Issue an appropriate error message when an erroneous situation is encountered.
Define the concept of abstraction and explain why it is important in software development.
Design and implement an application that reads a sentence from the user and prints the sentence with the characters of each word backward. Use a stack to reverse the characters of each word.
List the collections in the Java Collections API and mark the ones that are covered in this text.
Complete the implementation of the ArrayStack class presented in this chapter. Specifically, complete the implementations of the isEmpty, size, and toString methods.
Compare and contrast data types, abstract data types, and data structures.
The table in Figure 2.1 shows how the terms of the growth function for our dishwashing example are related to one another as n grows. Write a program that will create such a table for any given growth function.Figure 2.1 Number of dishes (n) 15n2 45n 15n2 + 45n 1 15 45 60 2 60 90 150 5 375 225 600
Determine the growth function and order of the following code fragment:for (int count = 0; count < n; count ++){ for (int count2 = 0; count2 < n; count2 = count2 * 2) { System.out.println(count,
Determine the growth function and order of the following code fragment:for (int count = 0; count < n; count ++){ for (int count2 = 0; count2 < n; count2 = count2 + 2) { System.out.println(count,
Write the code necessary to find the largest element in an unsorted array of integers. What is the time complexity of this algorithm?
Arrange the growth functions of the previous exercise in ascending order of efficiency for n = 10 and again for n = 1,000,000.
Determine the order of each of the following growth functions.a. 10n2 + 100n + 1000 b. 10n3 – 7c. 2n + 100n3d. n2 log n
Provide an example, and describe the implications, of a trade-off that might be necessary between quality characteristics in the development of a software system.
Give a specific example that illustrates each of the software quality characteristics listed in Figure 1.1.Figure 1.1Quality CharacteristicDescriptionCorrectnessThe degree to which software adheres to its specific requirements.ReliabilityThe frequency and criticality of software
Compare and contrast software engineering with other engineering disciplines.

Showing 200 - 300 of 232

1
2
3

Step by Step Answers