Coding. Steps to Success 1.Create a PLAN including a detailed statement of requirements (SORs) 2.Write algorithms based on the SORs 3.Write pseudocode.

Slides:



Advertisements
Similar presentations
1.4 Programming Tools Flowcharts Pseudocode Hierarchy Chart
Advertisements

A day or not a day? The time it takes for the earth to revolve once on its axis. Which is 24 hours… What is a day?
The Pseudocode Programming Process Chapter 9. Outline  Introduction  Design the routine.  Code the routine.  Check the code.  Clean up loose ends.
1 Program Design Language (PDL) Slides by: Noppadon Kamolvilassatian Source: Code Complete by Steve McConnell, Chapter 4.
Chapter 1 - An Introduction to Computers and Problem Solving
Chapter 2 - Problem Solving
Chapter 2 - Problem Solving
Proof Points Key ideas when proving mathematical ideas.
Algorithms and Problem Solving-1 Algorithms and Problem Solving.
Algorithms and Problem Solving. Learn about problem solving skills Explore the algorithmic approach for problem solving Learn about algorithm development.
Copyright © 2003 Center for Farm Financial Management, University of Minnesota Business Plan Once the research is complete, questions answered, and strategy.
Programming Fundamentals (750113) Ch1. Problem Solving
Programming. Software is made by programmers Computers need all kinds of software, from operating systems to applications People learn how to tell the.
Computer Programming Basics. Computer programs are a detailed set of instructions given to the computer They tell the computer: 1. What actions you want.
Algorithms IV: Top-Down Design
The Art of Programming Top-Down Design. The Art of Problem Solving The art of problem solving is the transformation of an English description of a problem.
The Pseudocode Programming Process Chapter 9. Summary of Steps in Building Classes and Routines.
Abstraction IS 101Y/CMSC 101 Computational Thinking and Design Tuesday, September 17, 2013 Carolyn Seaman University of Maryland, Baltimore County.
Unit B065 – Coding a solution PREP WORK 1)Make sure you keep a work log / diary. Use the table on page 16 of the hand book as a template 2)Keep a bibliography.
General Programming Introduction to Computing Science and Programming I.
AVCE ICT Unit 7 - Programming Session 9 – Using pseudocode and structured English.
CHAPTER 1: INTRODUCTION TO COMPUTER SCIENCE Introduction to Computer Science Using Ruby (c) 2012 Ophir Frieder et al.
Making a great Project 2 OCR 1994/2360. Analysis This is the key to getting it right. Too many candidates skip through this section. It’s worth 20% of.
Abstraction IS 101Y/CMSC 101 Computational Thinking and Design Tuesday, September 17, 2013 Marie desJardins University of Maryland, Baltimore County.
Programming for Beginners Martin Nelson Elizabeth FitzGerald Lecture 5: Software Design & Testing; Revision Session.
Problem Solving Techniques. Compiler n Is a computer program whose purpose is to take a description of a desired program coded in a programming language.
Software Development Life Cycle by A.Surasit Samaisut Copyrights : All Rights Reserved.
CS221 Algorithm Basics. What is an algorithm? An algorithm is a list of instructions that transform input information into a desired output. Each instruction.
Software Development Problem Analysis and Specification Design Implementation (Coding) Testing, Execution and Debugging Maintenance.
L061 Algorithms, Part 3 of 3 Topics Top down-design Structure charts Reading Sections , 3.3.
Intermediate 2 Computing Unit 2 - Software Development.
The Art of Programming. The process of breaking problems down into smaller, manageable parts By breaking the problem down, each part becomes more specific.
Steps in Problem Solving Written by: Dr. Frank Flanders and Cate Buchanan Georgia CTAE Resource Network.
Chapter 2 - VB 2005 by Schneider- modified by S. Jane '081 Chapter 2 - Problem Solving 2.1 Program Development Cycle 2.2 Programming Tools.
Programming Introduction. What is a program? Computers cannot think for themselves, they can only follow instructions. A program is a set of instructions.
1 Introduction To Writing for Computer Science and Engineering.
Expressing Algorithms as Flowcharts and Pseudocode
Efficiently Solving Computer Programming Problems Doncho Minkov Telerik Corporation Technical Trainer.
ALGORITHMS AND FLOWCHARTS. Why Algorithm is needed? 2 Computer Program ? Set of instructions to perform some specific task Is Program itself a Software.
Course: Software Engineering – Design I IntroductionSlide Number 1 What is a specification Description of a (computer) system, which:  is precise;  defines.
© Peter Andreae Java Programs COMP 102 # T1 Peter Andreae Computer Science Victoria University of Wellington.
CSC 212 – Data Structures Lecture 15: Big-Oh Notation.
INTRODUCTION TO COMPUTER PROGRAMMING(IT-303) Basics.
1 Week 1 Introduction, Writing a Program, Building a System Software Engineering Fall Term 2015 Marymount University School of Business Administration.
Managing a Project User Documentation.
ICS 3UI - Introduction to Computer Science
Introduction to Computing Science and Programming I
Algorithms and Problem Solving
A451 Theory – 7 Programming 7A, B - Algorithms.
Understand the Programming Process
Cracking the Coding Interview
Print slides for students reference
Written Description of Algorithms
Peer Review ENGL 106: FYC Beth Towle.
Programming Fundamentals (750113) Ch1. Problem Solving
Open on the student drive
Understand the Programming Process
Programming.
Algorithms and Problem Solving
Program Design Language (PDL)
Creative Project Revised 3/02
Lecture 7 Algorithm Design & Implementation. All problems can be solved by employing any one of the following building blocks or their combinations 1.
COMPUTATIONAL THINKING COMPUTATIONAL THINKING IN PROGRAMMING
Can you think of 2 purposes of the operating system?
Scratch –Think Like a Computer
Basic Concepts of Algorithm
WRITING AN ALGORITHM, PSEUDOCODE, AND FLOWCHART LESSON 2.
Lecture 20 – Practice Exercises 4
Presentation transcript:

Coding

Steps to Success 1.Create a PLAN including a detailed statement of requirements (SORs) 2.Write algorithms based on the SORs 3.Write pseudocode from the algorithms 4.Write the code from the pseudocode 5.Test

Planning You will have been given a specification of what the program should do Turn this into a statement of requirements Make sure you include lots of –It will ….. –The program must…. –The user can…..

Algorithms An algorithm is a set of steps to solve a problem. Algorithms don’t have to be implemented by a computer It must solve the problem completely and in a logical manner For more complex problems you can adopt a “black box” approach – You know what the outcome will be but currently not the process to achieve it –Postpone the solution until you have more knowledge about how to solve the problem Algorithms are best not written in a programming style language – leave that to you pseudocode

Code Buddy Get a code buddy to work with Your code buddy should: –The first person to ask when you have a problem –Read your code and give you feedback –Be someone to talk ideas through with Your code buddy is NOT: –Someone you copy code from

Algorithms to Code Coding is a complicated business and when you are starting out it is difficult to look at an empty screen and write code. It’s a bit like someone giving you a sheet of paper and asking you to write a essay. 1.Write an algorithm –These are high level statements written in a structured way so that a reasonable person could follow them and produce the result you expect. The can be gaps in the finer detail of what happens 2.Convert the algorithm to pseudocode –Take each of the high level statements of your algorithm and turn it into pseudocode. –Some of the statement will result in more than one line of pseudocode. This is where you really begin to understand how your program will work. 3.Convert the pseudocode to target language code –This bit should bee easier because the pseudocode should roughly translate line for line with the statements in your target language. –You will be able to use some of the language construct and functions to help improve the efficiency of the pseudocode

Do Not Code Without a Plan Have a clear plan – without one you could end up in the wrong place! A A B B C C

Do Not Code Without a Plan You must complete your pseudocode BEFORE you start coding This will: –Help you be clear about what you have to do –Revise you ideas about the logic of the program before you code –Code the result faster

There will be problems! With a plan you can navigate a way round obstacles that crop up along the way A A B B