Presentation V Computer Functioning By Teacher Julio Cesar Peñaloza Castañeda.

Slides:



Advertisements
Similar presentations
Test on Input, Output, Processing, & Storage Devices
Advertisements

Computer Hardware 4 Main Types.
Truth Tables Presented by: Tutorial Services The Math Center.
P3- Represent how data flows around a computer system
Introduction to Symbolic Logic
CS128 – Discrete Mathematics for Computer Science
P449. p450 Figure 15-1 p451 Figure 15-2 p453 Figure 15-2a p453.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
Presentation IV Parts of a Computer By Teacher Julio Cesar Peñaloza Castañeda.
Presentation V Computer Functioning By Teacher Julio Cesar Peñaloza Castañeda.
CSCI2110 – Discrete Mathematics Tutorial 8 Propositional Logic Wong Chung Hoi (Hollis)
Discrete Mathematics CS 285. Lecture 12 Section 1.1: Logic Axiomatic concepts in math: Equals Opposite Truth and falsehood Statement Objects Collections.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Copyright © Curt Hill Truth Tables A way to show Boolean Operations.
Computer Programming How Computers Work
Computer A computer is an electronic machine that takes information, processes it,and stores it. Computers are made up of hardware ( monitor, tower, keyboard,
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Solving Linear Inequalities `. Warm-up -4 < x ≤ 6 x ≤ -4 or x>
4. Electrons and electronics 4.5 Digital electronics.
Islamic University Of Gaza, Nael Aburas Data Storage Introduction to computer, 2nd semester, 2010/2011 Mr.Nael Aburas
Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.
Lesson 1.4. and ornot Logic Gate: A device that acts on input signals that it receives to produce an output signal (1 or 0). True = 1 False = 0.
Thinking Mathematically
1 Ethics of Computing MONT 113G, Spring 2012 Session 1 Digital Circuits, binary Numbers Course webpage:
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.
Planning as Satisfiability (SAT-Plan). SAT-Plan Translate the planning problem into a satisfiability problem for length n of Plan garb 0 (proposition)present.
CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.
LOGIC. Logic in general  Logics are formal languages for representing information such that conclusions can be drawn  Syntax defines the sentences in.
1.The following diagram illustrates the relationship among various hardware components. The arrows indicate the directions of data flow. Activity 1 Relationship.
 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.
WARM UP Graph the following inequalities: a. x ≤ 1 b. x < 2 3. – 4x – 3 < (1 – x ) ≥ 3.
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
Simple Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Presented by: Tutorial Services The Math Center
Truth Table to Statement Form
Logic Gates.
1-4 Solving Inequalities
AND.
DISCRETE MATHEMATICS CHAPTER I.
CSNB 143 Discrete Mathematical Structures
Thinking Mathematically
Truth Tables and Equivalent Statements
Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for Negation, Conjunction, and Disjunction
Chapter 2.3 Binary Logic.
Semantics In propositional logic, we associate atoms with propositions about the world. We specify the semantics of our logic, giving it a “meaning”. Such.
Logic – Bell Ringer.
Chapter 8 Logic Topics
Computer.
Applications of Propositional Logic
3.4 Computer systems Boolean logic Lesson 2.
TRUTH TABLES.
Discrete Mathematics Lecture # 8.
GCSE Computer Science – Logic Gates & Boolean Expressions
Discrete Mathematics Lecture 2: Propositional Logic
Binary Logic.
Statements joined by “And” (Conjunctions)
Discrete Mathematics Lecture 2: Propositional Logic
Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.
Section 3.7 Switching Circuits
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for the Conditional and Biconditional
6.4 Truth Tables for Arguments
Computer Electronic device Accepts data - input
What are Logic Gates?.
Propositional Satisfiability
Computer System.
Presentation transcript:

Presentation V Computer Functioning By Teacher Julio Cesar Peñaloza Castañeda

5.1 Basic Computer Functioning A computer can be defined as an electronic device that accepts data from an input device, processes it, stores it in a disk and finally displays it on an output device such as a monitor. The following figure illustrates how this flow of information exists for all types of computers such as Personal Computers, Laptops, Palmtops etc.

Flow of Information in a Computer

Tables of Truth Values

Example 1 Proposition: P: 31 is a prime number: Q: The ice is hot: Determine the value of truth of P, Q, P ^ Q, P ∨ Q

Solutions P = 1 (Because 31 IS a prime number) Q = 0 (It’s false that the ice is hot) P ^ Q = 0 (Because the when one of the propositions of a conjunction is false the conjunction is false) P ∨ Q = 1 (Because the when one of the propositions of a disjunction is true the disjunction is true)

Example 2 Proposition: P: There is life on the moon Q: = 3 Determine the value of truth of P, Q, P ∨ Q, P^Q, P → Q, P↔Q

Solutions P=0 Q=1 P ∨ Q=1 P^Q=0 P → Q=1 P↔Q = 0

Example 3 Proposition: P: There are elephants in Mars Q: The Fire is cold R: 2+ 1 = 4 Symbolize and validate the following propositions: S: If there are elephants in Mars and the fire is cold, then = 4 T: There are elephants in Mars and, fire IS cold so = 4

Solutions S = (P ^ Q) → R = 1 T = P ^ (Q →R) = 0