{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lecture5

# lecture5 - Discrete Computation Structures CSE 2353 Bhanu...

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

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

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

View Full Document
Lecture 05 Agenda I t Integers Algorithm, Format Conversion, GCD, Prime Numbers Recap for Quiz # 3 on Logic and Introduction to Algorithm 2
Integers: Learning Objectives Learn about the basic properties of integers Become aware how integers are represented in computer memory Division Algorithm I t R t ti i C t Integer Representation in Computers GCD Algorithm Learn about Prime Numbers 3

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

View Full Document
Integers Properties of Integers 4
Integers 5

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

View Full Document
Integers 6
Integers 7

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

View Full Document
Integers 8
Integers 9

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

View Full Document
Integers The div and mod operators div a div b the quotient of a and b obtained by b = the quotient of dividing a on b. Examples: 8 div 5 = 1 13 div 3 = 4 mod a mod b = the remainder of a and b obtained b the remainder of by dividing a on b 8 mod 5 = 3 13 mod 3 = 1 10
Integers 11

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

View Full Document
Integers 12
Integers 13

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

View Full Document
Integers 14