Lecture Comp 25 Math & Logic Discussion. What is logic? Logic is the study of reason Focus is the method or process by which an argument unfolds Aristotle.

Slides:



Advertisements
Similar presentations
Brief Introduction to Logic. Outline Historical View Propositional Logic : Syntax Propositional Logic : Semantics Satisfiability Natural Deduction : Proofs.
Advertisements

Course Outline Presentation Term: F09 Faculty Name : Asma Sanam Larik Course Name :INTRO TO COMPUTING Course Code : CSE145 Section :1 Semester : 1.
Introduction to Proofs
Intermediate Formulas & Functions Instructor: Rachel Baltus.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
Comp 205: Comparative Programming Languages Semantics of Imperative Programming Languages denotational semantics operational semantics logical semantics.
Brief Introduction to Logic. Outline Historical View Propositional Logic : Syntax Propositional Logic : Semantics Satisfiability Natural Deduction : Proofs.
E-learning in preparation of mathematics teachers and in mathematics teaching Working meeting to project EuroMath Innsbruck, 2004.
Course Review i206 Fall 2010 John Chuang. 2 Outline  Test 3 topics  Course review  Course evaluation.
Outline Chapter 1 Hardware, Software, Programming, Web surfing, … Chapter Goals –Describe the layers of a computer system –Describe the concept.
Describing Syntax and Semantics
Using Visual Logic To Teach A First Course In Programming Logic
MGF 1107 Mathematics of Social Choice Part 1a – Introduction, Deductive and Inductive Reasoning.
Copyright © cs-tutorial.com. Introduction to Web Development In 1990 and 1991,Tim Berners-Lee created the World Wide Web at the European Laboratory for.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Purpose of study A high-quality computing education equips pupils to use computational thinking and creativity to understand and change the world. Computing.
Invariant Based Programming in Education Tutorial, FM’08 Linda Mannila
TCP/IP Protocol Suite 1 Change the following IP addresses from binary notation to dotted-decimal notation. a b
MATH 224 – Discrete Mathematics
Low Level Programming Lecturer: Duncan Smeed Low Level Program Control Structures.
HTML CSS JAVASCRIPT. HTML - Stands for Hyper Text Markup Language HTML is a ‘language’ that describes web pages. This language is a collection of codes.
ES 101. Module 2 IP Addressing & Routing. Last Lecture Wide area networking Definition of “packets”
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
CSC Discrete Mathematical Structures Dr. Karl Ricanek Jr.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Computer Science School of Computing Clemson University Discrete Math and Reasoning about Software Correctness Joseph E. Hollingsworth
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Description Logics: Logic foundation of Semantic Web Semantic.
Proving statements about angles
Control Structures CPS120: Introduction to Computer Science Lecture 5.
DEDUCTIVE VS. INDUCTIVE REASONING. Problem Solving Logic – The science of correct reasoning. Reasoning – The drawing of inferences or conclusions from.
Copyright © Cengage Learning. All rights reserved.
Computer Architecture
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
COMP 170 L2 Part 3 of Course Chapter 3 of Textbook.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
1 CSC 221: Computer Programming I Spring 2008 course overview  What did we set out to learn?  What did you actually learn?  Where do you go from here?
The Teacher Computing HTML HyperText Markup Language.
1 CS1001 Lecture Overview Java Programming Java Programming Arrays Arrays.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
Principle of Programming Lanugages 3: Compilation of statements Statements in C Assertion Hoare logic Department of Information Science and Engineering.
Department of Computer Science, Florida State University CGS 3066: Web Programming and Design Spring
 In the 1960s, ARPANET (Advanced Research Projects Agency Network), the internet’s predecessor, was invented  ARPANET used two technologies that are.
Computer Network Architecture Lecture 9: IP Addressing 13/1/
Learning Aim C.  Creating web pages involves many considerations.  In this section we will look at the different software tools you can use and how.
Web Design – Week 2 Introduction to website basics Website basics: How the Web Works Client / server architecture Packet switching URL components.
CS/APMA 202 Spring 2005 Aaron Bloomfield. Sequences in Nature
Section 9.4 – Mathematical Induction Mathematical Induction: A method to prove that statements involving natural numbers are true for all natural numbers.
Computer Club Content Review Al Huda Computer Club, April 9, 2016 Farid Ahmed.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
CS 2130 Computational Structures (Discrete Mathematics for Computing)
CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.
CS140 – Computer Programming 1 Course Overview First Semester – Fall /1438 – 2016/2017 CS140 - Computer Programming 11.
Discussion Lecture Comp 25 Math & Logic.
Getting Started With HTML
Martin Kruliš, Jan Michelfeit
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Programming Fundamentals
Department of Computer Science, Florida State University
Introduction to Internet Programming
Chapter 10: Mathematical proofs
XML Data Introduction, Well-formed XML.
Martin Kruliš, Jan Michelfeit
Design and Implementation
Logical operators.
A Brief Summary for Exam 1
Introduction to Web Application Design
Sullivan Algebra and Trigonometry: Section 13.4
Chapter 2: Geometric Reasoning
Introduction to HTML By Perry Nelson Information Specialist.
Presentation transcript:

Lecture Comp 25 Math & Logic Discussion

What is logic? Logic is the study of reason Focus is the method or process by which an argument unfolds Aristotle was the founder of logic – developed principles of inference “All men are mortal. Socrates is a man. Therefore Socrates is mortal.”

Where are we Headed? COMP 25 satisfies the specific criteria of Area III-B as follows: –Principles of mathematics –Principles of formal logic

Principles of Mathematics –Number representations: Decimal, binary and hexadecimal numbering systems in programming. –Applications of algebra and their implementation: demonstrated by applications in various computer programming languages –Development of theories of logic and set theory, demonstrated through implementation of Access database queries

Principles of Formal Logic –Program structure, grammar and constructs: demonstrated through HTML programming, CSS and JavaScript –General programming conditional constructs (IF, IF-THEN-ELSE, FOR and WHILE loops, etc): demonstrated through JavaScript programming –Development of theories of logical formulas: demonstrated through Excel spreadsheets

Students gain insights into through “demonstration” How does the binary/hex number systems works, then directly see how this applies to the fundamental operation of modern computers Learn how logic allows expressions to be proved true or false, then directly see how this is used in the construction of programs, algorithms, and queries.

Insights through “demonstration” Learn how the languages of computers have structures, then observe the necessity of this structures in writing and debugging programs Some “formal proofs”, such as the basic laws and theorems of algebra, and students can see how these laws and theorems apply to computer programs and the operation of the computer itself.

Course outline Comp 25 is divided into four sections: –Computer Architecture and Networking –Programming Languages –Logical formulas –Database management systems

Computer Architecture & Networking The necessary foundation material is discussed for the course. This includes computer numbering systems, the basic organization of a computer system (its architecture), how data is represented stored, and some rudimentary networking background. Networking principles with emphasis on the TCP/IP suite of protocols, IP addressing systems, packet switching and network troubleshooting.

Programming languages Programming is introduced: initially through HTML (Hypertext Markup Language), CSS (Cascading Style Sheets), JavaScript. All programming is accomplished using basic text editors similar to using Windows Notepad or Max TextEdit: no HTML editors are used.

Logical Formulas These formulas are presented using Excel Beyond basic math formulas into logical formulas based on programming logic IF, THEN, ELSE, as well as nested IF statements, IF AND and IF OR. These logical formulas are constructed using algebra, allowing the computer to make decisions based on the results of the formulas.

Database Management Systems The use of logical formulas developed in the previous section allows the students to them move on to more advanced decision-making using databases of information. Complex logical expressions are built to form “queries” which are then evaluated by the Access database application. Apply formal logical principles in order to access specific information stored in a database.