Write a class with name intlist. This class will have an integer array arr (for simplicity define it with 100 locations) and an integer cnt as member data in private section. cnt variable will be used to keep the number of elements in integer array (arr). In public section of this class there will be following member functions with explained tasks: (i) listcount(): returns the number of elements in arr array (ii) addfirst(x): locates integer x to the first position of arr. All current elements in array will move to the next location. (iii) addlast(x): locates integer x to the last free location. (iv) removeall(): remove all elements of array (v) removefirst(): remove first element of array. All current elemets in array will move to the preceding location (vi) removelast(): remove last element of array. (vii) remove(i): remove element in index i. Notice: While adding if maximum exceeds will give an error message. While removing if there is no element or if there are no elements in a given index, it will give an error message.

Write a class with name intlist. This class will have an integer array arr (for simplicity define it with 100 locations) and an integer cnt as member data in private section. cnt variable will be used to keep the number of elements in integer array (arr). In public section of this class there will be following member functions with explained tasks: (i) listcount(): returns the number of elements in arr array (ii) addfirst(x): locates integer x to the first position of arr. All current elements in array will move to the next location. (iii) addlast(x): locates integer x to the last free location. (iv) removeall(): remove all elements of array (v) removefirst(): remove first element of array. All current elemets in array will move to the preceding location (vi) removelast(): remove last element of array. (vii) remove(i): remove element in index i. Notice: While adding if maximum exceeds will give an error message. While removing if there is no element or if there are no elements in a given index, it will give an error message.

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

Suppose that the bag class is efficiently implemented with a fixed array with a capacity of 4000, as in Chapter 3 of the class text. We execute these statements: bag b; b.insert(5); b.insert(4); b.insert(6); b.erase_one(5); Group of answer choices b.used is 2, b.data[0] is 4, b.data[1] is 6 b.used is 2, b.data[0] is 6, b.data[1] is 4 b.used is 3, b.data[0] is 4, b.data[1] is 6 b.used is 3, b.data[0] is 6, b.data[1] is 4
develop a class productsales with static array 'sales' of size 12 where 0th index stores january.1st index stores sales in february....so on11th index stores sales in december. create a static findmaximumsalesmonth()which prints the month in which maximun sales are done and test this above fuction main() from the same class
Write a program that will sort a prmiitive array of data using the following guidelines - DO NOT USE VECTORS, COLLECTIONS, SETS or any other data structures from your programming language. The codes for both the money and currency should stay the same, the main focus should be on the main file code (Programming language Java) Create a helper function called 'RecurInsSort' such that: It is a standalone function not part of any class from the prior lab or any new class you feel like creating here, Takes in the same type of parameters as any standard Insertion Sort with recursion behavior, i.e. void RecurInsSort(Currency arr[], int size) Prints out how the array looks every time a recursive step returns back to its caller The objects in the array should be Money objects added or manipulated using Currency references/pointers. It is OK to print out the array partially when returning from a particular step as long as the process of sorting is clearly demonstrated in the output. In…
Add the function min as an abstract function to the class arrayListType to return the smallest element of the list. Also, write the definition of the function min in the class unorderedArrayListType and write a program to test this function. I have 5 tabs: I have tried every solution I can think of with no luck. These are the guides: arrayListType.h arrayListTypeImp.cpp: main.cpp unorderedArraryListType.h unorderedArrayListTypeImp.cpp I am needing these in order to pass the assignment in Cengage Mindtap, please help with codes for each one if possible.
The native int type in C++ cannot store large integers of more than 10 decimal digits. In this project, you will implement a bigint class that behaves like the int type but can handle unsigned integers of up to 45 digits. 1. You are to build a class named bigint that can deal with up to 45 decimal digits of unsigned integers. Thebigint class is specified as follows. 2. The bigint class should have a five-element array (int v[5];) as its private date member. Each elementshould store 9 decimal digits.For example to store integer 1,300,000,000,000,900,000,000,100,000,000. You should have v[0] = 100000000,v[1] = 900000000, v[2] =0, v[3]= 1300, and v[4] = 0. 3. The bigint class should have the following constructors:bigint(); // default constructor, set the value to be 0bigint(int x0); // set the value to be x0bigint(int x0, int x1); // set the value to be x1 ∗ 109 + x0bigint(int x0, int x1, int x2); // set the value to be x2 ∗ 1018 + x1 ∗ 109 + x0bigint(int x0, int x1, int x2, int…
CODe full java. In this assignment, you will implement a class called ArrayAndArrayList. This class includessome interesting methods for working with Arrays and ArrayLists.For example, the ArrayAndArrayList class has a “findMax” method which finds and returns themax number in a given array. For a defined array: int[] array = {1, 3, 5, 7, 9}, callingfindMax(array) will return 9.There are 4 methods that need to be implemented in the ArrayAndArrayList class:● howMany(int[] array, int element) - Counts the number of occurrences of the givenelement in the given array.● findMax(int[] array) - Finds the max number in the given array.● maxArray(int[] array) - Keeps track of every occurrence of the max number in the givenarray.● swapZero(int[] array) - Puts all of the zeros in the given array, at the end of the givenarray.Each method has been defined for you, but without the code. See the javadoc for each methodfor instructions on what the method is supposed to do and how to write the code. It…
Write a program that will sort a prmiitive array of data using the following guidelines - DO NOT USE VECTORS, COLLECTIONS, SETS or any other data structures from your programming language. This will also use your 'Currency' and 'Money' classes from the previous lab, so everything for this lab will be in a new file for 'main'. (Programming language Java) Create a helper function called 'RecurInsSort' such that: It is a standalone function not part of any class from the prior lab or any new class you feel like creating here, Takes in the same type of parameters as any standard Insertion Sort with recursion behavior, i.e. void RecurInsSort(Currency arr[], int size) Prints out how the array looks every time a recursive step returns back to its caller The objects in the array should be Money objects added or manipulated using Currency references/pointers. It is OK to print out the array partially when returning from a particular step as long as the process of sorting is clearly…
TaskDeclare and implement 5 classes: FloatArray, SortedArray,FrontArray, PositiveArray & NegativeArray.1- The FloatArray class stores a dynamic array of floats and itssize. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the end of the array.- Overloading for the insertion operator << to write the array to afile (ofstream)- Overloading for the extraction operator >> to read the arrayelements from the file (ifstream) and add them to the array.- A destructor to deallocate the array2- The SortedArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the right place in the arraysuch that the array remains sorted with every add. Don’t add tothe array then sort but rather add in the right place.3- The FrontArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the front of…
Create class IntegerSet for which each object can hold integers in the range 0 through 100. Represent the set internally as a vector of bool values. Element a[i] is true if integer i is in the set. Element a[j] is false if integer j is not in the set. The default constructorinitializes a set to the so-called “empty set,” i.e., a set for which all elements contain false . Provide an intersectionOfSets member function which creates a third set which is the set-theoretic intersection of two existing sets (i.e., an element of the result is set to false if that element is false in either or both of the existing sets, and an element of the result is set to true if that element is true in each of the existing sets).
Declare and implement 5 classes: FloatArray, SortedArray, FrontArray, PositiveArray & NegativeArray 1- The FloatArray class stores a dynamic array of floats and its size. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the end of the array.- Overloading for the insertion operator << to write the array to afile (ofstream)- Overloading for the extraction operator >> to read the array elements from the file (ifstream) and add them to the array.- A destructor to deallocate the array 2- The SortedArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the right place in the arraysuch that the array remains sorted with every add. Don’t add to the array then sort but rather add in the right place. 3- The FrontArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the front…
Declare and implement 5 classes: FloatArray, SortedArray, FrontArray, PositiveArray & NegativeArray. 1- The FloatArray class stores a dynamic array of floats and its size. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the end of the array.- Overloading for the insertion operator << to write the array to afile (ofstream)- Overloading for the extraction operator >> to read the array elements from the file (ifstream) and add them to the array.- A destructor to deallocate the array2- The SortedArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the right place in the arraysuch that the array remains sorted with every add. Don’t add to the array then sort but rather add in the right place.3- The FrontArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the front…
Write a code in JAVA for storing information of Employee using array. Employee attributes for storing data are id (int), name (String), salary (int), department (String) and gender (char). Gender attribute can have one of two values m/M for male and f/F for female. You are required to implement following methods in your class. Prototype and description of methods is given below. Maximum 50 Employee can be stored. 1.void add(Employee e) this method receives Employee as an argument and adds it to end of existing. In case array contains data of 50 Employee display message “Out of memory” 2.int count( ) this methods returns total number of employee whose information is stored in array. 3.void remove(int id) this method receives id as argument and remove employee whose id matches with the provided argument. 4.Employee maxPaid( ) this method returns highly paid employee. If more than one employees are highly paid than return last from the given sequence. No need to write main method or main…