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;the arraypublic List (int cap) {}m_array = new int [cap];m index= 0;public abstract int sum();// underlying array// index of the next open slot in Follow the steps below to create a concrete class EnhancedList with requiredinstance 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 whichare used in one of the methods you are required to implement.3. Create a constructor that takes two parameters int cap, int low, and inthigh.4. The constructor should call the constructor of the super class and initialize theinstance variable properly.5. Create a void method rectify () that verifies if each element is with therange of [m_low, m_high]. If any element is smaller than m_low, change itsvalue to m_low. Similarly, if any element is greater than m_high, change itsvalue to m high.6. Override the sum method so it computes and returns the sum of the elementson the list. Note: Don't forget to add the @Override keyword!

The correct answer for the above mentioned question is given in the following steps for your…

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; the array public List (int cap) { m_array = new int [cap]; m index = 0; public abstract int sum (); // underlying array // index of the next open slot in

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; the array public List (int cap) { m_array = new int [cap]; m index = 0; public abstract int sum (); // underlying array // index of the next open slot in

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

Similar questions

Java Question 20:
java method : Write a method called prioritizeQueue to give priority for vaccination for elderly persons. The method is to be in a class called VaccinationQueue and has two parameters q1 and q2 type ArrayQueue. The q1 and q2 data are of type Integer. Assume that initially q1 is not empty and q2 is empty. The method will insert from q1 those elements towards the beginning of the queue (front) q2 whose data is greater than or equal to 45 and will insert those elements whose data is less than 45 and greater than or equal to 18 towards the end (rear) of q2. Any data item less than 18 of q1 will not be inserted in q2. It returns the number of elements added to q2. Class ArrayQueue and all its methods including iterator are available for use. You can also create temporary queues. You are not allowed to use arrays or any other data structure. Example: Before method call: front rear q1: 14 25 50 70 35 45 19 10 21…
/** * 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…
(c) The following is the incomplete abstract class definition as ADT: template class listType { public: const listType & operator= (const listType&); bool isEmptyList () const; void display () ;//to display data in linked list int length () const; void destroyList(); //function to delete all the nodes www w wwwww w ww ww ww Type front () const; Type back (0 const; void copyData (const listType &, int) ; void insert inOrder( 1); void deleteNode (Type & id); // default constructor // default destructor ww protected: (_2_) // to declare pointer named first (_3_) // to declared pointer named last } ; (i) Give the correct statements for 3(c) (1), (2) and (3) above. Assume that the structure's name of the node is nodeType.
Data Structures question (write in Java)
In-class 6: Pointers language C Perform a matrix transpose using 2D-static array 2D-dynamic array Complete our double-linked-list example so that it can correctly insert at a certain position in the list and delete an element.
Computer science help
Trace insertion sort for list ={18,57,8,89,7}
JAVA programming language
Question 5.1 Write a Python program that creates an unordered, singly-linked list consisting of 8 items. Each item in the linked list should be a number. You can use the code given in the lecture slides for your Node and UnorderedList classes. Your node class should contain the following functions: • a constructor • get_data() – returns the data in the node • get_next() – returns the next node in the list set_data() – sets the data in the node to the value given as a parameter set_next() – sets the node that this node links to, to the node given as a parameter Your UnorderedList class should contain the following functions: • a constructor • add() – adds a node to the head of the list, containing the number given in the parameter • is_empty() – returns True if the list is empty, and False otherwise • size() – returns the size of the list • print_list() – displays the contents of all nodes in the list Add code to create an UnorderedList object, and call its add() function to add 8 items…
Data Structures and algorithms: Topic: Doubly and circular Linked Lists in java: Please solve this on urgent basis: Attach output's picture and explain every statement in commments: Implemented Circular Linked List CODE: #include <bits/stdc++.h> // include the standard c++ header fileusing namespace std; class Node // definition of the class for the node of the linked list{public: int data; Node* next;}; void push(Node** head_ref, int data) // definition of the function to insert the element in the list{ Node* ptr1 = new Node(); ptr1->data = data; ptr1->next = *head_ref; if (*head_ref != NULL) // when the head of the list does not points to null { Node* temp = *head_ref; while (temp->next != *head_ref) temp = temp->next; temp->next = ptr1; } else…
Problem 3: In classroom, we implemented MyStack by including an ArrayList as private data field of the class (using composition). In this problem, we will use another way to implement the stack class. Define a new MyStack class that extends ArrayList. Draw the UML diagram for the classes and then implement MyStack. Write a test program that prompts the user to enter five strings and displays them in reverse order. (1) Your UML diagram: (3)