Assignment1

.docx

School

Langara College *

*We aren’t endorsed by this school

Course

1050

Subject

Computer Science

Date

Jan 9, 2024

Type

docx

Pages

2

Uploaded by CaptainGalaxyWasp15

Assignment 1: Coverage (Chapters 1-3) Show all steps in order to receive full credit Total Marks: 50 Part A: Binary Values and Number Systems (30 Marks) 1- Perform the following octal additions: a. 670 + 675 b. 101+ 706 c. 202 + 567 2- Perform the following hexadecimal additions: a. 9AB6 + 4321 b. AE9 + FED c. 1066 + ACBD 3- Express 9999 using positional notation (polynomial form), assuming it is a base 13 number. 4- Convert the unsigned binary number 11011011 to hexadecimal. 5- Convert the 8-bit 2’s complement number 11110011 to a signed decimal value. 6- Convert 120.62 to binary (stop after five binary digits/precision ). 7- Add the following two unsigned binary numbers. Give your answer in binary: 1 0 1 0 1 1 0 1 + 0 0 1 0 1 1 1 1
Part B: Data Representation (20 Marks) 8- Decode the following message written in extended ASCII values: 84 104 101 32 85 110 105 99 111 100 101 32 67 104 97 114 97 99 116 101 114 32 83 101 116 9- How would the following string of characters be represented using run length encoding? What is the compression ratio? AAAABBBCCCCCCCCDDDD hi there EEEEEEEEEFF 10- Given the following Huffman encoding table, decipher (decode) the bit strings below (part a) Huffman Code Character 00 A 11 E 010 T 0110 C 0111 L 1000 S 1011 R 10010 O 10011 I 101000 N 101001 F 101010 H 101011 D a. 10100010010101000100011101000100011 b. How many bits would it take to represent the word from part a) using ASCII characters assuming that one would use 8 bits per ASCII character? c. What is the compression ratio between parts a. and b.?
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help