C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN: 9781337102087
Author: D. S. Malik
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 18, Problem 16PE
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Develop a class ResizingArrayQueueOfStrings that implements the queueabstraction with a fixed-size array, and then extend your implementation to use arrayresizing to remove the size restriction.Develop a class ResizingArrayQueueOfStrings that implements the queueabstraction with a fixed-size array, and then extend your implementation to use arrayresizing to remove the size restriction.
Computer Science
create a method +addToList(o:E):void that adds the
object (o) to the ArrayList referenced by the
instance variable list.
create a method +removeFromBackOfList():E that
removes the object at the back of the ArrayList and
returns it.
Question 11
Write a method called changeQueue to be considered inside the ArrayQueue class and has one parameter item of type E. Your
method will change the queue in such a way that if the the first element of the queue and the last element of the queue are equal,
the first and last elements in the queue will be replaced with item, otherwise, do not do any change. Similarly, the same process is
done for the second element in the queue and the element before the last in the queue and so on. Assume you have a non-empty
queue with even number of elements. You are not allowed to call any method from the the ArrayQueue class. Do not use iterators.
Method head:
public void changeQueue(E item)
Example1:
Before run: front rear
"this" queue: 10 29 2 25 10
Item1: 100
After run:
front
rear
"this" queue: 100 29 100 100 5 100
Use the editor to format your answer
Chapter 18 Solutions
C++ Programming: From Problem Analysis to Program Design
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
- Use the ArrayList class Add and remove objects from an ArrayList Protect from index errors when removing Practice with input loop Details: This homework is for you to get practice adding and removing objects from an ArrayList. The Voter class was used to create instances of Voters which held their name and a voter identification number as instance variables, and the number of instances created as a static variable. This was the class diagram: The constructor takes a string, passed to the parameter n, which is the name of the voter and which should be assigned to the name instance variable. Every time a new voter is created, the static variable nVoters should be incremented. Also, every time a new voter is created, a new voterID should be constructed by concatenating the string “HI” with the value of nVoters and the length of the name. For example, if the second voter is named “Clark Kent”, then the voterID should be “HI210” because 2 is the value of nVoters and 10 is the number…arrow_forwardWrite a java program called ShoppingList.java, which prompts the user to enter a set of grocery items, and stores them in a list using the Java ArrayList Collection class. It then displays the list and asks the user to type in each item when they put it in their shopping cart and remove it from the list. It should work as follows: Welcome to My Shopping List. Please enter an item: Milk Enter another Item Y/N: Y Please enter an item: Bread Enter another Item Y/N: Y Please enter an item: Eggs Enter another Item Y/N: N Here is your Shopping List: Milk Bread Eggs Enter an item to remove from the list: Eggs Eggs has been removed Here is your Shopping List: Milk Bread Enter an item to remove from the list: Milk Milk has been removed Here is your Shopping List: Breadarrow_forwardJava programming language I have to create a remove method that removes the element at an index (ind) or space in an array and returns it. Thanks! I have to write the remove method in the code below. i attached the part where i need to write it. public class ourArrayList<T>{ private Node<T> Head = null; private Node<T> Tail = null; private int size = 0; //default constructor public ourArrayList() { Head = Tail = null; size = 0; } public int size() { return size; } public boolean isEmpty() { return (size == 0); } //implement the method add, that adds to the back of the list public void add(T e) { //HW TODO and TEST //create a node and assign e to the data of that node. Node<T> N = new Node<T>();//N.mData is null and N.next is null as well N.setsData(e); //chain the new node to the list //check if the list is empty, then deal with the special case if(this.isEmpty()) { //head and tail refer to N this.Head = this.Tail = N; size++; //return we are done.…arrow_forward
- In java A supermarket wants to reward its best customer of each day, showing the customer’s name on a screen in the supermarket. For that purpose, the store keeps an ArrayList.Create a class customer having id, name, gender, and bill provide appropriate getters/setters and constructors also provide toString method.In the Store class, make an ArrayList of customers, store name, and address implement methods public void addSale(Customer c) that will add customers to the arraylist.public void RemoveCustomer(int id);public void UpdateCustomerRecord(int Id);public displayAll();public String nameOfBestCustomer() to record the sale and return the name of the customer with the largest sale. public ArrayList nameOfBestCustomers(int topN) so that it displays the top customers, that is, the topN customers with the largest sales, where topN is a value that the user of the program supplies. Write a program that prompts following menu and ============================================…arrow_forwardComplete ArrayStack.java, an array-based implementation o the Stack.java interface. Modify only the bodies of the following methods in the ArrayStack class: push pop top isEmpty isFull Nothing else should be modified in ArrayStack. Write the class ArrayStackTest to test your implementation. Print only the names of the tests and error messages. Give the test method meaningful names (e.g., emptyStackTest). Test push, pop, top, and isEmpty immediately after the stack has been instantiated. Push an element on an empty stack. Test pop, top, and isEmpty. Instantiate a stack with initialCapacity of 1. Push two elements. Check capacity. Other tests you deem necessary.arrow_forwardjava Create a static method that: is called removeAll returns ArrayList<String> takes two parameters: an ArrayList of Strings called wordList, and a String called targetWord This method should go through every element of wordList and remove every instance of targetWord from the ArrayList. Example: ArrayList<String> wordList = new ArrayList<String>(Arrays.asList("hi","hey","hi","yo")); removeAll(wordList,"hi"); wordList: ["hey","yo"] public static void main(String[] args) { Scanner in = new Scanner(System.in); int size = in.nextInt(); String target = in.next(); ArrayList<String> list = new ArrayList<>(); for(int i=0; i < size; i++) { list.add(in.next()); } System.out.println(removeAll(list, target)); } }arrow_forward
- A programmer is designing a program to catalog all books in a library. He plans to have a Book class that stores features of each book: author, title, isOnShelf, and so on, with operations like getAuthor, getTitle, getShelf Info, and set Shelf Info. Another class, LibraryList, will store an array of Book objects. The LibraryList class will include operations such as listAll Books, addBook, removeBook, and searchForBook. The programmer plans to implement and test the Book class first, before implementing the LibraryList class. The program- mer's plan to write the Book class first is an example of (A) top-down development. (B) bottom-up development. (C) procedural abstraction. (D) information hiding. (E) a driver program.arrow_forwardProject Description: In this project you implement an ArrayStack ADT and use the stack for implementing the following methods: a) Reverse an array of Words: Accept an array of words as input parameter and return an array of words in reverse order. Use the method signature: public static String[] reverse Words (String[] wordList) Example Input: Bird Cat Dog Elephant Output: Elephant Dog Cat Birdarrow_forwardjava coding Write a method that will search an integer array for a number and return the count of how many times the number is in the array. The array is not sorted. Any inputs that the method needs must be part of the parameter list, not input from the user or a file or taken from the instance dataarrow_forward
- import java.util.ArrayList; /** * This class describes a user of Twitter. A user has a user ID * (e.g. @testudo), a list of tweets, a count of the number of followers, * and a list of users that this user follows. Unlike P5, * there is no upper limit on the number of tweets or users to follow. * * You may NOT import any library class other than java.util.ArrayList. * You may NOT add any instance variables to keep a count of the number * of tweets or users being followed. You may add instance variables * for other purposes as long as they are private. */public class TwitterUser { private String userID; private int followers; private ArrayList<Tweet> listTweets; private ArrayList<TwitterUser> toFollow; /** * A constructor that takes the user's ID. If the ID is null, or * longer than 32 characters, or it does not start with "@", * throw an IllegalArgumentException. * * All other instance variables should be initialized…arrow_forwardTour.java Create a Tour data type that represents the sequence of points visited in a TSP tour. Represent the tour as a circular linked list of nodes, one for each point in the tour. Each Node contains two references: one to the associated Point and the other to the next Node in the tour. Each constructor must take constant time. All instance methods must take time linear (or better) in the number of points currently in the tour. To represent a node, within Tour.java, define a nested class Node: private class Node { private Point p; private Node next; } Your Tour data type must implement the following API. You must not add public methods to the API; however, you may add private instance variables or methods (which are only accessible in the class in which they are declared). public class Tour // Creates an empty tour. public Tour() // Creates the 4-point tour a→b→c→d→a (for debugging). public Tour(Point a, Point b, Point c, Point d) // Returns the number of points in this tour. public…arrow_forwardCreate a class Queue and a Main to test it. This Queue will be implemented using an array and will hold int values. The array should start with a size of two. When needed, you should grow the array by doubling it in size. You will never shrink the array. Use a basic array of type int (do not use ArrayList or anything like that). Your Queue should have the following public methods: public void enqueue(int n) O(c) or O(n) when growing the array public int dequeue() O(n) public int peek() O(c) public int size() O(c) public boolean isEmpty() O(c)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
EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Definition of Array; Author: Neso Academy;https://www.youtube.com/watch?v=55l-aZ7_F24;License: Standard Youtube License