Week 1

Chapter 1: Basic Concepts

Class 2,3
 Translating Binary to Decimal

Weighted positional notation shows how to calculate the

decimal value of each binary bit:
dec = (Dn-1 × 2n-1) + (Dn-2 × 2n-2) + ... + (D1 × 21) + (D0 × 20)
D = binary digit

binary 00001001 = decimal 9:

(1 × 23) + (1 × 20) = 9

21
 Translating Unsigned Decimal to Binary
• Repeatedly divide the decimal integer by 2. Each
remainder is a binary digit in the translated value:

37 = 100101

22
 Binary Addition
• Starting with the LSB, add each pair of digits, include
the carry if present.

carry: 1

0 0 0 0 0 1 0 0 (4)

+ 0 0 0 0 0 1 1 1 (7)

0 0 0 0 1 0 1 1 (11)
bit position: 7 6 5 4 3 2 1 0

23
 Integer Storage Sizes
byte 8

Standard sizes: word 16

doubleword 32
quadword 64

What is the largest unsigned integer that may be stored in 20 bits?

24
 Hexadecimal Integers
Binary values are represented in hexadecimal.

25
 Translating Binary to Hexadecimal

• Each hexadecimal digit corresponds to 4 binary bits.

• Example: Translate the binary integer
000101101010011110010100 to hexadecimal:

26
 Converting Hexadecimal to Decimal

• Multiply each digit by its corresponding power of 16:

dec = (D3 × 163) + (D2 × 162) + (D1 × 161) + (D0 × 160)

• Hex 1234 equals (1 × 163) + (2 × 162) + (3 × 161) + (4 × 160), or

decimal 4,660.

• Hex 3BA4 equals (3 × 163) + (11 * 162) + (10 × 161) + (4 × 160), or

decimal 15,268.

27
 Powers of 16

Used when calculating hexadecimal values up to 8 digits

long:

28
Converting Decimal to Hexadecimal

decimal 422 = 1A6 hexadecimal

29
 Hexadecimal Addition

• Divide the sum of two digits by the number base (16). The quotient
becomes the carry value, and the remainder is the sum digit.

1 1
36 28 28 6A
42 45 58 4B
78 6D 80 B5

21 / 16 = 1, rem 5

30
 Hexadecimal Subtraction

• When a borrow is required from the digit to the left, add 16

(decimal) to the current digit's value:

16 + 5 = 21

−1
C6 75
A2 47
24 2E

Practice: The address of var1 is 00400020. The address of the next

variable after var1 is 0040006A. How many bytes are used by var1?

31
 Signed Integers
The highest bit indicates the sign. 1 = negative,
0 = positive

sign bit

1 1 1 1 0 1 1 0
Negative

0 0 0 0 1 0 1 0 Positive

If the highest digit of a hexadecimal integer is > 7, the value is

negative. Examples: 8A, C5, A2, 9D

32
 Forming the Two's Complement
• Negative numbers are stored in two's complement
notation
• Represents the additive Inverse

Note that 00000001 + 11111111 = 00000000

33
 Binary Subtraction
• When subtracting A – B, convert B to its two's
complement
• Add A to (–B)

00001100 00001100
– 00000011 11111101
00001001

Practice: Subtract 0101 from 1001.

34
 Learn How To Do the Following:

• Form the two's complement of a hexadecimal integer

• Convert signed binary to decimal
• Convert signed decimal to binary
• Convert signed decimal to hexadecimal
• Convert signed hexadecimal to decimal

See Book's page No 16, 17

35
 Ranges of Signed Integers

The highest bit is reserved for the sign. This limits the range:

Practice: What is the largest positive value that may be stored in 20 bits?

36
 Character Storage
• Character sets
• Standard ASCII (0 – 127)
• Extended ASCII (0 – 255)
• ANSI (0 – 255)
• Unicode (0 – 65,535)
• Null-terminated String
• Array of characters followed by a null byte
• Using the ASCII table
• back inside cover of book

See Book's page No 19

37
Numeric Data Representation

• pure binary
• can be calculated directly
• ASCII binary
• string of digits: "01010101"
• ASCII decimal
• string of digits: "65"
• ASCII hexadecimal
• string of digits: "9C"

38
 What's Next

• Welcome to Assembly Language

• Virtual Machine Concept
• Data Representation
• Boolean Operations

39
 Boolean Operations

• NOT
• AND
• OR
• Operator Precedence
• Truth Tables

40
 Boolean Algebra

• Based on symbolic logic, designed by George Boole

• Boolean expressions created from:
• NOT, AND, OR

41
 NOT

• Inverts (reverses) a boolean value

• Truth table for Boolean NOT operator:

Digital gate diagram for NOT:

NOT

42
 AND
• Truth table for Boolean AND operator:

Digital gate diagram for AND:

AND

43
 OR
• Truth table for Boolean OR operator:

Digital gate diagram for OR:

OR

44
 Operator Precedence

• Examples showing the order of operations:

45
 Truth Tables (1 of 3)
• A Boolean function has one or more Boolean inputs,
and returns a single Boolean output.
• A truth table shows all the inputs and outputs of a
Boolean function

Example: ¬X ∨ Y

46
 Truth Tables (2 of 3)
• Example: X ∧ ¬Y

47
 Truth Tables (3 of 3)
• Example: (Y ∧ S) ∨ (X ∧ ¬S)

X
mux Z
Y

Two-input multiplexer

48
 Summary
• Assembly language helps you learn how software is
constructed at the lowest levels
• Assembly language has a one-to-one relationship
with machine language
• Each layer in a computer's architecture is an
abstraction of a machine
• layers can be hardware or software
• Boolean expressions are essential to the design of
computer hardware and software

49