MATH 262 Final: MATH 262 Final Exam

468 views7 pages

turquoisegnu128

31 Jan 2019

School

McGill University

Department

Mathematics and Statistics

Course

MATH 262

Professor

All

For unlimited access to Study Guides, a Grade+ subscription is required.

Document Summary

Instructions and information: information on the computer card is to be entered with a soft lead pencil. The computer will also accept black or blue ball point pens, but this is not advised as you will not be able to erase these to make corrections: this exam paper is version 1. Make sure that the version column of your computer card has this same number lled in. If not, contact an invigilator: print your name and student number on the examination booklet provided. You should answer the written questions in the examination booklet. You may also use the examination booklet to do rough calculations for the multiple choice questions, but such work will not be evaluated: enter the requested id information on the computer card. It is your responsibility to do this correctly. Carefully check that your student number is entered correctly. Only the answers entered on the computer card will count for part 1.

Related Questions

Hi. You should write a Java program to meet the specification shown below.

In this game(dice poker), the computer rolls two standard six-sided dice and you bet on the outcome. The outcome is the configuration of the numbers rolled (explanation below). The input/output should utilise a graphical user interface (input and message boxes).

1.1 Game flow

You start with some money in your bank. You play a number of rounds, where for each round you place a bet and the computer rolls the dice, checks results and modifies your bank balance. After certain conditions, the game ends and you're presented with some final information shown as a message box.

1.2 Placing bets

Before the computer rolls the dice, you can bet some money from your bank.

ˆ If the numbers are sequential (e.g. 1 and 2, 5 and 4, etc. Not 6 and 1), you earn double your bet.

ˆ If the numbers are identical (rolling doubles), you earn triple your bet.

ˆ Otherwise, you win nothing therefore you lose the amount of money you bet.

Before placing a bet, the computer should inform you of your current bank balance.

1.3 Starting Game- Game rules

When the game starts you are given £6 in your bank. Each bet costs £1 and you are allowed to make up to five bets before the game ends. The game will end if you run out of money, or you have no more attempts left (you made all five bets). At the end of the game, you will be told which of these conditions has ended the game.

1.4 Results display

Once the game has finished (all bets have been placed or you ran out of money) the computer will collate and display the results in a single message box, comprised by:

ˆ On row per bet, displaying your bet, the numbers rolled, the amount of money earned or lost for that bet.

ˆ One row at the end, displaying the amount of money that you have remaining in your bank at the end of the game.

1.5..Variable bet amount

Allow the user to change how much they would like to bet and change the amount you win accordingly. Allow bets between £1 and 4£ (integers only)

1.6.High score table

Create a high score table. The more money you have remaining in your bank at the end of the game the higher up the table you will be. In order to implement this, players will have to enter their name before they play. The high score table should be displayed as a separate message box after the results have been displayed at the end of the game(1.4)

Not1: Please use JoptionPane class instead of scanner class.

Not2: Also If possible explain the description of your classes: what each does and how they relate to each other. And if possible, program should be extensible. E.g. Is it easy to change the number of dice? The number of rounds to play? The sides of the dice?Etc.

OC4135869

Sketch using these guidelines

pul aill al thes information together to sketch graphs that reveal the important You might ask: Why don't we just use a graphing calculator or computer to graph a It's true that modern technology is capable of producing very accurate graphs. But K 21+1+2 features of functions curve? Why do we need to use calculus? even the best graphing devices have to be used intelligently. It is easy to arrive at a misleading graph, or to miss important details of a curve, when relying solely on tech- nology. (See "Graphing Calculators and Computers" at www.stewartcalcelus.com, espe 4 discover the most interesting aspects of graphs and in many cases to and minimum points and inflection points exocily instead of approximately cially Examples 1, 3.4, and 5. See also Section 4.6.) The use of calculus enables us to calculate maximum FIGURE 1 For instance, Figure I shows the gr aph of /(x)-è¨-21x, + 18x + 2.At first glance it seems reasonable: It has the same shape as cubic curves like y x and it appears to have no maximum or minimum point. But if you compute the derivative, you will see that there is a maximum when x-0.75 and a minimum when x 1. Indeed if we zoom in to this portion of the graph, we see that behavior exhibited in Pigure 2 Without calculus, we could easily have overlooked it. 6a, FIGURE 2 In the next section we will graph functions by using the interaction between calculus and graphing devices. In this section we draw graphs by first considering the foilowing information. We don't assume that you have a graphing device, but if you do have one you should use it as a check on your work. â Guidelines for Sketching a Curve every item is relevant to every function. (For instance, a to make a sketch that displays the most important aspects of the function. The following checklist is intended as a guide to sketching a curve y- f(x) by hand. Not given curve might not have an asymptote or possess symmetry.) But the guidelines provide all the information you need A. Domain It's often useful to start by determining the domain D of f, that is, the set B. Intercepts The y-intercept is f(o) and this tells us where the curve intersects the of values of x for which f(x) is defined y-axis. To find the x-intercepts, we set y-0and solve for xã(You can omit this step if the equation is difficult to solve.) ry (a) Even fusction: reflectional symmetry all x in D, that is, the equation of the curve is unchanged when x is replacea by -x, then f is an even function and the curve is symmetric about the y-axis. This means that our work is cut in half. If we know what the curve looks like for 0, then we need only reflect about the y-axis to obtain the com- plete curve [see Figure 3(a). Here are some examples: y-ey-ry x). and for all x in D, then f is an odd function and the curve is symmetric about the origin. Again we can obtain the complete curve if we know what it looks like for x0. [Rotate 180Â° about the origin; see Figure 3(b).] Some b) Oud function rotational symmetry FIGURE 3 simple examples of odd functions are y-xy-x'y - and y-sin

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:

MATH 262 Final: MATH 262 Final Exam

Document Summary

Get access

Related textbook solutions

Calculus

Single Variable Calculus: Early Transcendentals

CALCULUS:EARLY TRANSCENDENTALS

Related Documents

MATH 262 Final: MATH 262 Final Exam Version 1

MATH 262 Final: MATH 262 Final Exam Version 0

MATH 133 Study Guide - Final Guide: Unit Vector, Unit Circle, Diagonal Matrix

Related Questions