Introduction to Computing Lecture 00: Part 2 Introduction to Algorithms and Flowcharts
|
|
|
- Noreen Cannon
- 6 years ago
- Views:
Transcription
1 Introduction to Computing Lecture 00: Part 2 Introduction to Algorithms and Flowcharts Assist.Prof.Dr. Nükhet ÖZBEK Ege University Department of Electrical & Electronics Engineering ozbek.nukhet@gmail.com 1
2 Topics Solving problems Software Development Method Algorithms Flow Charts 2
3 Software Development Programming is a problem-solving activity 3
4 How do we solve problems? We "just do" Guesswork-and-luck Trial-and-error Experience (possibly someone else's) "Scientifically" 4
5 The Problem-solving Process Requirement Analysis Analysis Design Implementation Test and Verification Maintenance 5
6 Requirement analysis Formally specify the problem and the needed solution Unimportant aspects are removed from problem definition 6
7 Analysis Detailed identification of the problem and the desired solution Detailed specification of input data and the required output is worked out 7
8 Design Specification of the process(es) needed to transform the input to the desired output Sequence of instructions specifying the steps required to accomplish a task is called an algorithm Designed algorithm must be checked for correctness 8
9 Implementation Designed algorithm is translated into a chosen computer language 9
10 Test and verification To see that developed program works as intended Program must be run with several different data sets to verify the program 10
11 Maintenance Developed program is modified to correct unexpected errors encountered in the program and add new features to the program if needed Maintenance can be a tedious process Programs must be well documented and structured 11
12 Algorithm A sequence of instructions specifying the steps required to accomplish some task Named after: Muhammad ibn Musa al- Khwarizmi of Khowarezm (now Khiva in Uzbekistan) 12
13 Algorithm Working Definition A sequence of instructions describing how to do a task [As opposed to actually executing the instructions] 13
14 Algorithm -- Examples A cooking recipe Assembly instructions for a model The rules of how to play a game Directions for driving from A to B A knitting pattern A car repair manual 14
15 Components of an Algorithm Variables and values Instructions Sequences Procedures Selections Repetitions Documentation 15
16 Values Represent quantities, amounts or measurements May be numerical or alphabetical (or other things) Often have a unit related to their purpose Example: Recipe ingredients 16
17 Variables Are containers for values places to store values Example: Variable Values This jar can contain 10 cookies 50 grams of sugar 3 slices of cake etc. 17
18 Restrictions on Variables Variables may be restricted to contain a specific type of value 18
19 Instructions Examples Directions to perform specific actions on values and variables. Take off your shoes Count to 10 Cut along dotted line 19
20 Sequence -- Example 1. Open freezer door 2. Take out Gourmet Meal 3. Close freezer door 4. Open microwave door 5. Put Gourmet Meal on carousel 6. Shut microwave door 7. Set microwave on high for 5 minutes 8. Start microwave 9. Wait 5 minutes 10. Open microwave door 11. Remove Gourmet Meal 12. Close microwave door 20
21 Components of an Algorithm Values and Variables Instruction (a.k.a. primitives) Sequence (of instructions) Procedure (involving instructions) Selection (between instructions) Repetition (of instructions) Documentation (beside instructions) 21
22 Procedure A named sequence of instructions So that you can Refer to it collectively (by name)...instead of individually (by each instruction in the sequence) Example: Drive_To_Uni 22
23 Procedure -- Example procedure Drive_To_Uni 1. find car keys 2. disable car alarm 3. open car door 4. get in car 5. shut car door 6. put keys in ignition 7. start car 8. back car out of driveway 9. drive to end of street 10. turn right 11. drive to end of street 12. turn left...etc...etc...etc...etc...etc...etc find parking space 53. pull into parking space 54. turn off engine 55. remove keys from ignition 56. open car door 57. get out 58. shut car door 59. lock car door 60. enable alarm 23
24 Procedure Example (cont) procedure Do_Thursday Wake_up Have_Shower Eat_Breakfast Drive_To_Uni Sit_EE134_Lecture...etc...etc...etc... Drive_From_Uni...etc...etc...etc... procedure Do_Week Do_Monday Do_Tuesday Do_Wednesday Do_Thursday...etc...etc...etc... 24
25 Procedure A procedure may have a set of parameters procedure customerservice ( myname,timeofday ) say Good timeofday say My name is myname say How can I help you? customerservice ( Ali, Morning ) customerservice ( Ayşe, Afternoon ) customerservice ( Veli, Night ) 25
26 Procedure Example (cont) procedure Do_Thursday Wake_up Have_Shower Eat_Breakfast Drive_To_Uni Sit_EE134_Lecture...etc...etc...etc... Drive_From_Uni...etc...etc...etc... An instruction invoking a procedure is known as a procedure call 26
27 Procedure Example (cont) procedure Do_Thursday Wake_up Have_Shower Eat_Breakfast Drive_To_Uni Sit_EE134_Lecture...etc...etc...etc... Drive_From_Uni...etc...etc...etc... We use brackets to mark the beginning and end of a sequence. 27
28 Procedure Example (cont) procedure Do_Thursday Wake_up Have_Shower Eat_Breakfast Drive_To_Uni Sit_EE134_Lecture...etc...etc...etc... Drive_From_Uni...etc...etc...etc... In this subject, we also use the following words to refer to a Procedure : Sub-routine Module Function 28
29 Components of an Algorithm Values and Variables Instruction (a.k.a. primitives) Sequence (of instructions) Procedure (involving instructions) Selection (between instructions) Repetition (of instructions) Documentation (beside instructions) 29
30 Selection An instruction that decides which of two possible sequences is executed The decision is based on a single true/false condition 30
31 Selection Example - Car Repair if (motor turns) then CheckFuel CheckSparkPlugs CheckCarburettor else CheckDistributor CheckIgnitionCoil 31
32 Selection Example Car Repair (cont) if (motor turns) then CheckFuel CheckSparkPlugs CheckCarburettor else CheckDistributor CheckIgnitionCoil Should be a true or false condition. 32
33 Selection Example -- Car Repair (cont) if (motor turns) then CheckFuel CheckSparkPlugs CheckCarburettor else CheckDistributor CheckIgnitionCoil Sequence if the condition is true. 33
34 Selection Example -- Car Repair (cont) if (motor turns) then CheckFuel CheckSparkPlugs CheckCarburettor else CheckDistributor CheckIgnitionCoil Sequence if the condition is false. 34
35 Selection Several Conditions What if several conditions need to be satisfied? if ( today is Thursday and the time is 10.00am ) then else Go to EE134 Lecture Go to Library Solution 1 35
36 Selection Several Conditions (cont) if ( today is Thursday ) then if ( the time is 10.00am ) then Go to EE134 Lecture else...etc...etc...etc... Often called a nested selection Solution 2 36
37 Selection At Least One of Several Conditions What if at least one of several conditions needs to be satisfied? if ( I feel hungry or the time is 1.00pm or my mate has his eye on my lunch ) then Eat my lunch now 37
38 Selection Several Courses of Action What if there are several courses of action? if ( button pressed is 1 ) then CheckAccountBalance else if ( button pressed is 2 ) then TransferFunds else if ( button pressed is 3 ) then PayBills else if ( button pressed is 4 ) then ExitPhoneBanking else say Invalid option Form 1 38
39 Selection Several Courses of Action (cont) if ( button pressed is 1 ) then CheckAccountBalance else if ( button pressed is 2 ) then TransferFunds else if ( button pressed is 3 ) then PayBills else if ( button pressed is 4 ) then ExitPhoneBanking else say Invalid option Cascaded selection. Form 2 39
40 Components of an Algorithm Values and Variables Instruction (a.k.a. primitives) Sequence (of instructions) Procedure (involving instructions) Selection (between instructions) Repetition (of instructions) Documentation (beside instructions) 40
41 Repetition Repeat an instruction......while (or maybe until) some true or false condition occurs Test the condition each time before repeating the instruction Also known as iteration or loop Example: Algorithm for getting a date 41
42 Repetition -- Example procedure AskOnDate ( name, time, location ) Phone(name) Say("Hey", name, "it's your lucky day!") Say("Wanna come to", location, "at", time, "?") ListenToReply ( ) start begging count at zero while (reply is "No" and begging count < 100) Say("Oh please!") add 1 to begging count ListenToReply ( ) 42
43 Repetition Example (cont) procedure AskOnDate ( name, time, location ) Phone(name) Say("Hey", name, "it's your lucky day!") Say("Wanna come to", location, "at", time, "?") ListenToReply ( ) start begging count at zero while ( reply is "No" and begging count < 100 ) Say("Oh please!") add 1 to begging count ListenToReply ( ) Condition is tested before sequence 43
44 Repetition Example (cont) procedure AskOnDate ( name, time, location ) Phone(name) Say("Hey", name, "it's your lucky day!") Say("Wanna come to", location, "at", time, "?") ListenToReply ( ) start begging count at zero while (reply is "No" and begging count < 100) Say("Oh please!") add 1 to begging count ListenToReply ( ) Sequence may not get executed at all 44
45 Repetition Example (cont) procedure AskOnDate ( name, time, location ) Phone(name) Say("Hey", name, "it's your lucky day!") Say("Wanna come to", location, "at", time, "?") ListenToReply ( ) start begging count at zero while (reply is "No" and begging count < 100) Say("Oh please!") add 1 to begging count ListenToReply ( ) Ensure initial values of variables used in the conditions are set correctly 45
46 Repetition Example (cont) procedure AskOnDate ( name, time, location ) Phone(name) Say("Hey", name, "it's your lucky day!") Say("Wanna come to", location, "at", time, "?") ListenToReply ( ) start begging count at zero while (reply is "No" and begging count < 100) Say("Oh please!") add 1 to begging count ListenToReply ( ) Ensure the variables used in the conditions are updated in each iteration 46
47 Repetition Example (cont) What if we don t increment the begging count? procedure AskOnDate ( name, time, location ) Phone(name) Say("Hey", name, "it's your lucky day!") Say("Wanna come to", location, "at", time, "?") ListenToReply ( ) start begging count at zero while (reply is "No" and begging count < 100) Say("Oh please!") Infinite loop 47
48 Repetition Variation decide on Time and Location initialise booking to unsuccessful while ( not successfully booked ) get next Name in little black book AskOnDate(Name, Time, Location) DetermineBookingSuccess SighWithRelief 48
49 Repetition Pre-tested Loop decide on Time and Location initialise booking to unsuccessful while ( not successfully booked ) get next Name in little black book AskOnDate(Name, Time, Location) DetermineBookingSuccess SighWithRelief pre-tested loop 49
50 Repetition Pre-tested Loop decide on Time and Location initialise booking to unsuccessful until ( successfully booked ) get next Name in little black book AskOnDate(Name, Time, Location) DetermineBookingSuccess SighWithRelief pre-tested loop 50
51 Repetition Post-tested Loop decide on Time and Location initialise booking to unsuccessful do get next Name in little black book AskOnDate(Name, Time, Location) DetermineBookingSuccess while ( not successfully booked ) SighWithRelief Sequence is executed at least once post-tested loop 51
52 Repetition Post-tested Loop decide on Time and Location initialise booking to unsuccessful repeat get next Name in little black book AskOnDate(Name, Time, Location) DetermineBookingSuccess until ( successfully booked ) SighWithRelief 52
53 Repetition -- Variations decide on Time and Location initialise booking to unsuccessful loop get next Name in little black book AskOnDate(Name, Time, Location) DetermineBookingSuccess if ( successfully booked ) then break loop SighWithRelief 53
54 Components of an Algorithm Values and Variables Instruction (a.k.a. primitives) Sequence (of instructions) Procedure (involving instructions) Selection (between instructions) Repetition (of instructions) Documentation (beside instructions) 54
55 Documentation Records what the algorithm does Describes how it does it Explains the purpose of each component of the algorithm Notes restrictions or expectations Example: Getting a date (again) 55
56 Documentation -- Example Think of something romantic to do decide on time and location Work through address book to look for a person initialise booking to unsuccessful until (successfully booked) get next Name in little black book AskOnDate(Name, Time, Location) DetermineBookingSuccess Assumes that I will find someone in the book before it runs out SighWithRelief 56
ITC213: STRUCTURED PROGRAMMING. Bhaskar Shrestha National College of Computer Studies Tribhuvan University
ITC213: STRUCTURED PROGRAMMING Bhaskar Shrestha National College of Computer Studies Tribhuvan University Lecture 02: Algorithms Readings: Not Covered in Textbook Problem Solving Process System Design:
Fundamentals of Digital System Design ECE 3700, CPSC 3700
Fundamentals of Digital System Design ECE 3700, CPSC 3700 Instructor: Priyank Kalla (kalla@ece.utah.edu) 4 Credits Tue, Thu 1:25-1:45pm, WEB 1230 Office Hours: Tue, Thu: 2:30-4pm, or by appointment Office:
Introduction to Computing Lecture 07: Repetition and Loop Statements (Part II)
Introduction to Computing Lecture 07: Repetition and Loop Statements (Part II) Assist.Prof.Dr. Nükhet ÖZBEK Ege University Department of Electrical & Electronics Engineering nukhet.ozbek@ege.edu.tr Topics
Lecture Transcript While and Do While Statements in C++
Lecture Transcript While and Do While Statements in C++ Hello and welcome back. In this lecture we are going to look at the while and do...while iteration statements in C++. Here is a quick recap of some
ENGR 1181 MATLAB 09: For Loops 2
ENGR 1181 MATLAB 09: For Loops Learning Objectives 1. Use more complex ways of setting the loop index. Construct nested loops in the following situations: a. For use with two dimensional arrays b. For
Quiz 1: Functions and Procedures
Quiz 1: Functions and Procedures Outline Basics Control Flow While Loops Expressions and Statements Functions Primitive Data Types 3 simple data types: number, string, boolean Numbers store numerical data
Introduction to Computing Lecture 08: Functions (Part I)
Introduction to Computing Lecture 08: Functions (Part I) Assist.Prof.Dr. Nükhet ÖZBEK Ege University Department of Electrical & Electronics Engineering nukhet.ozbek@ege.edu.tr Topics Uses of functions
Control Structures. Code can be purely arithmetic assignments. At some point we will need some kind of control or decision making process to occur
Control Structures Code can be purely arithmetic assignments At some point we will need some kind of control or decision making process to occur C uses the if keyword as part of it s control structure
Lecture 7 Tao Wang 1
Lecture 7 Tao Wang 1 Objectives In this chapter, you will learn about: Interactive loop break and continue do-while for loop Common programming errors Scientists, Third Edition 2 while Loops while statement
Algorithmic Thinking: Loops and Conditionals
Algorithmic Thinking: Loops and Conditionals Last Time A control flow structure: for loop range(n) range(start, end) range(start, end, step) Assignments that modify variables: x = x + y Iteration with
COMSC-051 Java Programming Part 1. Part-Time Instructor: Joenil Mistal
COMSC-051 Java Programming Part 1 Part-Time Instructor: Joenil Mistal Chapter 5 5 Controlling the Flow of Your Program Control structures allow a programmer to define how and when certain statements will
While Loops A while loop executes a statement as long as a condition is true while condition: statement(s) Statement may be simple or compound Typical
Recommended Readings Chapter 5 Topic 5: Repetition Are you saying that I am redundant? That I repeat myself? That I say the same thing over and over again? 1 2 Repetition So far, we have learned How to
Asking for information (with three complex questions, so four main paragraphs)
Structures of different kinds of emails Write typical paragraph plans for the kinds of emails, describing the paragraphs in the body and what kinds of opening lines and closing lines you need. Asking for
High-level software (Ch.9) Algorithms and data structures. Low-level software. Components Circuits Gates Transistors
High-level software (Ch.9) Algorithms and data structures Low-level software Components Circuits Gates Transistors Remember: Decision-making instructions BR Set PC to operand unconditionally BRLT i Set
LECTURE 5 Control Structures Part 2
LECTURE 5 Control Structures Part 2 REPETITION STATEMENTS Repetition statements are called loops, and are used to repeat the same code multiple times in succession. The number of repetitions is based on
B.V. Patel Institute of Business Management, Computer & Information Technology, Uka Tarsadia University
Unit 1 Programming Language and Overview of C 1. State whether the following statements are true or false. a. Every line in a C program should end with a semicolon. b. In C language lowercase letters are
CONTENTS: What Is Programming? How a Computer Works Programming Languages Java Basics. COMP-202 Unit 1: Introduction
CONTENTS: What Is Programming? How a Computer Works Programming Languages Java Basics COMP-202 Unit 1: Introduction Assignment 1 Assignment 1 posted on WebCt and course website. It is due September 22nd
Introduction to Computing Lecture 01: Introduction to C
Introduction to Computing Lecture 01: Introduction to C Assist.Prof.Dr. Nükhet ÖZBEK Ege University Department of Electrical&Electronics Engineering ozbek.nukhet@gmail.com Topics Introduction to C language
Decision Making and Loops
Decision Making and Loops Goals of this section Continue looking at decision structures - switch control structures -if-else-if control structures Introduce looping -while loop -do-while loop -simple for
CS1004: Intro to CS in Java, Spring 2005
CS1004: Intro to CS in Java, Spring 2005 Lecture #16: Java conditionals/loops, cont d. Janak J Parekh janak@cs.columbia.edu Administrivia Midterms returned now Weird distribution Mean: 35.4 ± 8.4 What
General Simulation Principles
1 / 24 General Simulation Principles Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/16/17 2 / 24 Outline 1 Steps in a Simulation Study 2 Some Definitions 3
CMPT 125: Lecture 4 Conditionals and Loops
CMPT 125: Lecture 4 Conditionals and Loops Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 17, 2009 1 Flow of Control The order in which statements are executed
Repetition Structures
Repetition Structures Chapter 5 Fall 2016, CSUS Introduction to Repetition Structures Chapter 5.1 1 Introduction to Repetition Structures A repetition structure causes a statement or set of statements
Condition-Controlled Loop. Condition-Controlled Loop. If Statement. Various Forms. Conditional-Controlled Loop. Loop Caution.
Repetition Structures Introduction to Repetition Structures Chapter 5 Spring 2016, CSUS Chapter 5.1 Introduction to Repetition Structures The Problems with Duplicate Code A repetition structure causes
5.1. Chapter 5: The Increment and Decrement Operators. The Increment and Decrement Operators. Looping. ++ is the increment operator.
Chapter 5: Looping 5.1 The Increment and Decrement Operators Copyright 2009 Pearson Education, Inc. Copyright Publishing as Pearson 2009 Addison-Wesley Pearson Education, Inc. Publishing as Pearson Addison-Wesley
61A LECTURE 1 FUNCTIONS, VALUES. Steven Tang and Eric Tzeng June 24, 2013
61A LECTURE 1 FUNCTIONS, VALUES Steven Tang and Eric Tzeng June 24, 2013 Welcome to CS61A! The Course Staff - Lecturers Steven Tang Graduated L&S CS from Cal Back for a PhD in Education Eric Tzeng Graduated
Chapter 1: Problem Solving Skills Introduction to Programming GENG 200
Chapter 1: Problem Solving Skills Introduction to Programming GENG 200 Spring 2014, Prepared by Ali Abu Odeh 1 Table of Contents Fundamentals of Flowcharts 2 3 Flowchart with Conditions Flowchart with
Topics. Introduction to Repetition Structures Often have to write code that performs the same task multiple times. Controlled Loop
Topics C H A P T E R 4 Repetition Structures Introduction to Repetition Structures The for Loop: a Count- Sentinels Nested Loops Introduction to Repetition Structures Often have to write code that performs
Copyright 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 5-1
Copyright 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 5-1 Chapter 6 : (Control Structure- Repetition) Using Decrement or Increment While Loop Do-While Loop FOR Loop Nested Loop
Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur
Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture 18 Switch Statement (Contd.) And Introduction to
Programming Logic & Pseudocode. Python Bootcamp, Day 1 Anna Rosen
Programming Logic & Pseudocode Python Bootcamp, Day 1 Anna Rosen Programming 101 Computer programming involves having the user formulate commands that the computer can run for a specific purpose. The computer
Chapter 2: Functions and Control Structures
Chapter 2: Functions and Control Structures TRUE/FALSE 1. A function definition contains the lines of code that make up a function. T PTS: 1 REF: 75 2. Functions are placed within parentheses that follow
CS 177 Week 5 Recitation Slides. Loops
CS 177 Week 5 Recitation Slides Loops 1 Announcements Project 1 due tonight at 9PM because of evac. Project 2 is posted and is due on Oct. 8th 9pm Exam 1 Wednesday Sept 30 6:30 7:20 PM Please see class
Textbook. Topic 5: Repetition. Types of Loops. Repetition
Textbook Topic 5: Repetition Are you saying that I am redundant? That I repeat myself? That I say the same thing over and over again? Strongly Recommended Exercises The Python Workbook: 64, 69, 74, and
KAREL JR 3 STUDENT JOURNAL REVISED APRIL 19, 2017 NAME SCHOOL, CLASS, PERIOD
KAREL JR 3 STUDENT JOURNAL REVISED APRIL 19, 2017 NAME DATE STARTED DATE COMPLETED SCHOOL, CLASS, PERIOD Copyright 2016, 2017 NCLab Inc. 2 3 TABLE OF CONTENTS: WELCOME TO YOUR JOURNAL 4 SECTION 11: USING
Computers and FORTRAN Language Fortran 95/2003. Dr. Isaac Gang Tuesday March 1, 2011 Lecture 3 notes. Topics:
Computers and FORTRAN Language Fortran 95/2003 Dr. Isaac Gang Tuesday March 1, 2011 Lecture 3 notes Topics: - Program Design - Logical Operators - Logical Variables - Control Statements Any FORTRAN program
BLM1011 Bilgisayar Bilimlerine Giriş I
BLM1011 Bilgisayar Bilimlerine Giriş I by Z. Cihan TAYŞİ Outline Fundamental concepts A little history, definition, design & analyzing Complexity Flow charts Elements, connections Algorithms Variable concept,
M275 - Web Development using PHP and MySQL
Arab Open University Faculty of computer Studies M275 - Web Development using PHP and MySQL Chapter 6 Flow Control Functions in PHP Summary This is a supporting material to chapter 6. This summary will
Introduction to Computing Lecture 09: Functions (Part II)
Introduction to Computing Lecture 09: Functions (Part II) Assist.Prof.Dr. Nükhet ÖZBEK Ege University Department of Electrical & Electronics Engineering nukhet.ozbek@ege.edu.tr Topics Structured Programming
Computer Programming. Basic Control Flow - Loops. Adapted from C++ for Everyone and Big C++ by Cay Horstmann, John Wiley & Sons
Computer Programming Basic Control Flow - Loops Adapted from C++ for Everyone and Big C++ by Cay Horstmann, John Wiley & Sons Objectives To learn about the three types of loops: while for do To avoid infinite
Chapter 2 - Problem Solving
Chapter 2 - Problem Solving Program Development Cycle Programming Tools Chapter 2 - VB.NET by Schneider 1 Terminology tip A computer program may also be called: Project (Visual Studio 6 term) Application
Announcements. 1. Forms to return today after class:
Announcements Handouts (3) to pick up 1. Forms to return today after class: Pretest (take during class later) Laptop information form (fill out during class later) Academic honesty form (must sign) 2.
Loops! Loops! Loops! Lecture 5 COP 3014 Fall September 25, 2017
Loops! Loops! Loops! Lecture 5 COP 3014 Fall 2017 September 25, 2017 Repetition Statements Repetition statements are called loops, and are used to repeat the same code mulitple times in succession. The
Physics 2660: Fundamentals of Scientific Computing. Lecture 5 Instructor: Prof. Chris Neu
Physics 2660: Fundamentals of Scientific Computing Lecture 5 Instructor: Prof. Chris Neu (chris.neu@virginia.edu) Reminder I am back! HW04 due Thursday 22 Feb electronically by noon HW grades are coming.
SOEE1160: Computers and Programming in Geosciences Semester /08. Dr. Sebastian Rost
SOEE1160 L3-1 Structured Programming SOEE1160: Computers and Programming in Geosciences Semester 2 2007/08 Dr. Sebastian Rost In a sense one could see a computer program as a recipe (this is pretty much
Iteration -- Once Is Not Enough
Iteration -- Once Is Not Enough ),7 Congratulations! The Day Find project is done! -- Reflect This is a significant accomplishment Understand a fundamental algorithm -- binary search Know how to search
CS1 Lecture 9 Feb. 5, 2018
CS1 Lecture 9 Feb. 5, 2018 HW 3 available today 5pm, due 9am Monday. Discussion sections this week: loop and string practice HW1 grading done scores posted by noon toeay Common errors: 1) hotel nights,
Ryan Parsons Chad Price Jia Reese Alex Vassallo
Ryan Parsons - Paper Prototype, Writing Chad Price - Paper Prototype, Digital Mockup Jia Reese - Paper Prototype, Usability Testing Alex Vassallo - Usability Testing, Writing All we have to decide is what
*Starting Out with C++: From Control Structures through Objects, 7/E* by *Tony Gaddis* COMPUTER PROGRAMMING LECTURE 05 LOOPS IMRAN IHSAN
PowerPoint Slides adapted from *Starting Out with C++: From Control Structures through Objects, 7/E* by *Tony Gaddis* Copyright 2012 Pearson Education Inc. COMPUTER PROGRAMMING LECTURE 05 LOOPS IMRAN IHSAN
Computer Programming & Problem Solving ( CPPS )
Computer Programming & Problem Solving ( CPPS ) Chapter No 3 Sir Syed University of Engineering & Technology Computer Engineering Department University Road, Karachi-75300, PAKISTAN Muzammil Ahmad Khan
Computing and compilers
Computing and compilers Comp Sci 1570 to Outline 1 2 3 4 5 Evaluate the difference between hardware and software Find out about the various types of software Get a high level understanding of how program
COMP 110 Introduction to Programming. What did we discuss?
COMP 110 Introduction to Programming Fall 2015 Time: TR 9:30 10:45 Room: AR 121 (Hanes Art Center) Jay Aikat FB 314, aikat@cs.unc.edu Previous Class What did we discuss? COMP 110 Fall 2015 2 1 Today Announcements
Method & Tools for Program Analysis & Design
Method & Tools for Program Analysis & Design TMB208 Pemrograman Teknik Kredit: 3 (2-3) 1 Programming Logic and Design, Introductory, Fourth Edition 2 1 Programming Methods Based on structures of programming
Welcome to CSE 142! Whitaker Brand. University of Washington, Winter 2018
Welcome to CSE 142! Whitaker Brand University of Washington, Winter 2018 1 What is computer science? computers? science? programming? late lonely nights in front of the computer? ALGORITHMIC THINKING al
OBJECT ORIENTED SYSTEM DEVELOPMENT Software Development Dynamic System Development Information system solution Steps in System Development Analysis
UNIT I INTRODUCTION OBJECT ORIENTED SYSTEM DEVELOPMENT Software Development Dynamic System Development Information system solution Steps in System Development Analysis Design Implementation Testing Maintenance
Programming. Why is programming fun?
Why is programming fun? Programming First is the sheer joy of making things. As the child delights in his mud pie, so the adult enjoys building things, especially things of his own design. I think this
REPETITION CONTROL STRUCTURE LOGO
CSC 128: FUNDAMENTALS OF COMPUTER PROBLEM SOLVING REPETITION CONTROL STRUCTURE 1 Contents 1 Introduction 2 for loop 3 while loop 4 do while loop 2 Introduction It is used when a statement or a block of
From video conversation 2. This is a gap fill exercise and can be used as either a quiz/test of
Teacher s guide to the quizzes/tests available for Unit 4 Quiz 1 Quiz 2 Quiz 3 Quiz 4 From video conversation 1. This is a gap fill exercise and can be used as either a quiz/test of target language acquisition,
Chapter 4 Loops. Lecture notes for computer programming 1 Faculty of Engineering and Information Technology Prepared by: Iyad Albayouk
Chapter 4 Loops Lecture notes for computer programming 1 Faculty of Engineering and Information Technology Prepared by: Iyad Albayouk ١ while Loop Flow Chart while (loop-continuation-condition) { // loop-body;
Introduction to Computing Lecture 05: Selection (continued)
Introduction to Computing Lecture 05: Selection (continued) Assist.Prof.Dr. Nükhet ÖZBEK Ege University Department of Electrical & Electronics Engineering nukhet.ozbek@ege.edu.tr Topics Type int as Boolean
6.149 Checkoff 2. What to complete. Recall: Creating a file and running a program in IDLE.
6.149 Checkoff 2 http://web.mit.edu/6.149/www/materials.html What to complete Due: Wednesday, January 14, 2015 @ 5 p.m. 1. checkoff2 user input.py, which will contain your code for 2.1 - User input 2.
Definition: A data structure is a way of organizing data in a computer so that it can be used efficiently.
The Science of Computing I Lesson 4: Introduction to Data Structures Living with Cyber Pillar: Data Structures The need for data structures The algorithms we design to solve problems rarely do so without
1.1 Defining Functions
1.1 Defining Functions Functions govern many interactions in our society today. Whether buying a cup of coffee at the local coffee shop or playing a video game, we are using a function in some fashion.
Low-level software. Components Circuits Gates Transistors
QUIZ Pipelining A computer pipeline has 4 processors, as shown above. Each processor takes 15 ms to execute, and each instruction must go sequentially through all 4 processors. A program has 10 instructions.
STUDENT LESSON A12 Iterations
STUDENT LESSON A12 Iterations Java Curriculum for AP Computer Science, Student Lesson A12 1 STUDENT LESSON A12 Iterations INTRODUCTION: Solving problems on a computer very often requires a repetition of
CpSc 1111 Lab 4 Part a Flow Control, Branching, and Formatting
CpSc 1111 Lab 4 Part a Flow Control, Branching, and Formatting Your factors.c and multtable.c files are due by Wednesday, 11:59 pm, to be submitted on the SoC handin page at http://handin.cs.clemson.edu.
Michele Van Dyne Museum 204B CSCI 136: Fundamentals of Computer Science II, Spring
Michele Van Dyne Museum 204B mvandyne@mtech.edu http://katie.mtech.edu/classes/csci136 CSCI 136: Fundamentals of Computer Science II, Spring 2016 1 Review of Java Basics Data Types Arrays NEW: multidimensional
Loops and Files. Chapter 04 MIT 12043, Fundamentals of Programming By: S. Sabraz Nawaz
Loops and Files Chapter 04 MIT 12043, Fundamentals of Programming By: S. Sabraz Nawaz Chapter Topics o The Increment and Decrement Operators o The while Loop o Shorthand Assignment Operators o The do-while
Working with Health IT Systems is available under a Creative Commons Attribution-NonCommercial- ShareAlike 3.0 Unported license.
Working with Health IT Systems is available under a Creative Commons Attribution-NonCommercial- ShareAlike 3.0 Unported license. Johns Hopkins University. Welcome to the Fundamentals of Health Workflow
TABLE OF CONTENTS 2 CHAPTER 1 3 CHAPTER 2 4 CHAPTER 3. Algorithm Design & Problem Solving. Programming. Databases
2 CHAPTER 1 Algorithm Design & Problem Solving 3 CHAPTER 2 Programming 4 CHAPTER 3 Databases TABLE OF CONTENTS 1. ALGORITHM DESIGN & PROBLEM-SOLVING 1.1 Problem-solving & Design Every computer system is
Everyday Algorithms. Algorithms and Introduction to Programming. bake a cake. start. mix sugar and butter. stir in 2 eggs. stir in flour.
Everyday Algorithms start bake a cake mix sugar and butter stir in 2 eggs stir in flour put in pans bake for 10 mins fork test clear? no yes end Adapted from Fluency with Information Technology, Lawrence
Overview. Lab 5 Methods and Parameters
Lab 5 Methods and Parameters Overview At this point in the course, you should have a set of skills which allow you to create functionality at the level of using control structures like if statements and
Instance generation from meta-models (for model transformation testing)
Instance generation from meta-models (for model transformation testing) Robbe De Jongh University of Antwerp Abstract Testing model transformations is a tedious job. One needs to make a representative
Chapter 1 Introduction
Chapter 1 Introduction Why I Am Writing This: Why I am I writing a set of tutorials on compilers and how to build them? Well, the idea goes back several years ago when Rapid-Q, one of the best free BASIC
Chapter 1 - An Introduction to Computers and Problem Solving
Chapter 1 - An Introduction to Computers and Problem Solving 1.1 An Introduction to Computers 1.2 Windows, Folders, and Files 1.3 Program Development Cycle 1.4 Programming Tools 1 1.1 An Introduction to
Chapter 3. Iteration
Chapter 3 Iteration Iteration Iteration is the form of program control that allows us to repeat a section of code. For this reason this form of control is often also referred to as repetition. The programming
Chapter 5: Loops and Files
Chapter 5: Loops and Files 5.1 The Increment and Decrement Operators The Increment and Decrement Operators ++ is the increment operator. It adds one to a variable. val++; is the same as val = val + 1;
An introduction to R: Organisation and Basics of Algorithmics
An introduction to R: Organisation and Basics of Algorithmics Noémie Becker, Benedikt Holtmann & Dirk Metzler 1 nbecker@bio.lmu.de - holtmann@bio.lmu.de Winter semester 2016-17 1 Special thanks to: Prof.
Another Example. Other Constructs
Another Example Re-do DemoSentinel02 using a sentinel of 'q' or 'Q' (for quit). Use a do-statement to setup the loop. DemoSentinel03.java Instructor Note: Demo from Eclipse 36 Other Constructs switch break
LN #3 (3 Hrs) Repetition, Computational state CTPS Department of CSE,Coimbatore
LN #3 (3 Hrs) Repetition, Computational state CTPS 2018 Objectives To understand repetition of statements. To comprehend the form of test and termination in looping. To study the form and function of elements
The diagram below is only partially complete. Use the terms in the word list to complete the empty boxes. Make dinner
Decomposing Problems As we have seen, decomposition means breaking down a difficult problem into more manageable pieces. A common way to tackle this process is to use a tree diagram showing increasing
ECE2049 E17 Lecture 2: Data Representations & C Programming Basics
ECE2049 E17 Lecture 2: Data Representations & C Programming Basics Administrivia Lab 0 after class today! o Get your MSP430 board! Install instructions for CCS are on course website under Resources o You
Programming and Data Structure
Programming and Data Structure Dr. P.P.Chakraborty Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture # 09 Problem Decomposition by Recursion - II We will
(Python) Chapter 3: Repetition
(Python) Chapter 3: Repetition 3.1 while loop Motivation Using our current set of tools, repeating a simple statement many times is tedious. The only item we can currently repeat easily is printing the
Announcements. The current topic: Scheme. Review: BST functions. Review: Representing trees in Scheme. Reminder: Lab 2 is due on Monday at 10:30 am.
The current topic: Scheme! Introduction! Object-oriented programming: Python Functional programming: Scheme! Introduction! Numeric operators, REPL, quotes, functions, conditionals! Function examples, helper
CITS1001 week 4 Grouping objects lecture 2
CITS1001 week 4 Grouping objects lecture 2 Arran Stewart March 29, 2018 1 / 37 Overview Last lecture, we looked at how we can group objects together into collections We looked at the ArrayList class. This
Introduction to Computer Science
Introduction to Computer Science CSCI 09 Readings St. Amant, Ch. China nhe- Andrew Goodney Fall 08 An algorithm (pronounced AL-go-rithum) is a procedure or formula for solving a problem. The word derives
Algorithms, Part 2 of 3. Topics Problem Solving Examples Pseudocode Control Structures
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode Control Structures 1 Problem Solving Decode this sentence: Pdeo eo pda yknnayp wjosan. We have just come up with a specific solution to
CS 370 The Pseudocode Programming Process D R. M I C H A E L J. R E A L E F A L L
CS 370 The Pseudocode Programming Process D R. M I C H A E L J. R E A L E F A L L 2 0 1 5 Introduction At this point, you are ready to beginning programming at a lower level How do you actually write your
COMP 110 Introduction to Programming. What did we discuss?
COMP 110 Introduction to Programming Fall 2015 Time: TR 9:30 10:45 Room: AR 121 (Hanes Art Center) Jay Aikat FB 314, aikat@cs.unc.edu Previous Class What did we discuss? COMP 110 Spring 2015 2 1 Today
COMP 111. Introduction to Computer Science and Object-Oriented Programming
COMP 111 Introduction to Computer Science and Object-Oriented Programming 5 Feeling Out of the Loop? Methods - So Far Execute a sequence of statements Declarations Assignment statements Return Maybe an
CSE115 / CSE503 Introduction to Computer Science I. Dr. Carl Alphonce 343 Davis Hall Office hours:
CSE115 / CSE503 Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall alphonce@buffalo.edu Office hours: Thursday 12:00 PM 2:00 PM Friday 8:30 AM 10:30 AM OR request appointment via e-mail
Developing Algorithms
This scheme gives pupils a practical looking at developing algorithms firstly by looking at abstraction, decomposition and algorithmic thinking. Students then learn about the different techniques used
Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur
Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture 15 Branching : IF ELSE Statement We are looking
Lists, loops and decisions
Caltech/LEAD Summer 2012 Computer Science Lecture 4: July 11, 2012 Lists, loops and decisions Lists Today Looping with the for statement Making decisions with the if statement Lists A list is a sequence
Cpt S 122 Data Structures. Course Review Midterm Exam # 2
Cpt S 122 Data Structures Course Review Midterm Exam # 2 Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Midterm Exam 2 When: Monday (11/05) 12:10 pm -1pm
Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #01 Introduction: The Process of Programming
Introduction to Programming in C Department of Computer Science and Engineering Lecture No. #01 Introduction: The Process of Programming Welcome to the introductory programming course on NPTEL MOOCs. The
DINO. Language Reference Manual. Author: Manu Jain
DINO Language Reference Manual Author: Manu Jain Table of Contents TABLE OF CONTENTS...2 1. INTRODUCTION...3 2. LEXICAL CONVENTIONS...3 2.1. TOKENS...3 2.2. COMMENTS...3 2.3. IDENTIFIERS...3 2.4. KEYWORDS...3
Programming for Engineers in Python
Programming for Engineers in Python Lecture 5: Object Oriented Programming Autumn 2011-12 1 Lecture 4 Highlights Tuples, Dictionaries Sorting Lists Modular programming Data analysis: text categorization
Procedures: Algorithms and Abstraction
Procedures: Algorithms and Abstraction 5 5.1 Objectives After completing this module, a student should be able to: Read and understand simple NetLogo models. Make changes to NetLogo procedures and predict