Java: An Introduction to Problem Solving and Programming (7th Edition)
Java: An Introduction to Problem Solving and Programming (7th Edition)
7th Edition
ISBN: 9780133766264
Author: Walter Savitch
Publisher: PEARSON
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 12.3, Problem 21STQ

Explanation of Solution

Given code:

The given code fragment is highlighted.

Filename: “ListNode.java”

//Define "ListNode" class

public class ListNode

{

  /* Refer the textbook of Listing 12.4 */

}

Filename: “StringLinkedList.java”

//Define "StringLinkedList" class

public class StringLinkedList

{

  /* Refer the textbook of Listing 12.5 */

}

Filename: “StringLinkedListDemo.java”

//Define "StringLinkedListDemo" class

public class StringLinkedListDemo

{

  //Define main function

  public static void main(String[] args)

  {

/* Create object "list" from "StringLinkedList" class */

StringLinkedList list = new StringLinkedList();

/* Add value to node using "addANodeToStart" method */

list.addANodeToStart("A");

list.addANodeToStart("B");

list.addANodeToStart("C");

/* Call the method "showList()" to display the element on the list */

list.showList();

  }

}

Reasons for displaying given output:

From the given code,

  • The first line “StringLinkedList list = new StringLinkedList();” is used to Create object “list” from “StringLinkedList” class...

Blurred answer
Students have asked these similar questions
C++ You should create a loop which will ask user if they want to insert, delete, display and exit. Then call the corresponding method based on the user's input.     The loop will only stop once user entered "Exit" Topic: LinkedList
2. ID: A Name: 2. A list of numbers is considered increasing if each value after the first is greater than or equal to the preceding value. The following procedure is intended to return true if numberList is increasing and return false otherwise. Assume that numberList contains at least two elements. Line 1: PROCEDURE isIncreasing (numberList) Line 2: { Line 3: count 2 Line 4: REPEAT UNTIL(count > LENGTH(numberList)) Line 5: Line 6: IF(numberList[count] =. YA198IC
For any element in keysList with a value smaller than 40, print the corresponding value in itemsList, followed by a space. Ex: If keysList = {32, 105, 101, 35} and itemsList = {10, 20, 30, 40}, print: 10 40  #include <iostream>#include <string.h>using namespace std; int main() {   const int SIZE_LIST = 4;   int keysList[SIZE_LIST];   int itemsList[SIZE_LIST];   int i;    cin >> keysList[0];   cin >> keysList[1];   cin >> keysList[2];   cin >> keysList[3];    cin >> itemsList[0];   cin >> itemsList[1];   cin >> itemsList[2];   cin >> itemsList[3];    /* Your code goes here */    cout << endl;    return 0;}

Chapter 12 Solutions

Java: An Introduction to Problem Solving and Programming (7th Edition)

Ch. 12.1 - Prob. 12STQCh. 12.2 - Prob. 13STQCh. 12.2 - Prob. 14STQCh. 12.2 - Prob. 15STQCh. 12.2 - Prob. 16STQCh. 12.3 - Prob. 17STQCh. 12.3 - Prob. 18STQCh. 12.3 - Prob. 19STQCh. 12.3 - Write a definition of a method isEmpty for the...Ch. 12.3 - Prob. 21STQCh. 12.3 - Prob. 22STQCh. 12.3 - Prob. 23STQCh. 12.3 - Prob. 24STQCh. 12.3 - Redefine the method getDataAtCurrent in...Ch. 12.3 - Repeat Question 25 for the method...Ch. 12.3 - Repeat Question 25 for the method...Ch. 12.3 - Repeat Question 25 for the method...Ch. 12.4 - Revise the definition of the class ListNode in...Ch. 12.4 - Prob. 30STQCh. 12 - Repeat Exercise 2 in Chapter 7, but use an...Ch. 12 - Prob. 2ECh. 12 - Prob. 3ECh. 12 - Repeat Exercises 6 and 7 in Chapter 7, but use an...Ch. 12 - Write a static method removeDuplicates...Ch. 12 - Write a static method...Ch. 12 - Write a program that will read sentences from a...Ch. 12 - Repeat Exercise 12 in Chapter 7, but use an...Ch. 12 - Write a program that will read a text file that...Ch. 12 - Revise the class StringLinkedList in Listing 12.5...Ch. 12 - Prob. 12ECh. 12 - Write some code that will use an iterator to...Ch. 12 - Prob. 14ECh. 12 - Write some code that will use an iterator to...Ch. 12 - Prob. 17ECh. 12 - Revise the method selectionSort within the class...Ch. 12 - Repeat the previous practice program, but instead...Ch. 12 - Repeat Practice Program 1, but instead write a...Ch. 12 - Write a program that allows the user to enter an...Ch. 12 - Write a program that uses a HashMap to compute a...Ch. 12 - Write a program that creates Pet objects from data...Ch. 12 - Repeat the previous programming project, but sort...Ch. 12 - Repeat the previous programming project, but read...Ch. 12 - Prob. 9PPCh. 12 - Prob. 10PPCh. 12 - Prob. 11PPCh. 12 - Prob. 12PPCh. 12 - Prob. 13PPCh. 12 - Prob. 14PPCh. 12 - Prob. 15PP
Knowledge Booster
Background pattern image
Computer Science
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
SEE MORE QUESTIONS
Recommended textbooks for you
  • Text book image
    EBK JAVA PROGRAMMING
    Computer Science
    ISBN:9781337671385
    Author:FARRELL
    Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT