Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
3rd Edition
ISBN: 9780134038179
Author: Tony Gaddis, Godfrey Muganda
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 20, Problem 1MC
A list is a collection that _____.
- a. associates keys with elements
- b. assigns an index to each of its elements
- c. is implemented by the JList class
- d. none of the above
Expert Solution & Answer
Program Description Answer
A list is a collection that “assigns an index to each element in a list”.
Hence, the correct answer is option “B”.
Explanation of Solution
List:
- A list is a collection that stores its element in a location-based order.
- Each element in a list is related with an index that matches to its location within the list. That is the first element contains index 0, the second element contains index 1 and so on.
- Storage allocation for the elements of a list takes place in two methods such as contiguous allocation and linked allocation.
- Continuous allocation:
- Array-based lists use this allocation.
- It assigns storage for consecutive list elements in consecutive memory locations.
- Linked allocation:
- This allocation does not require consecutive memory locations to store list elements.
- It uses a pointer to store each element in a list.
- Continuous allocation:
Explanation for incorrect options:
A list is a collection that associates index with elements not keys.
Hence, the option “A” is wrong.
“JList” is a type of Java Swing package. It is a component that shows a set of objects and permits the user to choose more than one element from the list.
Hence, the option “C” is wrong.
Want to see more full solutions like this?
Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
#include
using namespace std;
struct ListNode {
string data;
ListNode *next;
};
int main() {
ListNode *p, *list;
list = new ListNode;
list->data = "New York";
p new ListNode;
p->data = "Boston";
list->next = p;
p->next = new ListNode;
p->next->data = "Houston";
p->next->next = nullptr;
// new code goes here
Which of the following code correctly deletes the node with value "Boston" from the list when added at point of insertion
indicated above?
O list->next = p;
delete p;
O p = list->next;
%3D
list->next = p->next;
delete p;
p = list->next;
list = p->next;
delete p;
O None of these
O p = list->next;
%3D
list->next = p;
%3D
delete p;
5. List Member Deletion
Modify the list class you created in the previous programming challenges by adding a function to remove an item from the ist
and by adding a destructor:
void zemove (double x) :
Linkedtist (02
Test the class by adding a sequence of instructions that mixes operations for adding items, removing items, and printing the
list.
numUniqueValues ♡
Language/Type:
Related Links:
Java Set collections
List
Write a method named numUnique Values that accepts a List of integers as a
parameter and returns the number of unique integer values in the list. For example, if a
list named 1 contains the values [3, 7, 3, -1, 2, 3, 7, 2, 15, 15], the call of
numUniqueValues (1) should return 5. If passed the empty list, you should return 0.
Use a Set as auxiliary storage to help you solve this problem. Do not modify the list
passed in.
6
7
8
9
10
Method: Write a Java method as described, not a complete program or class.
12345
Chapter 20 Solutions
Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
Ch. 20.1 - Prob. 20.1CPCh. 20.1 - Prob. 20.2CPCh. 20.3 - Prob. 20.4CPCh. 20 - A list is a collection that _____. a. associates...Ch. 20 - Prob. 2MCCh. 20 - Prob. 3MCCh. 20 - Prob. 4MCCh. 20 - Prob. 5MCCh. 20 - Prob. 6MCCh. 20 - Prob. 7MC
Ch. 20 - Prob. 11TFCh. 20 - Prob. 12TFCh. 20 - Prob. 13TFCh. 20 - Prob. 14TFCh. 20 - Prob. 15TFCh. 20 - Prob. 16TFCh. 20 - Prob. 17TFCh. 20 - Prob. 18TFCh. 20 - Prob. 29TFCh. 20 - Prob. 20TFCh. 20 - Prob. 1FTECh. 20 - Prob. 2FTECh. 20 - Prob. 3FTECh. 20 - Prob. 4FTECh. 20 - Prob. 5FTECh. 20 - Prob. 1AWCh. 20 - Prob. 2AWCh. 20 - Prob. 3AWCh. 20 - Prob. 4AWCh. 20 - Prob. 3SACh. 20 - Prob. 4SACh. 20 - Prob. 5SACh. 20 - Consult the online Java documentation and...Ch. 20 - Prob. 1PCCh. 20 - Prob. 2PC
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
How many hello output lines does this program print?
Computer Systems: A Programmer's Perspective (3rd Edition)
If you call the File.CreateText method and the specified file already exists, what happens to the existing file...
Starting out with Visual C# (4th Edition)
Suppose aList is an object of the class ArrayListString. How do you add the string Hello to the end of aList ?
Java: An Introduction to Problem Solving and Programming (7th Edition)
What is an object?
Starting Out with Programming Logic and Design (4th Edition)
It is difficult to make a budget that spans several years, because prices are not stable. If your company needs...
Problem Solving with C++ (10th Edition)
Using FilesNumeric Processing If you have downloaded this books source code from the Computer Science Portal, y...
Starting Out with C++ from Control Structures to Objects (9th Edition)
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
- Programming Language: C++ I need the codes for arrayListType.h, main.cpp, myString.cpp, myString.harrow_forwardWhen removing curNode from a doubly-linked list with at least 2 elements, the list's tail may be assigned with _____. Group of answer choices curNode curNode's predecessor curNode's successor nullarrow_forwardclass MyList: # constructor def __init__(self, a): # converting array to list newList = a.tolist() # printing the list print("List is:", newList). Complete.arrow_forward
- Complete the code:- class MyList: # constructor def __init__(self, a): # converting array to list newList = a.tolist() # printing the list print("List is:", newList).arrow_forwardJava/Data Structures: The public ArrayList() constructor in the Java Class Library ArrayList creates an empty list with an initial capacity of ____. Multiple choice. A) 0 B) 1 C) 10 D) 100arrow_forwardC++ ProgrammingActivity: Deque Linked List Explain the flow of the code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow. #include "deque.h" #include "linkedlist.h" #include <iostream> using namespace std; class DLLDeque : public Deque { DoublyLinkedList* list; public: DLLDeque() { list = new DoublyLinkedList(); } void addFirst(int e) { list->addAt(e,1); } void addLast(int e) { list->addAt(e,size()+1); } int removeFirst() { return list->removeAt(1); } int removeLast() { return list->removeAt(size()); } int size(){ return list->size(); } bool isEmpty() { return list->isEmpty(); } // OPTIONAL: a helper method to help you debug void print() {…arrow_forward
- Question 40 An application can indicate a specific way to order the elements of a SortedABList list by passing a(n) Comparator object to a constructor of the list class. True False Question 41 A header node is a placeholder node at the beginning of a list, used to simplify list processing. True False Question 42 O(N) is the order of growth execution time of the indexOf operation when using the ABList class, assuming a list size of N. True False Question 43 A trailer node is a placeholder node at the end of a list, used to simplify list processing. True False Question 44 O(1) is the order of growth execution time of the indexOf operation when using the LBList class, assuming a list size of N. True False Question 45 Recall that within the ABList the numElements variable holds the number of elements currently in the list, and the elements array stores those elements. Assuming that a legal index is used, which of the following represents the code for the index-based T…arrow_forwardC++ function Linked list Write a function, to be included in an unsorted linked list class, called replaceItem, that will receive two parameters, one called olditem, the other called new item. The function will replace all occurrences of old item with new item (if old item exists !!) and it will return the number of replacements done.arrow_forwardion C Lons Employee -id: int -name String - dob : Date -staff : ArrayList +setid(int): void +getld() : int +setName(String): void +setDob(Date) : void +getDob(): Date +addStaff(Employee) : void +getStaff() : ArrayListarrow_forward
- Computer Science //iterator() creates a new Iterator over this list. It will//initially be referring to the first value in the list, unless the//list is empty, in which case it will be considered both "past start"//and "past end". template <typename ValueType>typename DoublyLinkedList<ValueType>::Iterator DoublyLinkedList<ValueType>::iterator(){//return iterator(head);} //constIterator() creates a new ConstIterator over this list. It will//initially be referring to the first value in the list, unless the//list is empty, in which case it will be considered both "past start"//and "past end". template <typename ValueType>typename DoublyLinkedList<ValueType>::ConstIterator DoublyLinkedList<ValueType>::constIterator() const{//return constIterator(head);} //Initializes a newly-constructed IteratorBase to operate on//the given list. It will initially be referring to the first//value in the list, unless the list is empty, in which case//it will be…arrow_forwardC++ Programing Create an application to keep track of a list of students and their grades in a data structures course using a linked list. You should use the C++ STL library. You need to create a class called student that contains 2 data members: name and grade and then create a linked list of objects of this class. The application should allow the user to add a student, remove a student, update the grade for a student, and search for a student.arrow_forwardstruct Node { int data; Node * next; }; Node • head; a. Write a function named addNode that takes in a variable of type int and inserts it at the head of the list. b. Write a function named removeNode that removes a node at the head of the list.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Introduction to Linked List; Author: Neso Academy;https://www.youtube.com/watch?v=R9PTBwOzceo;License: Standard YouTube License, CC-BY
Linked list | Single, Double & Circular | Data Structures | Lec-23 | Bhanu Priya; Author: Education 4u;https://www.youtube.com/watch?v=IiL_wwFIuaA;License: Standard Youtube License