Logical statements and. Lecture 1 ICOM 4075
|
|
- Clifford Crawford
- 6 years ago
- Views:
Transcription
1 Logical statements and operations Lecture 1 ICOM 4075
2 What is a statement? By a statementwe understand a sentence that affirms or denies the validity of a property or concept Examples: The color white Earth is a planet NOT A STATEMENT Barcelona is more enjoyable than Madrid
3 What is a statement? By a statementwe understand a sentence that affirms or denies the validity of a property or concept Examples: The color white Earth is a planet STATEMENT Barcelona is more enjoyable than Madrid
4 What is a statement? By a statementwe understand a sentence that affirms or denies the validity of a property or concept Examples: The color white Earth is a planet STATEMENT Barcelona is more enjoyable than Madrid
5 What is a logical statement? By a logical statement we understand a statement that can be unambiguously declared to be either true or false In the statements of the previous examples Earth is a planet LOGICAL STATEMENT Barcelona is more enjoyable than Madrid
6 What is a logical statement? By a logical statement we understand a statement that can be unambiguously declared to be either true or false In the statements of the previous examples Earth is a planet NOT A LOGICAL STATEMENT Barcelona is more enjoyable than Madrid
7 Variables Several concepts such as: Real number (a mathematical concept) Time(a physical concept) Distance( a geometrical concept) may assume (several different) values Variables are symbols (usually letters) used to represent these concepts. Consequently, variables: Have a meaning, and Assume values
8 Examples of variables Variables representing the concepts of real number, timeand distanceare illustrated below Variable Meaning Example of a value x Real number x = 5.67 t Time t= 3 hrs. 23 minutes d Distance d= 105 meters
9 What are variables good for? Variables are crucial for expressing scientific laws as mathematical relations or formulas Examples: Law Speed as a function of distance and time Exponential decay of an element Area of a circle Mathematical formula s = = d t e. 23t 2 a = xπ Variables involved d, t t x
10 Variables representing logical statements Logic studies the laws of reasoning. And as in other scientific disciplines, variablesare used in logic, to express the laws of reasoning in mathematical terms In logic, a variable represents a logical statement The logical statement that the variable represents is the meaningof the variable The value of the variableis the truth value of the statement, this is True or False Logic variables are also called Boolean variables
11 Examples Consider the following logical statements: Pluto is a planet All objects fall with the same speed -3 is greater than Below are representations with variables: Variable Meaning Value P Pluto is a planet False O All objects fall with the same speed True S -3 is greater than True
12 Basic logical operations The most basic operations of reasoning are: Negation, Conjunction, and Disjunction
13 Negation If S is a variable representing a logical statement, then the negationof S is the statement not S Examples: Statement Variable Negation Not Variable Pluto isa planet P Pluto is not a planet Not P All objects fall with the same speed -3 is greater than O Not all objects fall with the same speed Not O S -3 is not greater than Not S
14 Rules for operating with negation The next table states the changes in the values of a Boolean variable under negation S True False Not S False True
15 Example By applying these rules we get: Statement Value Negation Value P : Pluto isa planet False Not P : Pluto is not a planet True O: All objects fall with the same speed True Not O : Not all objects fall with the same speed False S: -3 is greater than True Not S : -3 is not greater than False
16 Conjunction The conjunction of two statements A and B is the statement A and B Examples: Statement A Statement B Conjunction P : Pluto isa planet O: All objects fall with the same speed O : All objects fall with the same speed S: -3 is greater than P and O : Pluto is a planet andall objects fall with the same speed O and S : All objects fall with the same speed and -3 is greater than -3.01
17 Rules for operating with conjunction The next table establishes the values of two Boolean variables after conjunction A B Aand B True True True False False True False False True False False False
18 Examples By applying these rules we get: Statement Statement Conjunction P: Pluto isa planet O: All objects fall with the same speed P and O : Pluto is a planet andall objects fall with the same speed False True False O: All objects fall with the same speed S: -3 is greater than O and S : All objects fall with the same speed and -3 is greater than True True True
19 Disjunction The disjunction of two statements A and B is the statement A or B Examples: Statement Statement Conjunction P : Pluto isa planet O : All objects fall with the same speed O: All objects fall with the same speed S: -3 is greater than P or O : Pluto is a planet orall objects fall with the same speed O or S : All objects fall with the same speed or-3 is greater than -3.01
20 Rules for operating with disjunction The next table establishes the values of two Boolean variables under disjunction A B Aor B True True True False False True False False True True True False
21 Examples By applying these rules we get: Statement Statement Conjunction P: Pluto isa planet O: All objects fall with the same speed P or O : Pluto is a planet orall objects fall with the same speed False True True O: All objects fall with the same speed S: -3 is greater than O and S : All objects fall with the same speed or -3 is greater than True True True
22 Compounded statements A compounded logical statement is one that contains at least one of the logical operations (or connectives) negation, disjunction or conjunction A basic(also called atomic) logical statement is one that has no logical operation in it Examples: A and B, A or B and Not A are all compounded statements
23 Analyzing compounded statements Consider the logical sentence: Earth is a planet or Earth is a star and there are planets that are also stars Is this statement true or false? Let s analyze (parse) the statement. This is, Identify the basic statements that compose it Identify the logical operation that link these basic statements
24 Parsing By basic statement we understand a statement that does not contains and or or s The actual parsing of the sentence is depicted below: Earth is a planet orearth is a star andthere are planets that are also stars Basic Statement 1: A : Earth is a planet Basic Statement 2: B: Earth is a star Basic Statement 3: C: there are planets that are also stars Logical operation 1: Disjunction Logical operation 2: Conjunction
25 In summary: parsing gives A table of Boolean variables Variables A B C Meaning Earth is a planet Earth is a star There are planets that are also stars and an expression of the sentence in terms of these variables: A or B and C
26 Order of precedence The order in which logic operations must be executedismade explicit by imposing parenthesis. Just as in elementary algebra, any operation within parenthesis precedes over the others A convention establishes that andhas precedence over or, unless otherwise indicated. This is an implicitprecedence, in the sense that it is assumed only if no parenthesis are imposed
27 Implicit and explicit precedence So,without parenthesis (implicit precedence), we have to EVALUATE FIRST! S = A or B and C This is the same as the parenthesized expression (explicit precedence) S= A or (B and C) Remark: (A or B) and C is not the same as S
28 So, is the sentence true? Well, if we assume the natural truth values of the basic variables A, B and C, Variable Meaning Natural value A Earth is a planet TRUE B Earth is a star FALSE C There are planets that are also stars FALSE S = A or B and C is: REMEMBER TO: Do this first! A B C B and C A or B and C True False False False True
29 Generalization But let s go beyond the particular meanings and their corresponding natural values for the variables A, B and C in the previous example Let s look at A or B and C as a general pattern of reasoningwith three Boolean variables which may occur in many other logical sentences Example: x > 1 or x < 0 and x > -.35 As a general pattern, we have to take all possible truth values for the Boolean variables in A or B and C
30 Truth values of A or B and C as a general pattern of reasoning A B C B and C A or B and C True True True True True True True False False True True False True False True True False False False True False True True True True False True False False False False False True False False False False False False False
31 Truth values of A or B and C as a general pattern of reasoning The previous example fits in this general pattern A B C B and C A or B and C True True True True True True True False False True True False True False True True False False False True False True True True True False True False False False False False True False False False False False False False
32 The notion of equivalence Two statements are said to be equivalentif they have the same truth values in all the possible choices of values for their variables Example: Not (Not A) is equivalent to A A Not A Not (Not A) True False True False True False All possible choices for one variable Same Columns = Equivalent Statement
33 Other equivalences Not (A and B) is equivalent to Not A or Not B All possible values for two variables A B A and B Not (A and B) True True True False True False False True False True False True False False False True Same Columns = Equivalent Statements A B Not A Not B Not A or Not B True True False False False True False False True True False True True False True False False True True True
34 Other equivalences (2) Not (A or B) is equivalent to Not A and Not B All possible values for two variables A B A or B Not (A or B) True True True False True False True False False True True False False False False True Same Columns = Equivalent Statement A B Not A Not B Not A and Not B True True False False False True False False True False False True True False False False False True True True
35 Summary In this lecture we have studied: The concepts of statement and logical statement The representation of statements with variables The basic operations of logic and their tables The analysis of a compounded statement (parsing) The idea of hypothesis (assumption) The evaluation of compounded statements respecting precedence The equivalence of logical sentences
36 Exercises (1) 1. Write in terms of variables and logical operations a) Real numbers are always less than or equal to the square of its value and even numbers are all divisible by 2 b) The square root of a negative number is undefined as a real number but is defined as a complex number or as an ordered pair of real numbers c) It is not the case that a planet is a star and a comet or there are planets that are stars or comets 2. Evaluate the truth tables of the previous statements
37 Exercises (2) 3. Determine whether the following pairs of statements are equivalent a) Not (A and B), Not A and Not B b) Not (A and B), Not A or Not B c) Not (A or B), Not A or Not B d) Not (A or B), Not A and Not B e) A and Not B and C, Not( Not A or B or Not C)
[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics
400 lecture note #4 [Ch 6] Set Theory 1. Basic Concepts and Definitions 1) Basics Element: ; A is a set consisting of elements x which is in a/another set S such that P(x) is true. Empty set: notated {
More informationBoolean Algebra A B A AND B = A*B A B A OR B = A+B
Boolean Algebra Algebra is the branch of mathematics that deals with variables. Variables represent unknown values and usually can stand for any real number. Because computers use only 2 numbers as we
More informationLECTURE 2 An Introduction to Boolean Algebra
IST 210: Boot Camp Ritendra Datta LECTURE 2 An Introduction to Boolean Algebra 2.1. Outline of Lecture Fundamentals Negation, Conjunction, and Disjunction Laws of Boolean Algebra Constructing Truth Tables
More information9. Elementary Algebraic and Transcendental Scalar Functions
Scalar Functions Summary. Introduction 2. Constants 2a. Numeric Constants 2b. Character Constants 2c. Symbol Constants 2d. Nested Constants 3. Scalar Functions 4. Arithmetic Scalar Functions 5. Operators
More informationCSCE 120: Learning To Code
CSCE 120: Learning To Code Manipulating Data I Introduction This module is designed to get you started working with data by understanding and using variables and data types in JavaScript. It will also
More informationAn algorithm may be expressed in a number of ways:
Expressing Algorithms pseudo-language 1 An algorithm may be expressed in a number of ways: natural language: flow charts: pseudo-code: programming language: usually verbose and ambiguous avoid most (if
More informationSection 1.1 Logic LOGIC
Section 1.1 Logic 1.1.1 1.1 LOGIC Mathematics is used to predict empirical reality, and is therefore the foundation of engineering. Logic gives precise meaning to mathematical statements. PROPOSITIONS
More information2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2
2.2 Set Operations 127 2.2 Set Operations Introduction Two, or more, sets can be combined in many different ways. For instance, starting with the set of mathematics majors at your school and the set of
More informationInformation Science 1
Information Science Boolean Expressions Week College of Information Science and Engineering Ritsumeikan University Topics covered l Terms and concepts from Week 9 l Binary (Boolean) logic History Boolean
More informationLecture (04) Boolean Algebra and Logic Gates
Lecture (4) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 26, Logic Design Boolean algebra properties basic assumptions and properties: Closure law A set S is
More informationLecture (04) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee
Lecture (4) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee Boolean algebra properties basic assumptions and properties: Closure law A set S is closed with respect to a binary operator, for every
More informationPRG PROGRAMMING ESSENTIALS. Lecture 2 Program flow, Conditionals, Loops
PRG PROGRAMMING ESSENTIALS 1 Lecture 2 Program flow, Conditionals, Loops https://cw.fel.cvut.cz/wiki/courses/be5b33prg/start Michal Reinštein Czech Technical University in Prague, Faculty of Electrical
More informationOur Strategy for Learning Fortran 90
Our Strategy for Learning Fortran 90 We want to consider some computational problems which build in complexity. evaluating an integral solving nonlinear equations vector/matrix operations fitting data
More informationSummary of Course Coverage
CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities
More informationCOMP Intro to Logic for Computer Scientists. Lecture 2
COMP 1002 Intro to Logic for Computer Scientists Lecture 2 B 5 2 J Language of logic: building blocks Proposition: A sentence that can be true or false. A: It is raining in St. John s right now. B: 2+2=7
More informationWarmup Problem. Translate the following sentence from English into Propositional Logic. I want to eat ice cream even though I am on a diet.
Warmup Problem Translate the following sentence from English into Propositional Logic I want to eat ice cream even though I am on a diet 1/25 CS 245: Logic and Computation Carmen Bruni Lecture 2 Based
More informationAQA Computer Science A-Level Boolean algebra Advanced Notes
Q Computer Science -Level 465 Boolean algebra dvanced Notes Specification: 4651 Using Boolean algebra: Be familiar with the use of Boolean identities and De Morgan s laws to manipulate and simplify Boolean
More informationLesson 10: Representing, Naming, and Evaluating Functions
: Representing, Naming, and Evaluation Functions Classwork Opening Exercise Study the 4 representations of a function below. How are these representations alike? How are they different? TABLE: Input 0
More informationMixed Integer Linear Programming
Mixed Integer Linear Programming Part I Prof. Davide M. Raimondo A linear program.. A linear program.. A linear program.. Does not take into account possible fixed costs related to the acquisition of new
More informationChapter 4: Basic C Operators
Chapter 4: Basic C Operators In this chapter, you will learn about: Arithmetic operators Unary operators Binary operators Assignment operators Equalities and relational operators Logical operators Conditional
More informationPseudocode is an abbreviated version of the actual statement t t (or code ) in the program.
Pseudocode Pseudocode is an abbreviated version of the actual statement t t (or code ) in the program. It is a type of algorithm in that all steps needed to solve the problem must be listed. 1 While algorithms
More informationControl Structures. Lecture 4 COP 3014 Fall September 18, 2017
Control Structures Lecture 4 COP 3014 Fall 2017 September 18, 2017 Control Flow Control flow refers to the specification of the order in which the individual statements, instructions or function calls
More informationDiscrete Mathematics Lecture 4. Harper Langston New York University
Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a
More informationPropositional Logic. Part I
Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.
More informationCCBC Math 081 Order of Operations Section 1.7. Step 2: Exponents and Roots Simplify any numbers being raised to a power and any numbers under the
CCBC Math 081 Order of Operations 1.7 1.7 Order of Operations Now you know how to perform all the operations addition, subtraction, multiplication, division, exponents, and roots. But what if we have a
More informationTo prove something about all Boolean expressions, we will need the following induction principle: Axiom 7.1 (Induction over Boolean expressions):
CS 70 Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 7 This lecture returns to the topic of propositional logic. Whereas in Lecture Notes 1 we studied this topic as a way of understanding
More informationegrapher Language Reference Manual
egrapher Language Reference Manual Long Long: ll3078@columbia.edu Xinli Jia: xj2191@columbia.edu Jiefu Ying: jy2799@columbia.edu Linnan Wang: lw2645@columbia.edu Darren Chen: dsc2155@columbia.edu 1. Introduction
More informationTo prove something about all Boolean expressions, we will need the following induction principle: Axiom 7.1 (Induction over Boolean expressions):
CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 7 This lecture returns to the topic of propositional logic. Whereas in Lecture 1 we studied this topic as a way of understanding proper reasoning
More informationResearch Group. 2: More types, Methods, Conditionals
Research Group 2: More types, Methods, Conditionals Outline Lecture 1 Review More types Methods Conditionals 2 Types Kinds of values that can be stored and manipulated. boolean: Truth value (true or false).
More informationMore Formulas: circles Elementary Education 12
More Formulas: circles Elementary Education 12 As the title indicates, this week we are interested in circles. Before we begin, please take some time to define a circle: Due to the geometric shape of circles,
More informationMathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 9 Normal Forms
Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 9 Normal Forms In the last class we have seen some consequences and some equivalences,
More informationProgramming Lecture 3
Programming Lecture 3 Expressions (Chapter 3) Primitive types Aside: Context Free Grammars Constants, variables Identifiers Variable declarations Arithmetic expressions Operator precedence Assignment statements
More informationLecture 5. Logic I. Statement Logic
Ling 726: Mathematical Linguistics, Logic. Statement Logic V. Borschev and B. Partee, September 27, 2 p. Lecture 5. Logic I. Statement Logic. Statement Logic...... Goals..... Syntax of Statement Logic....2.
More informationOperators. Java operators are classified into three categories:
Operators Operators are symbols that perform arithmetic and logical operations on operands and provide a meaningful result. Operands are data values (variables or constants) which are involved in operations.
More informationPropositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Propositional Calculus: Boolean Algebra and Simplification CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Topics Motivation: Simplifying Conditional Expressions
More informationInformatics 1 - Computation & Logic: Tutorial 3
Informatics - Computation & Logic: Tutorial Counting Week 5: 6- October 7 Please attempt the entire worksheet in advance of the tutorial, and bring all work with you. Tutorials cannot function properly
More informationChapter 6 Primitive types
Chapter 6 Primitive types Lesson page 6-1. Primitive types Question 1. There are an infinite number of integers, so it would be too ineffient to have a type integer that would contain all of them. Question
More informationCSC 501 Semantics of Programming Languages
CSC 501 Semantics of Programming Languages Subtitle: An Introduction to Formal Methods. Instructor: Dr. Lutz Hamel Email: hamel@cs.uri.edu Office: Tyler, Rm 251 Books There are no required books in this
More informationCOMP1730/COMP6730 Programming for Scientists. Data: Values, types and expressions.
COMP1730/COMP6730 Programming for Scientists Data: Values, types and expressions. Lecture outline * Data and data types. * Expressions: computing values. * Variables: remembering values. What is data?
More informationHandout 9: Imperative Programs and State
06-02552 Princ. of Progr. Languages (and Extended ) The University of Birmingham Spring Semester 2016-17 School of Computer Science c Uday Reddy2016-17 Handout 9: Imperative Programs and State Imperative
More informationChapter 2 Working with Data Types and Operators
JavaScript, Fourth Edition 2-1 Chapter 2 Working with Data Types and Operators At a Glance Instructor s Manual Table of Contents Overview Objectives Teaching Tips Quick Quizzes Class Discussion Topics
More informationContents. Jairo Pava COMS W4115 June 28, 2013 LEARN: Language Reference Manual
Jairo Pava COMS W4115 June 28, 2013 LEARN: Language Reference Manual Contents 1 Introduction...2 2 Lexical Conventions...2 3 Types...3 4 Syntax...3 5 Expressions...4 6 Declarations...8 7 Statements...9
More informationIntroduction to programming with Python
Introduction to programming with Python Ing. Lelio Campanile 1/61 Main Goal - Introduce you to programming - introduce you to the most essential feature of python programming 2/61 Before to start The name
More informationExponents. Reteach. Write each expression in exponential form (0.4)
9-1 Exponents You can write a number in exponential form to show repeated multiplication. A number written in exponential form has a base and an exponent. The exponent tells you how many times a number,
More informationScheme Tutorial. Introduction. The Structure of Scheme Programs. Syntax
Scheme Tutorial Introduction Scheme is an imperative language with a functional core. The functional core is based on the lambda calculus. In this chapter only the functional core and some simple I/O is
More informationLesson 10. Student Outcomes. Lesson Notes
Student Outcomes Students understand that a function from one set (called the domain) to another set (called the range) assigns each element of the domain to exactly one element of the range and understand
More informationCSE 115. Introduction to Computer Science I
CSE 115 Introduction to Computer Science I Note about posted slides The slides we post will sometimes contain additional slides/content, beyond what was presented in any one lecture. We do this so the
More informationSpreadsheet EXCEL. Popular Programs. Applications. Microsoft Excel. What is a Spreadsheet composed of?
Spreadsheet A software package (computer program) that can mix numbers, letters and perform simple mathematical operations. EXCEL Can be programmed Lab Lecture, part 1 Applications Accounting Statistical
More informationCOMP519 Web Programming Lecture 11: JavaScript (Part 2) Handouts
COMP519 Web Programming Lecture 11: JavaScript (Part 2) Handouts Ullrich Hustadt Department of Computer Science School of Electrical Engineering, Electronics, and Computer Science University of Liverpool
More informationDefinition: A context-free grammar (CFG) is a 4- tuple. variables = nonterminals, terminals, rules = productions,,
CMPSCI 601: Recall From Last Time Lecture 5 Definition: A context-free grammar (CFG) is a 4- tuple, variables = nonterminals, terminals, rules = productions,,, are all finite. 1 ( ) $ Pumping Lemma for
More informationTester vs. Controller. Elementary Programming. Learning Outcomes. Compile Time vs. Run Time
Tester vs. Controller Elementary Programming EECS1022: Programming for Mobile Computing Winter 2018 CHEN-WEI WANG For effective illustrations, code examples will mostly be written in the form of a tester
More informationIntroduction to Visual Basic and Visual C++ Arithmetic Expression. Arithmetic Expression. Using Arithmetic Expression. Lesson 4.
Introduction to Visual Basic and Visual C++ Arithmetic Expression Lesson 4 Calculation I154-1-A A @ Peter Lo 2010 1 I154-1-A A @ Peter Lo 2010 2 Arithmetic Expression Using Arithmetic Expression Calculations
More informationFull file at
Java Programming: From Problem Analysis to Program Design, 3 rd Edition 2-1 Chapter 2 Basic Elements of Java At a Glance Instructor s Manual Table of Contents Overview Objectives s Quick Quizzes Class
More informationElementary Programming
Elementary Programming EECS1022: Programming for Mobile Computing Winter 2018 CHEN-WEI WANG Learning Outcomes Learn ingredients of elementary programming: data types [numbers, characters, strings] literal
More informationMATVEC: MATRIX-VECTOR COMPUTATION LANGUAGE REFERENCE MANUAL. John C. Murphy jcm2105 Programming Languages and Translators Professor Stephen Edwards
MATVEC: MATRIX-VECTOR COMPUTATION LANGUAGE REFERENCE MANUAL John C. Murphy jcm2105 Programming Languages and Translators Professor Stephen Edwards Language Reference Manual Introduction The purpose of
More informationLogic Design: Part 2
Orange Coast College Business Division Computer Science Department CS 6- Computer Architecture Logic Design: Part 2 Where are we? Number systems Decimal Binary (and related Octal and Hexadecimal) Binary
More informationLECTURE 4. Logic Design
LECTURE 4 Logic Design LOGIC DESIGN The language of the machine is binary that is, sequences of 1 s and 0 s. But why? At the hardware level, computers are streams of signals. These signals only have two
More informationAlgebraic Expressions
P.1 Algebraic Expressions, Mathematical Models, and Real Numbers P.2 Exponents and Scientific Notation Objectives: Evaluate algebraic expressions, find intersection and unions of sets, simplify algebraic
More informationLe L c e t c ur u e e 2 To T p o i p c i s c t o o b e b e co c v o e v r e ed e Variables Operators
Course Name: Advanced Java Lecture 2 Topics to be covered Variables Operators Variables -Introduction A variables can be considered as a name given to the location in memory where values are stored. One
More informationIntroduction to Boolean logic and Logical Gates
Introduction to Boolean logic and Logical Gates Institute of Statistics Fall 2014 We saw the importance of the binary number system for data representation in a computer system. We ll see that the construction
More informationLecture 2 FORTRAN Basics. Lubna Ahmed
Lecture 2 FORTRAN Basics Lubna Ahmed 1 Fortran basics Data types Constants Variables Identifiers Arithmetic expression Intrinsic functions Input-output 2 Program layout PROGRAM program name IMPLICIT NONE
More informationComputational Expression
Computational Expression Conditionals Janyl Jumadinova 10 October, 2018 Janyl Jumadinova Computational Expression 10 October, 2018 1 / 16 Computational Thinking: a problem solving process Decomposition
More informationCS 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 2 Solutions to Selected Problems
CS 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 2 Solutions to Selected Problems 1. Search trees for the state-space graph given below: We only show the search trees corresponding
More informationThe set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;
Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method
More informationConstants and Variables
DATA STORAGE Constants and Variables In many introductory courses you will come across characteristics or elements such as rates, outputs, income, etc., measured by numerical values. Some of these will
More informationhp calculators HP 9s Basic Arithmetic Practice Doing Arithmetic
Practice Doing Arithmetic Practice doing arithmetic This learning module describes how to carry out simple arithmetic calculations on your HP 9s. Since the HP 9s uses the familiar algebraic entry system,
More informationStatements Truth Tables. Definition of a Statement
Aendix E Introduction to Logic E.1 Introduction to Logic Statements Truth Tables Statements In everyday seech and in mathematics you make inferences that adhere to common laws of logic. These methods of
More informationMathematics Scope & Sequence Algebra I
Mathematics Scope & Sequence 2016-17 Algebra I Revised: June 20, 2016 First Grading Period (24 ) Readiness Standard(s) Solving Equations and Inequalities A.5A solve linear equations in one variable, including
More informationChapter 9 Deductive Arguments II Truth-Functional Logic. Tutorial: Truth Tables
Chapter 9 Deductive Arguments II ruth-unctional Logic utorial: ruth ables ruth ables he aim of this tutorial is to help you learn to construct truth tables and use them to test the validity of arguments.
More informationChapter 17. Fundamental Concepts Expressed in JavaScript
Chapter 17 Fundamental Concepts Expressed in JavaScript Learning Objectives Tell the difference between name, value, and variable List three basic data types and the rules for specifying them in a program
More informationHomework. Update on website issue Reading: Chapter 7 Homework: All exercises at end of Chapter 7 Due 9/26
Homework Update on website issue Reading: hapter 7 Homework: All exercises at end of hapter 7 Due 9/26 opyright c 22 28 UMaine omputer Science Department / 2 OS 4: Foundations of omputer Science Karnaugh
More informationPlease try all of the TRY THIS problems throughout this document. When done, do the following:
AP Computer Science Summer Assignment Dr. Rabadi-Room 1315 New Rochelle High School nrabadi@nredlearn.org One great resource for any course is YouTube. Please watch videos to help you with any of the summer
More informationChapter 15. Functional Programming. Topics. Currying. Currying: example. Currying: example. Reduction
Topics Chapter 15 Functional Programming Reduction and Currying Recursive definitions Local definitions Type Systems Strict typing Polymorphism Classes Booleans Characters Enumerations Tuples Strings 2
More informationTowards a Logical Reconstruction of Relational Database Theory
Towards a Logical Reconstruction of Relational Database Theory On Conceptual Modelling, Lecture Notes in Computer Science. 1984 Raymond Reiter Summary by C. Rey November 27, 2008-1 / 63 Foreword DB: 2
More informationEntry Point of Execution: the main Method. Elementary Programming. Learning Outcomes. Development Process
Entry Point of Execution: the main Method Elementary Programming EECS1021: Object Oriented Programming: from Sensors to Actuators Winter 2019 CHEN-WEI WANG For now, all your programming exercises will
More informationBOOLEAN ALGEBRA AND CIRCUITS
UNIT 3 Structure BOOLEAN ALGEBRA AND CIRCUITS Boolean Algebra and 3. Introduction 3. Objectives 3.2 Boolean Algebras 3.3 Logic 3.4 Boolean Functions 3.5 Summary 3.6 Solutions/ Answers 3. INTRODUCTION This
More informationFlow Control. So Far: Writing simple statements that get executed one after another.
Flow Control So Far: Writing simple statements that get executed one after another. Flow Control So Far: Writing simple statements that get executed one after another. Flow control allows the programmer
More informationDiagonalization. The cardinality of a finite set is easy to grasp: {1,3,4} = 3. But what about infinite sets?
Diagonalization Cardinalities The cardinality of a finite set is easy to grasp: {1,3,4} = 3. But what about infinite sets? We say that a set S has at least as great cardinality as set T, written S T, if
More informationJava enum, casts, and others (Select portions of Chapters 4 & 5)
Enum or enumerates types Java enum, casts, and others (Select portions of Chapters 4 & 5) Sharma Chakravarthy Information Technology Laboratory (IT Lab) Computer Science and Engineering Department The
More informationBEGINNING PROBLEM-SOLVING CONCEPTS FOR THE COMPUTER. Chapter 2
1 BEGINNING PROBLEM-SOLVING CONCEPTS FOR THE COMPUTER Chapter 2 2 3 Types of Problems that can be solved on computers : Computational problems involving some kind of mathematical processing Logical Problems
More informationPropositional Logic Formal Syntax and Semantics. Computability and Logic
Propositional Logic Formal Syntax and Semantics Computability and Logic Syntax and Semantics Syntax: The study of how expressions are structured (think: grammar) Semantics: The study of the relationship
More informationGrade 4 ISTEP+ T1 #1-2 ISTEP+ T1 # Identify, describe and draw parallelograms, rhombuses, and ISTEP+ T1 #5-6
Unit 1 Naming and Constructing Geometric Figures 1 a B Use a compass and straightedge to construct geometric figures. 4.4.1 Identify, describe, and draw rays, right angles, acute angles, obtuse ISTEP+
More informationPropositional Logic:
CS2209A 2017 Applied Logic for Computer Science Lecture 2 Propositional Logic: Syntax, semantics, truth table Instructor: Yu Zhen Xie Language of logic: building blocks Proposition: A sentence that can
More informationLecture 3: Some Strange Properties of Fractal Curves
Lecture 3: Some Strange Properties of Fractal Curves I have been a stranger in a strange land. Exodus 2:22 1. Fractal Strangeness Fractals have a look and feel that is very different from ordinary curves.
More informationBits, Words, and Integers
Computer Science 52 Bits, Words, and Integers Spring Semester, 2017 In this document, we look at how bits are organized into meaningful data. In particular, we will see the details of how integers are
More informationCPS122 Lecture: From Python to Java last revised January 4, Objectives:
Objectives: CPS122 Lecture: From Python to Java last revised January 4, 2017 1. To introduce the notion of a compiled language 2. To introduce the notions of data type and a statically typed language 3.
More informationLecture 9. Monday, January 31 CS 205 Programming for the Sciences - Lecture 9 1
Lecture 9 Reminder: Programming Assignment 3 is due Wednesday by 4:30pm. Exam 1 is on Friday. Exactly like Prog. Assign. 2; no collaboration or help from the instructor. Log into Windows/ACENET. Start
More informationCS 3512, Spring Instructor: Doug Dunham. Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010
CS 3512, Spring 2011 Instructor: Doug Dunham Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010 Prerequisites: Calc I, CS2511 Rough course outline:
More informationWEEK 4 OPERATORS, EXPRESSIONS AND STATEMENTS
WEEK 4 OPERATORS, EXPRESSIONS AND STATEMENTS OPERATORS Review: Data values can appear as literals or be stored in variables/constants Data values can be returned by method calls Operators: special symbols
More informationEntry Point of Execution: the main Method. Elementary Programming. Compile Time vs. Run Time. Learning Outcomes
Entry Point of Execution: the main Method Elementary Programming EECS2030: Advanced Object Oriented Programming Fall 2017 CHEN-WEI WANG For now, all your programming exercises will be defined within the
More informationSyntax of Eiffel: a Brief Overview
Syntax of Eiffel: a Brief Overview EECS3311 A: Software Design Fall 2018 CHEN-WEI WANG Escape Sequences Escape sequences are special characters to be placed in your program text. In Java, an escape sequence
More informationReteaching Transversals and Angle Relationships
Name Date Class Transversals and Angle Relationships INV Transversals A transversal is a line that intersects two or more coplanar lines at different points. Line a is the transversal in the picture to
More informationFunctions 3.6. Fall Math (Math 1010) M / 13
Functions 3.6 Fall 2013 - Math 1010 (Math 1010) M 1010 3.6 1 / 13 Roadmap 3.6 - Functions: Relations, Functions 3.6 - Evaluating Functions, Finding Domains and Ranges (Math 1010) M 1010 3.6 2 / 13 3.6
More informationFormal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5
Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5 [talking head] Formal Methods of Software Engineering means the use of mathematics as an aid to writing programs. Before we can
More informationCommands, and Queries, and Features. Syntax of Eiffel: a Brief Overview. Escape Sequences. Naming Conventions
Commands, and Queries, and Features Syntax of Eiffel: a Brief Overview EECS3311 A: Software Design Fall 2018 CHEN-WEI WANG In a Java class: Attributes: Data Mutators: Methods that change attributes without
More informationCGF Lecture 2 Numbers
CGF Lecture 2 Numbers Numbers A number is an abstract entity used originally to describe quantity. i.e. 80 Students etc The most familiar numbers are the natural numbers {0, 1, 2,...} or {1, 2, 3,...},
More informationfalse, import, new 1 class Lecture2 { 2 3 "Data types, Variables, and Operators" 4
1 class Lecture2 { 2 3 "Data types, Variables, and Operators" 4 5 } 6 7 // Keywords: 8 byte, short, int, long, char, float, double, boolean, true, false, import, new Zheng-Liang Lu Java Programming 44
More informationLOGIC AND DISCRETE MATHEMATICS
LOGIC AND DISCRETE MATHEMATICS A Computer Science Perspective WINFRIED KARL GRASSMANN Department of Computer Science University of Saskatchewan JEAN-PAUL TREMBLAY Department of Computer Science University
More informationInformation Science 1
Topics covered Information Science 1 Fundamental Programming Constructs (1) Week 11 Terms and concepts from Week 10 Flow of control and conditional statements Selection structures if statement switch statement
More informationCS1150 Principles of Computer Science Boolean, Selection Statements
CS1150 Principles of Computer Science Boolean, Selection Statements Yanyan Zhuang Department of Computer Science http://www.cs.uccs.edu/~yzhuang CS1150 Math Center https://www.uccs.edu/mathcenter/schedules
More information