Introduction to Functional Decomposition

Slides:



Advertisements
Similar presentations
1 ICS102: Introduction To Computing King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science.
Advertisements

Introduction to Functional Decomposition Intro to Computer Science CS 1510 Dr. Sarah Diesburg.
Algorithms Intro to Computer Science CS1510, Section 2 Dr. Sarah Diesburg.
Algorithms and Problem Solving-1 Algorithms and Problem Solving Mainly based on Chapter 6: “Problem Solving and Algorithm Design” from the Book: “Computer.
© Jalal Kawash 2010 Introduction Peeking into Computer Science 1.
© Janice Regan, CMPT 102, Sept CMPT 102 Introduction to Scientific Computer Programming The software development method algorithms.
Using Algorithms Copyright © 2008 by Helene G. Kershner.
Algorithms and Problem Solving
More on Functions (Part 2) Intro to Computer Science CS1510, Section 2 Dr. Sarah Diesburg.
Introduction CS 3358 Data Structures. What is Computer Science? Computer Science is the study of algorithms, including their  Formal and mathematical.
The Programming Process Define the problem* Make or buy software? Design the program * Code (write) the program Test (debug) the program Document the.
Lecture 13: 10/10/2002CS149D Fall CS149D Elements of Computer Science Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture.
2. Program Development Intro Programming in C++ Computer Science Dept Va Tech August 2001 ©2001 Barnette ND & McQuain WD 1 Top-Down Design:A solution method.
Intro to Nested Looping Intro to Computer Science CS1510 Dr. Sarah Diesburg.
Intro to Nested Looping Intro to Computer Science CS1510 Dr. Sarah Diesburg.
Problem Solving Intro to Computer Science CS1510 Dr. Sarah Diesburg 1.
More on Functions (Part 2) Intro to Computer Science CS1510, Section 2 Dr. Sarah Diesburg.
Development Environment
Algorithms IV Top-Down Design.
More on Functions (Part 2)
Topic: Programming Languages and their Evolution + Intro to Scratch
More Functional Decomposition
Selection Structures (Part 1)
Using Algorithms Copyright © 2008 by Helene G. Kershner.
Functions CIS 40 – Introduction to Programming in Python
Application Development Theory
Algorithm and Ambiguity
And now for something completely different . . .
Intro to Computer Science CS1510 Dr. Sarah Diesburg
Using Algorithms Copyright © 2008 by Helene G. Kershner.
Intro to Computer Science CS1510 Dr. Sarah Diesburg
More Nested Loops and Lab 5
Intro to Nested Looping
Computational Thinking
More Functional Decomposition
Intro to Nested Looping
Problem Solving and Algorithm Design
Intro to Computer Science CS1510 Dr. Sarah Diesburg
Intro to Computer Science CS1510 Dr. Sarah Diesburg
More Functional Decomposition
Chapter 8 Namespaces and Memory Realities
Intro to Computer Science CS1510 Dr. Sarah Diesburg
Intro to Computer Science CS1510 Dr. Sarah Diesburg
The Programming Process
Programming We have seen various examples of programming languages
Algorithm and Ambiguity
More on Functions (Part 2)
More on Functions (Part 2)
Intro to Nested Looping
Flowcharts and Pseudo Code
COMPUTATIONAL THINKING COMPUTATIONAL THINKING IN PROGRAMMING
Intro to Computer Science CS1510 Dr. Sarah Diesburg
Intro to Computer Science CS1510 Dr. Sarah Diesburg
Thinking about programming
Intro to Computer Science CS1510, Section 2 Dr. Sarah Diesburg
Intro to Computer Science CS1510 Dr. Sarah Diesburg
Thinking about programming
Intro to Computer Science CS1510 Dr. Sarah Diesburg
Computational Thinking
Intro to Nested Looping
Basic Concepts of Algorithm
More Functional Decomposition
Dale/Weems/Headington Program Input and the Software Design Process
Rocky K. C. Chang September 11, 2018
Top-Down Design & JSP Skill Area Part D
Quiz: Computational Thinking
Intro to Computer Science CS1510 Dr. Sarah Diesburg
More Functional Decomposition
Lecture 6 - Recursion.
Presentation transcript:

Introduction to Functional Decomposition Intro to Computer Science CS 1510 Dr. Sarah Diesburg

Programs are getting larger… Our programs are starting to get large enough that we can’t hold all the details of the implementation in our heads We need a toolset to help us break down large programming problems into smaller, more manageable sub-problems

Breaking up our programs When should break up our programs into small problems? …before we try to write them! Why? We can create re-usable, debuggable pieces that save us time This means that we should integrate this notion into our early design process

Functional Decompostion Functional decomposition* works to break up a large programming assignment into smaller sub-problems Working from the abstract to the concrete This is also known as top-down design * Special thanks to Dr. McCormick for the use of his materials from the book: Dale, Weems, and McCormick. Programming and Problem Solving with ADA 95.

Design Abstract step – a list of major steps in our solution Concrete step – algorithmic steps that can be translated directly into Python code …or, the code of any programming language!

Design What is the easiest way to solve a problem?

Design What is the easiest way to solve a problem? Give the problem to someone else and say “Solve it!” Since we need to solve our own problems, let’s see if we can break this down further…

Design We need to break down a solution from a series of very high-level abstract steps into concrete algorithmic steps that can be implemented in code Each of the major steps becomes an independent sub-problem that we can work on independently

Design Why would we want to do this? It’s much easier to focus on one problem at a time. Can get lost in large specifications without a plan

Design We can create a hierarchical solution tree that goes from the most abstract steps to the concrete steps Each level of the tree is a complete solution to the problem that is less abstract than the level above it This is known as functional equivalence

Hierarchical Solution Tree Concrete steps are shaded

Modules Each box represents a module Modules are a self-contained collection of steps that solves a problem or subproblem They can contain both concrete and abstract steps Concrete steps are often written in pseudocode

Design Warm Up – mileage.py Dr. Mobile asks you to write a program that asks for the starting and ending mileage as well as the total gasoline consumed.  It then calculates the MPG and prints a nice message regarding the MPG of the car. Recall, mpg = (ending mileage – start mileage) / gas consumed It must also print out if the car can be legally driven as-is in California by 2016 (>= 35 MPG)

Mileage Solution Tree Level 0 Solve the Problem No steps are shaded, so these are all abstract steps (must be broken down more to solve in code Get Data Calculate MPG Print Data

Mileage Solution Tree Level 1 Get Data All steps are shaded, so these are all concrete steps that we can translate directly into Python code Ask for starting mileage Ask for ending mileage Ask for gas consumed

Get Data startMileage = int(input(“Please enter the starting mileage: “)) endMileage = int(input(“Please enter the ending mileage: “)) gasConsumed = int(input(“Please enter the gas consumed: “))

Mileage Solution Tree Level 1 Calculate MPG This is a concrete step that we can translate directly into Python code Mpg = (end-start)/gas consumed

Calculate MPG mpg = (endMileage – startMileage) / gasConsumed

Mileage Solution Tree Level 1 Print Data We still need to break down step 2 into something more concrete Print mpg Print if car can be driven in California

Mileage Solution Tree Level 2 Drive in California These are concrete if mpg < 35: print cannot drive else print can drive

Print Data # Print mpg print(“The total mpg is: “, mpg) #Drive in California If mpg < 35: print(“Cannot drive in California.”) else print(“Can drive in California!”)

Total Table Get Data Calculate MPG Print Data Level 0 Solve the Problem Get Data Calculate MPG Print Data Level 1 Get Data Calculate MPG Print Data Ask for starting mileage Ask for ending mileage Ask for gas consumed Mpg = (end-start)/gas consumed Print mpg Print if car can be driven in California Level 2 Drive in California if mpg < 35: print cannot drive else print can drive

Something cool Each module in our solution tree could be broken into a function