lecture5

lecture5 - Discrete Computation Structures CSE 2353 Bhanu...

Info iconThis preview shows pages 1–16. Sign up to view the full content.

View Full Document Right Arrow Icon
Discrete Computation Structures CSE 2353 Bhanu Kapoor, PhD Department of Computer Science & Engineering Southern Methodist University, Dallas, TX [email protected] , 214-336-4973 September 10, 2009 Embrey 129, SMU, Dallas, Texas Lecture 05 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 05 Agenda ± Integers ± Algorithm, Format Conversion, GCD, Prime Numbers ecap for Quiz # 3 on Logic and Introduction ± Recap for Quiz # 3 on Logic and Introduction to Algorithm 2
Background image of page 2
Integers: Learning Objectives ± Learn about the basic properties of integers ± Become aware how integers are represented in computer memory ± Division Algorithm ± Integer Representation in Computers ± GCD Algorithm ± Learn about Prime Numbers 3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Integers ± Properties of Integers 4
Background image of page 4
Integers 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Integers 6
Background image of page 6
Integers 7
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Integers 8
Background image of page 8
Integers 9
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Integers ± The div and mod operators ² div iv the quotient of nd btained by ± a div b = the quotient of a and b obtained by dividing a on b. ± Examples: div 5 = 1 ² 8 div 5 = 1 ² 13 div 3 = 4 ² mod od = the remainder of nd btained ± a mod b the remainder of a and b obtained by dividing a on b ² 8 mod 5 = 3 ² 13 mod 3 = 1 10
Background image of page 10
Integers 11
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Integers 12
Background image of page 12
Integers 13
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Integers 14
Background image of page 14
.
Background image of page 15

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 16
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/11/2009 for the course CSE 2353 taught by Professor Bhanukapoor during the Spring '09 term at SMU.

Page1 / 39

lecture5 - Discrete Computation Structures CSE 2353 Bhanu...

This preview shows document pages 1 - 16. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online