Educational software development ideas "It is the supreme art of the teacher to awaken joy in creative expression and knowledge.“ Albert Einstein.

Slides:



Advertisements
Similar presentations
What are the S, T, and E in STEM? How are they related?
Advertisements

CHAPTER 2 GC101 Program’s algorithm 1. COMMUNICATING WITH A COMPUTER  Programming languages bridge the gap between human thought processes and computer.
Static Single Assignment CS 540. Spring Efficient Representations for Reachability Efficiency is measured in terms of the size of the representation.
Personalized Purple Circles Self-sufficient Workstations for Developing Competencies Wynanne Watts, CS Des Samarres Frédéric Bédard, Collège Saint-Bernard.
Fundamentals of Algorithms MCS - 2 Lecture # 4
 Control structures  Algorithm & flowchart  If statements  While statements.
Computer Science: A Structured Programming Approach Using C1 8-4 Array Applications In this section we study two array applications: frequency arrays with.
PUN Sai Wing 5/1/2004 My own observations from your teaching practice Share your ideas, please.
Literacy Through Dance By: Janelle Dickerson. What is Dance Literacy? Developing and enhancing literacy through performing arts Developing and enhancing.
Outline IS400: Development of Business Applications on the Internet Fall 2004 Instructor: Dr. Boris Jukic JavaScript: Control Structure.
Chapter 4: Control Structures: Selection
Copyright © 2012 Pearson Education, Inc. Chapter 3 Control Structures: Selection.
 2003 Prentice Hall, Inc. All rights reserved.  2004 Prentice Hall, Inc. All rights reserved. Chapter 8 - JavaScript: Control Statements I Outline 8.1.
Algorithms In general algorithms is a name given to a defined set of steps used to complete a task. For example to make a cup of tea you would fill the.
© Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 1 Structural Program Development: If, If-Else Outline.
1 Conditional statements Dept. of Computer Engineering Faculty of Engineering, Kasetsart University Bangkok, Thailand.
C++ Programming: From Problem Analysis to Program Design, Second Edition Chapter 19: Searching and Sorting.
“The study of algorithms is the cornerstone of computer science.” Algorithms Fall 2011.
Programming in Java Unit 4. Learning outcome:  LO2: Be able to design Java solutions  LO3: Be able to implement Java solutions Assessment criteria:
Software Life Cycle What Requirements Gathering, Problem definition
Chapter 5 Algorithms Introduction to computer, 2nd semester, 2010/2011 Mr.Nael Aburas Faculty of Information Technology.
Lecture 2: Logical Problems with Choices. Problem Solving Before writing a program Have a thorough understanding of the problem Carefully plan an approach.
Pseudocode When designing an ALGORITHM to solve a problem, Pseudocode, can be used. –Artificial, informal language used to develop algorithms –Similar.
Definition of Terms Software/Programs Programs that directs the operation of a computer system Set of instructions Codes Programming Process of planning,
Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
Dale Roberts 1 Program Control - Algorithms Department of Computer and Information Science, School of Science, IUPUI CSCI N305.
 2003 Prentice Hall, Inc. All rights reserved. Chapter 8 - JavaScript: Control Statements I Outline 8.1 Introduction 8.2 Algorithms 8.3 Pseudocode 8.4.
Lecture 2 Control Structure. Relational Operators -- From the previous lecture Relational Operator Meaning == is equal to < is less than > is greater.
Algorithm Design.
Structured Program Development Angela Chih-Wei Tang ( 唐 之 瑋 ) Department of Communication Engineering National Central University JhongLi, Taiwan 2010.
CMP 131 Introduction to Computer Programming Violetta Cavalli-Sforza Week 3, Lecture 1.
Algorithms & FlowchartsLecture 10. Algorithm’s CONCEPT.
Advanced Program Design. Review  Step 1: Problem analysis and specification –Specification description of the problem’s inputs and output –Analysis generalize.
IB Computer Science – Logic
Fundamentals of Algorithms MCS - 2 Lecture # 5. Representation of Algorithms (continued) Flowcharts.
Elementary Teacher By Ms. Ross
1 Conditional Statements + Loops ผศ. ดร. อนันต์ ผลเพิ่ม Anan Phonphoem
General Computer Science for Engineers CISC 106 Lecture 06 James Atlas Computer and Information Sciences 06/24/2009.
Langston Hughes: “Theme for English B” Due: _______________.
Algorithms JPC and JWD © 2002 McGraw-Hill, Inc. 2 Algorithms 2 An Algorithm is a finite set of precise instructions for performing a computation or for.
Notes are in RED. Which came first: the question or the idea ? Where does a ‘QUESTION’ come from?
IT Job Roles. ICT Technician An ICT technician is a person who works in an IT based environment and their job is to fix any computer that is not functioning.
Welcome to Our Class. It is the supreme art of the teacher to awaken joy in creative expression and knowledge. -Albert Einstein The Language Arts classroom.
Objective: Students will be able to analyze characterization in order to write a thesis statement about heroism. Journal: Free Write Lesson 5.
PHP-language, conditional statements
A Preview of Coming Attractions….
Revision Units Exam date 16th May 2017 Summer 1.
Logic Gates.
Computer Programming Flowchart.
Chapter 8 - JavaScript: Control Statements I
Big O: Make it Simple Determine how complex the algorithm is, in relative to the size of the problem (e.g: List to be sorted) 'O' Stands for 'Order' -
Lecture 2: Introduction to Algorithms
Quantum One.
Lecture 2: Logical Problems with Choices
Program Control using Java - Theory
Relational and Logical Operators
Topics discussed in this section:
Computers & Programming Languages
Logic Gates.
Observations = Evidence
3 Control Statements:.
Quantum One.
Relational and Logical Operators
Click to add Text Computers & Instructions. Computers are given instructions in the form of computer programs that are created through the development.
Jeannette Smith Personal Statement
2-2 Logic Part 2 Truth Tables.
My Cooperating Teacher Profile
Control Structures.
Presentation transcript:

Educational software development ideas "It is the supreme art of the teacher to awaken joy in creative expression and knowledge.“ Albert Einstein

Presenting a theoretical notion Animations Films Feedback

Control structures By control structure we understand a form of jointing the operations the algorithm works with. These are: -linear structure -alternative structure -repetitive structure

Alternative structure Example: In our daily lives we hear statements such as: IF I pass all classes, THEN I go to the summer camp, ELSE I stay to study. Three words with an important role can be observed: IF, THEN, ELSE.

A statement is formed out of 3 components: a condition, in this case “I pass all classes”, condition which we will name C; the action, in this case “I go to the summer camp ”, named S1, action associated with THEN, namely it will be executed only if “I pass all classes”; the action “stay to study”, named S2, action associated with ELSE, namely it will be executed only if not “I pass all classes”; To be very clear, the statement can be written as: if C then S1 else S2 Definition The alternative structure is defined through the selection between two or more actions depending on the condition’s (logical expression) truth value.

Graphical representation I pass all classes TrueFalse I go to the summer camp Stay to study Previous problem The representation of the alternative structure as a logical scheme. According to the notations C TrueFalse S2S1

C TrueFalse

C TrueFalse S1

C TrueFalse S2

List all the cases in which you can’t use the computer. IF I pass all classes AND all grades are over 7, THEN I can replace my computer with a better one, ELSE I remain with the old one.

Exemplu Car placing in a car park m columns I variesI varies n lines J varies

Bubble sort

Merge sort

Good luck in projecting and using the educational software!