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
NO AI USE PLEASE
RSA decryption: You are given the following RSA values: n = 9797, e = 7, d = 4111. Some ciphertext was received: c = 7321. Based on that information, compute the plaintext message m. Show all your work along the way. No Use of AI please
(25 points) What are the use cases in which public key encryption would be useless? In light of what we discussed in class. would the internet be where it is today without the COIS-4370H-A-F01-2025FA-OSH Computer & Info Security Ords. City any sources you use. Remember to frame your answer in light of what was discussed in class.

Chapter 7 Solutions

Java: An Introduction To Problem Solving And Programming Plus Mylab Programming With Pearson Etext -- Access Card Package (8th 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