CSC104H1 Lecture : CSC363 Lecture Notes 1 - Introduction to Turing Machines

155 views4 pages

skyfox856

11 Mar 2011

School

Department

Course

Professor

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

Document Summary

Goal: define computation as abstractly and generally as possible. Many possible formalizations: start with one, study it, then compare with others. Informal idea: similar to fsa but with no limitation on access to input: One-way infinite tape divided into squares (or cells) (each square holds one symbol); Read-write head positioned on one square at a time; control can be in one of a fixed number of states; Initially, tape contains input (one symbol per square, starting on leftmost square) and blanks, and head is on leftmost input symbol; Current state and symbol read determine next state, symbol written, and movement of head (one square left or right). Tm can both read and write symbols. Head can move left or right (convention: moving left on leftmost square leaves head where it is). Special accept and reject states that stop computation immediately. Example: m_1 that accepts exactly strings of the form w#w for w (- {0,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

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:

Grade 9 Science – Lab Safety & Equipment Woksheet

Part A: Highlight ‘T’ for TRUE OR ‘F’ for FALSE for each of the following questions. (K - 35)

1. T F Broken glassware should be swept up immediately and placed in the garbage bin.
2. T F Eyeglasses or contact lenses are an acceptable substitute for googles during an experiment.
3. T F If you arrive at class to find a spilled liquid on your desk, you should assume it is water and wipe
it up with paper towels.
4. T F Students with long hair must tie it back when using Bunsen burners.
5. T F If you take too much of the chemicals needed for an experiment, put it back into the container you
got it from.
6. T F Class B fires are those related to electrical equipment.
7. T F Discard all solid waste by rinsing it down the sink.
8. T F You may consume food and drinks during a lab, as long as it is kept at a safe distance from
chemicals.
9. T F If asked to detect the odour of a chemical in the lab, the student should inhale a deep breath of the
chemical.
10. T F If your clothing were to catch on fire, your first step should be to STOP, DROP and ROLL.
11. T F When using a fire extinguisher, aim at the top of the fire. The chemical in the extinguisher will
fall and put out the flames.
12. T F When heating chemicals in a test tube, heat from the bottom up, aiming the test tube at the
ceiling, and keep the test tube still.
13. T F It is ok to take off my safety goggles if it’s just for a second while I write something down.
14. T F If any chemical makes contact with your eye, wash it immediately at the eyewash station for
fifteen minutes. If you should spill chemicals on your skin, place the affected area under water
immediately.
15. T F Always read through each activity before you begin.
16. T F If you are unsure about any part of the procedure for an experiment, you should figure it out
yourself. Asking the teacher for clarification will result in a lower mark due to lack of preparation.
17. T F It is acceptable to sit during very long experiments.
18. T F It is ok if I don’t know where the lab safety equipment is since I can just ask someone later.
19. T F Be sure to tell your teacher about any accident, broken equipment, or injury that occurs during
class; no matter how minor.
20. T F When working with chemicals, keep pens and pencils away from your mouth.
21. T F In warmer months, it is acceptable to wear sandals during an experiment.
22. T F Determine whether your equipment is cool enough to disassemble by placing the back of your
hand near it.
23. T F Loose-fitting, long-sleeved shirts should be worn during experiments to protect your arms from
burns and chemical splashes.
24. T F If you must retrieve materials during a lab, it is acceptable to leave your Bunsen burner unattended
as long as it is set to a yellow flame.
25. T F To avoid an injury when heating materials, always place a stopper or tight-fitting lid on the
container being heated.
26. T F If a student uses the last of the chemicals in an experiment, it is their responsibility to go into the
storeroom to retrieve an additional quantity of that chemical.
27. T F Always leave your work area clean and dry before leaving the lab and make sure equipment and
glassware is returned clean to its proper place.
28. T F Horseplay is O.K. during a lab as long as no one is getting hurt.
29. T F It is never advisable to place a thermometer in an open flame.
30. T F To cool hot glassware, run cold water over it.
31. T F Class A fires can be extinguished with water.
32. T F Class D fires must be extinguished with water.
33. T F Keep equipment away from the edge of the lab bench.
34. T F If your eye itches while you are working with chemicals, you should rub it with your hands.
35. T F WHMIS stands for warning hazardous materials information symbols.

jhonny

CSC104H1 Lecture : CSC363 Lecture Notes 1 - Introduction to Turing Machines

Document Summary

Get access

Related Documents

NSCS 320 Lecture Notes - Lecture 14: Universal Turing Machine, Abstract Machine, Enigma Machine

CS360 Lecture Notes - Lecture 11: Turing Machine, Tape Head, Equatorial Guinea

COMP 102 Lecture 6: COMP 102 Lec Sep 26

Related Questions