Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 11.11, Problem 11.11.4CP
Program Plan Intro
ArrayList:
A list of object is stored in the ArrayList. Once an array list is created, the size of the array is fixed. Java gives the ArrayList class for storing an unlimited number of objects in a single list.
Creation of ArrayList:
ArrayList <String> x = new ArrayList<String>();
The above statement is an example of creation of ArrayList. The array object “x” is used to store the list of objects.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
For the following code, indicate the weighted edge values.
List<WeightedEdge> list = new ArrayList<>();list.add(new WeightedEdge(1, 2, 3.5));list.add(new WeightedEdge(2, 3, 4.5));WeightedEdge e = java.util.Collections.max(list);e.u =
e.v =
e.weight =
Question: What is the length of the array in MyArrayList after executing the following statements?
MyArrayList<Double> list = new MyArrayList<>(); list.add(25.4); list.trimToSize(); list.add(15.4); list.add(35.4); list.add(17.4); list.add(7.4);
public class MyArrayList<E> implements MyList<E> { public static final int INITIAL_CAPACITY = 16; private E[] data = (E[])new Object[INITIAL_CAPACITY]; private int size = 0; // Number of elements in the list
/** Create an empty list */ public MyArrayList() { }
/** Create a list from an array of objects */ public MyArrayList(E[] objects) { for (int i = 0; i < objects.length; i++) add(objects[i]); // Warning: don’t use super(objects)! }
@Override /** Add a new element at the specified index */ public void add(int index, E e) { ensureCapacity();
// Move the elements to the right after the specified index for (int…
Question)
Consider the following code snippet:
1. List<Integer> list = new ArrayList<>();2. list.add(10);3. list.add(new Integer(10));4. list.add(new Integer(Integer.parseInt("10")));
Which line is an example of auto-boxing?
Line 1
Line 4
Line 2
Line 3
Chapter 11 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 11.2 - True or false? A subclass is subset of a...Ch. 11.2 - What keyword do you use to define a subclass?Ch. 11.2 - What is single inheritance? What is multiple...Ch. 11.3 - What is the output of running the class C in (a)?...Ch. 11.3 - How does a subclass invoke its superclasss...Ch. 11.3 - True or false? When invoking a constructor from a...Ch. 11.4 - True or false? You can override a private method...Ch. 11.4 - True or false? You can override a static method...Ch. 11.4 - How do you explicitly invoke a superclasss...Ch. 11.4 - How do you invoke an overridden superclass method...
Ch. 11.5 - Identify the problems in the following code:...Ch. 11.5 - Prob. 11.5.2CPCh. 11.5 - If a method in a subclass has the same signature...Ch. 11.5 - If a method in a subclass has the same signature...Ch. 11.5 - If a method in a subclass has the same name as a...Ch. 11.5 - Prob. 11.5.6CPCh. 11.7 - Prob. 11.7.1CPCh. 11.8 - Prob. 11.8.1CPCh. 11.8 - Prob. 11.8.2CPCh. 11.8 - Can you assign new int[50], new Integer [50], new...Ch. 11.8 - Prob. 11.8.4CPCh. 11.8 - Show the output of the following code:Ch. 11.8 - Show the output of following program: 1public...Ch. 11.8 - Show the output of following program: public class...Ch. 11.9 - Indicate true or false for the following...Ch. 11.9 - For the GeometricObject and Circle classes in...Ch. 11.9 - Suppose Fruit, Apple, Orange, GoldenDelicious, and...Ch. 11.9 - What is wrong in the following code? 1public class...Ch. 11.10 - Prob. 11.10.1CPCh. 11.11 - Prob. 11.11.1CPCh. 11.11 - Prob. 11.11.2CPCh. 11.11 - Prob. 11.11.3CPCh. 11.11 - Prob. 11.11.4CPCh. 11.11 - Prob. 11.11.5CPCh. 11.12 - Correct errors in the following statements: int[]...Ch. 11.12 - Correct errors in the following statements: int[]...Ch. 11.13 - Prob. 11.13.1CPCh. 11.14 - What modifier should you use on a class so a class...Ch. 11.14 - Prob. 11.14.2CPCh. 11.14 - In the following code, the classes A and B are in...Ch. 11.14 - In the following code, the classes A and B are in...Ch. 11.15 - Prob. 11.15.1CPCh. 11.15 - Indicate true or false for the following...Ch. 11 - Sections 11.211.4 11.1(The Triangle class) Design...Ch. 11 - (Subclasses of Account) In Programming Exercise...Ch. 11 - (Maximum element in ArrayList) Write the following...Ch. 11 - Prob. 11.5PECh. 11 - (Use ArrayList) Write a program that creates an...Ch. 11 - (Shuffle ArrayList) Write the following method...Ch. 11 - (New Account class) An Account class was specified...Ch. 11 - (Largest rows and columns) Write a program that...Ch. 11 - Prob. 11.10PECh. 11 - (Sort ArrayList) Write the following method that...Ch. 11 - (Sum ArrayList) Write the following method that...Ch. 11 - (Remove duplicates) Write a method that removes...Ch. 11 - (Combine two lists) Write a method that returns...Ch. 11 - (Area of a convex polygon) A polygon is convex if...Ch. 11 - Prob. 11.16PECh. 11 - (Algebra: perfect square) Write a program that...Ch. 11 - (ArrayList of Character) Write a method that...Ch. 11 - (Bin packing using first fit) The bin packing...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- If N represents the number of elements in the collection, then the contains method of the ArrayCollection class is O(1). True or False If N represents the number of elements in the list, then the index-based add method of the ABList class is O(N). True or Falsearrow_forwardWhat is the ArrayList list's starting size?arrow_forwardSuppose that you want an operation for the ADT list that adds an array of items to the end of the list. The header of the method could be as follows: public void addAll( T[ ] items) Write an implementation of this method for the class LinearLinkedListarrow_forward
- Hello, thank you for helping with this. However, the code needed is a Linked list, not array-list. Any chance you can assist with that?arrow_forwardBubble Sort You will change the following method bubbleSort() by using generics and complete only one of three bubbleSort() methods. public int[] bubbleSort(int[] list) {//{2, 9, 5, 4, 8, 1, 6} int i, j, temp = 0; for (i = 0; i < list.length - 1; i++) { for (j = 0; j < list.length - 1 ; j++) { if (list[j] > list[j + 1]) { temp = list[j]; list[j] = list[j + 1]; list[j + 1] = temp; } } } return list; } OPTION 1 public static <E> void bubbleSort(E[] list){ //COMPLETE HERE } OPTION 2 public static<E extends Comparable<E>> void bubbleSort(E[] list){ //COMPLETE HERE } OPTION 3public static<E> void bubbleSort(E[] list, Comparator<? super E> comparator){ //COMPLETE HERE }arrow_forwardPlease explai The list ADT interface and its implementation remove the need for the original list interface and its two implementing classes (ElementNode & EmptyNode). Group of answer choices A. True B. False C. No answer text provided. D. No answer text provided. Q#2, What is the type of the argument to a sort operation on a list? Group of answer choices A. Function B. Predicate C. Comparator D. BiFunctionarrow_forward
- If operations given below is applied on a stack, what will be the result? For array implementation we need is_full() operation, however in linked list case this function is not required. Explain the reason createStack()push(1)push(2)push(1)peek()push(2)pop()pop()pop()push(2)push(1)push(2)arrow_forwardGiven two ArrayLists: list1=[10,20,30], and list2=[40,50], what is the content of the list1 after executing the following statement: list1.addAll(list2) a. [40, 50] b. [10, 20, 30] c. [10, 40, 50, 20, 30] d. [10, 20, 30, 40, 50]arrow_forwardWrite a class that maintains the top ten scores for a game application,implementing the add and remove methods of Section 3.1.1 in the textbook, but using a singly linked list instead of an array. You need to implement the singly linked list yourself. Textbook reference is Data structures and algorithms Micheal Goodricharrow_forward
- Suppose myGoods is an ArrayList of Product objects. Write the code using an iterator and a while loop to allow you to print all the Products in the list on a single line, separated by spacesarrow_forwardWrite an equals method for the LBList class. Return true if the lists have the same number of elements and the elements in each position of the lists are the same; otherwise return false. DO NOT USE ANY OTHER METHODS OF THE LBLIST CLASS.arrow_forwardYou are going to implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this homework. The “data.txt” file has three lines of data 100, 110, 120, 130, 140, 150, 160 100, 130, 160 1@0, 2@3, 3@END You need to 1. create an empty unsorted list 2. add the numbers from the first line to list using putItem() function. Then print all the current keys to command line in one line using printAll(). 3. delete the numbers given by the second line in the list by using deleteItem() function. Then print all the current keys to command line in one line using printAll().. 4. putItem () the numbers in the third line of the data file to the corresponding location in the list. For example, 1@0 means adding number 1 at position 0 of the list. Then print all the current keys to command line in one…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education