Introduction to Computer Systems
|
|
- Brenda Hamilton
- 5 years ago
- Views:
Transcription
1 Introduction to Computer Systems Department of Computer Science and Information Systems Lecturer: Steve Maybank Spring 2018 Week 1a: History of Computing 9 January 2018 Birkbeck College, U. London 1
2 Hardware for Evaluating 1+2 Brain Abacus rods and beads Mechanical rods and gears Electromechanical electromagnets open and close switches Vacuum tubes Transistors and integrated circuits 9 January 2018 Birkbeck College, U. London 2
3 Abacus Chinese abacus Russian abacus 9 January 2018 BB Section 0.2 3
4 Pascal s Calculator: the Pascaline Addition and subtraction only. Image from See How the Pascaline works on You Tube 9 January 2018 Birkbeck College, U. London 4
5 Subtraction Using the Pascaline 1 Use 9 s complement to convert the subtraction to addition The nine s complement C(a) of a single digit a is C a = 9 a Examples: C 2 = 7, C 3 = 6. Note that C C a = a a b = C(C a + b) Example: 4 3 = C C = C = C 8 = 1 9 January 2018 Birkbeck College, U. London 5
6 Subtraction Using the Pascaline 2 Prove that if a, b are single digits and a b, then a b = C(C a + b) Proof: C a b = 9 a b = 9 a + b = C a + b a b = CC a b = C C a b = C C a + b Example: a = 7, b = 1 C a = 2, C a + b = 3 a b = C 3 = 6 9 January 2018 Birkbeck College, U. London 6
7 Difference Engine Early computer for squaring numbers, and much more. Numerical results printed out in the form of tables. Designer: Charles Babbage ( ) 1821: plans for a Difference Engine. 1832: partially built by Joseph Clement. 1834: plans for a more advanced computer, the programmable Analytical Engine. Never built. See 9 January 2018 BB Section 0.2 7
8 Why Differences? Differences are used to evaluate polynomials. Three examples of polynomials: 1, x + 1, 1 + x x x/2 Notation in computing: f x = x x x Notation in mathematics: f x = 1 + 3x x 2 Evaluation: f 2 = = 3 9 January 2018 Birkbeck College, U. London 8
9 Example of Differences f x = x 2 First difference 1 = f 1 f 0 = 1 2 = f 2 f 1 = 3 3 = f 3 f 2 = 5 Second difference 2 1 = = = 2 First difference in symbols: f x + 1 f x = x x 2 = 2x January 2018 Birkbeck College, U. London 9
10 Evaluation of x 2 Using Differences x x*x 1 st difference 2 nd difference Find the differences: Δ x + 1 = Δ x + 2 Find the values of x x: x + 1 x + 1 = Δ x + x 2 9 January 2018 Brookshear Section
11 Why Polynomials? function 0.7 log polynomial x Polynomials are used to approximate more complicated functions, e.g. if x is small, log 1 + x x x 2 /2 9 January 2018 Birkbeck College, U. London 11
12 Modern Construction of a Difference Engine Engine constructed from Babbage s designs by the Science Museum 9 January 2016 Birkbeck College, U. London 12
13 Lego Version of the Difference Engine Built by Andrew Carol 9 January 2018 Birkbeck College, U. London 13
14 Code Breaking Machine Replica of the Bombe used at Bletchley Park Original design (1939): Alan Turing Gordon Welchman Electromechanical, specialised only for breaking the Enigma code 9 January 2018 Birkbeck College, U. London 14
15 Electromechanical Computer 1 st fully automatic computer. Vol16x2.4x0.6 m 3, weight 4500 Kg. Instructions read from punched paper. Store: 72 nums. of 23 dec. digits. Speed: + or s., * 6 s., / 15.3 s. H. Aiken, January 2018 Birkbeck College, U. London 15
16 ENIAC 18,000 vacuum tubes Vol 30x2.4x0.9 m 3, Weight Kg Data input: card reader. Volatile store: twenty 10 digit decimal nos. Read only store: 100 nos. Programming: rewire Speed: + or 0.2 ms, * 3 ms, / 25 ms. J. Presper-Eckert and J. Mauchley 9 January 2018 Birkbeck College, U. London 16
17 Computing at Birkbeck 1945: Andrew Booth recruited by J.D. Bernal to work on mathematical methods for inferring crystal structure from X-rays : builds series of computers, Automatic Relay Computer (ARC), ARC2, SEC, 1957: establishes Department of Numerical Automation at Birkbeck See 9 January 2018 Birkbeck College, U. London 17
18 Computing at Birkbeck MSc student Norman Kitz working on the SEC (Simple Electronic Computer) at Birkbeck (1949). 50years/50yearsofcomputing.pdf 9 January 2018 Birkbeck College, U. London 18
19 Computing Game Tom has a game in which he pretends to be a computer 9 January 2018 Birkbeck College, U. London 19
20 Equipment A set of boxes Each box has a name: 0, 1, 2, Each box contains a piece of paper with a single number on it, e.g. box 0 contains 10 9 January 2018 Birkbeck College, U. London 20
21 Instructions Tom carries out instructions such as: Add the number in box 0 to the number in box 2, then put the result in box 2, i.e. make the result the new number in box 2. Subtract the number in box 1 from the number in box 0. Put the result in box 0. Multiply the number in box 1 with the number in box 3. Put the result in box 4. 9 January 2018 Birkbeck College, U. London 21
22 Observations The computer consists of a memory (the boxes), a device for changing the contents of the memory (Tom) and a list of instructions. The instructions are simple and there are only a few types (so far add, subtract and multiply). The instructions are carried out one at a time. There is no limit to the number of instructions which are carried out (Tom never gets tired). 9 January 2018 Birkbeck College, U. London 22
Chapter 01: Introduction. Lesson 01 Evolution Computers Part 1: Mechanical Systems, Babbage method of Finite Difference Engine and Turing Hypothesis
Chapter 01: Introduction Lesson 01 Evolution Computers Part 1: Mechanical Systems, Babbage method of Finite Difference Engine and Turing Hypothesis Objective Understand how mechanical computation systems
More informationCS187 - Science Gateway Seminar for CS and Math
CS187 - Science Gateway Seminar for CS and Math Fall 2013 Class 3 Sep. 10, 2013 What is (not) Computer Science? Network and system administration? Playing video games? Learning to use software packages?
More informationTheory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death
Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory
More informationHow Does Nature Compute?
How Does Nature Compute? Lila Kari Dept. of Computer Science University of Western Ontario London, ON, Canada http://www.csd.uwo.ca/~lila/ lila@csd.uwo.ca Computers: What can they accomplish? Fly spaceships
More informationWhat is a Computer? computer: anything that is able to take a mathematically
What is a Computer? computer: anything that is able to take a mathematically well-defined problem and perform a sequence of simple operations that will result in the solution to that problem. A computer
More informationcomplex networks and systems i609: advanced PhD seminar I Informatics luis rocha 2019 INDIANA UNIVERSITY
complex networks and systems Informatics luis rocha 2019 i609: advanced PhD seminar I luis m. rocha school of informatics, computing, & engineering indiana university, bloomington, usa and instituto gulbenkian
More informationThe History of ENIAC
The History of ENIAC Thomas McCaffery University of Pennsylvania Thomas McCaffery Bicsi Northeast Regional Meeting March 8, 2012 University of Pennsylvania About Penn Founded in 1740 by Benjamin Franklin.
More informationASSC = Automatic Sequence-Controlled Calculator (= Harvard Mark I) Howard Aitken, 1943
Počítací stroje Analytical Engine Charles Babbage, čtyřicátá léta 19. století Z3 Konrad Zuse, 1941 ASSC = Automatic Sequence-Controlled Calculator (= Harvard Mark I) Howard Aitken, 1943 Colossus Mark I,
More informationHistory & Binary Representation
History & Binary Representation C. R. da Cunha 1 1 Instituto de Física, Universidade Federal do Rio Grande do Sul, RS 91501-970, Brazil. August 30, 2017 Abstract In this lesson we will review the history
More informationBinary addition example worked out
Binary addition example worked out Some terms are given here Exercise: what are these numbers equivalent to in decimal? The initial carry in is implicitly 0 1 1 1 0 (Carries) 1 0 1 1 (Augend) + 1 1 1 0
More informationIntroduction. Chapter Computation and science
Chapter 1 Introduction Computing has become a necessary means of scientific study. Even in ancient times, the quantification of gained knowledge played an essential role in the further development of mankind.
More informationMACHINE COMPUTING. the limitations
MACHINE COMPUTING the limitations human computing stealing brain cycles of the masses word recognition: to digitize all printed writing language education: to translate web content games with a purpose
More informationWeek No. 06: Numbering Systems
Week No. 06: Numbering Systems Numbering System: A numbering system defined as A set of values used to represent quantity. OR A number system is a term used for a set of different symbols or digits, which
More information1 Computing System 2. 2 Data Representation Number Systems 22
Chapter 4: Computing System & Data Representation Christian Jacob 1 Computing System 2 1.1 Abacus 3 2 Data Representation 19 3 Number Systems 22 3.1 Important Number Systems for Computers 24 3.2 Decimal
More informationww.padasalai.net
t w w ADHITHYA TRB- TET COACHING CENTRE KANCHIPURAM SUNDER MATRIC SCHOOL - 9786851468 TEST - 2 COMPUTER SCIENC PG - TRB DATE : 17. 03. 2019 t et t et t t t t UNIT 1 COMPUTER SYSTEM ARCHITECTURE t t t t
More informationCHAPTER 2 NUMBER SYSTEMS
CHAPTER 2 NUMBER SYSTEMS The Decimal Number System : We begin our study of the number systems with the familiar decimal number system. The decimal system contains ten unique symbol 0, 1, 2, 3, 4, 5, 6,
More informationKeith Fligg. 03-April-07
03-April-07 Part 1: Counting Review of Numbers Part 2: Part 1: Counting Review of Numbers Numerical Representation in the Brain Part 2: Part 1: Counting Review of Numbers Numerical Representation in the
More informationUnit 4: Computer as a logic machine
Unit 4: Computer as a logic machine Propositional logic Boolean algebra Logic gates Computer as a logic machine: symbol processor Development of computer The credo of early AI Reference copyright c 2013
More informationElectrical Circuits. Winchester College Physics. makptb. c D. Common Time man. 3rd year Revision Test
Name... Set... Don.... manner~ man makptb Winchester College Physics 3rd year Revision Test Electrical Circuits Common Time 2011 Mark multiple choice answers with a cross (X) using the box below. I A B
More informationChapter 3: Inequalities
Chapter 3: Inequalities 3-1: Graphing and Writing Inequalities Objectives: Identify solutions of inequalities in one variable. Write and graph inequalities in one variable. Inequality: The quantities are
More information20. Combinational Circuits
Combinational circuits Q. What is a combinational circuit? A. A digital circuit (all signals are or ) with no feedback (no loops). analog circuit: signals vary continuously sequential circuit: loops allowed
More informationLecture 24. A Brief History of Computer Science (with thanks to Prabhakar Ragde) CS125 Course Notes Lecture 24, Slide 1
Lecture 24 A Brief History of Computer Science (with thanks to Prabhakar Ragde) CS125 Course Notes Lecture 24, Slide 1 Why History? No shortage of good stories It helps us understand the way things are
More informationCan a Machine Think?
Can a Machine Think? Mathematics 15: Lecture 27 Dan Sloughter Furman University December 4, 2006 Dan Sloughter (Furman University) Can a Machine Think? December 4, 2006 1 / 8 Alan Turing 1912-1954 Dan
More informationGREENWOOD PUBLIC SCHOOL DISTRICT 3 Grade Math Pacing Guide
Week 1 GREENWOOD PUBLIC SCHOOL DISTRICT First Nine Weeks Instructional Pd. Date Aug 6 10 Lesson 1 Academic Focus 3.NBT.A.1. 3.OA.B.5 3.NBT.A.3 round whole numbers to the nearest 10. I Can Statements round
More informationELEC Digital Logic Circuits Fall 2014 Switching Algebra (Chapter 2)
ELEC 2200-002 Digital Logic Circuits Fall 2014 Switching Algebra (Chapter 2) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering Auburn University, Auburn,
More informationMAA509: Quantum Computing and Information Introduction
MAA509: Quantum Computing and Information Introduction November 7, 2016 November 7, 2016 1 / 19 Why make computers? Computation by hand is difficult and not very stimulating. Why not make a machine do
More informationVirtualization. Introduction. G. Lettieri A/A 2014/15. Dipartimento di Ingegneria dell Informazione Università di Pisa. G. Lettieri Virtualization
Introduction G. Lettieri Dipartimento di Ingegneria dell Informazione Università di Pisa A/A 2014/15 G. Lettieri Folk definition What do people mean when they talk about virtualization w.r.t. computers?
More informationGCSE AQA Mathematics. Numbers
GCSE Mathematics Numbers Md Marufur Rahman Msc Sustainable Energy Systems Beng (Hons) Mechanical Engineering Bsc (Hons) Computer science & engineering GCSE AQA Mathematics 215/16 Table of Contents Introduction:...
More informationTuring Machines Decidability
Turing Machines Decidability Master Informatique 2016 Some General Knowledge Alan Mathison Turing UK, 1912 1954 Mathematician, computer scientist, cryptanalyst Most famous works: Computation model («Turing
More informationLecture 22 Chapters 3 Logic Circuits Part 1
Lecture 22 Chapters 3 Logic Circuits Part 1 LC-3 Data Path Revisited How are the components Seen here implemented? 5-2 Computing Layers Problems Algorithms Language Instruction Set Architecture Microarchitecture
More informationUniversal Turing Machine. Lecture 20
Universal Turing Machine Lecture 20 1 Turing Machine move the head left or right by one cell read write sequentially accessed infinite memory finite memory (state) next-action look-up table Variants don
More informationDigital Systems Roberto Muscedere Images 2013 Pearson Education Inc. 1
Digital Systems Digital systems have such a prominent role in everyday life The digital age The technology around us is ubiquitous, that is we don t even notice it anymore Digital systems are used in:
More informationbiologically-inspired computing lecture 14 Informatics luis rocha 2015 biologically Inspired computing INDIANA UNIVERSITY
lecture 14 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0
More informationAnnouncements. Problem Set 6 due next Monday, February 25, at 12:50PM. Midterm graded, will be returned at end of lecture.
Turing Machines Hello Hello Condensed Slide Slide Readers! Readers! This This lecture lecture is is almost almost entirely entirely animations that that show show how how each each Turing Turing machine
More informationCan You Count on Your Computer?
Can You Count on Your Computer? Professor Nick Higham School of Mathematics University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ p. 1/33 p. 2/33 Counting to Six I asked my computer
More informationFirst Draft of a Report on the EDVAC *
First Draft of a Report on the EDVAC * By John von Neumann V on Neumann's computing responsibility on the Los Alamos Manhattan Project led him to Bell Laboratories and Harvard University in search of additional
More informationCSC103 How Computers Work
mith College Computer Science CSC103 How Computers Work Fall 2017 Dominique Thiébaut dthiebaut@smith.edu Plan for Day 1 Syllabus Overview Some History Syllabus http://cs.smith.edu < Start here Faculty
More informationDigital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit
Digital Techniques 1. Binary System The digital computer is the best example of a digital system. A main characteristic of digital system is its ability to manipulate discrete elements of information.
More informationApplications. Smartphone, tablet, game controller, antilock brakes, microprocessor, Wires
COMPUTER SCIENCE Combinational circuits Q. What is a combinational circuit? A. A digital circuit (all signals are or ) with no feedback (no loops). analog circuit: signals vary continuously sequential
More informationComputer Organization I CRN Test 3/Version 1 CMSC 2833 CRN Spring 2017
. Print your name on your SANTRON in the space labeled NAME. 2. Print MS 2833 in the space labeled SUBJET. 3. Print the date 5-3-27, in the space labeled DATE. 4. Print your RN in the space labeled PERIOD.
More information! Chris Diorio. ! Gaetano Borrielo. ! Carl Ebeling. ! Computing is in its infancy
Welcome to CSE370 Special Thanks!! Instructor: ruce Hemingway " Ts: ryan Nelson and John Hwang " Tool Specialist: Cory Crawford Lecture Materials:! Chris Diorio! Class web " http://www.cs.washington.edu/education/courses/370/currentqtr/
More informationPrime Clocks. Michael Stephen Fiske. 10th GI Conference on Autonomous Systems October 23, AEMEA Institute. San Francisco, California
Prime Clocks Michael Stephen Fiske 10th GI Conference on Autonomous Systems October 23, 2017 AEMEA Institute San Francisco, California Motivation for Prime Clocks The mindset of mainstream computer science
More informationTuring Machines. COMP2600 Formal Methods for Software Engineering. Katya Lebedeva. Australian National University Semester 2, 2014
Turing Machines COMP2600 Formal Methods for Software Engineering Katya Lebedeva Australian National University Semester 2, 2014 Slides created by Jeremy Dawson and Ranald Clouston COMP 2600 Turing Machines
More informationScientific Notation. Chemistry Honors
Scientific Notation Chemistry Honors Used to easily write very large or very small numbers: 1 mole of a substance consists of 602,000,000,000,000,000,000,000 particles (we ll come back to this in Chapter
More informationNumbers and Arithmetic
Numbers and Arithmetic See: P&H Chapter 2.4 2.6, 3.2, C.5 C.6 Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University Big Picture: Building a Processor memory inst register file alu
More informationIntro To Digital Logic
Intro To Digital Logic 1 Announcements... Project 2.2 out But delayed till after the midterm Midterm in a week Covers up to last lecture + next week's homework & lab Nick goes "H-Bomb of Justice" About
More informationComputer Science. 19. Combinational Circuits. Computer Science COMPUTER SCIENCE. Section 6.1.
COMPUTER SCIENCE S E D G E W I C K / W A Y N E PA R T I I : A L G O R I T H M S, M A C H I N E S, a n d T H E O R Y Computer Science Computer Science An Interdisciplinary Approach Section 6.1 ROBERT SEDGEWICK
More informationHow long is the arrow?
1.2 Measurements Measuring We have all measured things before, but how would you define it? Measurement: comparing an unknown quantity to a standard unit (known quantity) How long is the arrow? Any measurement
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active
More informationSorting. CMPS 2200 Fall Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk
CMPS 2200 Fall 2017 Sorting Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk 11/17/17 CMPS 2200 Intro. to Algorithms 1 How fast can we sort? All the sorting algorithms
More informationCS 135. Designing Functional Programs
CS 135 Designing Functional Programs ADMINISTRATIVA HISTORY HISTORY NOVEMBER 29, 2018 2 Administrativa This is the last CS 135 lecture. Last CS 135 tutorials tomorrow. Don t forget about A9 (deadline Mon,
More informationDigital Electronics Part 1: Binary Logic
Digital Electronics Part 1: Binary Logic Electronic devices in your everyday life What makes these products examples of electronic devices? What are some things they have in common? 2 How do electronics
More informationHow to teleport your cat?
How to teleport your cat? Māris Ozols University of Cambridge What is quantum computing? Mathematics Quantum Computing Physics Computer Science What is a computer? What is a computer? A physical device
More informationCSE370: Introduction to Digital Design
CSE370: Introduction to Digital Design Course staff Gaetano Borriello, Brian DeRenzi, Firat Kiyak Course web www.cs.washington.edu/370/ Make sure to subscribe to class mailing list (cse370@cs) Course text
More information2.1 Computational Tractability
2.1 Computational Tractability Pascaline http://en.wikipedia.org/wiki/pascal%27s_calculator Blaise Pascal s 17 th century calculator (addition and subtraction) 2 Computational Tractability As soon as an
More informationCprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Simple Processor CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Digital
More informationPark Forest Math Team. Meet #3. Algebra. Self-study Packet
Park Forest Math Team Meet #3 Self-study Packet Problem Categories for this Meet: 1. Mystery: Problem solving 2. Geometry: Angle measures in plane figures including supplements and complements 3. Number
More information19 Lorenz Cipher Machine
9 Lorenz Cipher Machine During the Second World War, the codebreakers at Bletchley Park devised a variety of techniques that enabled the Allies to break the major codes used by the Germans. Not only was
More informationSorting. CS 3343 Fall Carola Wenk Slides courtesy of Charles Leiserson with small changes by Carola Wenk
CS 3343 Fall 2010 Sorting Carola Wenk Slides courtesy of Charles Leiserson with small changes by Carola Wenk 10/7/10 CS 3343 Analysis of Algorithms 1 How fast can we sort? All the sorting algorithms we
More informationComputer Science. 20. Combinational Circuits. Computer Science COMPUTER SCIENCE. Section
COMPUTER SCIENCE S E D G E W I C K / W A Y N E Computer Science 20. Combinational Circuits Computer Science An Interdisciplinary Approach Section 6.1 ROBERT SEDGEWICK K E V I N WAY N E http://introcs.cs.princeton.edu
More informationBoolean Algebra & Digital Logic
Boolean Algebra & Digital Logic Boolean algebra was developed by the Englishman George Boole, who published the basic principles in the 1854 treatise An Investigation of the Laws of Thought on Which to
More informationCristina Nita-Rotaru. CS355: Cryptography. Lecture 4: Enigma.
CS355: Cryptography Lecture 4: Enigma. Towards cryptographic engines } How to move from pencil and paper to more automatic ways of encrypting and decrypting? } How to design more secure ciphers } Alberti
More informationEECS150 - Digital Design Lecture 21 - Design Blocks
EECS150 - Digital Design Lecture 21 - Design Blocks April 3, 2012 John Wawrzynek Spring 2012 EECS150 - Lec21-db3 Page 1 Fixed Shifters / Rotators fixed shifters hardwire the shift amount into the circuit.
More informationLogic Theory in Designing of Digital Circuit & Microprocessor
Logic Theory in Designing of Digital Circuit & Microprocessor Prof.Vikram Mahendra Kakade Assistant Professor, Electronics & Telecommunication Engineering Department, Prof Ram Meghe College of Engineering
More informationEnergy. E d. Energy Power = time. E t P = E t = P
Energy Forms of energy Energy can never be created or destroyed. It can only be transformed from one type to another (or other types). here are many different forms of energy: Kinetic (movement) Energy
More information8 th Grade Algebra 1 (Honors) Subject
Subject Nine Week Standard 8 th Grade Algebra 1 (Honors) First 9 Weeks Standards are not covered in their entirety during this 9 weeks. Standards will be repeated throughout the course. N-Q.A.1: Use units
More informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
More informationCS5371 Theory of Computation. Lecture 10: Computability Theory I (Turing Machine)
CS537 Theory of Computation Lecture : Computability Theory I (Turing Machine) Objectives Introduce the Turing Machine (TM) Proposed by Alan Turing in 936 finite-state control + infinitely long tape A stronger
More informationChapter 1 :: From Zero to One
Chapter 1 :: From Zero to One Digital Design and Computer Architecture David Money Harris and Sarah L. Harris Copyright 2007 Elsevier 1- Chapter 1 :: Topics Background The Game Plan The Art of Managing
More informationPark Forest Math Team. Meet #3. Self-study Packet
Park Forest Math Team Meet #3 Self-study Packet Problem Categories for this Meet (in addition to topics of earlier meets): 1. Mystery: Problem solving 2. Geometry: Properties of Polygons, Pythagorean Theorem
More informationIOP2601. Some notes on basic mathematical calculations
IOP601 Some notes on basic mathematical calculations The order of calculations In order to perform the calculations required in this module, there are a few steps that you need to complete. Step 1: Choose
More informationWe say that the base of the decimal number system is ten, represented by the symbol
Introduction to counting and positional notation. In the decimal number system, a typical number, N, looks like... d 3 d 2 d 1 d 0.d -1 d -2 d -3... [N1] where the ellipsis at each end indicates that there
More informationEXEMPLAR NATIONAL CERTIFICATE (VOCATIONAL) ELECTRICAL PRINCIPLES AND PRACTICE NQF LEVEL 3 ( ) (X-Paper) 09:00 12:00
NATIONAL CERTIFICATE (VOCATIONAL) ELECTRICAL PRINCIPLES AND PRACTICE NQF LEVEL 3 2008 (12041002) (X-Paper) 09:00 12:00 EXEMPLAR This question paper consists of 7 pages. EXEMPLAR -2- NC(V) TIME: 3 HOURS
More informationImplementation of Boolean Logic by Digital Circuits
Implementation of Boolean Logic by Digital Circuits We now consider the use of electronic circuits to implement Boolean functions and arithmetic functions that can be derived from these Boolean functions.
More informationMath 20 Spring Discrete Probability. Midterm Exam
Math 20 Spring 203 Discrete Probability Midterm Exam Thursday April 25, 5:00 7:00 PM Your name (please print): Instructions: This is a closed book, closed notes exam. Use of calculators is not permitted.
More informationA Universal Turing Machine
A Universal Turing Machine A limitation of Turing Machines: Turing Machines are hardwired they execute only one program Real Computers are re-programmable Solution: Universal Turing Machine Attributes:
More informationINTRO TO MATH PROGRAMMING MA/OR 504, FALL 2015 LECTURE 11
INTRO TO MATH PROGRAMMING MA/OR 504, FALL 2015 LECTURE 11 A COMPLEXITY THEORY CRASH COURSE What is an algorithm? Precise definition requires a model of computation You might have heard some of these (won
More informationEECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates
EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs April 16, 2009 John Wawrzynek Spring 2009 EECS150 - Lec24-blocks Page 1 Cross-coupled NOR gates remember, If both R=0 & S=0, then
More informationUNIVERSITY OF BOLTON SCHOOL OF ENGINEERING MSC SYSTEMS ENGINEERING AND ENGINEERING MANAGEMENT SEMESTER 2 EXAMINATION 2015/20016
TW63 UNIVERSITY OF BOLTON SCHOOL OF ENGINEERING MSC SYSTEMS ENGINEERING AND ENGINEERING MANAGEMENT SEMESTER 2 EXAMINATION 2015/20016 MONITORING OF MECHANICAL SYSTEMS MODULE NO: EEM7018 Date: Thursday 19
More informationThe University of Georgia Department of Physics and Astronomy Graduate Qualifying Exam Part I (Dated: August 9, 2010)
The University of Georgia Department of Physics and Astronomy Graduate Qualifying Exam Part I (Dated: August 9, 010) Instructions: Attempt all problems. Start each problem on a new sheet of paper, and
More informationEconomic and Social Council Distr. LIMITED
UNITED NATIONS E Economic and Social Council Distr. LIMITED E/CONF.74/L.91 26 August 1982 ENGLISH ONLY Riurth United Nations Conference on the Standardization of Geographical Names Geneva, 24 August to
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 6 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter
More informationCPE100: Digital Logic Design I
Chapter 1 Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu http://www.ee.unlv.edu/~b1morris/cpe100/ CPE100: Digital Logic Design I Section 1004: Dr. Morris From Zero to One Chapter 1 Background:
More informationE40M. Binary Numbers. M. Horowitz, J. Plummer, R. Howe 1
E40M Binary Numbers M. Horowitz, J. Plummer, R. Howe 1 Reading Chapter 5 in the reader A&L 5.6 M. Horowitz, J. Plummer, R. Howe 2 Useless Box Lab Project #2 Adding a computer to the Useless Box alows us
More information(a) Definition of TMs. First Problem of URMs
Sec. 4: Turing Machines First Problem of URMs (a) Definition of the Turing Machine. (b) URM computable functions are Turing computable. (c) Undecidability of the Turing Halting Problem That incrementing
More informationLecture notes on Turing machines
Lecture notes on Turing machines Ivano Ciardelli 1 Introduction Turing machines, introduced by Alan Turing in 1936, are one of the earliest and perhaps the best known model of computation. The importance
More informationLecture (02) NAND and NOR Gates
Lecture (02) NAND and NOR Gates By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 2018, CSE303 Logic design II NAND gates and NOR gates In this section we will define NAND and NOR gates. Logic
More informationENGIN 112 Intro to Electrical and Computer Engineering
ENGIN 112 Intro to Electrical and Computer Engineering Lecture 2 Number Systems Russell Tessier KEB 309 G tessier@ecs.umass.edu Overview The design of computers It all starts with numbers Building circuits
More informationConversions between Decimal and Binary
Conversions between Decimal and Binary Binary to Decimal Technique - use the definition of a number in a positional number system with base 2 - evaluate the definition formula ( the formula ) using decimal
More informationForm #425 Page 1 of 6
Version Quiz #4 Form #425 Name: A Physics 2212 G Spring 2018 Recitation Section: Print your name, quiz form number (3 digits at the top of this form), and student number (9 digit Georgia Tech ID number)
More informationCURRICULUM MAPPING EXAMPLES. Topic: Key Concepts Activities/Demonstrators/Connections (Key Vocabulary in Bold Print)
CURRICULUM MAPPING EXAMPLES Grade : 9 Physical Science September Mid. Oct. Mid-Oct. November November Mid. Dec. January Mid. Feb. Topic: Key Concepts Activities/Demonstrators/Connections (Key Vocabulary
More informationChemistry Basic Science Concepts. Observations: are recorded using the senses. Examples: the paper is white; the air is cold; the drink is sweet.
Note Packet # 1 1 Chemistry: the study of matter. Chemistry Basic Science Concepts Matter: anything that has mass and occupies space. Observations: are recorded using the senses. Examples: the paper is
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 4 Following the slides of Dr. Ahmed H. Madian محرم 439 ه Winter 28
More informationECE260: Fundamentals of Computer Engineering
Data Representation & 2 s Complement James Moscola Dept. of Engineering & Computer Science York College of Pennsylvania Based on Computer Organization and Design, 5th Edition by Patterson & Hennessy Data
More information1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output.
Chapter 1.10 Logic Gates 1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output. Microprocessors are the central hardware that runs computers. There are several components that
More informationSelf-reproducing programs. And Introduction to logic. COS 116, Spring 2012 Adam Finkelstein
Self-reproducing programs. And Introduction to logic. COS 6, Spring 22 Adam Finkelstein Midterm One week from today in class Mar 5 Covers lectures, labs, homework, readings to date Old midterms will be
More informationLesson 3: Networks and Matrix Arithmetic
Opening Exercise Suppose a subway line also connects the four cities. Here is the subway and bus line network. The bus routes connecting the cities are represented by solid lines, and the subway routes
More informationWhy digital? Overview. Number Systems. Binary to Decimal conversion
Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not
More informationNumerical Methods Lecture 2 Simultaneous Equations
Numerical Methods Lecture 2 Simultaneous Equations Topics: matrix operations solving systems of equations pages 58-62 are a repeat of matrix notes. New material begins on page 63. Matrix operations: Mathcad
More informationChapter 5 Simplifying Formulas and Solving Equations
Chapter 5 Simplifying Formulas and Solving Equations Look at the geometry formula for Perimeter of a rectangle P = L W L W. Can this formula be written in a simpler way? If it is true, that we can simplify
More information