Log in
Computer Science
4
answers
0
watching
527
views
25 Dec 2017

Part (c) (3 MARKS] Write an -_eq - method in class Airplane that compares two Airplane objects to see if they are equal. Consider two Airplanes equal if they have the same serial number. Follow the function design recipe, which includes writing a docstring.

word_media_image1.png
word_media_image2.png
Watch
4
answers
0
watching
527
views

For unlimited access to Homework Help, a Homework+ subscription is required.

Unlock all answers

Get 1 free homework help answer.
Already have an account? Log in
Share
Already have an account? Log in
Share
Already have an account? Log in
Share
Collen Von
Collen VonLv2
26 Dec 2017
Already have an account? Log in
Share

Related questions

Question 6.6 MARKS] Two friends like to send messages to each other, but they don't want anyone else to read the messages. To keep the messages private, they change each letter in the original message to a different letter of the alphabet. For every letter, they both know which letter will be substituted for it, which is called an encoding. The message will contain only lowercase letters. It will not contain whitespace, digits, or punctuation. The receiver of a secret message doesn't want to convert it back to the original message by hand. Instead, that person asks you to write a function to do it. Following the function design recipe, define a function that given a secret message and the encoding used, returns the original message. Choose a meaningful function name, and add a docstring that includes the type contract, the description, and two examples that return different values. You must choose the types to use to represent the data, and you will be marked not only on the correctness of the function, but also on your choice of data structures.

5. 110 marks] Consider the card structure definition. (define-struct card (value suit)) ii Acara is a structure (make-card v s), where ji v is an integer in the range from 1 to 10 and iis is a symbo. for suit, from the set 'hearts, ii 'diamonds, 'spades, and 'clubs. a) [2 marks] Define a constant called four-of-hearts corresponding to the card with suit 'hearts and value 4. Consider the Scheme function merge-cards which consumes two card structures (cl and c2) and produces a new card, according to the following rules: . If the suits of the two cards are the same, the new card has that suit and its value is the sum of the values of cl and c2, up to a maximum value of 10 • Otherwise, the new card has the value of cl and the suit of c2. b) 12 marks Write the contract of merce-cards (the function header is given below). c) 12 marks Write a single example for merge-cards. d) 16 marks Complete the body of the function merge-cards. (define (mergo-cards c! 02)

8. Write a class called WordSet representing a set of String objects which can contain an arbitrary number of strings, limited only by the memory available to the Java Virtual Machine. A set is a collection of elements, however, unlike a list, a set cannot contain duplicate elements. Therefore, as its name implies, a WordSet object cannot contain duplicate Strings that is, if one attempts to da String to a Wordset, and the wordset already contains an element which is equal to this string, the attempt will fail and the state of the Wordset will not change. All String comparisons performed in the methods defined in the Wordset class are done in a Case SENSITIVE manner. Note that in the method descriptions below, the phrase "this Wordset" means "the Wordset on which the method in question is called." Your Wordset class MUST provide the following INSTANCE methods • A constructor, which takes no parameters and initializes the new Wordset ohject so that it contains no elements • A method called add(), which takes as its only parameter a string and returns a value of type boolean. If this Wordset already contains a string which is equal to the parameter string, or the parameter String is null, then the state of this Wordset does not change and the method return false; otherwise, the parameter String is added to this Wordset. and the method returns true. • A method called remove().which takes as its only parameter a string and returns a value of type boolean. If this wordSet contains a string which is equal to the parameter String this string is removed from the WordSet and the method returns true. On the other hand, if the string parameter is null or this Wordset does not contain a string which is equal to the parameter string, then the state of this wordset does not change, and the method return false. • A method called get.size(), which takes no parameters and returns the number of strings currently stored in this Wordset. This method MUST NOT change the state of this Wordset. • A method called isMember(). which takes as its only parameter a string and retumsa value of type boolean which is true if this wordset contains the parameter String false otherwise. If the parameter String is null, this method also return false. This method MUST NOT change the state of this wordset. • A method called computebirrerence().which takes as its only parameter a Wordset and returns a new Wordset representing the difference between this wordset and the parameter Wordset: in other words, the WordSet returned by this method contains all the strings that are in this wordset, but not in the parameter Wordset. If the parameter Wordset contains all the elements of this WordSet or this WordSet contains no elements, then this method returns a new Wordset containing no elements. Finally, if the parameter Wordset is null or contains ne strings, then this method returns a new wordset which contains all the elements of this wordset. This method MUST NOT change the state of this wordset or the parameter Wordset. • A method called tostring , which takes the parameters and turns a string which is the textual representation of this wordset. This textual representation consists of the concatena tion of the following clements - The String - The text representation of each clement in the WordSet; cach pair of adjacent clements is separated by the String", but this String MUST NOT appear before the first clement or after the last element - The String") The order in which the elements of this Wordset appear in the textual representation generated by the tostring() method does not matter. If the WordSet contains to Brings, then the textual representation returned by this method is ". Note that you MUST respect proper encapsulation practices that is, the attributes and methods of your class MUST be declared using the proper visibility modifier NINT Um an array list (of string) to keep track of the string stored in a wordt ob joot Is there a method defined in the Array loist class which determines whether in clementis already wored in an array ist, and which will do a case-sensitive comparison when liked on an Arraylint of strings? See the pages 24-26 of this examination for information about potentially useful methods defined by the ArrayList class WRITE YOUR Wordset CLASS IN THE SPACE BELOW:

Related Documents

CSC148H1 Lecture Notes - Lecture 3: Docstring, Init
carminemule879
CS 1301 Lecture Notes - Lecture 16: Memory Address, Init, Booklist
coralpanda603
CP114 Lecture Notes - Lecture 2: Result Set, Init, File Descriptor
raspberrycricket434

Weekly leaderboard

Home
Homework Help 3,900,000
Computer Science 2,000
Start filling in the gaps now
Log in