40 views

Uploaded by Eduardo Coldibeli Bianchi

Week 3 Tutorial

You are on page 1of 7

EEET 1026

Introduction to Computer Systems

Tutorial 1

Digital Number Systems, Codes and Conversions

Decimal, Binary and Hexadecimal Number Systems

Binary Coded Decimal (BCD)

S Mahfuz Aziz

Preparation

You are expected to attempt each of the exercises in this handout before

the scheduled tutorial class.

The questions and exercises in the handout are based on the materials

covered in the lectures. You can review the materials by revisiting the lecture

notes available in this web site.

It is important that you read the relevant sections of the textbook (Digital

Systems: Principles and Applications) and look at the examples there to

enhance your understanding of the concepts.

Important note

Tutorial classes are meant to be interactive. That is, you are expected to

actively take part in the discussion and problem solving. Dont expect the

tutor to simply hand out solutions. Therefore, your preparation for the class

is essential.

Exercises:

1-3, 1-4, 1-5, 1-6, 1-7, 1-8, 1-9, 1-10, 1-11, 1-12, 1-13

2-1, 2-2, 2-3, 2-4, 2-5, 2-6, 2-7, 2-8, 2-11, 2-13, 2-14, 2-15, 2-19, 2-20, 2-21

1-3. Convert the following binary numbers to their equivalent decimal values.

(a) 110012

(b) 1001.10012

(c) 10011011001.101102

(a) 100112

(b) 1100.0101

(c) 10011100100.10010

1-5. Using three bits, show the binary counting sequence from 000 to 111.

1-6. Using six bits, show the binary counting sequence from 000000 to 111111.

1-7. What is the maximum number that we can count up to using 10 bits?

1-8. What is the maximum number that we can count up to using 14 bits?

1-11. Draw the timing diagram for a digital signal that continuously alternates between 0.2V

(binary 0) for 2 ms and 4.4 V (binary 1) for 4 ms.

1-12. Draw the timing diagram for a digital signal that continuously alternates between 0.3V

(binary 0) for 5 ms and 3.9 V (binary 1) for 2 ms.

1-13. Suppose that the decimal integer values from 0 to 15 are to be transmitted in binary.

(a) How many data lines will be needed if parallel representation is used?

(b) How many data lines will be needed if serial representation is used?

3

(a) 10110

(b) 10010101

(c) 100100001001

(d) 01101011

(e) 11111111

(f) 01101111

(g) 1111010111

(h) 11011111

(i) 100110

(j) 1101

(k) 111011

(l) 1010101

(a) 37

(b) 13

(c) 189

(d) 1000

(e) 77

(f) 390

(g) 205

(h) 2133

(i) 511

(j) 25

(k) 52

(l) 47

2-3. What is the largest decimal value that can be represented by:

(a) an eight-bit binary number?

(a) 743

(b) 36

(c) 37FD

(d) 2000

(e) 165

(f) ABCD

(g) 7FF

(h) 1204

(i) E71

(j) 89

(k) 58

(l) 72

(a) 59

(b) 372

(c) 919

(d) 1024

(e) 771

(f) 2313

(g) 65,536

(h) 255

(i) 29

(j) 33

(k) 100

(l) 200

2-6. Convert each of the hex values from Problem 2-4 to binary.

(a) 743

(b) 36

(c) 37FD

(d) 2000

(e) 165

(f) ABCD

(g) 7FF

(h) 1204

(i) E71

(j) 89

(k) 58

(l) 72

(a) 10110

(b) 10010101

(c) 100100001001

(d) 01101011

(e) 11111111

(f) 01101111

(g) 1111010111

(h) 11011111

(i) 100110

(j) 1101

(k) 111011

(l) 1010101

2-13. Take each four-bit binary number in the order they are written and write the equivalent hex

digit without performing a calculation by hand or by calculator.

(a) 1001

(b) 1101

(c) 1000

(d) 0000

(e) 1111

(f) 0010

(g) 1010

(h) 1001

(i) 1011

(j) 1100

(k) 0011

(l) 0100

(m)

(n)

(o)

(p)

0001

0101

0111

0110

2-14. Take each hex digit and write its four-bit binary value without performing any calculations

by hand or by calculator.

(a) 6

(b) 7

(c) 5

(d) 1

(e) 4

(f) 3

(g) C

(h) B

(i) 9

(j) A

(k) 2

(l) F

(m)

(n)

(o)

(p)

0

8

D

9

2-15. What is the largest decimal value that can be represented by three hex digits?

(a) 47

(b) 962

(c) 187

(d) 6727

(e) 13

(f) 529

(g) 89627

(h) 1024

(i) 72

(j) 38

(k) 61

(l) 90

2-20. How many bits are required to represent the decimal numbers in the range from 0 to 999

using:

(a) Straight binary code?

(a) 1001011101010010

(b) 000110000100

(c) 011010010101

(d) 0111011101110101

(e) 010010010010

(f) 010101010101

(g) 10111

(h) 010110

(i) 1110101

X

A

t

v

Write the Boolean expression for each intermediate signal t, u, v and the output X.

Determine the values of t, u, v, X for all possible input conditions, and list the values in a truth

table. By examining the values of X with the values of all the inputs (A, B, C), can you think of a

way to simplify the circuit?

- Chapter 1Uploaded byapi-3831104
- Qlikview QAUploaded byHeather Gonzalez
- bao1qwwwUploaded bytayan1
- Assigment ProgUploaded byAtanuBhandary
- Midterm.wi14Uploaded bychrislake12
- 1. Basic Theories of Information (2).pdfUploaded byAero Xavier Mazter
- OPPCPUHIGH.pdfUploaded bySR
- ARINC Protocol TutorialUploaded byFauzan Phone
- c 0421013019Uploaded byInternational Journal of computational Engineering research (IJCER)
- TOY MachineUploaded byManmeetSingh
- Lec02Uploaded byAnil Verma
- 141-408 Eng Maths 2Uploaded byabhishek chib
- beginner_enUploaded bykuongsamnang
- DapUploaded byvor001
- ContentsUploaded byRajasekar Pichaimuthu
- BasicArith ReviewUploaded byJames Jamsmith
- SchUploaded bysaihfjkuio
- English - Peterson`s New SAT Math Workbook.(.PDF)Uploaded byTony Pham
- Chapter 5Uploaded byMuhammad Bilal Iqbal
- ashuthoshUploaded byRaghuvaraprasada Rao
- s30 Pumping LemmaUploaded byama2amal
- 2sem Assig 11 New SyllabusUploaded bymandrake2k79213
- ScheduleUploaded byArkaprava Paul
- SpecBAS Reference manualUploaded byPaulDunn
- Aire Acondicionado - Introduccion, Componentes y FuncionamientoUploaded byFrancisco Santiago Gallardo
- GMAT Quant Topic 9 - Miscellaneous SolutionsUploaded byAnkit Kumar Pathak
- Graham's number - Wikipedia, the free encyclopedia.pdfUploaded bymossmoss
- AdsUploaded byanon_593523024
- Presentation MatematikaUploaded bySesil Selvia
- Question Bank IT&DMUploaded bySaksham Bahati

- Programming for Engineers 1Uploaded byEduardo Coldibeli Bianchi
- Aula09_AlgoritmosGeneticos.pdfUploaded byEduardo Coldibeli Bianchi
- Aula03_MecanismosBusca.pdfUploaded byEduardo Coldibeli Bianchi
- Aula11_VisãoComputacional.pdfUploaded byEduardo Coldibeli Bianchi
- Aula02_MecanismosBusca.pdfUploaded byEduardo Coldibeli Bianchi
- 4.1Uploaded byEduardo Coldibeli Bianchi
- Aula04_AprendizadoDataMining.pdfUploaded byEduardo Coldibeli Bianchi
- Aula10_LogicaFuzzy.pdfUploaded byEduardo Coldibeli Bianchi
- Aula08_RedesNeurais_antiga.pdfUploaded byEduardo Coldibeli Bianchi
- Aula09_AlgoritmosGeneticos_antiga.pdfUploaded byEduardo Coldibeli Bianchi
- Aula01_IntroducaoUploaded byEduardo Coldibeli Bianchi
- Week 2 Practical 1 OHSW Aziz 100314Uploaded byEduardo Coldibeli Bianchi
- atmel 89s52Uploaded byKrishnan Raj Gopal
- BC556_557_3Uploaded byWowieEm
- Programming for EngineersUploaded byEduardo Coldibeli Bianchi
- Projeto.correnteUploaded byEduardo Coldibeli Bianchi
- asdasdasUploaded byEduardo Coldibeli Bianchi
- Lecture Slides 01Uploaded byEduardo Coldibeli Bianchi
- Resposta ExercicioUploaded byEduardo Coldibeli Bianchi
- Lecture Slides 02Uploaded byEduardo Coldibeli Bianchi
- pp_1_sem_2013.docUploaded byEduardo Coldibeli Bianchi
- pp_1_sem_2013.docUploaded byEduardo Coldibeli Bianchi
- Lista de Exercícios 1 - Robotica EL7920Uploaded byEduardo Coldibeli Bianchi
- Errata JCraig 3rdEd.060116Uploaded bylinuxsoon

- Digital Imaging DentistryUploaded byvrapciudorian
- Course Summary V1Uploaded byRagh Krishh
- TOP TEN THINGS LUXURY GUESTS ABSOLUTELY WANT! PART 2Uploaded byL Aruna Dhir
- heatex02awUploaded byyvethendo
- LyncServer AdminUploaded byChandraSekhar
- Equipment ListUploaded byRAJU
- g RosaryUploaded bydaljmer
- CEHv8 Module 07 Viruses and WormsUploaded byRifqi Multazam
- Samsung Gt-n8000 Service Manual r1.0Uploaded byCarlosDias
- 2015-09-04.MPLS_LabGuide_Ver2.2Uploaded byJerry Felix
- Clamps HYDACUploaded byricardofime72
- ISO 23278 2015 MT in Acceptable LevelUploaded byAnonymous 5RuzXS
- Outdoor 3 Way Speaker Sound System 12VUploaded byjumpupdnbdj
- Strategic and Tactical Mine PlanningUploaded byMuwafaq2002
- OOD with ABAP exercises requirements.pdfUploaded byRob-Joke
- Atomic PropulsionUploaded bydhoo_baby
- Sir Raman.pptUploaded byரூபாதேவி லாேகநாதன்
- UG Timetable TN. OPEN UniversityUploaded byIndiaresult
- Turnitin Originality ReportUploaded byStillward Laud Mark-Mills
- Ch_-_2_Pressure_Buildup_Tests (1).pdfUploaded byMohannad Abdulrahman
- Chapter 1Uploaded byCharlene Kronstedt
- 291 Rank University PerformaUploaded byRehan Chodhry
- 05. MPCUploaded bypuppyr
- Convocation ManualUploaded bySidhuDhivar
- CSD 500 SPECUploaded byPeter John Packiaraj
- TextbookUploaded bySabari Carouna
- Agricultural Land Suitability Analysis for Potato CropUploaded byiplascak
- LOAD RUNNER IntervewquestiosnUploaded byRamesh Soolam
- Purchasing - Integration With Approvals Management (Ame)Uploaded bykjganesh
- Elster a 1800Uploaded byIisp Shams