Engineering
11.30 Final Project -- Algorithmic Beauty of Plants This lab will follow examples from the wonderful book "The Algorithmic Beauty of Plants (ABOP)". This book is available free at the link, and is well worth perusing. We will be generating plants using the grammars and approach summarized in Figure 1.24, "Examples of plant-like structures generated by bracketed OL systems", from that book. For this problem, you will implement a class called PLANT. The class has two methods: (1) An initializer. The function will take an initial state (string), a generator (dictionary), the number of generation iterations to run (n) and an angle delta (deltaTheta) for changing direction while drawing. When the class is initialized, you must run the generator with the specified parameter, and make the resulting string available as a member variable PLANT.str. To run the generator, every character in the input string is either (a) replaced by the corresponding value from the generator dictionary if it is in the generator dictionary, or (b) copied directly to the output string if it is not in the generator dictionary. This is repeated n times. For example: np = PLANT ('b', {'b':'a', 'a': 'ab'},5,25) np.str =='abaababa' --> True and np=PLANT ('X', {'X' : 'F[+X] F[-X] +X', 'F' : 'FF'},2,20) np.str=='FF[+F[+X]F[-X] +X] FF[-F [+X]F[-X] +X] +F[+X]F[-X] +X' --> True
8.7 Define a struct, movieType, to store the following data about a movie: movie name (string), movie director (string), producer (string), the year movie was released (int), and number of copies in stock. 8.8 Assume the definition of Exercise 8.7. Declare a variable of type movieType to store the following data: movie name-Summer Vacation, director- Tom Blair, producer-Rajiv Merchant, year the movie released-2005, the number of copies in stock-34.