THE IMPORTANCE OF DISCRETE MATHEMATICS IN COMPUTER TECHNOLOGY.

Slides:



Advertisements
Similar presentations
Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
Advertisements

CT455: Computer Organization Logic gate
UNIT 8 DIGITAL LOGIC. (1) To study and understand Boolean algebra and Boolean properties. (2) To design and analyze Logic gates. (3) To design and analyze.
INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.
Sahar Mosleh PageCalifornia State University San Marcos 1 Introductory Concepts This section of the course introduces the concept of digital circuits and.
Types of Logic Circuits
Copyright © Cengage Learning. All rights reserved.
Lecture 2 Dr Richard Reilly Dept. of Electronic & Electrical Engineering Room 153, Engineering Building To insert your company logo on this slide From.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
Digital Logic Lecture 1 Introduction By Dr Zyad Dwekat The Hashemite University Computer Engineering Department.
Boolean Algebra – I. Outline  Introduction  Digital circuits  Boolean Algebra  Two-Valued Boolean Algebra  Boolean Algebra Postulates  Precedence.
Chapter 2 Combinational Systems And / Or / Not. TRIAD PRINCIPLE: Combinational is about And / Or / Not combinations As well as equivalent functions. It.
1 CHAPTER 4: PART I ARITHMETIC FOR COMPUTERS. 2 The MIPS ALU We’ll be working with the MIPS instruction set architecture –similar to other architectures.
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Introduction to Computer Science David Goldschmidt, Ph.D. Computer Science The College of Saint Rose CIS September 6, 2007.
Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Combinatorial Algorithms Unate Covering Binate Covering Graph Coloring Maximum Clique.
MATH 224 – Discrete Mathematics
Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.
4.4 Equations as Relations
1 Section 10.2 Boolean Algebra Motivation: Notice the list of corresponding properties for the algebra of sets and the algebra of propositional wffs. These.
Fall 2012: FCM 708 Foundation I Lecture 2 Prof. Shamik Sengupta
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 – 7.2 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean.
4. Electrons and electronics 4.5 Digital electronics.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Boolean Algebra & Logic Prepared by Dr P Marais (Modified by D Burford)
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
CS6133 Software Specification and Verification
June 10, 2002© Howard Huang1 Number systems To get started, we’ll discuss one of the fundamental concepts underlying digital computer design:
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.
Boolean Functions and Boolean Algebra Laxmikant Kale.
Logic Simplification-Using Boolean Laws Logic Design Laboratory EE 2121 Lectures By Manesh T EE2121-In Charge
DIGITAL ELECTRONICS. Everything in digital world is based on binary system. Numerically it involves only two symbols 0 or 1. –0 = False = No –1 = True.
Minute Paper 4/4/04 Z=50+j86.7=100
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean Logic.
Technical Seminar II Implementation of
Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patternson and Hennessy Text.
Dr. ClincyLecture Slide 1 CS6020- Chapter 3 (3A and ) Dr. Clincy Professor of CS First Exam - Tuesday, September 6th Coverage: All subjects up to.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Hoda Roodaki Boolean Algebra Hoda Roodaki
Logic gates.
Digital Logic.
Logic Gates & Boolean Algebra
From Classical Proof Theory to P vs. NP
Boolean Algebra.
14:332:231 DIGITAL LOGIC DESIGN Boolean Algebra
ECE 2110: Introduction to Digital Systems
ECE 3110: Introduction to Digital Systems
Logic Gates.
Computer Science 210 Computer Organization
Propositional Calculus: Boolean Algebra and Simplification
Agenda – 2/12/18 Questions? Readings: CSI 4, P
Basic Logic Gates 1.
Dr. Clincy Professor of CS
Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: We can represent.
Functions Introduction.
Mathematics for Computer Science MIT 6.042J/18.062J
Logic Gates.
Lecture 20: Combinatorial Circuits I
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
A Brief Summary for Exam 1
DISCRETE COMPUTATIONAL STRUCTURES
Truth tables Mrs. Palmer.
Introductory Concepts
What are Logic Gates?.
Presentation transcript:

THE IMPORTANCE OF DISCRETE MATHEMATICS IN COMPUTER TECHNOLOGY

Computer technology is a proof of today’s growing world; by the developing technology its effects -advantages or disadvantages- are seen in many parts of daily life. At first, connections between computer technology and the real world seem far, but computers are not used only for computing due to the representations of many variables and conditions of real life. Abacus is called to be the first computer, but comparing Abacus with modern computers shows that there have been many stages, up to coming to this level in computer technology. Many details in real life can be simulated; for instance, colours can be represented by pixels or manner of thinking by artificial intelligence.

Because of the common problems, theories of computing, logic and nature of life have to be tied together to get the most effective solution. As a result of this combination, methods that are used for representing situations and developing applications are based on the same structure, supported by Discrete Mathematics. To deal with advanced subjects of computer technology many applications of Discrete Mathematics are required.

Although Discrete Mathematics does not seem essential for computer technologies, it has many important advantages for developments such as converting problems of real world to computer technology and creating algorithms, using Boolean Algebra, as well as supporting software applications.

I. First of all, making the connection between real world and computer technology leads to the developments of new areas and opportunities. As an axiom, a function of different variables has to produce results both in life and theory.

1. Both numeric symbols and other variables in real life correspond to numbers in computer technology 2. Representation of mathematical expressions by electrical devices lead to new results in mathematics and computer systems

II. Due to the values of variables and results, domain and range sets differ. 1. A proposition can be only true or false, in other words, it is a dichotomy 2. “ 0 and 1 ” are the only elements of domain for variables in computer technology, which cover many hazards of real world by corresponding all the elements of it to “ 0 and 1 ”

III. As a way of creating algorithms flow charts are useful for small programs or functions. 1. Being efficient, data structures occuring during the execution time of a program and using functions 2. A comprehensible and effective method for advancing algorithms is pseudocade 3. Correctness of a program besides debugging

IV. Boolean Algebra is a bridge that supports transition between computer technology and real life. System of Boolean Algebra is quite easy; it consists of literals, operators and some basic theorems only.

1. Boolean Algebra is a form of equational reasoning 2. Boolean expressions can be represented by truth tables

V. Applications of Boolean Algebra are generally on logical and electrical circuits 1. In general, the first design of a logical circuit is not systematic, the main problem for logical circuits is making the cheaper one with including required features 2. Many different physical devices, both electrical and nonelectrical, have been used to build logical gates

VI. Taking advantages of Discrete Mathematics in software applications makes things easier to deal with problems. Artificial intelligence structures are based on logical theorems.

VII. Taking advantages of Discrete Mathematics in software applications makes things easier to deal with problems.

In conclusion; discrete mathematics and computer technology are unseperatable. Since all computer technology is based on discrete mathematics.