Jackson Structured Diagrams

Slides:



Advertisements
Similar presentations
HKOI 2005 Junior Q1 Pattern Matching ( 模式匹配 ). Question Given a target value (Sum of pattern P), find a sub-block with size equal to P having sum closest.
Advertisements

1 ILP (Recap). 2 Basic Block (BB) ILP is quite small –BB: a straight-line code sequence with no branches in except to the entry and no branches out except.
AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.
3.1.3 Program Flow control_1 Understand the need for structure Breaking things down.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
Chapter 2- Visual Basic Schneider
KISS Programming. What’s so great about computers? They are fast (so they can accomplish much in a short time… spell check a thesis) They don’t make mistakes.
1 PATH TESTING An Example for White-Box Testing. 2 Path testing a form of white box testing steps to complete: –derive the module’s flow diagram –describe.
IMSE Lecture Week 6 - Low Level Design Summary of last week: u Transform Analysis - 4 steps: 1 annotate the DFD (without redrawing it) 2 draw the intermediate.
Entity Event Modelling
Chapter 2: Developing a Program Extended and Concise Prelude to Programming Concepts and Design Copyright © 2003 Scott/Jones, Inc.. All rights reserved.
Pg HUGHES Electrical & Electronic Technology
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
The Program Design Phases
Algorithm & Flowchart.
Chapter 2: Developing a Program Prelude to Programming Concepts and Design Copyright © 2001 Scott/Jones, Inc.. All rights reserved. 1 Chapter 2 Developing.
Extended Prelude to Programming Concepts & Design, 3/e by Stewart Venit and Elizabeth Drake Chapter 2: Developing a Program.
Simple Program Design Third Edition A Step-by-Step Approach
1-3 Exponents Learn to represent numbers by using exponents.
Module Road Map Credit Categories Assignment 2 Credit Category 2 You are able to demonstrate how data may be filtered using Xpath You are able to demonstrate.
Describe the Program Development Cycle. Program Development Cycle The program development cycle is a series of steps programmers use to build computer.
Extended Prelude to Programming Concepts & Design, 3/e by Stewart Venit and Elizabeth Drake Chapter 2: Flowcharts.
CPS120 Introduction to Computer Programming The Programming Process.
Probability Tree Diagrams. Can be used to show the outcomes of two or more events. Each Branch represents the possible outcome of one event. Probability.
Scenarios, Use-cases and Domain Models Christian Glahn, Marcus Specht.
Interaction Diagram Notation
Pseudocode Algorithms Using Sequence, Selection, and Repetition Simple Program Design Third Edition A Step-by-Step Approach 6.
Introduction Object oriented design is a method where developers think in terms of objects instead of procedures or functions. SA/SD approach is based.
Practical Programming COMP153-08S Week 5 Lecture 1: Screen Design Subroutines and Functions.
PROGRAM DEVELOPMENT CYCLE. Problem Statement: Problem Statement help diagnose the situation so that your focus is on the problem, helpful tools at this.
1 AVCE ICT Unit 7 - Programming Session 8 – Documenting your programs.
Principles of Programming - NI Simple Recursion Recursion is where a function calls itself. Concept of recursive function: A recursive function is.
Structured Programming The Basics. Control structures They control the order of execution What order statements will be done in, or whether they will.
Systems Design.  Application Design  User Interface Design  Database Design.
Problem-solving with Computers. 2Outline  Computer System  5 Steps for producing a computer program  Structured program and programming  3 types of.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
Flowchart. a diagram of the sequence of movements or actions of people or things involved in a complex system or activity. a graphical representation.
Lecture 3 : Hard Systems Modelling UFCE8V-20-3 Information Systems Development SHAPE Hong Kong 2010/11.
“Cobweb” diagrams. Affine Difference Equations---Slope bigger than 1.
CPSC 233 Tutorial 5 February 2 th /3 th, Java Loop Statements A portion of a program that repeats a statement or a group of statements is called.
DBS201: Data Modeling. Agenda Data Modeling Types of Models Entity Relationship Model.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
Introduction to Scratch We will be using the Scratch Environment today, so please log in to the Scratch website (scratch.mit.edu)
Program Design & Development EE 201 C7-1 Spring
Steps of a Design Brief V Purpose of a Design Brief  A design brief is the process used to solve problems or complete presentations.  It is very.
IST 210: PHP Logic IST 210: Organization of Data IST2101.
Structured Programming The Basics
Tools Of Structured Analysis
An Iterative FFT We rewrite the loop to calculate nkyk[1] once
Chapter 2- Visual Basic Schneider
Design methods: JSP and JSD†
Learning Intention I will learn about the iterative software development process with a focus on the Design stage.
Chapter 5 Structures.
Dr. Samer Odeh Hanna (PhD)
Unit# 9: Computer Program Development
Problem Solving Techniques
Chapter 2- Visual Basic Schneider
Problem Solving: Structure Charts
Structure Charts Agenda: What are Structure Charts
Chapter 2- Visual Basic Schneider
LabVIEW.
Circle Map Circle Maps are tools used to help define a thing or idea.
Let us build the tree for the argument Q>-P | P>Q.
Exponents Course 1.
Software Development Process
Circle Map Circle Maps are tools used to help define a thing or idea.
Vocabulary Algorithm - A precise sequence of instructions for processes that can be executed by a computer Low level programming language: A programming.
Top-Down Design & JSP Skill Area Part D
Example 5A: Solving Simple Rational Equations
Calculate 81 ÷ 3 = 27 3 x 3 x 3 3 x 3 x 3 x 3 ÷ 3 = This could be written as
Presentation transcript:

Jackson Structured Diagrams Programming Concepts Jackson Structured Diagrams

Jackson Structured Diagrams This is a useful way of representing the structure of a program, when a program is large and complex, it is important to plan out the solution before attempting to write any program code. By using a Jackson structured diagram your system can be documented and given to a programmer to aid the development of the program.

Jackson Structured Diagrams The basic structure to a JSD is as follows: It resembles a family tree, with the main modules being written across the top line. You read it from left to right completing any sub branches before being able to move on to the next module. JSD structures programs and data in terms of sequences, iterations and selections. Program Jackson Initialise InputAndProcess Output

Jackson Structured Diagrams Example - Loop b = 10 Do While (a<b) a = a + 1 Loop To represent a Loop using JSD: Calculate result* Initialise InputAndProcess Output Do While (a<b)

Jackson Structured Diagrams Example - Selection To represent Selection using JSD: Check if A >B If (A>B) Then Msgbox (“A is > B”) True Msgbox (“B is > A”) False

Jackson Structured Diagrams JSD is a structured analysis and design method similar to SSADM. It uses Entity Structure Diagrams (ESD) and Network Diagrams (ND) to model a system.