lecture04-june12 - 6/12/09 Lecture 4 Announcements...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
6/12/09 1 Lecture 4 Announcements • Assignment 1 Q&A due Monday in class (2) on paper • Design due Wed. in class (6) on paper • IPO diagram, UML class diagram (if you create additional classes), functional block diagram showing what static methods call other methods (yours), main algorithm (either pseudocode or flowchart) • Program due Sunday submitted to BB (12) Topics for today – Eclipse demo – Analysis process tips – Continue basic Java introduction • Finish strings • Static method mechanics • Arrays (time permitting) Analysis Process (IPO model) YOU Problem/ Project statement Other Inputs from The Customers Or users Knowledge of The application Domain (miniworld) Information sources •Requirements •Assumptions •Questions •Better understanding of the mini-world and the problem •Solution ideas Artifacts of analysis Analysis Process Tips 1. Read the problem statement very carefully. 2. Identify and understand the required inputs, desired outputs, etc. 3. Parse the problem statement looking for the key concepts; use the divide and conquer approach (break big chunks into little ones) Noun phrases typically will denote potential data types and variables (and later: classes,objects) Verb phrases will denote potential processes/functions/actions Outputs can often be related to inputs by a transformation process (perhaps needing intermediate variables) 4. Work examples all the way through by hand 5. Seek clarification and more information as needed from the problem specifiers (the teaching team in this case) 6. Create an IPO diagram, architecture diagrams, high level sketch of the flow of the main algorithm and any data structures/data types 7. DO NOT start by trying to write code!! Analysis Process Tips IPO (system view) – identify the inputs (e.g. the data given) – Identify the outputs (i.e. the desired results) Architecture – Identify the basic components, functions and features needed – Identify the data objects, structures, variables and relationships between them – Identify those processes that transform the input data into the output data – Identify pre-existing parts that will participate in the solution (e.g. library classes and methods) – Create UML and functional block diagrams Analysis Identify additional (derived/nonfunctional) requirements or constraints on the solution; and questions to be asked of the client Make assumptions and simplifications as necessary (document and check those) What is in a Program Design? Algorithms + Data Structures => Programs Algorithm – Is a logical sequence of discrete steps that describes a complete solution to a given problem which is computable in a finite amount of time. Data Structure
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/15/2009 for the course EE 322C taught by Professor Nettles during the Summer '08 term at University of Texas at Austin.

Page1 / 5

lecture04-june12 - 6/12/09 Lecture 4 Announcements...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online