You are given the following class definition for an array-based List ADT: public abstract class List { protected int[] m_array; protected int m_index; 1 public List (int cap) ( 1 m_array = new int[cap]; m index - public abstract int sum(); // underlying array // index of the next open slot in Follow the steps below to create a concrete class EnhancedList with required instance variables and methods. 1. Make sure that the EnhancedList class inherits from List. 2. Declare two private instance variables: int m low and int m high which are used in one of the methods you are required to implement. 3. Create a constructor that takes two parameters int cap, int low, and int high. 4. The constructor should call the constructor of the super class and initialize the instance variable properly. 5. Create a void method rectify() that verifies if each element is with the range of [m_low, m_high]. If any element is smaller than =_low, change its value to m_low. Similarly, if any element is greater than m_high, change its value to m high. 6. Override the sum method so it computes and returns the sum of the elements on the list. Note: Don't forget to add the @Override keyword!

You are given the following class definition for an array-based List ADT: public abstract class List { protected int[] m_array; protected int m_index; 1 public List (int cap) ( 1 m_array = new int[cap]; m index - public abstract int sum(); // underlying array // index of the next open slot in Follow the steps below to create a concrete class EnhancedList with required instance variables and methods. 1. Make sure that the EnhancedList class inherits from List. 2. Declare two private instance variables: int m low and int m high which are used in one of the methods you are required to implement. 3. Create a constructor that takes two parameters int cap, int low, and int high. 4. The constructor should call the constructor of the super class and initialize the instance variable properly. 5. Create a void method rectify() that verifies if each element is with the range of [m_low, m_high]. If any element is smaller than =_low, change its value to m_low. Similarly, if any element is greater than m_high, change its value to m high. 6. Override the sum method so it computes and returns the sum of the elements on the list. Note: Don't forget to add the @Override keyword!

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Consider the following statement, which is intended to create an ArrayList named theater_club to…

A: 4. Consider the following statement, which is intended to create an ArrayList named theater_club to…

Q: Consider following C++ code and based on given function interface commentwrite the implementation of…

A: The objective of the question is to implement the constructor for the nested class Node in the given…

Q: With public functions: const & operator=(const nodeType&); void setInfo(const Type& elem); Type…

A: In this answer, we are required to implement a set of templated classes for various types of linked…

Q: A generic class is defined below. Complete the program as told by the comments. public class Sample…

Q: Question 2 The following is an interrace for a class PriorityQueue: class PriorityQueue { } /*…

A: The implementation of a PriorityQueue class in Java, which is a data structure that allows us to…

Q: Structure of the MyBSTree Fields • a private field named root of type Node You may implement any…

A: Note: To insert any new item in the BSTree we need to compare the item with the current Node's data…

Q: Java Write a p

A: Answer in next step

Q: Java programming I have to do the "Resize method" which I believe if the array is full, it should…

A: I have implemented the code as per the instruction. The code for cirQueue.java with resize method…

Q: a. The "queueClass" shown below is not complete. Add member functions and friend functions to the…

A: Java programming is an object oriented programming languages that are used to create the web…

Q: Question 1 A generic class is defined below. Complete the program as told by the comments. public…

A: Use the below lines to set variables in function setExampleData. this.n = n; this.d = d;

Q: I am having trouble on removing the largest and smallest numbers and getting the sum and dividing it…

A: The given contain functions : int getItemCount(); void display(); void add(int newItem); bool…

Q: The difference between overloading and generics can be explained. Ad hoc polymorphism is sometimes…

A: Method overloading and Generics are both the operations provided by Object Oriented languages.

Q: Question No: 01: Make a class to implement linked list and Implement the basic functions of Linked…

A: //--------Implementing linked list----------// class LinkedList { Node head; // Linked list…

Q: Add a constructor initializer list to the overloaded constructor Professor(string newName, int…

A: Define the Professor class with private member variables name (string) and students (vector of…

Q: PREPARE A UML DIAGRAM FOR THE CODE public class Customer { private List orderList = new…

A: The UML Class diagram is a graphical representation of classes, their attributes, methods, and…

Q: Imagine a generic class: public class Example { /* large body */ } What can be used as X when…

A: A Generic class, means that the items or functions in that class can be generalized with the…

Q: What is the output of the following code snippet? new Student(); = new Student(345, 3.5); Student…

A: 1. B. 0 3.5 2. D 345 345

Q: Consider the following class hierarchy: class Animal { ... } class Mammal extends Animal { ... }…

A: Begin by defining the printArray method with a generic type T that takes an array of type T[] as…

Q: 1. Follow the class instruction and complete the Cat class. Create class Cat a. Add properties: i.…

A: The algorithm for the Java code provided to create a Cat class with properties, methods,…

Q: Code a generic class called Location that describes a point in the xy plane. The Location class…

A: Algorithm : Location class Step 1 : a generic class is created with two parameters <X,Y>.…

Q: }; How many times a constructor is called with the following definition of an array? (Hint: Try it…

A: What is constructor? A constructor is a special type of member function of a class which initializes…

Q: we have 2 classes: public class Customer { private String id; private String name; private String…

A: Customer.java public class Customer { private String id; private String name; private String town;…

Concept explainers

Types of Linked List

A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.

Linked List

When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).

Question

You are given the following class definition for an array-based List ADT:
public abstract class List
protected int[] m_array;
protected int m_index;
1
public List (int cap) (
m array new int[cap];
m index
1
public abstract int sum();
// underlying array
// index of the next open slot in
Follow the steps below to create a concrete class EnhancedList with required
instance variables and methods.
1. Make sure that the EnhancedList class inherits from List.
2. Declare two private instance variables: int m low and int n high which
are used in one of the methods you are required to implement.
3. Create a constructor that takes two parameters int cap, int low, and int
high.
4. The constructor should call the constructor of the super class and initialize the
instance variable properly.
5. Create a void method rectify() that verifies if each element is with the
range of [m low, m highl. If any element is smaller than - low, change its
value tom low. Similarly, if any element is greater than m high, change its
value to high.
6. Override the sum method so it computes and returns the sum of the elements
on the list. Note: Don't forget to add the goverride keyword.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: EnhancedList class inherits from list:

VIEW

Step 2: add the class body:

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

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

/** * This class will use Nodes to form a linked list. It implements the LIFO * (Last In First Out) methodology to reverse the input string. * **/ public class LLStack { private Node head; // Constructor with no parameters for outer class public LLStack( ) { // to do } // This is an inner class specifically utilized for LLStack class, // thus no setter or getters are needed private class Node { private Object data; private Node next; // Constructor with no parameters for inner class public Node(){ // to do // to do } // Parametrized constructor for inner class public Node (Object newData, Node nextLink) { // to do: Data part of Node is an Object // to do: Link to next node is a type Node } } // Adds a node as the first node element at the start of the list with the specified…
in C++ Define a new “Word” class that must inherit from the given Name class. This class manages a dictionary word info: name (string) and its definition (string). It must prevent the creation of a Word object with either an empty or all-blank word or definition. This class must at least complete the methods defined in the Name class: toString method returns a string representation of the Word object in the format of “WORD( <word> ) DEFINITION( <definition> ) such as WORD(school) DEFINITION(an educational institution) contains method that accepts a search string and returns true if either word or definition contains the search string as a substring. It returns false otherwise. isTheSame method that compares two Word objects and returns true only if both Word objects have the exact same word and definition and false otherwise. Please note that if the given object in the parameter is not a Word object, it will return false.
Implement a nested class composition relationship between any two class types from the following list: Advisor Вook Classroom Department Friend Grade School Student Teacher Tutor Write all necessary code for both classes to demonstrate a nested composition relationship including the following: a. one encapsulated data member for each class b. inline default constructor using constructor delegation for each class c. inline one-parameter constructor for each class d. inline accessors for all data members e. inline mutators for all data members
Draw a class diagram for the parking office class below. Diagram shoukd not be hand drawn. N.B Parking office class has relations and dependencies with car, customer, parkinglot and parking charge classes. public class ParkingOffice {String name;String address;String phone;List<Customer> customers;List<Car> cars;List<ParkingLot> lots;List<ParkingCharge> charges; public ParkingOffice(){customers = new ArrayList<>();cars = new ArrayList<>();lots = new ArrayList<>();charges = new ArrayList<>();}public Customer register() {Customer cust = new Customer(name,address,phone);customers.add(cust);return cust;}public Car register(Customer c,String licence, CarType t) {Car car = new Car(c,licence,t);cars.add(car);return car;}public Customer getCustomer(String name) {for(Customer cust : customers)if(cust.getName().equals(name))return cust;return null;}public double addCharge(ParkingCharge p) {charges.add(p);return p.amount;}public String[]…
Task 3: Implement method setup in PE1 class. The description of what is wanted is given in the starter code. public class PE1 { MazedogMaze; /** * This method sets up the maze using the given input argument * @param maze is a maze that is used to construct the dogMaze */ publicvoidsetup(String[][]maze){ /* insert your code here to create the dogMaze * using the input argument. */ } /** * This method returns true if the number of * gates in dogMaze >= 2. * @return it returns true, if enough gate exists (at least 2), otherwise false. */ publicbooleanenoughGate(){ // insert your code here. Change the return value to fit your purpose. returntrue; } /** * This method finds a path from the entrance gate to * the exit gate. * @param row is the index of the row, where the entrance is. * @param column is the index of the column, where the entrance is. * @return it returns a string that contains the path from the start to the end. * The return value should…
Task 3: Implement method setup in PE1 class. The description of what is wanted is given in the starter code. TASK 1 and 2 are done in class maze. Please use PE1 class. public class PE1 { MazedogMaze; /** * This method sets up the maze using the given input argument * @param maze is a maze that is used to construct the dogMaze */ publicvoidsetup(String[][]maze){ /* insert your code here to create the dogMaze * using the input argument. */ } /** * This method returns true if the number of * gates in dogMaze >= 2. * @return it returns true, if enough gate exists (at least 2), otherwise false. */ publicbooleanenoughGate(){ // insert your code here. Change the return value to fit your purpose. if() returntrue; } /** * This method finds a path from the entrance gate to * the exit gate. * @param row is the index of the row, where the entrance is. * @param column is the index of the column, where the entrance is. * @return it returns a string that contains the…
8. Following is the node class: class node { int v node *next: public: node(int x) {v=x; next3D03;} friend class list: }3; Implement the sequential list class below: class list { // circular list class // head position node *head; public: bool empty() { return !head;} list() {head-0;} ~list(); void add(int x); int get(); // empty list judgment / constructor // destructor, to be implemented // add to tail, to be implemented // get from head, to be implemented }3B
Java (Generic Types) - Zip Code and Population
comptuer sciecne help
A) Write a generic Java queue class (a plain queue, not a priority queue). Then, call it GenericQueue, because the JDK already has an interface called Queue. This class must be able to create a queue of objects of any reference type. Consider the GenericStack class shown below for some hints. Like the Stack class below, the GenericQueue should use an underlying ArrayList<E>. Write these methods and any others you find useful: enqueue() adds an E to the queue peek() returns a reference to the object that has been in the queue the longest, without removing it from the queue dequeue() returns the E that has been in the queue the longest, and removes it from the queue contains(T t) returns true if the queue contains at least one object that is equal to t *in the sense that calling .equals() on the object with t the parameter returns true.* Otherwise contains returns false. size() and isEmpty() are obvious.