- By
**arden** - Follow User

- 91 Views
- Uploaded on

Download Presentation
## PowerPoint Slideshow about ' computer science' - arden

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

Binary

A bit string can represent a number:

110 =

1×22 + 1×21 + 0×20

A byte has the place values:

What is the smallest possible byte?

the largest?

- Input: a positive integer N
- Find the largest k so that 2k ≤ N
- for each power_of_2 ∈ {2k,2k-1,…,1}:
- if N ≥ power_of_2 then:
- set N = N - power_of_2 and output 1
- else:
- output 0

- 3. stop.

- setp = 1 and k = 0
- whilep ≤ N/2:
- set p = p×2 and k=k+1

PRACTICE: 11011100, 93, 42

Hexadecimal

Base 16:

0,1,2,…,9,A,B,C,D,E,F

0x37

- = 5510

0x1A

- = 2610

0xC2

- = 19410

How many bits for a hex digit?

4 (a nibble)

http://cs1001.us/

Please read Chapter 4.2.2 for Wednesday’s lecture.

Download Presentation

Connecting to Server..