Starting with your solution to the previous task, extend the Circle class by implementing the_eq__() method. This is an example of a so-called "rich comparison" method, which allows two objects to be compared with standard operators (in this case, the == operator) by triggering a special method call (in this case, the_eq_() method). • x == y calls x._eq__(y) Add the following method to your Circle class: • The special eq__(self, other) method defines the behaviour of the equality operator. In this case, two circles are considered to be equal to each other if and only if they have exactly the same radius. The method should return True if two circles are equal, and False otherwise. HINT: You will need to use the isinstance( ) function to check for cases where a non-circle object is passed to the method - in this case, you should return False immediately. Submit the entire class definition in the answer box below. For example: Test Result c1 = Circle(2.5) False c2 = Circle(4) print(c1 == c2) c1 = Circle(2) c2 = Circle(2) True print(c1 == c2)

Starting with your solution to the previous task, extend the Circle class by implementing the_eq__() method. This is an example of a so-called "rich comparison" method, which allows two objects to be compared with standard operators (in this case, the == operator) by triggering a special method call (in this case, the_eq_() method). • x == y calls x._eq(y) Add the following method to your Circle class: • The special eq(self, other) method defines the behaviour of the equality operator. In this case, two circles are considered to be equal to each other if and only if they have exactly the same radius. The method should return True if two circles are equal, and False otherwise. HINT: You will need to use the isinstance( ) function to check for cases where a non-circle object is passed to the method - in this case, you should return False immediately. Submit the entire class definition in the answer box below. For example: Test Result c1 = Circle(2.5) False c2 = Circle(4) print(c1 == c2) c1 = Circle(2) c2 = Circle(2) True print(c1 == c2)

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

You are to implement removeHead, and removeTail and you also have to create the following functions (for visual purposes of the detail explanation, header and trailer sentinels are described as h and t respectively): IMPORTANT NOTE: For all the methods that has the pos parameter i.e. addAt, removeAt, move, make sure to access that specified position from whichever is nearer - the head or the tail - similar to what we have done in the get method. Example DoublyLinkedList: h <-> 10 <-> 30 <-> 40 <-> 50 <-> t int add(int num) This will add the element num into the last element of the linked list and return the position of the newly-added element. In the above example, having add(60) will return 5 as it is the fifth position in the list. int remove(int num) This will remove the first instance of the element and return the position of the removed element. In the above example, having remove(40) will return 3 as 40 was the third element in the linked list…
Improve the method printList to print out the details of all publications ordered on the category of the publications, and then on the title within each category. Note: currently there are only 2 categories, i.e. Book and Journal, but the project may be expended by adding other categories, e.g. Newspaper etc. Here are my four classes. public class Database {private ArrayList<Publication> publicationList; // An array list collection of publications /*** Create a new database*/public Database() {publicationList = new ArrayList<Publication>();} /*** Add a publication** @param publication The publication to be added*/public void addPublication(Publication publication) {if (publicationList.contains(publication)) {System.out.println("This publication has already been added to the list: " + publication);} else {publicationList.add(publication);}} /*** Get the total number of publications** @return The total number of publications*/public int getTotal() {return…
. For the TimeSpan class described below, add a compareTo method that takes another TimeSpan object as a parameter & returns: -1 if this TimeSpan is SMALLER than to the TimeSpan object passed in as a parameter 0 if both TimeSpans are the same 1 if this TimeSpan is GREATER than the TimeSpan object passed in as a parameter Add code, as needed, to allow the Collections class to sort the ArrayList of TimeSpan objects import java.util.*; public class TimeSpan implements { private int hours; private int minutes; public TimeSpan(int hours1, int minutes1) { hours = 0; minutes = 0; add(hours1, minutes1); } public void add(int hours1, int minutes1) { hours += hours1; minutes += minutes1; while (minutes > 60) { minutes -= 60; // convert 60 min --> 1 hour hours++; } } public void add(TimeSpan time) { add(time.hours, time.minutes); }…
Answer the given question with a proper explanation and step-by-step solution. USING JAVA: ---Sorting the Invoices via dates--- Another error that will still be showing is that there is not Comparable/compareTo() method setup on the Invoice class file. That is something you need to fix and code. Implement the use of the Comparable interface and add the compareTo() method to the Invoice class. The compareTo() method will take a little work here. We are going to compare via the date of the invoice. The dates of the Invoice class are by default saved in a MM-DD-YYYY format. So they have a dash '-' between each part of the date. So you will need to split the date of the current invoice AND split the date of the object sent to the method. We have three things to compare against here. First we need to check the year. If the years are the same then you should go another step forward and compare the months. If the months are the same then you will lastly have to compare the day. Use whatever…
In the existing class UnsortedTableMap, the method put(k,v) is used to add an entry to a map. This method spends time to locate an existing item with the given key. Provide a non-static method named putOnlyIfAbsent(k,v) that adds the entry to the map only if there is no entry with a key k. In case an entry with key k already exists, then just return the existing value corresponding to the key. The new method should be provided in the class UnsortedTableMap. Write the testing code in the main method of the class UnsortedTableMap.
By overriding compare( ), alter the way that objects are ordered. For example, to sort in reverse order, you can create a comparator that reverses the outcome of a comparison. The equals( ) method, shown here, tests whether an object equals the invoking comparator:boolean equals(Object obj)Here, obj is the object to be tested for equality. The method returns true if obj and the invoking object are both Comparator objects and use the same ordering. Otherwise, it returns false. Write java code for implement given statement.
Write the Java implementation of an instance method, called countRange, inside the IntArrayBag class such that the method takes two input integer parameters, called start and end. The method then counts and returns how many elements in the bag fall in the range between start and end inclusive. For example, if start is 5 and end is 8, then the method counts how many elements in the bag are equal to 5,6,7, or 8. The method returns zero if start > end. Make sure to include the method header.
Provide a different implementation of ChoiceQuestion. Instead of storing the choices in an array list, the addChoice method should add the choice to the question text. For this purpose, an addLine method has been added to the Question class. /** A question with multiple choices.*/public class ChoiceQuestion extends Question{ // Add any needed instance variables, but don't store the choices // The choices should be added to the text of the superclass /* code goes here */ /** Constructs a choice question with a given text and no choices. @param questionText the text of this question */ public ChoiceQuestion(String questionText) { /code goes here */ } /** Adds an answer choice to this question. @param choice the choice to add @param correct true if this is the correct choice, false otherwise */ public void addChoice(String choice, boolean correct) { /* code goes here */ } }
Consider a scenario of Contacts Database, in which all information of user contacts will be stored. In the given scenario you have to implement your database of contacts using the Generic Arraylist you have created in Task 1. Steps to Follow:Step 1:In first step you have to create Contact class with the following attributes;● First Name● Last Name● Phone Number● Email AddressAdd mutator and accessor methods for all given attributesStep 2:You have to create a menu consisting of the following functionalities;1. Add a new contact2. Display all contacts3. Display specific contact 4. Delete a contact5. Quit
Consider the Person class in Problem 1. Implement the interface PersonPriorityQueueInterface provided in the assignment. In your implementation, you must use an instance of AList (which you used in Problem 1) to store the list of persons. We consider that a person whose age is higher than a second person also has a higher priority. Thus, the method peek(), for example, should return the person who is the oldest in the list. Your implementation should be O(n) for add, and O(1) for the remaining methods. Consider the Person class in Problem 1. Implement the interface PersonPriorityQueueInterface provided in the assignment. In your implementation, you must use an instance of AList (which you used in Problem 1) to store the list of persons. We consider that a person whose age is higher than a second person also has a higher priority. Thus, the method peek(), for example, should return the person who is the oldest in the list. Your implementation should be O(n) for add, and O(1)…
In this exercise, you are going to build on your Circleclass from the previous exercise. You are going to add 2 method, areaDifference and perimeterDifference. Both methods take a doubleradius of a second circle and return the difference from the current circle. For example, if you create a Circle object with a radius of 4 and call areaDifference(3), you will return the diffence between the area of a circle with radius 4 and the area of a circle with a radius of 3. perimeterDifferencewould be the same. Make sure you create at least one Circle and test and print the results of your methods. in java
In this exercise, you are going to build on your Circleclass from the previous exercise. You are going to add 2 method, areaDifference and perimeterDifference. Both methods take a doubleradius of a second circle and return the difference from the current circle. For example, if you create a Circle object with a radius of 4 and call areaDifference(3), you will return the diffence between the area of a circle with radius 4 and the area of a circle with a radius of 3. perimeterDifferencewould be the same. Make sure you create at least one Circle and test and print the results of your methods. given: public class Circle{private double radius;public Circle(double theRadius){radius = theRadius;}// Add a method called area that returns the area of a circle// using Math.PIpublic double area(){return Math.PI*radius*radius;}// Add a method called perimeter that returns the perimeter of a// circle using Math.PIpublic double perimeter(){return Math.PI*2*radius;}}