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

bartleby

Videos

Expert Solution & Answer
Book Icon
Chapter 7, Problem 14E

Explanation of Solution

Modified class for “OneWayNoRepeatsList.java”

//Define "OneWayNoRepeatsList" class

public class OneWayNoRepeatsList

{

  //Declare required variables

  public static int START_POSITION = 1;

  public static int DEFAULT_SIZE = 50;

//entry.length is the total number of items you have room

//for on the list (its capacity); countOfEntries is the number of 

  //items currently on the list.

private int countOfEntries; //can be less than entry.length.

    private String[] entry;

  /**

    Creates an empty list with a given capacity

    */

    public OneWayNoRepeatsList(int maximumNumberOfEntries)

    {

        //Add "1" to the maximum number of entries

        entry = new String[maximumNumberOfEntries + 1];

        //Assign count of entries to "0"

        countOfEntries = 0;

    }

    /**

    Creates an empty list with a capacity of DEFAULT_SIZE.

    */

    public OneWayNoRepeatsList()

    {

        //Add "1" to "DEFAULT_SIZE"

        entry = new String[DEFAULT_SIZE + 1];

        countOfEntries = 0;

// or replace these two statements with this(DEFAULT_SIZE);

    }

    //Method definition for "isFull"

    public boolean isFull()

    {

/* Returns "true" if the total number of entries equal to one less than the size of entry. Otherwise, returns "false". */

        return countOfEntries == entry.length - 1;

    }

    //Method definition for "isEmpty"

    public boolean isEmpty()

    {

        return countOfEntries == 0;

    }

    /**

    Precondition: List is not full.

    Postcondition: If item was not on the list,

    it has been added to the list.

    */

    public void addItem(String item)

    {

        if (!isOnList(item))

        {

            if (countOfEntries == entry.length - 1)

            {

System.out.println("Attempt to add to a full list!");

                System.exit(0);

            }

            else

            {

/* Here the value of entry start from 1 that is entry[1]. Hence it ignores entry[0] */

                entry[countOfEntries + 1] = item;

                //Increment the count of entries value

                countOfEntries++;

            }

        }

        //else do nothing. Item is already on the list.

    }

    /**

    If the argument indicates a position on the list,

    the entry at that specified position is returned;

    otherwise, null is returned.

    */

    public String getEntryAt(int position)

    {

        String result = null;

        /* Here the index of position start from "1".

If the value of "position" satisfy the given condition, then returns the value at given index. Otherwise returns "null" */

if ((1 <= position) && (position <= countOfEntries))

            result = entry[position];

        return result;

    }

    /**

    Returns true if position indicates the last item

    on the list; otherwise, returns false...

Blurred answer
Students have asked these similar questions
Create an original network topology consisting of at least seven routers and twelve links, assigning arbitrary positive weights to each link. Using this topology, apply Dijkstra's Link-State Algorithm to compute the shortest paths from a source router of your choice to all other routers in the network. Your topology must be entirely your own design and should not resemble any examples from the textbook, lecture slides, or other students' work. Al-generated topologies are not permitted. Create a PowerPoint presentation that follows the format and style of slides 11 to 23 from Lecture Slide Set 06 (LS06). You should copy those slides and make any necessary changes, additions, or deletions to reflect your own topology, shortest-path calculations, and update tables. Do not alter the original slide style, layout, or formatting.
Create an original network topology consisting of at least seven routers and twelve links, assigning arbitrary positive weights to each link. Using this topology, apply Dijkstra's Link-State Algorithm to compute the shortest paths from a source router of your choice to all other routers in the network. Your topology must be entirely your own design and should not resemble any examples from the textbook, lecture slides, or other students' work. Al-generated topologies are not permitted. Create
x3003 x3008 1110 0000 0000 1100 1110 0010 0001 0000 0101 0100 1010 0000 x3004 0010 0100 0001 0011 x3005 0110 0110 0000 0000 X3006 0110 1000 0100 0000 x3007 0001 0110 1100 0100 0111 0110 0000 What does the following LC-3 program do? Trace Step by Step, SHOW ALL YOUR WORK. x3001 x3002 0000 x3009 0001 0000 0010 0001 X300A 0001 0010 0110 0001 x300B 0001 0100 1011 1111 x300C 0000 0011 1111 1000 X300D 1111 0000 0010 0101 x300E 0000 0000 0000 0101 x300F 0000 0000 0000 0100 x3010 0000 0000 0000 0011 x3011 0000 0000 0000 0110 x3012 0000 0000 0000 0010 x3013 x3014 0000 0000 0000 0000 0000 0100 0000 0111 x3015 0000 0000 0000 0110 x3016 0000 0000 0000 1000 x3017 0000 0000 0000 0111 x3018 0000 0000 0000 0101

Chapter 7 Solutions

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

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
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning
9.1: What is an Array? - Processing Tutorial; Author: The Coding Train;https://www.youtube.com/watch?v=NptnmWvkbTw;License: Standard Youtube License