The ancient Egyptians used a decimal system in which pictographs were used to represent powers of 10.

Size: px
Start display at page:

Download "The ancient Egyptians used a decimal system in which pictographs were used to represent powers of 10."

Transcription

1 Section 3.1 The ancient Egyptians used a decimal system in which pictographs were used to represent powers of 10. Value Symbol Represents 1 Staff 10 Heel bone 100 Coil of rope 1,000 Lotus flower 10,000 Pointing finger 100,000 Tadpole 1,000,000 Astonished person Example: Example: Write 2,041,365 in Egyptian Hieroglyphs.

2 Section 3.2 Roman numerals use capital letters for different values, which are added together to get the number being represented (similar to Egyptian numerals). Symbol I V X L C D M Value "If Victor's X-ray Looks Clear, Don't Medicate" Roman numerals appear in things like buildings and copyrights. Generally speaking, symbols will be written left to right in decreasing value. LX = CC = DCXII = MDCCCLXXXVIII = Unlike Egyptian numerals, Roman numerals can pair two symbols together to lessen the value of the second symbol. This is called an increase. Possible increase pairs are: IV = IX = XL = XC = CD = CM = Notice how the values of the symbols increase from left to right. the value of the first symbol from the value of the second symbol. Increases must be done first (kind of like grouping symbols), then add up the values. DCCXCVI = MCMXLIX =

3 For numbers greater than or equal to 4,000 a bar is written over the number: One bar = multiply the number by 1,000 XLII XC CDV Example: Write using Roman numerals

4 Section 3.3 Our number system is called a base-10 place value system. Ten digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 Each "place" represents a power of 10 Powers increase from right to left The first power used is always Example: 27, However, other bases are or were used in certain applications or languages: Base 2 (binary): computers Base 4 (quaternary): Chumash Base 5 (quinary): Saraveca and Gumatj Base 8 (octal): computers Base 16 (hexadecimal): computers Base 60 (sexagesimal): Babylonian, time, angles When a number is written using another base, we will use the notation (number)base. Example: Write (2403)5 as a base 10 number. Five digits: Powers of! Change each number to base 10: (571)8 (1011)2 (1021)3

5 For hexadecimal (base 16), we need more than 10 digits, so letters are used in addition to numbers. Digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F A = B = C = D = E = F = Change each number to base 10: (5E)16 (1A2)16 To convert from base 10 to another base requires repeated subtraction or division (you will want a calculator for this). Example: Change 238 to base 5 (by subtraction) Example: Change 135 to octal and to binary. Example: Change 3391 to hexadecimal. Five hundred begins it, five hundred ends it, Five in the middle is seen; First of all letters, the first of all figures, Take up their stations between. Join all together, and then you will bring Before you the name of an eminent king.

6 Section 3.4 In 1947 the transistor was invented. Transistors are tiny switches that can be triggered by electric signals. They enabled the invention of the modern computer. In a computer, information is stored in memory as a bit (short for binary digit) using transistors. A bit is a basic unit of information used in computing and digital communications. A bit can only have one of two values and may be physically represented with a two-state device. These state values are most commonly represented as either a or. Think of representing the state when the switch (transistor) is on, and when it is off. The byte is a unit of digital information that most commonly consists of eight bits, representing a binary number. Think of a byte as a set of 8 switches, whose state is indicated by a 0 or 1. ASCII, abbreviated from American Standard Code for Information Interchange, is a character encoding standard for electronic communication that was introduced in ASCII codes represent in computers. Here is a table of some ASCII codes. We will only be interested in the alphabet characters. Upper case: Lower case: The computer will store an ASCII character as an 8-digit binary number (a byte). Example: Translate the binary code to English Example: Translate the word "Math" to ASCII (use base 10 codes).

7 Section 3.5 POSTNET stands for POSTal Numeric Encoding Technique. It is a barcode used by USPS to encode ZIP code information. How many bars for each digit? How many tall bars for each digit? How does it work? 1-12 in Binary Add 5 th bit Bars Renumber The number will help you find the value for each POSTNET code: The barcode starts and ends with a full bar (often called a guard rail) and has a check digit after the ZIP, ZIP+4, or delivery point.

8 To determine the check digit, first add up all of the digits in the Zip code. The check digit is chosen so that the sum of all digits in the barcode is a multiple of. Find the check digit for each ZIP code: Example: Write in POSTNET code. Check digit: Note: In 2009 the POSTNET barcode was replaced by Intelligent Mail barcode. The IM barcode is intended to provide greater information and functionality. It effectively incorporates the routing ZIP code and tracking information included in previously used postal barcode standards.

9 Section 3.6 In the Middle Ages, Königsberg, Prussia, became a very important city and trading center strategically positioned on the river. The healthy economy allowed the people of the city to build seven bridges across the river. The bridges were called Blacksmith s bridge, Connecting Bridge, Green Bridge, Merchant s Bridge, Wooden Bridge, High Bridge, and Honey Bridge. According to lore, the citizens of Königsberg used to spend Sunday afternoons walking, and they wondered if they could walk around the city crossing each of the seven bridges only once. None of the citizens of Königsberg could invent such a route, but they could not prove that it was impossible. Here is a map of Königsberg showing the river and seven bridges. Can you find a route? On August 26, 1735, Leonhard Euler presented a paper containing the solution to the Königsberg bridge problem. He addressed both this specific problem, as well as a general solution with any number of landmasses and any number of bridges. Euler accidentally sparked a new branch of mathematics called graph theory. A graph is a collection of and connecting them. We want to know if a graph is traversable, which means we can trace the graph following each edge just, without having to lift our pencil from the paper. Try it! It turns out, a graph is traversable if and only if it has or odd vertices. If odd vertices, start at one and you will end at the other. If it has odd vertices, it is called an Euler Circuit. You can start at any vertex, traverse the graph, and end back where you began.

10 Which graphs are traversable? Which are Euler circuits?

11 Section 3.7 We return to 18th century Königsberg. Could a citizen walk a path across all seven bridges without crossing a bridge twice? Euler proved it was. In 1875, the people of Königsberg decided to build a new bridge. Now is it traversable? Euler circuit? Is this an Euler circuit?

12 Is this an Euler circuit? What is the minimum number of bridges to burn so that it is? Modern applications of graph theory:

13 Section 3.8 Like bridge problems, we can try to find routes through buildings with multiple rooms and doors. For example, can you pass through all the rooms while going through each door only once? Try it! We can use graph theory to solve this! Represent each room and the outside as a vertex, and each doorway as an edge. You can also just count the number of doorways to each room (including the outside). Is the game of Clue traversable?

Graph Theory Problems Instructor: Natalya St. Clair. 1 The Seven Bridges of Königsberg Problem

Graph Theory Problems Instructor: Natalya St. Clair. 1 The Seven Bridges of Königsberg Problem Graph Theory Problems erkeley Math ircles 2015 Lecture Notes Graph Theory Problems Instructor: Natalya St. lair 1 The Seven ridges of Königsberg Problem Königsberg is an ancient city of Prussia, now Kalingrad,

More information

Graph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC January 26, 2011

Graph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC   January 26, 2011 Graph Theory Martin Stynes Department of Mathematics, UCC email: m.stynes@ucc.ie January 26, 2011 1 Introduction to Graphs 1 A graph G = (V, E) is a non-empty set of nodes or vertices V and a (possibly

More information

Digital Fundamentals

Digital Fundamentals Digital Fundamentals Tenth Edition Floyd Chapter 2 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. All Rights Reserved Decimal Numbers The position of each digit in a weighted

More information

FINDING THE RIGHT PATH

FINDING THE RIGHT PATH Task 1: Seven Bridges of Konigsberg! Today we are going to begin with the story of Konigsberg in the 18 th century, its geography, bridges, and the question asked by its citizens. FINDING THE RIGHT PATH

More information

14.2 Euler Paths and Circuits filled in.notebook November 18, Euler Paths and Euler Circuits

14.2 Euler Paths and Circuits filled in.notebook November 18, Euler Paths and Euler Circuits 14.2 Euler Paths and Euler Circuits The study of graph theory can be traced back to the eighteenth century when the people of the town of Konigsberg sought a solution to a popular problem. They had sections

More information

11-5 Networks. Königsberg Bridge Problem

11-5 Networks. Königsberg Bridge Problem Section 11-5 Networks 1 11-5 Networks In the 1700s, the people of Königsberg, Germany (now Kaliningrad in Russia), used to enjoy walking over the bridges of the Pregel River. There were three landmasses

More information

6.2. Paths and Cycles

6.2. Paths and Cycles 6.2. PATHS AND CYCLES 85 6.2. Paths and Cycles 6.2.1. Paths. A path from v 0 to v n of length n is a sequence of n+1 vertices (v k ) and n edges (e k ) of the form v 0, e 1, v 1, e 2, v 2,..., e n, v n,

More information

Digital Fundamentals

Digital Fundamentals Digital Fundamentals Tenth Edition Floyd Chapter 2 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. All Rights Reserved Quiz 2 Agenda Lecture: Chapter 2 (2-7 through 2-11):

More information

Mohammad A. Yazdani, Ph.D. Abstract

Mohammad A. Yazdani, Ph.D. Abstract Utilizing Euler s Approach in Solving Konigsberg Bridge Problem to Identify Similar Traversable Networks in a Dynamic Geometry Teacher Education Environment: An Instructional Activity Mohammad A. Yazdani,

More information

CHAPTER 10 GRAPHS AND TREES. Alessandro Artale UniBZ - artale/z

CHAPTER 10 GRAPHS AND TREES. Alessandro Artale UniBZ -  artale/z CHAPTER 10 GRAPHS AND TREES Alessandro Artale UniBZ - http://www.inf.unibz.it/ artale/z SECTION 10.1 Graphs: Definitions and Basic Properties Copyright Cengage Learning. All rights reserved. Graphs: Definitions

More information

Brief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions

Brief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions Brief History Graph Theory What is a graph? It all began in 1736 when Leonhard Euler gave a proof that not all seven bridges over the Pregolya River could all be walked over once and end up where you started.

More information

Graph Theory

Graph Theory Graph Theory 2012.04.18 Our goal today is to learn some basic concepts in graph theory and explore fun problems using graph theory. A graph is a mathematical object that captures the notion of connection.

More information

AQR UNIT 7. Circuits, Paths, and Graph Structures. Packet #

AQR UNIT 7. Circuits, Paths, and Graph Structures. Packet # AQR UNIT 7 NETWORKS AND GRAPHS: Circuits, Paths, and Graph Structures Packet # BY: Introduction to Networks and Graphs: Try drawing a path for a person to walk through each door exactly once without going

More information

of Nebraska - Lincoln

of Nebraska - Lincoln University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-2008 De Bruijn Cycles Val Adams University of Nebraska

More information

Launch problem: Lining streets

Launch problem: Lining streets Math 5340 June 15,2012 Dr. Cordero Launch problem: Lining streets Lining Street Problem A Problem on Eulerian Circuits http://www.edmath.org/mattours/discrete/ Your job for the day is to drive slowly around

More information

Discussion. Why do we use Base 10?

Discussion. Why do we use Base 10? MEASURING DATA Data (the plural of datum) are anything in a form suitable for use with a computer. Whatever a computer receives as an input is data. Data are raw facts without any clear meaning. Computers

More information

Memory Addressing, Binary, and Hexadecimal Review

Memory Addressing, Binary, and Hexadecimal Review C++ By A EXAMPLE Memory Addressing, Binary, and Hexadecimal Review You do not have to understand the concepts in this appendix to become well-versed in C++. You can master C++, however, only if you spend

More information

The Bridges of Konigsberg Problem Can you walk around the town crossing each bridge only once?

The Bridges of Konigsberg Problem Can you walk around the town crossing each bridge only once? The Bridges of Konigsberg Problem Can you walk around the town crossing each bridge only once? Many people had tried the walk and felt that it was impossible, but no one knew for sure. In 1736, Leonard

More information

Chapter 3 DATA REPRESENTATION

Chapter 3 DATA REPRESENTATION Page1 Chapter 3 DATA REPRESENTATION Digital Number Systems In digital systems like computers, the quantities are represented by symbols called digits. Many number systems are in use in digital technology

More information

The premature state of Topology and Graph Theory nourished by Seven Bridges of Königsberg Problem

The premature state of Topology and Graph Theory nourished by Seven Bridges of Königsberg Problem The premature state of Topology and Graph Theory nourished by Seven Bridges of Königsberg Problem Damodar Rajbhandari Many many years ago, There was a problem which created a mind-boggling puzzle to the

More information

Chapter 1. Urban Services. Chapter Outline. Chapter Summary

Chapter 1. Urban Services. Chapter Outline. Chapter Summary Chapter 1 Urban Services Chapter Outline Introduction Section 1.1 Euler Circuits Section 1.2 Finding Euler Circuits Section 1.3 Beyond Euler Circuits Section 1.4 Urban Graph Traversal Problems Chapter

More information

Numeral Systems. -Numeral System -Positional systems -Decimal -Binary -Octal. Subjects:

Numeral Systems. -Numeral System -Positional systems -Decimal -Binary -Octal. Subjects: Numeral Systems -Numeral System -Positional systems -Decimal -Binary -Octal Subjects: Introduction A numeral system (or system of numeration) is a writing system for expressing numbers, that is a mathematical

More information

Number Systems. Dr. Tarek A. Tutunji Philadelphia University, Jordan

Number Systems. Dr. Tarek A. Tutunji Philadelphia University, Jordan Number Systems Dr. Tarek A. Tutunji Philadelphia University, Jordan Number Systems Programmable controllers use binary numbers in one form or another to represent various codes and quantities. Every number

More information

Sarah Will Math 490 December 2, 2009

Sarah Will Math 490 December 2, 2009 Sarah Will Math 490 December 2, 2009 Euler Circuits INTRODUCTION Euler wrote the first paper on graph theory. It was a study and proof that it was impossible to cross the seven bridges of Königsberg once

More information

Chapter 2 Exercises and Answers

Chapter 2 Exercises and Answers Chapter 2 Exercises and nswers nswers are in blue. For Exercises -5, match the following numbers with their definition.. Number. Natural number C. Integer number D. Negative number E. Rational number unit

More information

Graph Theory. 26 March Graph Theory 26 March /29

Graph Theory. 26 March Graph Theory 26 March /29 Graph Theory 26 March 2012 Graph Theory 26 March 2012 1/29 Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study. However,

More information

08. First and second degree equations

08. First and second degree equations 08. First and second degree equations GRAPH THEORY Based on Chris K. Caldwell work: http://primes.utm.edu/cgi-bin/caldwell/tutor/graph/index.html INTRODUCTION Consider the next problem: Old Königsberg

More information

Chapter 3: Number Systems and Codes. Textbook: Petruzella, Frank D., Programmable Logic Controllers. McGraw Hill Companies Inc.

Chapter 3: Number Systems and Codes. Textbook: Petruzella, Frank D., Programmable Logic Controllers. McGraw Hill Companies Inc. Chapter 3: Number Systems and Codes Textbook: Petruzella, Frank D., Programmable Logic Controllers. McGraw Hill Companies Inc., 5 th edition Decimal System The radix or base of a number system determines

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CMPS Introduction to Computer Science Lecture Notes Binary Numbers Until now we have considered the Computing Agent that executes algorithms to be an abstract entity. Now we will be concerned with techniques

More information

Introduction to Networks

Introduction to Networks LESSON 1 Introduction to Networks Exploratory Challenge 1 One classic math puzzle is the Seven Bridges of Königsberg problem which laid the foundation for networks and graph theory. In the 18th century

More information

Chapter 5: The Mathematics of Getting Around

Chapter 5: The Mathematics of Getting Around Euler Paths and Circuits Chapter 5: The Mathematics of Getting Around 5.1 Street-Routing Problem Our story begins in the 1700s in the medieval town of Königsberg, in Eastern Europe. At the time, Königsberg

More information

Junior Circle Meeting 3 Circuits and Paths. April 18, 2010

Junior Circle Meeting 3 Circuits and Paths. April 18, 2010 Junior Circle Meeting 3 Circuits and Paths April 18, 2010 We have talked about insect worlds which consist of cities connected by tunnels. Here is an example of an insect world (Antland) which we saw last

More information

Math 110 Graph Theory II: Circuits and Paths

Math 110 Graph Theory II: Circuits and Paths Math 110 Graph Theory II: Circuits and Paths For Next Time. Read Section 6.1 Circuit Training (p. 386ff) for more background on this material. Review the definition of a graph. Make sure you understand

More information

Intermediate Math Circles Wednesday, February 22, 2017 Graph Theory III

Intermediate Math Circles Wednesday, February 22, 2017 Graph Theory III 1 Eulerian Graphs Intermediate Math Circles Wednesday, February 22, 2017 Graph Theory III Let s begin this section with a problem that you may remember from lecture 1. Consider the layout of land and water

More information

Beyond Base 10: Non-decimal Based Number Systems

Beyond Base 10: Non-decimal Based Number Systems Beyond Base : Non-decimal Based Number Systems What is the decimal based number system? How do other number systems work (binary, octal and hex) How to convert to and from nondecimal number systems to

More information

Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths

Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths The Königsberg Bridge Problem The following figure shows the rivers and bridges of Königsberg. Residents of the city occupied themselves by trying to find a walking path through the city that began and

More information

Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths

Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths The Königsberg Bridge Problem The following figure shows the rivers and bridges of Königsberg. Residents of the city occupied themselves by trying to find a walking path through the city that began and

More information

Binary Representation. Jerry Cain CS 106AJ October 29, 2018 slides courtesy of Eric Roberts

Binary Representation. Jerry Cain CS 106AJ October 29, 2018 slides courtesy of Eric Roberts Binary Representation Jerry Cain CS 106AJ October 29, 2018 slides courtesy of Eric Roberts Once upon a time... Claude Shannon Claude Shannon was one of the pioneers who shaped computer science in its early

More information

TOPIC: NUMBER SYSTEMS

TOPIC: NUMBER SYSTEMS Ministry of Secondary Education Progressive Comprehensive High School PCHS Mankon Bamenda Department of Computer Studies Republic of Cameroon Peace Work - Fatherland TOPIC: NUMBER SYSTEMS Class: Comp.

More information

Digital Fundamentals. CHAPTER 2 Number Systems, Operations, and Codes

Digital Fundamentals. CHAPTER 2 Number Systems, Operations, and Codes Digital Fundamentals CHAPTER 2 Number Systems, Operations, and Codes Decimal Numbers The decimal number system has ten digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 The decimal numbering system has a base of

More information

Circuits and Paths. April 13, 2014

Circuits and Paths. April 13, 2014 Circuits and Paths April 13, 2014 Warm Up Problem Quandroland is an insect country that has four cities. Draw all possible ways tunnels can join the cities in Quadroland. (Remember that some cities might

More information

The Building Blocks: Binary Numbers, Boolean Logic, and Gates. Purpose of Chapter. External Representation of Information.

The Building Blocks: Binary Numbers, Boolean Logic, and Gates. Purpose of Chapter. External Representation of Information. The Building Blocks: Binary Numbers, Boolean Logic, and Gates Chapter 4 Representing Information The Binary Numbering System Boolean Logic and Gates Building Computer Circuits Control Circuits CMPUT Introduction

More information

Using sticks to count was a great idea for its time. And using symbols instead of real sticks was much better.

Using sticks to count was a great idea for its time. And using symbols instead of real sticks was much better. 2- Numbering Systems Tutorial 2-1 What is it? There are many ways to represent the same numeric value. Long ago, humans used sticks to count, and later learned how to draw pictures of sticks in the ground

More information

[301] Bits and Memory. Tyler Caraza-Harter

[301] Bits and Memory. Tyler Caraza-Harter [301] Bits and Memory Tyler Caraza-Harter Ones and Zeros 01111111110101011000110010011011000010010001100110101101 01000101110110000000110011101011101111000110101010010011 00011000100110001010111010110001010011101000100110100000

More information

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7 CS 70 Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7 An Introduction to Graphs A few centuries ago, residents of the city of Königsberg, Prussia were interested in a certain problem.

More information

Chapter 4: Computer Codes. In this chapter you will learn about:

Chapter 4: Computer Codes. In this chapter you will learn about: Ref. Page Slide 1/30 Learning Objectives In this chapter you will learn about: Computer data Computer codes: representation of data in binary Most commonly used computer codes Collating sequence Ref. Page

More information

BINARY SYSTEM. Binary system is used in digital systems because it is:

BINARY SYSTEM. Binary system is used in digital systems because it is: CHAPTER 2 CHAPTER CONTENTS 2.1 Binary System 2.2 Binary Arithmetic Operation 2.3 Signed & Unsigned Numbers 2.4 Arithmetic Operations of Signed Numbers 2.5 Hexadecimal Number System 2.6 Octal Number System

More information

Graphs. Reading Assignment. Mandatory: Chapter 3 Sections 3.1 & 3.2. Peeking into Computer Science. Jalal Kawash 2010

Graphs. Reading Assignment. Mandatory: Chapter 3 Sections 3.1 & 3.2. Peeking into Computer Science. Jalal Kawash 2010 Graphs Mandatory: hapter 3 Sections 3.1 & 3.2 Reading ssignment 2 Graphs bstraction of ata 3 t the end of this section, you will be able to: 1.efine directed and undirected graphs 2.Use graphs to model

More information

Beyond Base 10: Non-decimal Based Number Systems

Beyond Base 10: Non-decimal Based Number Systems Beyond Base : Non-decimal Based Number Systems What is the decimal based number system? How do other number systems work (binary, octal and hex) How to convert to and from nondecimal number systems to

More information

Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study.

Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study. Graph Theory Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study. However, it wasn t studied too systematically until

More information

Data Representation 1

Data Representation 1 1 Data Representation Outline Binary Numbers Adding Binary Numbers Negative Integers Other Operations with Binary Numbers Floating Point Numbers Character Representation Image Representation Sound Representation

More information

IT 1204 Section 2.0. Data Representation and Arithmetic. 2009, University of Colombo School of Computing 1

IT 1204 Section 2.0. Data Representation and Arithmetic. 2009, University of Colombo School of Computing 1 IT 1204 Section 2.0 Data Representation and Arithmetic 2009, University of Colombo School of Computing 1 What is Analog and Digital The interpretation of an analog signal would correspond to a signal whose

More information

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around 1 Finite Math A Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around Academic Standards Covered in this Chapter: *************************************************************************************

More information

Instant Insanity Instructor s Guide Make-it and Take-it Kit for AMTNYS 2006

Instant Insanity Instructor s Guide Make-it and Take-it Kit for AMTNYS 2006 Instant Insanity Instructor s Guide Make-it and Take-it Kit for AMTNYS 2006 THE KIT: This kit contains materials for two Instant Insanity games, a student activity sheet with answer key and this instructor

More information

Discrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs

Discrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 13 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite to writing a

More information

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around 1 Finite Math A Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around Academic Standards Covered in this Chapter: *************************************************************************************

More information

CDS Computing for Scientists. Midterm Exam Review. Midterm Exam on October 22, 2013

CDS Computing for Scientists. Midterm Exam Review. Midterm Exam on October 22, 2013 CDS 130-001 Computing for Scientists Midterm Exam Review Midterm Exam on October 22, 2013 1. Review Sheet 2. Sample Midterm Exam CDS 130-001 Computing for Scientists Midterm Exam - Review Sheet The following

More information

CC411: Introduction To Microprocessors

CC411: Introduction To Microprocessors CC411: Introduction To Microprocessors OBJECTIVES this chapter enables the student to: Use number { base 2, base 10, or base 16 }. Add and subtract binary/hex numbers. Represent any binary number in 2

More information

Characterization of Graphs with Eulerian Circuits

Characterization of Graphs with Eulerian Circuits Eulerian Circuits 3. 73 Characterization of Graphs with Eulerian Circuits There is a simple way to determine if a graph has an Eulerian circuit. Theorems 3.. and 3..2: Let G be a pseudograph that is connected

More information

Section 3.4 Basic Results of Graph Theory

Section 3.4 Basic Results of Graph Theory 1 Basic Results of Graph Theory Section 3.4 Basic Results of Graph Theory Purpose of Section: To formally introduce the symmetric relation of a (undirected) graph. We introduce such topics as Euler Tours,

More information

MATH 113 Section 9.2: Topology

MATH 113 Section 9.2: Topology MATH 113 Section 9.2: Topology Prof. Jonathan Duncan Walla Walla College Winter Quarter, 2007 Outline 1 Introduction to Topology 2 Topology and Childrens Drawings 3 Networks 4 Conclusion Geometric Topology

More information

Pre-Calculus. Slide 1 / 192. Slide 2 / 192. Slide 3 / 192. Matrices

Pre-Calculus. Slide 1 / 192. Slide 2 / 192. Slide 3 / 192. Matrices Slide 1 / 192 Pre-Calculus Slide 2 / 192 Matrices 2015-03-23 www.njctl.org Table of Content Introduction to Matrices Matrix Arithmetic Scalar Multiplication Addition Subtraction Multiplication Solving

More information

Pre-Calculus Matrices

Pre-Calculus Matrices Slide 1 / 192 Slide 2 / 192 Pre-Calculus Matrices 2015-03-23 www.njctl.org Slide 3 / 192 Table of Content Introduction to Matrices Matrix Arithmetic Scalar Multiplication Addition Subtraction Multiplication

More information

New Jersey Center for Teaching and Learning. Progressive Mathematics Initiative

New Jersey Center for Teaching and Learning. Progressive Mathematics Initiative Slide 1 / 192 New Jersey Center for Teaching and Learning Progressive Mathematics Initiative This material is made freely available at www.njctl.org and is intended for the non-commercial use of students

More information

Crossing bridges. Crossing bridges Great Ideas in Theoretical Computer Science. Lecture 12: Graphs I: The Basics. Königsberg (Prussia)

Crossing bridges. Crossing bridges Great Ideas in Theoretical Computer Science. Lecture 12: Graphs I: The Basics. Königsberg (Prussia) 15-251 Great Ideas in Theoretical Computer Science Lecture 12: Graphs I: The Basics February 22nd, 2018 Crossing bridges Königsberg (Prussia) Now Kaliningrad (Russia) Is there a way to walk through the

More information

Commutative property. Associative property. Distributive property

Commutative property. Associative property. Distributive property Math 4. Class work 4. Algebra Addition Multiplication a+b=b+a Commutative a b=b a a+(b+c)=(a+b)+c Associative a (b c)=(a b) c Distributive a (b+c)=a b + a c a (b c)=a b a c Commutative and associative

More information

Pre-Calculus. Introduction to Matrices. Slide 1 / 192 Slide 2 / 192. Slide 3 / 192. Slide 4 / 192. Slide 6 / 192. Slide 5 / 192. Matrices

Pre-Calculus. Introduction to Matrices. Slide 1 / 192 Slide 2 / 192. Slide 3 / 192. Slide 4 / 192. Slide 6 / 192. Slide 5 / 192. Matrices Slide 1 / 192 Slide 2 / 192 Pre-Calculus Matrices 2015-03-23 www.njctl.org Slide 3 / 192 Content Introduction to Matrices Matrix Arithmetic Scalar Multiplication Addition Subtraction Multiplication Solving

More information

Graph Theory. Defining a Graph

Graph Theory. Defining a Graph Graph Theory This topic is one of the most applicable to real-life applications because all networks (computer, transportation, communication, organizational, etc.) can be represented with a graph. For

More information

Review of Number Systems

Review of Number Systems Review of Number Systems The study of number systems is important from the viewpoint of understanding how data are represented before they can be processed by any digital system including a digital computer.

More information

Beyond the Euler Trail. Mathematics is often thought of as formulas, ratios, and the number Pi. The history of

Beyond the Euler Trail. Mathematics is often thought of as formulas, ratios, and the number Pi. The history of Patino 1 Prof. Petersen Sierra Patino Math 101 Section 4939 6 April 2016 Beyond the Euler Trail Mathematics is often thought of as formulas, ratios, and the number Pi. The history of math and its roots

More information

The Gray Code. Script

The Gray Code. Script Course: B.Sc. Applied Physical Science (Computer Science) Year & Sem.: IInd Year, Sem - IIIrd Subject: Computer Science Paper No.: IX Paper Title: Computer System Architecture Lecture No.: 9 Lecture Title:

More information

Euler and Hamilton circuits. Euler paths and circuits

Euler and Hamilton circuits. Euler paths and circuits 1 7 16 2013. uler and Hamilton circuits uler paths and circuits o The Seven ridges of Konigsberg In the early 1700 s, Konigsberg was the capital of ast Prussia. Konigsberg was later renamed Kaliningrad

More information

NUMBER SENSE AND OPERATIONS. Competency 0001 Understand the structure of numeration systems and multiple representations of numbers.

NUMBER SENSE AND OPERATIONS. Competency 0001 Understand the structure of numeration systems and multiple representations of numbers. SUBAREA I. NUMBER SENSE AND OPERATIONS Competency 0001 Understand the structure of numeration systems and multiple representations of numbers. Prime numbers are numbers that can only be factored into 1

More information

Lecture (02) Operations on numbering systems

Lecture (02) Operations on numbering systems Lecture (02) Operations on numbering systems By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 2018, CSE202 Logic Design I Complements of a number Complements are used in digital computers to simplify

More information

Logic and Computer Design Fundamentals. Chapter 1 Digital Computers and Information

Logic and Computer Design Fundamentals. Chapter 1 Digital Computers and Information Logic and Computer Design Fundamentals Chapter 1 Digital Computers and Information Overview Digital Systems and Computer Systems Information Representation Number Systems [binary, octal and hexadecimal]

More information

Math You ve Gotta Have This Book!

Math You ve Gotta Have This Book! If You re Trying to Get Better Grades & Higher Test Scores in Math You ve Gotta Have This Book! Grades 4-6 By Imogene Forte & Marjorie Frank Incentive Publications, Inc. Nashville, Tennessee Illustrated

More information

Agenda EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 1: Introduction. Go over the syllabus 3/31/2010

Agenda EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 1: Introduction. Go over the syllabus 3/31/2010 // EE : INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN Lecture : Introduction /9/ Avinash Kodi, kodi@ohio.edu Agenda Go over the syllabus Introduction ti to Digital it Systems // Why Digital Systems?

More information

Dec Hex Bin ORG ; ZERO. Introduction To Computing

Dec Hex Bin ORG ; ZERO. Introduction To Computing Dec Hex Bin 0 0 00000000 ORG ; ZERO Introduction To Computing OBJECTIVES this chapter enables the student to: Convert any number from base 2, base 10, or base 16 to any of the other two bases. Add and

More information

Excerpt from: Stephen H. Unger, The Essence of Logic Circuits, Second Ed., Wiley, 1997

Excerpt from: Stephen H. Unger, The Essence of Logic Circuits, Second Ed., Wiley, 1997 Excerpt from: Stephen H. Unger, The Essence of Logic Circuits, Second Ed., Wiley, 1997 APPENDIX A.1 Number systems and codes Since ten-fingered humans are addicted to the decimal system, and since computers

More information

Math 3336 Section 6.1 The Basics of Counting The Product Rule The Sum Rule The Subtraction Rule The Division Rule

Math 3336 Section 6.1 The Basics of Counting The Product Rule The Sum Rule The Subtraction Rule The Division Rule Math 3336 Section 6.1 The Basics of Counting The Product Rule The Sum Rule The Subtraction Rule The Division Rule Examples, Examples, and Examples Tree Diagrams Basic Counting Principles: The Product Rule

More information

An Introduction to Graph Theory

An Introduction to Graph Theory An Introduction to Graph Theory Evelyne Smith-Roberge University of Waterloo March 22, 2017 What is a graph? Definition A graph G is: a set V (G) of objects called vertices together with: a set E(G), of

More information

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite

More information

Chapter 8 Topics in Graph Theory

Chapter 8 Topics in Graph Theory Chapter 8 Topics in Graph Theory Chapter 8: Topics in Graph Theory Section 8.1: Examples {1,2,3} Section 8.2: Examples {1,2,4} Section 8.3: Examples {1} 8.1 Graphs Graph A graph G consists of a finite

More information

Objectives. Connecting with Computer Science 2

Objectives. Connecting with Computer Science 2 Objectives Learn why numbering systems are important to understand Refresh your knowledge of powers of numbers Learn how numbering systems are used to count Understand the significance of positional value

More information

MTH-129 Review for Test 4 Luczak

MTH-129 Review for Test 4 Luczak MTH-129 Review for Test 4 Luczak 1. On each of three consecutive days the National Weather Service announces that there is a 50-50 chance of rain. Assuming that they are correct, answer the following:

More information

CHW 261: Logic Design

CHW 261: Logic Design CHW 261: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed14 http://bu.edu.eg/staff/ahmedshalaby14# Slide 1 Slide 2 Slide 3 Digital Fundamentals CHAPTER

More information

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. Numbers & Number Systems

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. Numbers & Number Systems SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics Numbers & Number Systems Introduction Numbers and Their Properties Multiples and Factors The Division Algorithm Prime and Composite Numbers Prime Factors

More information

Computer Arithmetic. In this article we look at the way in which numbers are represented in binary form and manipulated in a computer.

Computer Arithmetic. In this article we look at the way in which numbers are represented in binary form and manipulated in a computer. Computer Arithmetic In this article we look at the way in which numbers are represented in binary form and manipulated in a computer. Numbers have a long history. In Europe up to about 400 numbers were

More information

Understand graph terminology Implement graphs using

Understand graph terminology Implement graphs using raphs Understand graph terminology Implement graphs using djacency lists and djacency matrices Perform graph searches Depth first search Breadth first search Perform shortest-path algorithms Disjkstra

More information

CE161-4-AU UNIVERSITY OF ESSEX. Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE. Time allowed: TWO hours

CE161-4-AU UNIVERSITY OF ESSEX. Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE. Time allowed: TWO hours CE161-4-AU UNIVERSITY OF ESSEX Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE Time allowed: TWO hours The following items are provided: Graph paper (available on invigilator s desk) Candidates

More information

Graphs And Algorithms

Graphs And Algorithms Graphs nd lgorithms Mandatory: hapter 3 Sections 3.1 & 3.2 Reading ssignment 2 1 Graphs bstraction of ata 3 t the end of this section, you will be able to: 1. efine directed and undirected graphs 2. Use

More information

umber Systems bit nibble byte word binary decimal

umber Systems bit nibble byte word binary decimal umber Systems Inside today s computers, data is represented as 1 s and 0 s. These 1 s and 0 s might be stored magnetically on a disk, or as a state in a transistor. To perform useful operations on these

More information

Review of Data Representation & Binary Operations Dhananjai M. Rao CSA Department Miami University

Review of Data Representation & Binary Operations Dhananjai M. Rao CSA Department Miami University Review of Data Representation & Binary Operations Dhananjai M. Rao () CSA Department Miami University 1. Introduction In digital computers all data including numbers, characters, and strings are ultimately

More information

DIGITAL SYSTEM DESIGN

DIGITAL SYSTEM DESIGN DIGITAL SYSTEM DESIGN UNIT I: Introduction to Number Systems and Boolean Algebra Digital and Analog Basic Concepts, Some history of Digital Systems-Introduction to number systems, Binary numbers, Number

More information

Sections 5.2, 5.3. & 5.4

Sections 5.2, 5.3. & 5.4 MATH 11008: Graph Theory Terminology Sections 5.2, 5.3. & 5.4 Routing problem: A routing problem is concerned with finding ways to route the delivery of good and/or services to an assortment of destinations.

More information

Encryption à la Mod Name

Encryption à la Mod Name Rock Around the Clock Part Encryption à la Mod Let s call the integers,, 3,, 5, and the mod 7 encryption numbers and define a new mod 7 multiplication operation, denoted by, in the following manner: a

More information

Number System. Introduction. Decimal Numbers

Number System. Introduction. Decimal Numbers Number System Introduction Number systems provide the basis for all operations in information processing systems. In a number system the information is divided into a group of symbols; for example, 26

More information

Salvador Sanabria History of Mathematics. Königsberg Bridge Problem

Salvador Sanabria History of Mathematics. Königsberg Bridge Problem Salvador Sanabria History of Mathematics Königsberg Bridge Problem The Problem of the Königsberg Bridge There is a famous story from Konigsberg. The city of Konigsberg, Northern Germany has a significant

More information

CHAPTER 10 GRAPHS AND TREES. Copyright Cengage Learning. All rights reserved.

CHAPTER 10 GRAPHS AND TREES. Copyright Cengage Learning. All rights reserved. CHAPTER 10 GRAPHS AND TREES Copyright Cengage Learning. All rights reserved. SECTION 10.1 Graphs: Definitions and Basic Properties Copyright Cengage Learning. All rights reserved. Graphs: Definitions and

More information

Multiplying and Dividing by Powers of 10

Multiplying and Dividing by Powers of 10 Multiplying and Dividing by Powers of 10 1.) Complete stations A-F around the room. Copy each problem and answer it below. Problem A B C D E F Answer = = = = = = 2.) Where is the decimal point in a whole

More information