Log in
HomeClass Notes1,200,000CA670,000

COMP 250 Lecture Notes - Lecture 22: Binary Search Tree, If And Only If, Priority Queue

16 views7 pages
School
McGill University
Department
Computer Science (Sci)
Course
COMP 250
Professor
Michael Langer

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

Queues : the first thing that goes in is the first thing that comes on. Stacks: the last thing that comes in is the first thing to come out. We"re talking about collections and just saying add or remove. With a queue (or a stack), we have the definition of which one gets removed when we remove. You think of stacks and queues in a visual sense. Priority queues are more general than normal queues. Stacks and queues are actually types of priority queues. A priority queue has a defined ordering on the elements. It can be done in an arbitrary way. When you remove, you remove the most extreme (the smallest or largest) element. So, there has to be some way of defining the ordering -- some formal/mathematical function. : a hospital waiting room has a list of people that need to be served -- the priority depends on. Real life example their urgency or when they arrived.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

COMP 250 Lecture Notes - Lecture 9: Reserved Word, Pseudocode, The Algorithm
burgundygoose665
COMP 250 Lecture Notes - Lecture 8: Empty Spaces, Dynamic Array, Circular Buffer
rosealligator817
COMP 250 Lecture Notes - Lecture 21: Binary Search Tree, Binary Search Algorithm, Dynamic Array
rosealligator817

Related Questions

How To Check The Quality Of A Printed T-Shirt

Meta Description: The quality of a printed t-shirt is considered genuine when the best fabric is used and also depends on the printing method.

We all have favorite clothes and accessories such as Chicago cubs hats. There is sometimes one t-shirt we love the most and sometimes there are multiple t-shirts. The point is we want these t-shirts to last forever with us so that we can wear them as much as we want and as long as we want. But it always comes down to the quality due to which we have to say goodbye to our favorites.

So here are some of the tips you should always consider while purchasing Chicago Cubs shirts or any other printed t-shirts.

  • You should always check what kind of fabric is used and how long does this fabric last.

  • How easily the print on the t-shirt will stay or can be easily removed with wash off. You must always check the durability of the print.

  • Many people make mistakes related to the color vibrance while purchasing it and should always avoid accidents in mistaking saturation.

  • Always consider looking for the t-shirt that will deliver the best sharpness of the image and the resolution.

  • Do not forget to look at the detailing of the shirts and their finishing.

  • You should be able to breathe comfortably in it.

  • The common performance of the fabrics, techniques of printing, how to make the best use so that you can get the best results.

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: