CREATE A JAVA PROGRAM (SEE ATTACHED PHOTOS BELOW) 1. Write an interface name InterfaceSet with the following components:Attribute: max an integer variable initialize to 10, static and finalMethod signatures:- public void add(int e) -> this method adds e in an array, e is not added in the array if ealready exists in the array. Attribute count in increment every successful add of e.- public void display() -> display the contents of the array (NOTE: the array is an attributein the class later)- public int count() -> returns the value of count (NOTE: count is an attribute in the classlater)- public boolean isElementOf(int e) -> returns true if e is in the array false if not- public int getElement(int index) -> returns the value in array at index- public Set union(Set s) -> returns the unionExample:current Object set[] ={1,2,3};Set s] = (1,3,10,5);returns: Set union[]={1,2,3,10,5);NOTE: current object added first, then parameter Set s.2. Write a class Set that implements interface InterfaceSet. Class Set has the followingattributes: set - an array of integer and an integer variable count. Default constructor must setthe size of the array with the max variable from interface. A constructor that accepts aninteger variable size and set the array size of attribute set array to size.NOTE: remove the public modifier in defining interface and class For example:TestResultSet sl = new Set ();1s1.add (1);s1.add (2) ;s1.add (3);s1.add (2);s1.display ();Set s1 =new Set ();Count: 10s1.add (10);10s1.add (12);12sl.add (13);13s1.add (14);14s1.add (15);15s1.add (17);17s1.add (16) ;16s1.add (18);18s1.add (20) ;20s1.add (21);21s1.add (22);System.out.println ("Count: "+s1.count ());s1.display ();

The given problem is related to Java programming where an interface named 'InterfaceSet' and a class…

1. Write an interface name InterfaceSet with the following components: Attribute: max an integer variable initialize to 10, static and final Method signatures: - public void add(int e) -> this method adds e in an array, e is not added in the array if e already exists in the array. Attribute count in increment every successful add of e. - public void display() > display the contents of the array (NOTE: the array is an attribute in the class later) - public int count() -> returns the value of count (NOTE: count is an attribute in the class later) - public boolean isElementOf(int e) -> returns true if e is in the array false if not - public int getElement(int index) -> returns the value in array at index public Set union(Set s) -> returns the union

1. Write an interface name InterfaceSet with the following components: Attribute: max an integer variable initialize to 10, static and final Method signatures: - public void add(int e) -> this method adds e in an array, e is not added in the array if e already exists in the array. Attribute count in increment every successful add of e. - public void display() > display the contents of the array (NOTE: the array is an attribute in the class later) - public int count() -> returns the value of count (NOTE: count is an attribute in the class later) - public boolean isElementOf(int e) -> returns true if e is in the array false if not - public int getElement(int index) -> returns the value in array at index public Set union(Set s) -> returns the union

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

If N represents the number of elements in the collection, then the contains method of the ArrayCollection class is O(1). True or False If N represents the number of elements in the list, then the index-based add method of the ABList class is O(N). True or False
public class testRun{public static int find(int[] data, int target,int start, int end) {int[] stored = sort(data);if (start <= end) {int midPoint = (start + end / 2);if (stored[midPoint] == target) {return midPoint;}if (stored[midPoint] > target) {return find(data, target, start, midPoint - 1);//return first half,exclusive itself}if (stored[midPoint] < target) {return find(data, target, start, midPoint + 1);//return last half,exclusive itself.}}return -1;}public static int[] sort(int[] data){// Find the smallest element in the listfor (int i = 0; i < data.length -1 ; i++){ //generate the index position,not =< b/c goes outer boundint min = i; //assign index position to min in each iterationfor (int j = i + 1; j < data.length ; j++){if (data[j] < data[min]){ //if the element in the second index number smaller than// the element in previous index numbermin = j; // assign j to the smallest number}}swap (data,i,min);// data[i] = min the smallest number assign to…
Need help with the parts that say TODO in images , This may be needed scoresheet code below package edu.vtc.cis2271.yahtzee; import java.util.ArrayList;import java.util.HashSet;import java.util.List;import java.util.Set; public class Scoresheet{ private static final int SMALL_STRAIGHT_SCORE = 30;private static final int LARGE_STRAIGHT_SCORE = 40;private static final int FULL_HOUSE_SCORE = 25;private static final int YAHTZEE_SCORE = 50;private static final int TOP_HALF_BONUS = 35;private static final int TOP_HALF_BONUS_LEVEL = 63; @SuppressWarnings("javadoc")public enum Category {Ones,Twos,Threes,Fours,Fives,Sixes,SmallStraight,LargeStraight,ThreeOfKind,FourOfKind, FullHouse, Yahtzee,Chance} public Scoresheet(){_scores = new int[Category.values().length];_listeners = new ArrayList<>();for (int i = 0; i < _scores.length; i++)_scores[i] = -1;} public void addScoreSheetListener(ScoreSheetListener listener){_listeners.add(listener);} public void…
THE QUESTION IS ATTACHED: PLEASE AVOID USING import java.util.ArrayList; import java.util.HashMap; import java.util.Map; BECAUSE I HAVEN'T STUDIED THEM YET, YOU CAN USE 1D AND 2D ARRAYS. YOU ARE FREE TO USE import java.io.File; import java.io.FileNotFoundException; import java.io.FileWriter; import java.io.IOException; EFFECTIVELY USE LOOPS AND CONTROL STATEMENTS. TXT. FILE IS INCLUDED BELOW: MOVIE NAME, MOVIE YEAR, RATING AND GENRE. The Martian2015Adventure8.0Murder on the Orient Express2017Crime6.5X-Men: First Class2011Action7.7X-Men: Days of Future Past2014Action7.9This Means War2012Action6.3Godzilla vs. Kong2021Adventure6.5Black Widow2021Action7.5Zack Snyder's Justice League2021Action8.1The Ten Commandments1956Drama7.9The Father2020Drama8.3Nobody2021Crime7.5Promising Young Woman2020Crime7.5What Lies Below2020Horror4.4Shrine2021Horror5.1Bram Stoker's Dracula1992Horror7.4
Retrieving a value using its associated key can be accomplished using anindexer, which works just like an indexer for an array. A key is passed in asthe index value, and the value associated with the key is returned, unless thekey doesn’t exist, in which a null is returned.Write short code segment demonstrates how this technique works:
THE QUESTION IS ATTACHED: PLEASE AVOID USING import java.util.ArrayList; import java.util.HashMap; import java.util.Map; BECAUSE I HAVEN'T STUDIED THEM YET, YOU CAN USE 1D AND 2D ARRAYS. YOU ARE FREE TO USE import java.io.File; import java.io.FileNotFoundException; import java.io.FileWriter; import java.io.IOException; EFFECTIVELY USE LOOPS AND CONTROL STATEMENTS. ALSO TRY AND CATCH. TXT. FILE IS INCLUDED BELOW: MOVIE NAME, MOVIE YEAR, RATING AND GENRE. The Martian2015Adventure8.0Murder on the Orient Express2017Crime6.5X-Men: First Class2011Action7.7X-Men: Days of Future Past2014Action7.9This Means War2012Action6.3Godzilla vs. Kong2021Adventure6.5Black Widow2021Action7.5Zack Snyder's Justice League2021Action8.1The Ten Commandments1956Drama7.9The Father2020Drama8.3Nobody2021Crime7.5Promising Young Woman2020Crime7.5What Lies Below2020Horror4.4Shrine2021Horror5.1Bram Stoker's Dracula1992Horror7.4
detemine if the follow statement are true or False and why? screenshots show the ArrayBoundedStack class and StackUnderflowException code If N represents the number of elements on the stack, then the push method of the ArrayBoundedStack class is O(N). While processing this expression ( } ( ) ( ) { { { } [ ] } } ) the highest number of elements on our stack at any one time is 1. If N represents the maximum possible number of elements on the stack, then the ArrayBasedStack constructor is O(N). The following expression is balanced: ( ( ( [ ) ] ) ) Our StackUnderflowException code essentially consists of two simple constructors and "packages" and "extends" statements and nothing else.
Please do not give solution in image format thanku USING JAVA Modify the code to use Arraylist Instead of HashmapCODE:import java.util.ArrayList;import java.util.HashMap;import java.util.List;import java.util.Map;class Student {private String name;private List<String> certificates;public Student(String name) {this.name = name;this.certificates = new ArrayList<>();}public void addCertificate(String certificate) { certificates.add(certificate);}public boolean hasCertificate(String certificate) {return certificates.contains(certificate);}public String getName() {return name;}}public class CertificateManagement {public static void main(String[] args) { Map<String, Student> students = new HashMap<>();Student student1 = new Student("John");student1.addCertificate("Java");student1.addCertificate("Python");students.put("John", student1);Student student2 = new Student("Alice");student2.addCertificate("C++");students.put("Alice", student2);Student student3 = new…
Write a remove method that removes all items between a Start Index and an End Index (Inclusive) in Java. This is for a class called RArrayList that functions just like an ArrayList.
I need to write changeArrayLength(int m) – void method; I already have the code (attached below) but it needs debugging... This method creates a new student table for this course; this new table has the given length m; the method moves all registered students to this table. This method creates a new array of SLinkedList<Student>, moves all the registered students into these linked lists, and changes this course’s studentTable field so it references this new table instead. Each student in the current table will be moved to the new table. This will require in most cases that the student is moved to a different array slot index. The slot index for the SLinkedList<Student> that they are moved to is id % m, where m is the new length of the array (the parameter of the method). The motivation for increasing the capacity of the array is that it keeps the average lengths of the linkedlists below 1, which tends to mean a fast traversal of each linked list. public class Course {…
I need to write changeArrayLength(int m) – void method; I already have the code (attached below) but it needs debugging... This method creates a new student table for this course; this new table has the given length m; the method moves all registered students to this table. This method creates a new array of SLinkedList<Student>, moves all the registered students into these linked lists, and changes this course’s studentTable field so it references this new table instead. Each student in the current table will be moved to the new table. This will require in most cases that the student is moved to a different array slot index. The slot index for the SLinkedList<Student> that they are moved to is id % m, where m is the new length of the array (the parameter of the method). The motivation for increasing the capacity of the array is that it keeps the average lengths of the linkedlists below 1, which tends to mean a fast traversal of each linked list.
What are the advantages of using a link list instead of an array?