Similar Books

    No books found

Title
Chapter: 18 / Q: 38
(Recursive tree) Write a program to display a recursive tree as shown in Figure 18.20
Chapter: 18 / Q: 39
(Dragging the tree) Revise Programming Exercise 18.38 to move the tree to where the mouse is dragged
Chapter: 19 / Q: 1
(Revising Listing 19.1) Revise the GenericStack class in Listing 19.1 to implement it using an array rather than an ArrayList. You should check the array size before adding a new element to the stack. If the array is full, create a new array that doubles the current array size and copy the element
Chapter: 19 / Q: 2
(Implement GenericStack using inheritance) In Listing 19.1, GenericStack is implemented using composition. Define a new stack class that extends ArrayList. Draw the UML diagram for the classes and then implement GenericStack. Write a test program that prompts the user to enter five strings and disp
Chapter: 19 / Q: 3
(Distinct elements in ArrayList) Write the following method that returns a new ArrayList. The new list contains the non-duplicate elements from the original list. public static ArrayList removeDuplicates(ArrayList list)
Chapter: 19 / Q: 4
(Generic linear search) Implement the following generic method for linear search. public static > int linearSearch(E[] list, E key)
Chapter: 19 / Q: 5
(Maximum element in an array) Implement the following method that returns the maximum element in an array. public static > E max(E[] list)
Chapter: 19 / Q: 6
(Maximum element in a two-dimensional array) Write a generic method that returns the maximum element in a two-dimensional array
Chapter: 19 / Q: 7
(Generic binary search) Implement the following method using binary search. public static > int binarySearch(E[] list, E key)
Chapter: 19 / Q: 8
(Shuffle ArrayList) Write the following method that shuffles an ArrayList: public static void shuffle(ArrayList list)
total questions: 772

Questions

772

Views

Best Answers

299

Points

5