When a car arrives at the toll gate, the gate is closed. the gate opens as soon as the driver has paid 25 pesewas. we assume that we have only three coins denominations 5,10 and 25 pesewas. We also assume that no excess change is returned. After having arrived at the toll gate, the driver inserts a sequence of coins into the machine. At the moment, the machine has to decide whether or not to open the gate. whether or not the driver has paid 25 pesewas (or more). a) construct the state transition table for the above scenario b) convert the state transition table to a minimal DFA

When a car arrives at the toll gate, the gate is closed. the gate opens as soon as the driver has paid 25 pesewas. we assume that we have only three coins denominations 5,10 and 25 pesewas. We also assume that no excess change is returned. After having arrived at the toll gate, the driver inserts a sequence of coins into the machine. At the moment, the machine has to decide whether or not to open the gate. whether or not the driver has paid 25 pesewas (or more). a) construct the state transition table for the above scenario b) convert the state transition table to a minimal DFA

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter18: Deterministic Dynamic Programming

Section18.1: Two Puzzles

Problem 3P

See similar textbooks

Similar questions

There are N light bulbs numbered 1 to N, all kept off initially. There are also N persons who will toggle all the bulbs. The first person comes and toggles all the bulbs. The second person comes and toggles all even bulbs. The third person comes and toggles all multiples of 3. This process continues till all N persons pass. When N=16, only the bulbs 1,4,9, and 16 are on. When N=50, how many bulbs are on?
When a car arrives at the toll gate, the gate is closed. the gate opens as soon as the driver has paid 25 pesewas. we assume that we have only three coins denominations 5,10 and 25 pesewas. We also assume that no excess change is returned. After having arrived at the toll gate, the driver inserts a sequence of coins into the machine. At the moment, the machine has to decide whether or not to open the gate. whether or not the driver has paid 25 pesewas (or more). a)construct the state transition table for the above scenariob) convert the state transition table to a minimal DFA 1.given the grammarF to mMpQ|QnFQ to mMpM|pM|qM to mQ|mQp|m (i) Using top-down approach, derive mqpmmqmqpn(ii) Using the bottom-up approach, derive qppmmpnpm Using top-down approach, derive i. mmpmnmmpqii. mmpq
There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plant with more pesticide content than the plant to its left. Example // pesticide levels Use a -indexed array. On day , plants and die leaving . On day , plant in dies leaving . There is no plant with a higher concentration of pesticide than the one to its left, so plants stop dying after day . Input Format The first line contains an integer , the size of the array .The next line contains space-separated integers . Constraints Sample Input 7 6 5 8 4 7 10 9 Sample Output 2 Explanation Initially all plants are alive. Plants = {(6,1), (5,2), (8,3), (4,4), (7,5),…
The spring in the figure below is stretched from its equilibrium position at x = 0 to a positive coordinate xo. ko HINT x = 0 x = xo PE sn PE 50 The force on the spring is F and it stores elastic potential energy PESO. If the spring displacement is tripled to 3x, determine the ratio of the new force to the original force, and the ratio of the new to the original elastic potential energy, Fo Fo PESO (a) the ratio of the new force to the original force, PE ST PE SO (b) the ratio of the new to the original elastic potential energy,
There are four people who want to cross a rickety bridge; they all begin on the same side. You have 17 minutes to get them all across to the other side. It is night, and they have one flashlight. A maximum of two people can cross the bridge at one time. Any party that crosses, either one or two people, must have the flashlight with them. The flashlight must be walked back and forth; it cannot be thrown, for example. Person 1 takes 1 minute to cross the bridge, person 2 takes 2 minutes, person 3 takes 5 minutes, and person 4 takes 10 minutes. A pair must walk together at the rate of the slower person's pace. Write the specification of an algorithm that solves the problem.
Correct answer will be upvoted else downvoted. Computer science. At whatever point a robot arrives at a divider, it pivots right away and proceeds with his ride the other way with a similar speed. At whatever point a few robots meet at a similar integer organize, they impact and detonate into dust. When a robot has detonated, it doesn't slam into some other robot. Note that if a few robots meet at a non-integer facilitate, nothing occurs. For every robot see whether it at any point detonates and print the hour of blast on the off chance that it occurs and −1 in any case. Input The primary line contains a solitary integer t (1≤t≤1000) — the number of testcases. Then, at that point, the depictions of t testcases follow. The primary line of each testcase contains two integers n and m (1≤n≤3⋅105; 2≤m≤108) — the number of robots and the organize of the right divider. The second line of each testcase contains n integers x1,x2,… ,xn (0<xi<m) — the beginning…
The fuel economy of a car is the distance which it can travel on one litre of fuel. The base fuel economy (i.e., its fuel economy when there is only one person - the driver - in the car) of a certain car is MM kilometres per litre. It was also observed that every extra passenger in the car decreases the fuel economy by 11 kilometre per litre. PP people want to take this car for a journey. They know that the car currently has VV litres of fuel in its tank. What is the maximum distance this car can travel under the given conditions, assuming that all PP people always stay in the car and no refuelling can be done? Note that among the PP people is also a driver, i.e., there are exactly PP people in the car. Solve in any programming language
Interest on a credit card’s unpaid balance is calculated using the average daily balance. Suppose that netBalance is the balance shown in the bill, payment is the payment made, d1 is the number of days in the billing cycle, and d2 is the number of days payment is made before billing cycle. Then, the average daily balance is: averageDailyBalance =netBalance x d1-payment x d2d1 If the interest rate per month is, say, 0.0152, then the interest on the unpaid balance is: Interest= averageDailyBalance * 0.0152 Write a program using c++ compiler that accepts as inputnetBalance, payment, d1,d2, and interest rate per month. The program outputs the interest. Format your output to two decimal places.
There are 2016 passengers about to board a plane, numbered 1 through 2016 in that order. Each passenger is assigned to a seat equal to his or her own number. However, the first passenger disregards instructions and instead of sitting in seat number 1, chooses and sits down in a randomly chosen seat. Each subsequent passenger acts according to the following scheme: if their assigned seat is available, they will sit there; otherwise, they will pick at random from the remaining available seats and sit there. What is the probability that the 1512th passenger ends up sitting in their assigned seat? A. 1/2016 B. 1/2 C. 5/8 D. 3/4 E. None of the above
You are given an exam with questions numbered 1, 2, 3, . . . , n. Each question i is worth pi points and has a frustration score fi . You must answer the questions in order, but you may choose to skip some questions. The reason you might choose to do this is that even though you can solve any individual question i and obtain the ???? points, some questions are so frustrating that after solving them you will be unable to solve any of the following fi questions. Suppose that you are given the pi and fi values for all the questions as input. Devise an efficient algorithm you can for choosing a set of questions to answer that maximizes your total points, and compute its asymptotic worst case running time as a function of n.
You have a five-quart pitcher, a three-quart pitcher and an unlimited supply of water, but no measuring cups. How would you separate exactly four quarts of water?
Assume that in a game the player rolls four dices at the same time. The player rolls these dices for 150 times. Report the number of occurrence that the sum of four dices is larger than 15.