PseudocodeFORTRAN (original) INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END.

Slides:



Advertisements
Similar presentations
AP Computer Science Anthony Keen. Computer 101 What happens when you turn a computer on? –BIOS tries to start a system loader –A system loader tries to.
Advertisements

Computer Programming Lab(7).
 2007 Dr. Natheer Khasawneh. Chapter 13. Graphical User Interface Concepts: Part 1.
METHOD OVERRIDING Sub class can override the methods defined by the super class. Overridden Methods in the sub classes should have same name, same signature.
Chapter 7 User-Defined Methods. Chapter Objectives  Understand how methods are used in Java programming  Learn about standard (predefined) methods and.
Java Planning our Programs Flowcharts Arithmetic Operators.
Introduction to working with Loops  2000 Prentice Hall, Inc. All rights reserved. Modified for use with this course. Introduction to Computers and Programming.
 2002 Prentice Hall. All rights reserved. 1 Chapter 6 - Methods Outline Note: Inconsistent with textbook subsection numbering […] 6.14Recursion 6.15 Example.
Fundamental Programming Structures in Java: Comments, Data Types, Variables, Assignments, Operators.
GTECH 731 Lab Session 4 Lab 3 Review, Lab 4 Intro 9/28/10 Lab 3 Review Lab 4 Overview.
COMP 14: Intro. to Intro. to Programming May 23, 2000 Nick Vallidis.
C++ Programming Language Day 1. What this course covers Day 1 – Structure of C++ program – Basic data types – Standard input, output streams – Selection.
Control Structures II. Why is Repetition Needed? There are many situations in which the same statements need to be executed several times. Example: Formulas.
16-Aug-15 Java Puzzlers From the book Java Puzzlers by Joshua Bloch and Neal Gafter.
The for-statement. Different loop-statements in Java Java provides 3 types of loop-statements: 1. The for-statement 2. The while-statement 3. The do-while-statement.
JAVA Control Structures: Repetition. Objectives Be able to use a loop to implement a repetitive algorithm Practice, Practice, Practice... Reinforce the.
VARIABLES, TYPES, INPUT/OUTPUT, ASSIGNMENT OPERATION Shieu-Hong Lin MATH/CS Department Chapel.
First appearedFeaturesMain paradigmsPopular uses COMPUTING Basic FOR A=1 TO 100 IF A MOD 15 = 0 THEN PRINT “FizzBuzz” ELSE IF A MOD 3 = 0 THEN PRINT “Fizz”
Visual Basic Fundamental Concepts. Integrated Development Enviroment Generates startup form for new project on which to place controls. Features toolbox.
CSC3170 Introduction to Database Systems
Java and C++, The Difference An introduction Unit - 00.
Outlines Chapter 3 –Chapter 3 – Loops & Revision –Loops while do … while – revision 1.
Object Oriented Programming Graphical User Interfaces Dr. Mike Spann
C# B 1 CSC 298 Writing a C# application. C# B 2 A first C# application // Display Hello, world on the screen public class HelloWorld { public static void.
COMPUTER PROGRAMMING I Objective 8.03 Apply Animation and Graphic Methods in a Windows Form (4%)
Computer Programming Andres, Wen-Yuan Liao Department of Computer Science and Engineering De Lin Institute of Technology
Jens Krüger & Polina Kondratieva – Computer Graphics and Visualization Group computer graphics & visualization Practical Course C# / DirectX WS 05/06 Introduction.
Programming Examples to Accompany Structure Topic Please use speaker notes for additional information!
Introduction to Programming David Goldschmidt, Ph.D. Computer Science The College of Saint Rose Java Fundamentals (Comments, Variables, etc.)
1 CC111 Lec9 : Visual Basic Visual Basic (3) Lecture 9.
1 CS1120: Recursion. 2 What is Recursion? A method is said to be recursive if the method definition contains a call to itself A recursive method is a.
COMPUTER PROGRAMMING I SUMMER Apply operators and Boolean expressions.
南台科技大學 資訊工程系 Arduino 與電腦端互動設計之三 報告人:洪賢麟 指導老師:李育強 日期: 2013/11/20 報告人:洪賢麟 指導老師:李育強 日期: 2013/11/20.
110-G1 Motivation: Within a program, may have to perform the same computation over and over Many programs share the same computation (e.g. sorting) To.
Practical Programming COMP153-08S Lecture 1: Starting to program.
ITEC 320 C++ Examples.
Microsoft Visual Basic 2005: Reloaded Second Edition Chapter 3 Variables, Constants, Methods, and Calculations.
Introduction to VSTS Introduction to Visual Studio 2008 Development Edition Understanding code complexity using Code Metrics.
VB .NET Revisit VB .NET Revisit.
6c – Function Procedures Lingma Acheson Department of Computer and Information Science, IUPUI CSCI N331 VB.NET Programming.
COMPUTER PROGRAMMING I SUMMER Apply operators and Boolean expressions.
Georgia Institute of Technology More on Creating Classes part 2 Barb Ericson Georgia Institute of Technology Oct 2005.
BEGINNING PROGRAMMING.  Literally – giving instructions to a computer so that it does what you want  Practically – using a programming language (such.
The while-statement. Syntax and meaning of the while-statement The LOOP-CONTINUATION-CONDITION is a Boolean expression (exactly the same as in the condition.
Java methods Methods break down large problems into smaller ones Your program may call the same method many times saves writing and maintaining same code.
Review TEST 2 Chapters 4,5,7. QUESTION For which type of operands does the == operator always work correctly: (a) int, (b) double, or (c) String?
CONTROL STATEMENTS LOOPS. WHY IS REPETITION NEEDED?  There are many situations in which the same statements need to be executed several times.  Example:
Debugging, Static Variables, ByRef, ByValue Chapt. 6 in Deitel, Deitel and Nieto.
CIVIL AND GEOMATIC ENGINEERING FT Okyere. CIV 257- COMPUTER PROGRAMMING Lecture 3.
First appeared Features Popular uses Assembly 1949 For code that must directly interact with the hardware (drivers), embedded processors, processor specific.
COMPUTER PROGRAMMING I SUMMER Apply operators and Boolean expressions.
Invent Your Own Computer Games with Python
1 Lecture # 2. * Introducing Programming with an Example * Identifiers, Variables, and Constants * Primitive Data Types * Byte, short, int, long, float,
Exception and Exception Handling. Exception An abnormal event that is likely to happen during program is execution Computer could run out of memory Calling.
Pseudocode FORTRAN (original) INPUT number
The need for Programming Languages
A variable is a name for a value stored in memory.
Chapter 7 - Methods Outline Note: Inconsistent with textbook subsection numbering […] 7.13 Recursion […]
Object Oriented Programming
Chapter 2 Elementary Programming
USING ECLIPSE TO CREATE HELLO WORLD
Introduction to VB programming
Chapter 5: Control Structures II
للمزيد زورونا على موقعنا الإلكتروني:
null, true, and false are also reserved.
An Introduction to Java – Part I, language basics
الوحدة الرابعة البرمجة وصياغة حل المسائل البرمجة وأهميتها أهداف الدرس الأول مفهوم البرمجة. الفرق بين المبرمج ومستخدم البرنامج. الحاجة إلى البرامج.
The for-statement.
Methods/Functions.
COMPUTING.
Presentation transcript:

PseudocodeFORTRAN (original) INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder 10 FORMAT(I4) 20 READ 1, INUM 30 READ 1, IDIVSR 40 IMED = INUM 50 IF (INUM – IDIVSR) 80, 60, IMED = IMED – IDIVSR 70 GOTO 5 80 IREMR = IMED 90 PUNCH 1, IREMR

PseudocodeCOBOL (probably buggy, modified from “Hello World” program found on the Internet) INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder IDENTIFICATION DIVISION PROGRAM-ID. MODULO ENVIRONMENT DIVISION CONFIGURATION SECTION DATA DIVISION FILE SECTION PROCEDURE DIVISION MAIN-LOGIC SECTION BEGIN ACCEPT NUMBER ACCEPT DIVISOR MOVE NUMBER TO INTERMEDIATE PERFORM UNTIL INTERMEDIATE < DIVISOR SUBTRACT DIVISOR FROM INTERMEDIATE END-PERFORM MOVE INTERMEDIATE TO REMAINDER DISPLAY REMAINDER STOP RUN MAIN-LOGIC-EXIT EXIT.

PseudocodeBASIC (interactive, from the original 1964 Dartmouth manual) INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder 10 DATA user_types_value_of_N 15 READ N 20 DATA user_types_value_of_D 25 READ D 30 LET I = N 40 IF I >= D GO TO LET I = I – D 60 GO TO LET R = I 80 PRINT R

PseudocodeC INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder #include void main(int argc, char* argv) { int number, divisor, intermediate; scanf(“%d”, number); scanf(“%d”, divisor); intermediate = number; while (intermediate >= divisor) { intermediate = intermediate – divisor; } remainder = intermediate; printf(“%d”, remainder); }

PseudocodeFORTRAN 77 INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder PROGRAM MODULO INTEGER NUMBER, DIVISOR INTEGER INTERMEDIATE READ *, NUMBER READ *, DIVISOR INTERMEDIATE = NUMBER DO WHILE (INTERMEDIATE.GE. DIVISOR) INTERMEDIATE = INTERMEDIATE - DIVISOR END DO REMAINDER = INTERMEDIATE PRINT *, REMAINDER

PseudocodeBASIC (structured, as used in early Personal Computers) INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder INPUT number INPUT divisor intermediate = number WHILE intermediate >= divisor intermediate = intermediate - divisor WEND remainder = intermediate PRINT remainder

PseudocodeC++ INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder #include public class Modulo { public static int mod(int number, int divisor) { int intermediate; intermediate = number; while (intermediate >= divisor) { intermediate = intermediate – divisor; } remainder = intermediate; return remainder; }

public Modulo() { } int main() { int number, divisor; cin >> number; cin >> divisor; cout << Modulo.mod(number, divisor); return 0; }

PseudocodeJava (not object oriented, console input and output) INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder import java.io.*; public class Modulo { public static void main(String[] args) { int number, divisor, intermediate, remainder; number = Integer.valueOf(System.console().readLine()); divisor = Integer.valueOf(System.console().readLine()); intermediate = number; while (intermediate >= divisor) { intermediate = intermediate – divisor; } remainder = intermediate; System.out.println(remainder); }

PseudocodeJava (fully object oriented, console input and output) INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder import java.io.*; public class Modulo { private int number, divisor; public int mod() { int intermediate; intermediate = number; while (intermediate >= divisor) { intermediate = intermediate – divisor; } remainder = intermediate; return remainder; }

public void setNumber(int n) { if (n > 0 && n < ) number = n; } public void setDivisor(int d) { if (d > 0 && n < ) divisor = d; } public Modulo() { number = 0; divisor = 1; } public static void main(String[] args) { Modulo modulo = new Modulo(); modulo.setNumber( Integer.valueOf(System.console().readLine())); modulo.setNumber( Integer.valueOf(System.console().readLine())); System.out.println(modulo.mod()); }

Pseudocodephp INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder <?php function modulo($n, $d) { $i = $n; while ($i >= $d) { $i = $i - $d; } $r = $i; return $r; } ?>

Number: Divisor: Find remainder

Pseudocodejavascript (not related to Java) INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder function modulo() { var number = document.getElementById('numberInput').value; var divisor = document.getElementById('divisorInput').value; var intermediate = number; while (intermediate >= divisor) { intermediate = intermediate - divisor; } var remainder = intermediate; alert(remainder); }

Number: Divisor: Find remainder

PseudocodeVisual Basic (not object oriented, console input and output) INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder Module Modulo Sub Main() Dim number, divisor, intermediate, remainder As Int32 Int32.TryParse(System.Console.In.ReadLine(), number); Int32.TryParse(System.Console.In.ReadLine(), divisor); intermediate = number; While (intermediate >= divisor) intermediate = intermediate – divisor; End While remainder = intermediate; System.Console.Out.WriteLine(remainder); End Sub End Module

PseudocodeC# (not object oriented, console input and output) INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder using System; class Program { static void main(string[] args) { int number, divisor, intermediate, remainder; Int32.TryParse(System.Console.In.ReadLine(), out number); Int32.TryParse(System.Console.In.ReadLine(), out divisor); intermediate = number; while (intermediate >= divisor) { intermediate = intermediate – divisor; } remainder = intermediate; System.Console.Out.WriteLine(remainder); }

Visual Basic (fully object oriented windows) _ Partial Class Prime_Windows Inherits System.Windows.Forms.Form 'Form overrides dispose to clean up the component list. _ Protected Overrides Sub Dispose(ByVal disposing As Boolean) Try If disposing AndAlso components IsNot Nothing Then components.Dispose() End If Finally MyBase.Dispose(disposing) End Try End Sub 'Required by the Windows Form Designer Private components As System.ComponentModel.Icontainer 'NOTE: The following procedure is required by the Windows Form Designer 'It can be modified using the Windows Form Designer. 'Do not modify it using the code editor. _ Private Sub InitializeComponent() Me.NumberInput = New System.Windows.Forms.TextBox Me.AnswerLable = New System.Windows.Forms.Label Me.SuspendLayout() ' 'NumberInput ' Me.NumberInput.Location = New System.Drawing.Point(103, 47) Me.NumberInput.Name = "NumberInput" Me.NumberInput.Size = New System.Drawing.Size(87, 20) Me.NumberInput.TabIndex = 0 ' 'AnswerLable ' Me.AnswerLable.AutoSize = True Me.AnswerLable.Location = New System.Drawing.Point(108, 104) Me.AnswerLable.Name = "AnswerLable" Me.AnswerLable.Size = New System.Drawing.Size(0, 13) Me.AnswerLable.TabIndex = 1 ' 'Prime_Windows '

Me.AutoScaleDimensions = New System.Drawing.SizeF(6.0!, 13.0!) Me.AutoScaleMode = System.Windows.Forms.AutoScaleMode.Font Me.ClientSize = New System.Drawing.Size(292, 273) Me.Controls.Add(Me.AnswerLable) Me.Controls.Add(Me.NumberInput) Me.Name = "Prime_Windows" Me.Text = "Prime" Me.ResumeLayout(False) Me.PerformLayout() End Sub Friend WithEvents NumberInput As System.Windows.Forms.TextBox Friend WithEvents AnswerLable As System.Windows.Forms.Label End Class Public Class Prime_Windows Private Sub NumberInput_KeyUp(ByVal sender As_ System.Object, ByVal e As_ System.Windows.Forms.KeyEventArgs) Handles_ NumberInput.KeyUp Dim primeFinder As New Prime If e.KeyCode = Keys.Enter Then If Int32.TryParse(NumberInput.Text, number) = 0 Then answer = “Invalid input” ElseIf number < 0 Then answer = “Must be positive” Else If number >= 2 And primeFinder.determineIfPrime(number) Then answer = number.ToString + " is a prime." Else answer = number.ToString + " is not a prime.“ End If AnswerLable.Text = answer End If End Sub Dim number As Integer Dim answer As String End Class

Public Class Prime Public Function determineIfPrime(ByVal number As Integer) As Boolean Dim remainder As Integer Dim divisor As Integer Dim prime As Boolean Dim finder As New ModuloFinder prime = True divisor = 2 While divisor < number remainder = finder.modulo(number, divisor) If remainder = 0 Then prime = False End If divisor = divisor + 1 End While Return prime End Function End Class

INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder Pseudocode Public Class ModuloFinder Public Function modulo(ByVal number As_ Integer, ByVal divisor As Integer) As Integer Dim intermediate As Integer Dim remainder As Integer intermediate = number While intermediate >= divisor intermediate = intermediate – divisor End While remainder = intermediate Return remainder End Function End Class

C# (fully object oriented windows) using System; using System.Collections.Generic; using System.Linq; using System.Windows.Forms; namespace Prime_CSharp_Windows { static class Program { /// /// The main entry point for the application. /// [STAThread] static void Main() { Application.EnableVisualStyles(); Application.SetCompatibleTextRenderingDefault(false); Application.Run(new PrimeWindow()); } namespace Prime_CSharp_Windows { partial class PrimeWindow { /// /// Required designer variable. /// private System.ComponentModel.IContainer components = null; /// /// Clean up any resources being used. /// /// true if managed resources /// should be disposed; otherwise, false. protected override void Dispose(bool disposing) { if (disposing && (components != null)) { components.Dispose(); } base.Dispose(disposing); }

#region Windows Form Designer generated code /// /// Required method for Designer support - do not modify /// the contents of this method with the code editor. /// private void InitializeComponent() { this.NumberInput = new System.Windows.Forms.TextBox(); this.AnswerLabel = new System.Windows.Forms.Label(); this.SuspendLayout(); // // NumberInput // this.NumberInput.Location = new System.Drawing.Point(94, 57); this.NumberInput.Name = "NumberInput"; this.NumberInput.Size = new System.Drawing.Size(100, 20); this.NumberInput.TabIndex = 0; this.NumberInput.KeyUp += new System.Windows.Forms.KeyEventHandler(this.NumberInput_KeyUp); // // AnswerLabel // this.AnswerLabel.AutoSize = true; this.AnswerLabel.Location = new System.Drawing.Point(94, 109); this.AnswerLabel.Name = "AnswerLabel"; this.AnswerLabel.Size = new System.Drawing.Size(0, 13); this.AnswerLabel.TabIndex = 1; // // PrimeWindow // this.AutoScaleDimensions = new System.Drawing.SizeF(6F, 13F); this.AutoScaleMode = System.Windows.Forms.AutoScaleMode.Font; this.ClientSize = new System.Drawing.Size(292, 273); this.Controls.Add(this.AnswerLabel); this.Controls.Add(this.NumberInput); this.Name = "PrimeWindow"; this.Text = "Prime"; //this.Load += new System.EventHandler(this.PrimeWindow_Load); this.ResumeLayout(false); this.PerformLayout(); } #endregion private System.Windows.Forms.TextBox NumberInput; private System.Windows.Forms.Label AnswerLabel; }

using System; using System.Windows.Forms; namespace Prime_CSharp_Windows { public partial class PrimeWindow : Form { public PrimeWindow() { InitializeComponent(); } private void NumberInput_KeyUp(object sender, KeyEventArgs e) { if (e.KeyCode == Keys.Enter) { if (Int32.TryParse(NumberInput.Text, out number) == false) answer = “Invalid input”; else if (number < 0) answer = “Must be positive”; else { if (Prime.determineIfPrime(number) answer = number + " is a prime."; else answer = number + " is not a prime."; } AnswerLabel.Text = answer.ToString(); } private int number; private string answer; } public static class Prime { public static Boolean determineIfPrime(int number) { int remainder; int divisor; Boolean prime; prime = true; divisor = 2; while (divisor < number) { remainder = ModuloFinder.modulo(number, divisor); if (remainder == 0) prime = false; divisor = divisor + 1; } return prime; }

INPUT number INPUT divisor intermediate <-- number WHILE intermediate >= divisor intermediate <-- intermediate – divisor END WHILE remainder <-- intermediate OUTPUT remainder Pseudocode public static class ModuloFinder { public static int modulo(int number, int divisor) { int intermediate; int remainder; intermediate = number; while (intermediate >= divisor) { intermediate = intermediate – divisor; } remainder = intermediate; return remainder; }