Part #1: Write a method called equallists in a class called compare. The methodaccepts three ArrayList objects list1, list2 and list3 of type ArrayList asparameters. The list3 is to be generated by compare the list1 and list2 by themethod, if both lists list1 items and list2 items are equal then write 1 in the sameindex in list3, else write 0.public class compare{public static boolean equallistsmmmmmmmmm(ArrayListunnammmmmArrayList list3)mmmmmmmmmmmExample:list1: 4 13 18list2: 42 112list3: 1010(generated by the method)listl, ArrayListPart #2: Write a class called Test equallists having main method to test theapplication. In main method create following:1- Object of type ArrayList list1.2- Add the following data to list1 (4 133- Object of type ArrayList list2.4- Add the following data to list2 (45- Object of type ArrayList list3.6- Test the equallists method to print the result.19090 12 050102list2,18 1 901).1 12 920 5).

Java Program: import java.util.ArrayList; public class compare { public static <E>…

Part # 1: Write a method called equallists in a class called compare. The method accepts three ArrayList objects list1, list2 and list3 of type ArrayList as parameters. The list3 is to be generated by compare the list1 and list2 by the method, if both lists list1 items and list2 items are equal then write 1 in the same index in list3, else write 0. public class compare public static boolean equallists mmmmmmmmm (ArrayList mmmmmmm ArrayList list3) mmmmmmmm Example: list1: 4 13 1 list2: 4 2 1 list3: 1 0 1 0 (generated by the method) Part #2: Write a class called Test_equallists having main method to test the application. In main method create following: 1- Object of type ArrayList list1. 2- Add the following data to list1 (4 13 3- Object of type ArrayList list2. 4- Add the following data to list2 (42 5- Object of type ArrayList list3. 6- Test the equallists method to print the result. 8 12 listl, ArrayList 1 9 0 list2, 9 0 1 2 0 5 0 1 0 18 19 0 1). 1 12 9 2 05).

Part # 1: Write a method called equallists in a class called compare. The method accepts three ArrayList objects list1, list2 and list3 of type ArrayList as parameters. The list3 is to be generated by compare the list1 and list2 by the method, if both lists list1 items and list2 items are equal then write 1 in the same index in list3, else write 0. public class compare public static boolean equallists mmmmmmmmm (ArrayList mmmmmmm ArrayList list3) mmmmmmmm Example: list1: 4 13 1 list2: 4 2 1 list3: 1 0 1 0 (generated by the method) Part #2: Write a class called Test_equallists having main method to test the application. In main method create following: 1- Object of type ArrayList list1. 2- Add the following data to list1 (4 13 3- Object of type ArrayList list2. 4- Add the following data to list2 (42 5- Object of type ArrayList list3. 6- Test the equallists method to print the result. 8 12 listl, ArrayList 1 9 0 list2, 9 0 1 2 0 5 0 1 0 18 19 0 1). 1 12 9 2 05).

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

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 ============================================…
Design a generic method 'sum' that accepts an array of any type such as int, double or float and this method will return the sum of all elements in the array. Create a test class and call 'sum twice by passing arrays of different types.
Question 3. ArraysWrite a Java program that has a method called collapse() which accepts an array of integers as a parameterand returns a new array containing the result of replacing each pair of integers with the sum of thatpair. For example, if an array called list stores the values [ 7, 2, 8, 9, 4, 13, 7, 1, 9, 10 ], then the call ofcollapse(list) should return a new array containing [ 9, 17, 17, 8, 19 ]. The first pair from the originallist is collapsed into 9 (7 1 2), the second pair is collapsed into 17 (8 1 9), and so on. If the list storesan odd number of elements, the final element is not collapsed. For example, if the list had been [ 1, 2,3, 4, 5 ], then the call would return [ 3, 7, 5 ]. The collapse() method should not change the array that ispassed as a parameter.
Write a class TouristSpot that has the data members; name of tourist spot, state in which it lies. Create an array list of n places and write a function that takes array list as an argument to identify a state that has more than one tourist spot. Java Program
2. The class PetShop has a single field as defined below: private ArrayList petList; Define a method to print out the details of all cats in petList in PetShop.
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.
Writing a program that helps to enter patients information:● Write a class patientInfo which contains the following data and methods:• Data:PatientName (String).PatientID (int).• Methods:Getter and Setter for each data item.toString method.● Display this menu:1:Merging two Single Linked List structure type2:Merging two Stacks data structure type3:Merging two Queses data structure type4:Merging Single Linked List with Stack to Linked List5:Merging Single Linked List with Queue to Linked List6:Merging Singly Linked List with Stack only Patient’s name that start with S to Queue● Ask the user to choose the data structure type from a given list to be merged.If you choose any of the above options:1.You must request [the size of data structures and patient information] from the user.2. Print the data structure before the merge.3. Print data structure after the merge.
rite a method called samePosition in a class called StackExt that receives two parameters st1 and st2 of type ArrayStack and a third parameter pos of type int. The method returns true, if stack st1 and st2 contains the same value in position pos. Otherwise, the method returns false. Assume that both stacks st1 and st2 contain same number of elements. Assume that the position of the top element is 0 and increases by 1 for each subsequent element. The elements of both stacks st1 and st2 must remain in the original relative positions in the stacks at the end of the method. Use common stack operations only such as push, pop, peek, isEmpty, constructor and copy constructor. You can create temporary objects of type ArrayStack in your method. Example: top st1: 4 5 3 10 8 st1: 5 9 4 10 1 If the pos is 3, then both stacks contain 10 in position 3. The method returns true. If the pos is 1, then st1 contains 5 and st2 contains 9 in…
Java 1. Implement ArrayUnorderedList<T> class which will extend ArrayList<T> by defining the following additional methods(i) public void addToFront(T element); //Adds the specified element to the front of the list.(ii) public void addToRear(T element); //Adds the specified element to the rear of the list.(iii) public void addAfter(T element, T target); //Adds the specified element after the specified target element.a. Create an object of ArrayUnorderedList<T> class and perform some add, remove, and search operations and finally print the entire Stack.
In the existing DoublyLinkedList class, write and test a non-static method named reverseList to reverse a doubly linked list. Write the testing code in the main method of the class DoublyLinkedList. For this purpose, you must only use and update the DoublyLinkedList.java file provided in Lesson2Examples posted in the eCentennial module “Lesson Examples (from textbook)” package Ex2; public class DoublyLinkedList<E> { private static class Node<E> { private E element; // reference to the element stored at this node private Node<E> prev; // reference to the previous node in the list private Node<E> next; // reference to the subsequent node in the list public Node(E e, Node<E> p, Node<E> n) {element = e;prev = p;next = n;} // public accessor methodspublic E getElement() { return element; } public Node<E> getPrev() { return prev; } public Node<E> getNext() { return next; } // Update methodspublic void setPrev(Node<E> p) { prev = p; }…
In the existing CircularlyLinkedList class, Write a non-static method named getMax for finding the maximum element in a circularly linked list. Write the testing code in the main method of the class CircularlyLinkedList. For this purpose, you must only use and update the CircularlyLinkedList.java file provided in Lesson3Examples posted in the eCentennialmodule "Lesson Examples (from textbook)" package exercise3; public class CircularlyLinkedList<E> { private static class Node<E> { private E element; private Node<E> next; public Node(E e, Node<E> n) { element = e; next = n; } public E getElement() { return element; } public Node<E> getNext() { return next; } public void setNext(Node<E> n) { next = n; } } private Node<E> tail = null; private int size = 0; public CircularlyLinkedList() { } public int size() { return size; } public boolean isEmpty() { return size == 0; } public E first() { if (isEmpty()) return null; return…
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