-1- Programming Project #1 (Moldels of Computation, Spring, 2001) Due: Section 1: March 1 (Thursday) Section 2 : March 2 (Friday) We know that formal languages.

Slides:



Advertisements
Similar presentations
1 CS 446 – Tutorial 6 Frid. Nov. 6 th, 2009 Implementation Tutorial.
Advertisements

Parameter passing mechanism: pass-by-reference. The Pass-by-reference mechanism - the agreement Recall: Parameter passing mechanism = agreement between.
1 Multi-way Algorithm for Cube Computation CPS Notes 8.
Accessibility Resources: Transition To College Two students talking in the Student Union.
CSc 2310 Principles of Programming (Java)
ATEC Procedural Animation Introduction to Procedural Methods in 3D Computer Animation Dr. Midori Kitagawa.
CSE115: Introduction to Computer Science I Dr. Carl Alphonce 219 Bell Hall
176 Formal Languages and Applications: We know that Pascal programming language is defined in terms of a CFG. All the other programming languages are context-free.
Simulating Trees with Fractals and L-Systems Eric M. Upchurch CS 579.
1 1. Show the result of each of the following set operations in terms of set property. Write your sets as simple as possible. (a) L 0  L 4 (b) L 0  L.
1 Basic Object Oriented Concepts Overview l What is Object-Orientation about? l What is an Object? l What is a Class? l Constructing Objects from Classes.
Costas Busch - RPI1 The Pumping Lemma for Context-Free Languages.
79 Regular Expression Regular expressions over an alphabet  are defined recursively as follows. (1) Ø, which denotes the empty set, is a regular expression.
Chapter 1 Software Engineering. Homework ► Read Section 2.2 (pages 79-98) ► Answer questions: ► 7, 8, 11, 12, & 13 on page 134. ► Answer on paper, hand.
CS5371 Theory of Computation Lecture 8: Automata Theory VI (PDA, PDA = CFG)
Holt Geometry 12-Ext Using Patterns to Generate Fractals 12-Ext Using Patterns to Generate Fractals Holt Geometry Lesson Presentation Lesson Presentation.
ECE200 – Computer Organization Course Introduction.
Intro to CIT 594 ~matuszek/cit594.html.
Graphical Tree-Based Scientific Calculator: CalcuWiz Will Ryan Christian Braunlich.
Activity 1 - WBs 5 mins Go online and spend a moment trying to find out the difference between: HIGH LEVEL programming languages and LOW LEVEL programming.
COMP 151: Computer Programming II Spring Course Topics Review of Java and basics of software engineering (3 classes. Chapters 1 and 2) Recursion.
At LCC we want you be academically successful and this usually means doing well in the classroom. In this section we will cover some basic college “know.
GRANTS FOR GREAT IDEAS Workshop Spring Workshop Objectives To provide a format for writing grant proposals. To offer insights for creating effective.
SE-308 Software Engineering-II 7th Term SE University of Engineering & Technology Taxila, Pakistan Software Engineering Department.
CSc 2310 Principles of Programming (Java) Dr. Xiaolin Hu.
“The Tell-Tale Heart Stations”
Network Simulation and Testing Polly Huang EE NTU
L-Systems and Procedural Plants CSE 3541 Matt Boggus.
1 Homework #7 (Models of Computation, Spring, 2001) Due: Section 1; April 16 (Monday) Section 2; April 17 (Tuesday) 2. Covert the following context-free.
Pushdown Automata (PDAs)
CS 23021–600 Computer Science I Dr. Angela Guercio Spring 2010.
Introduction to Databases Computer Science 557 September 2007 Instructor: Joe Bockhorst University of Wisconsin - Milwaukee.
Welcome to CS 115! Introduction to Programming. Class URL ~mjspra2/ 115summer/
L-system and SVG 2D SVG Tree 2002/10/16.
Computer Science Term 1, 2006 Tutorial 3 Assignment 4 – Special Effects.
PHY 1405 Conceptual Physics (CP 1) Spring 2010 Cypress Campus.
CEN 4010 First Lecture January 9, 2006 CEN 4010 Introduction to Software Engineering Spring 2006 Instructor: Masoud Sadjadi
Elements of a Java Program Bina Ramamurthy SUNY at Buffalo.
GRANTS FOR GREAT IDEAS FALL WORKSHOP OBJECTIVES To provide a format for writing grant proposals. To offer insights for creating effective grant.
Procedural Modelling of Plant Scenes Presented by: Kim R 2 Supervisors:Shaun Bangay Adele Lobb A research project for Computer Science Honours 2004.
Geometry 8.4 Special Right Triangles This is a very important section, as it is used extensively throughout the second semester.
Physics 131 Introduction Instructor: Dr. Michael Chen Office: P9442 Office Hour: MWF. 10:30-11:30am; or by appointment
LINDFERN Lindenmayer Systems in VPython Nick Langhammer.
Cross Language Clone Analysis Team 2 October 13, 2010.
1 CS1430: Programming in C++ Section 2 Instructor: Qi Yang 213 Ullrich
Introduction to Image Processing Our first look at image processing will be through the use of Paint Shop Pro, a bitmap editing program available as shareware.
 2005 SDU Lecture13 Reducibility — A methodology for proving un- decidability.
Copyright © Cengage Learning. All rights reserved. Elementary Probability Theory 4.
Utilizing Your Class Site Class Website Guide by Kimberlee Fulbright.
ATEC Procedural Animation Introduction to Procedural Methods in 3D Computer Animation Dr. Midori Kitagawa.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2002 Sections Ms. Susan Mitchell.
1 Programming Project #2 (Moldels of Computation, Spring, 2001) Due: April 20 (Friday) This assignment is the second half of the programming project which.
 Software Development Life Cycle  Software Development Tools  High Level Programming:  Structures  Algorithms  Iteration  Pseudocode  Order of.
Concepts and Realization of a Diagram Editor Generator Based on Hypergraph Transformation Author: Mark Minas Presenter: Song Gu.
Introduction to Momentum Monday, November 30, 2015.
CMSC 330: Organization of Programming Languages Operational Semantics.
Class of 2016 Senior Advisory 2/17/16. What’s next?
GRANTS FOR GREAT IDEAS WORKSHOP SUMMER WORKSHOP OBJECTIVES To provide a format for writing grant proposals. To offer insights for creating effective.
GRANTS FOR GREAT IDEAS SUMMER WORKSHOP OBJECTIVES To provide a format for writing both Grant Express and GFGI proposals. To offer insights for creating.
What is PDF?  Each group is required to create a Product Development File (PDF).  The PDF is a series of documents that cover the entire history of the.
Experimenting with Grammars to Generate L-Systems – in JFLAP March 31, 2011 Prof. Susan Rodger Computer Science Dept.
Scott C. Johnson Lecturer Rochester Institute of Technology Spring 2016.
Topic: Python’s building blocks -> Variables, Values, and Types
CSc 1302 Principles of Computer Science II
ATCM 3310 Procedural Animation
Reading & Student Success Center
ASTs, Grammars, Parsing, Tree traversals
Designing a Pittsfordschools.org site
Accelerated Introduction to Computer Science
Utilizing Your Class Site
Presentation transcript:

-1- Programming Project #1 (Moldels of Computation, Spring, 2001) Due: Section 1: March 1 (Thursday) Section 2 : March 2 (Friday) We know that formal languages (and their grammars) are directly related to the programming languages. It is well known that some formal languages can be translated into interesting two or three-dimensional fractal figures. In this semester we will implement, so called, L-system simulator (shortly, LSS), which given an L-system grammar, generates a string of the grammar and translate the string into a plant. LSS will be implemented in two parts; part I and part II. This programming assignment is for part I. In this project we develop and implement a software tool that will be used in part II. You should do this project strictly following the guide lines given below. Programs to be implemented: Write a program for each of the following 1 through 4, and keep it in a file. 1. A program which, given a current position P, direction D and length L, draw a straight line of length L from P to direction D. All dimensions are in pixels. 2. A program which, given P, D, and L as above and thickness T and color C, draw a straight line of length L with thickness T and color C from P to direction D. 3. A program which given a number k and the L-system(i.e., the set of rewriting rules) in the handout under the title of "Drawing Plants Using Lindenmayer System“ in a file, generates a string by applying the rewriting rules k times and stores it in an array. 4. A program which, given a string generated by the program that you have developed in part 3 above, draw a tree similar to the one shown in the handout. (You don’t have to draw the numbers on the tree!) Notice that to draw a branch (i.e., a line), you need current position, direction, thickness, and color of the branch. Let penInfo be the set of these data. While drawing a branch if it requires to generate a new branch you store current penInfo in a stack such that you can use it later to complete the old branch by popping it off from the stack when you finish drawing the new branch. (This idea will be explained in more detail in the class.) ** If you need any assumptions, restrictions, etc. that do not contradict to the above guide lines, you may use them for your project, and should clearly describe them in your project report.

-2- Programming Project #1 (cont’d) Notice: (a) You may use any programming language (Visual C++ or Java is strongly recommended) that can be compiled in a platform available in RPI campus or on your laptop. You should keep the 4 programs that you have implemented according to the guide lines (1) – (4) above. (b) You should keep in mind that to complete LSS in Project #2 you are supposed to extend the program that you will develop in part 4 above. You should seriously think about the extendibility of your programs when you implement them in this project. (c) Your project will be evaluated by demo. As soon as you complete your project, make an appointment with your instructor for your demo evaluation. Project grade will be based on the following policy: - Completeness (40%), Comprehension (50%), Program documentation(10%). - For every day late, 20% of the maximum grade will be deducted. (d) Only the students who have completed Project #1 will be eligible to do Project #2. (e) This is individual (i.e., not group) project. Hence, it is illegal to make a copy of other student's program. Similar programming projects were given for the last semester class. So there is the possibility that some of the programs float around the campus. Please resist the temptation of making a copy of such programs. To support this policy, sign the attached "Proclamation of Conscience“ and hand in when you do your demo.

-3- Proclamation of Conscience March _______, 2001 I firmly proclaim with my conscience that all the programs in my programming project have been implemented by myself. Id__________ Name(print)_______________ (sign)__________