Exercise 1 - Turing Machines Submit Assignment
PURPOSE
This exercise is designed to free your mind from thinking of big picture problems, and instead to focus on details. This mindset will be crucial when we study assembly language. Think Lego blocks. Focus on one block at a time, rather than the elephant you are trying to build.
TASK
Take the problem of determining whether a number is a prime number. Draw a flowchart to represent this algorithm. Keep each box in the flowchart as simple as possible, with only one operation in each box. Each box will represent a Turing machine. Use rectangles to represent arithmetic operations such as addition, subtraction, multiplication, division and modulus (remainder). Use diamonds to represent relational operations such as equals, not equals, less-than, etc. Use circles to represent the different outcomes: one for prime and one for not prime.
OPTIONS
You may use any tool you wish. I recommend LucidChart, a free online program at lucidchart. com. Many word processors, such as MS Word, have drawing tools. You may also use a drawing program like MS Paint. You may even draw your chart by hand and submit a picture.

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges--what’s being bought-- are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them--for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e. g., the possible’ transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e. g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s’ is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s’. so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of even~s--s’ of length m and s of length n, each possibly containing an event more than once--and decides in time o(m n) whether s’ is a subsequence of s

Which cultural aspect does this type of song best portray? a german polka dance

Write a program that uses a random number generator to generate a two digit positive integer and allows the user to perform one or more of the following operations: a. double the number. b. reverse the digits of the number. c. raise the number to the power of 2, 3, or 4. d. sum the digits of the number. e. if the number is a two-digit number, then raise the first digit to the power of the second digit. f. if the number is a three-digit number and the last digit is less than or equal to 4, then raise the first two digits to the power of the last digit. after performing an operation if the number is less than 10, add 10 to the number. also, after each operation determine if the number is prime. each successive operation should be performed on the number generated by the last operation. your program should not contain any global variables and each of these operations must be implemented by a separate function. also, your program should be menu driven. 7. (fraction calculator) write a program that