Answered: Java Write a p

Name: JavaWrite a program that implements the methods of a list using the op
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: JavaWrite a program that implements the methods of a list using the operations of each ADT.Making use of Inheritance and Polymorphism. Create the stack (STACK) and queue (QUEUE) derived classes and implement their methods as indicated in the book.In

Engineering

Computer Science

Java Write a p

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter13: Overloading And Templates

Section: Chapter Questions

Problem 15PE

See similar textbooks

Similar questions

Write Java code Objectives •Use an abstract data type for a list •Use a method that contains an Object type as a formal parameter •Use methods in an existing class •Access data members within a class Required Files: •ListInterface.java •ListException.java •ListOutOfBoundsException.java •ListArrayBased.java Description A list is an abstract data type used to store ordered data, and contains operations that fall into the following categories: (1) add data to a data collection, (2) remove data from a data collection, and (3) ask questions about data in a data collection. The operations which ask questions about the data in a data collection may include operations that determine if a data collection is empty, determine the size of a data collection, and retrieve the item at a given position in a data collection. A list should be able to contain any type of object. The methods for the List support any object as specified in the interface. In this assignment, the objects will be S trings.…
Using C++ to Creates a class called Member with two integer x and y. a. Add a constructor able to create a Member object with tow integers and the default values 0,0; b. Add the methods setX and setY to modify the attributes x and y; c. Add the method display able to display the attributes, - A Queue is a special array where the insertion and deletion will be via a specific index called "head". A Queue is characterized by 3 attributes: a. capacity (int): the maximum number element Member that can be contained into the Queue; b. head: presents the index where we can add/remove element to the Queue. The head value presents also the current number of elements into the Queue. When a Queue is created the initial value of head is 0; c. Member content[]: an array of elements of type Member; Creates the class Queue with the following methods: a. a Constructor able to create a Queue with maximum 10 Members; b. bool empty (): this method returns true if no element exists in the Queue c. bool…
Lab Goal : This lab was designed to teach you more object oriented programming and start you down the path of creating larger programs and games like BlackJack and Elevens [ one of the new AP CS A Labs ]. You will create a Deck class that contains a List < Card >Lab Description : You need to design a class that contains an instance variables which is a List < Card > and an int that keeps track of the top card position . You then need to make a constructor and related methods. You will need a dealCard method and a shuffle method. Use the template shown below. /make a Deck classpublic static final int NUMCARDS = 52;public static String[] SUITS = "CLUBS HEARTS DIAMONDS SPADES".split(" ");private List<Card> cards;private int top;//make a Deck constructor//refer cards to new ArrayList//set top to the top of the deck 51//loop through all suits//loop through all faces 1 to 13//add a new BlackJackCard to the deck//make a dealCard() method that returns the top card//write…
Using C++ Without Using linked lists: Create a class AccessPoint with the following: x - a double representing the x coordinate y - a double representing the y coordinate range - an integer representing the coverage radius status - On or Off Add constructors. The default constructor should create an access point object at position (0.0, 0.0), coverage radius 0, and Off. Add accessor and mutator functions: getX, getY, getRange, getStatus, setX, setY, setRange and setStatus. Add a set function that sets the location coordinates and the range. Add the following member functions: move and coverageArea. Add a function overLap that checks if two access points overlap their coverage and returns true if they do. Add a function signalStrength that returns the wireless signal strength as a percentage. The signal strength decreases as one moves away from the access point location. Represent this with bars like, IIIII. Each bar can represent 20% Test your class by writing a main function that…
X1222: Double Ended Queue: Deque A double ended queue, known as deque, is a queue data structure that allows adding and removing elements from both ends of the queue. Instead of enqueue and dequeue, it has insert, delete, and get for both front and last of the queue as shown below. The data stored internally is stored in a ListNodesPlus object. The basic class definition is shown below: public class Deque { private ListNodePlus elements; // code ommitted for space public void clear() {...}; public int numElements () {...}; public boolean isEmpty() {...}; ● // Implement the following four methods public void insertFront (E it) { } public E deleteFront () { } public void insertLast (E it) { } public E deleteLast() { } Write the following four methods: • insertFront (E it) takes it and adds it to the front of the queue. stored internally in elements. The front of the queue is defined as position 0 in the queue. ● deleteFront () removes the element at the front of the queue and returns it.…
Design the program to get the output as shown. Subtasks: 1. You will need to create 2 classes: Team and Player 2. Make all the variables in the Team class private. 3. Make all the variables in the Player class public. 4. Write the required codes in the Team and Player classes Hints:  Create a list in team class to store the player’s name in that list  Use constructor overloading technique for Team class [You are not allowed to change the code below] # Write your code here for subtasks 1-4 b = Team() b.setName('Bangladesh') mashrafi = Player("Mashrafi") b.addPlayer(mashrafi) tamim = Player("Tamim") b.addPlayer(tamim) b.printDetail() a = Team("Australia") ponting = Player("Ponting") a.addPlayer(ponting) lee = Player("Lee") a.addPlayer(lee) a.printDetail() Output: ===================== Team: Bangladesh List of Players: ['Mashrafi', 'Tamim'] ===================== ===================== Team: Australia List of Players: ['Ponting', 'Lee'] =====================
Design the program to get the output as shown. Subtasks: 1. You will need to create 2 classes: Team and Player 2. Make all the variables in the Team class private. 3. Make all the variables in the Player class public. 4. Write the required codes in the Team and Player classes Hints: Create a list in team class to store the player's name in that list Use constructor overloading technique for Team class [You are not allowed to change the code below] # Write your code here for subtasks 1-4 Output: ===: = Team() b.setName('Bangladesh') mashrafi = Player("Mashrafi") b.addPlayer(mashrafi) tamim = Player("Tamim") b.addPlayer(tamim) b.printDetail() a = Team("Australia") ponting = Player("Ponting") a.addPlayer(ponting) lee = Player("Lee") a.addPlayer(lee) a.printDetail() Team: Bangladesh List of Players: ['Mashrafi', 'Tamim'] b = ==== Team: Australia List of Players: ['Ponting', 'Lee'] %3D %D
c# programMake a class called Employees, with attributes Name, Gender, Experience, Salary and ID.Make a delegate called EligiblePromo. This delegate takes an employees object as a parameter and returns a boolean value indication whether or not the employee should be promoted.Make a PromoteEmployee() method that takes an arraylist of Employees and delegate of type EligiblePromo as parametersNB: PromoteEmployee() methos loops through each Employees object and passes it to the delegate(25)
Please use Python for this question: Question 1. Inheritance: You MUST use inheritance for this problem. A stack is a sequence container type that, like a queue, supports very restrictive access methods: all insertions and removals are from one end of the stack, typically referred to as the top of the stack. A stack is often referred to as a last-in first-out (LIFO) container because the last item inserted is the first removed. Implement a Stack class using inheritance. inherit the following methods below: a. Constructor/_init__ - Can construct either an empty stack, or initialized with a list of items, the first item is at the bottom, the last is at the top. b. push() - take an item as input and push it on the top of the stack c. pop() - remove and return the item at the top of the stack d. isEmpty() - returns True if the stack is empty, False otherwise e. [] - return the item at a given location, [0] is at the bottom of the stack f. len() - return length of…
Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained. You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data; Node next; Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function…
Read this: Complete the code in Visual Studio using C++ Programming Language - Give me the answer in Visual Studio so I can copy*** - Separate the files such as .cpp, .h, or .main if any! Develop a C++ "doubly" linked list class of your own that can hold a series of signed shorts Develop the following functionality: Develop a linked list node struct/class You can use it as a subclass like in the book (Class contained inside a class) You can use it as its own separate class Your choice Maintain a private pointer to a node class pointer (head) Constructor Initialize head pointer to null Destructor Make sure to properly delete every node in your linked list push_front(value) Insert the value at the front of the linked list pop_front() Remove the node at the front of the linked list If empty, this is a no operation operator << Display the contents of the linked list just like you would print a character string operator [] Treat like…
• Class PassengerList has/should have the following members: -A list of valid PNR numbers pnrList as an instance variable. Constructor PassengerList () populates the list pnrList as given in the template code. -Method public PassengerInfo get PassengerInfo (String) should take a PNR number as argument, check if the PNR number is valid, and if yes, then return a valid Passenger Info object that has the name of the passenger. For ease of implementation, we assume that the valid PNR numbers are 1 to 3. An inner private class PassengerInfo Name of a passenger as an instance variable - This class implements interface IPassenger Info, which enables its object to be accessible from outside the class PassengerList. - Constructor PassengerInfo (String) assigns the name of the passenger to the instance variable of class Passenger Info whose PNR number is given. If the PNR number is 1, then the name should be passenger i, where the valid PNR numbers are for 1 ranging from 1 to 3.