Computer Science: An Overview (13th Edition) (What's New in Computer Science)
13th Edition
ISBN: 9780134875460
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 1, Problem 53CRP
Explanation of Solution
Determine the error correcting properties in new code.
The 24 bit code is generated by representing each symbol by three consecutive copies of its ASCII representation. The symbol A is represented as
The table below shows the simple code for the symbols.
Symbol | Code |
A | |
B | |
C | |
D |
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
A barcode scanner for Universal Product Codes (UPCs) verifies the 12-digit code scanned by
comparing the code's largest digit (called a check digit) to its own computation of the check digit
from the first 11 digits as follows:
1. Calculate the sum of the digits in the odd-numbered positions (the first, third,..... eleventh
digits) and multiply this sum by 3.
2. Calculate the sum of the digits in the even-numbered position (the second, fourth....tenth
digits) and add this to the previous result.
3. If the last digit of the result from step 2 is 0, then 0 is the check digit. Otherwise, subtract
the last digit from 10 to calculate the check digit.
4. If the check digit matches the final digit of the 12-digit UPC, the UPC is assumed correct
By using C++ write a program that prompts the user to enter the 12 digits of a barcode separated by
space.
The program should store the digits in an integer array, calculate the check digit, and compare it
to the final barcode digit. If the digits…
An alternative to hexadecimal notation for representing bit patterns is dotted decimal notation in which each byte in the pattern is represented by its base ten equivalent. In turn, these byte representations are separated by periods. For example, 12.5 represents the pattern 0000110000000101 (the byte 00001100 is represented by 12, and 00000101 is represented by 5), and the pattern 100010000001000000000111 is represented by 136.16.7. Represent each of the following bit patterns in dotted decimal notation.
0000111100001111
001100110000000010000000
0000101010100000
n alternative to hexadecimal notation for representing bit patterns is dotted decimal notation in which each byte in the pattern is represented by its base ten equivalent. In turn, these byte representations are separated by periods. For example, 12.5 represents the pattern 0000110000000101 (the byte 00001100 is represented by 12, and 00000101 is represented by 5), and the pattern 100010000001000000000111 is represented by 136.16.7. Represent each of the following bit patterns in dotted decimal notation.
0000111100001111
001100110000000010000000
0000101010100000
Chapter 1 Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Ch. 1.1 - What input bit patterns will cause the following...Ch. 1.1 - In the text, we claimed that placing a 1 on the...Ch. 1.1 - Assuming that both inputs to the flip-flop in...Ch. 1.1 - a. If the output of an AND gate is passed through...Ch. 1.1 - Prob. 5QECh. 1.1 - Prob. 6QECh. 1.2 - If the memory cell whose address is 5 contains the...Ch. 1.2 - Prob. 2QECh. 1.2 - Design a sequence of steps that correctly...Ch. 1.2 - How many bits would be in the memory of a computer...
Ch. 1.3 - Prob. 1QECh. 1.3 - Prob. 2QECh. 1.3 - Prob. 3QECh. 1.3 - Prob. 4QECh. 1.3 - Prob. 5QECh. 1.3 - Prob. 6QECh. 1.4 - Here is a message encoded in ASCII using 8 bits...Ch. 1.4 - In the ASCII code, what is the relationship...Ch. 1.4 - Prob. 3QECh. 1.4 - Prob. 4QECh. 1.4 - Convert each of the following binary...Ch. 1.4 - Prob. 6QECh. 1.4 - What is the largest numeric value that could be...Ch. 1.4 - An alternative to hexadecimal notation for...Ch. 1.4 - What is an advantage of representing images via...Ch. 1.4 - Prob. 10QECh. 1.5 - Convert each of the following binary...Ch. 1.5 - Convert each of the following base ten...Ch. 1.5 - Convert each of the following binary...Ch. 1.5 - Express the following values in binary notation:...Ch. 1.5 - Perform the following additions in binary...Ch. 1.6 - Convert each of the following twos complement...Ch. 1.6 - Prob. 2QECh. 1.6 - Suppose the following bit patterns represent...Ch. 1.6 - Suppose a machine stores numbers in twos...Ch. 1.6 - In the following problems, each bit pattern...Ch. 1.6 - Prob. 6QECh. 1.6 - Prob. 7QECh. 1.6 - Prob. 8QECh. 1.6 - Prob. 9QECh. 1.6 - Prob. 10QECh. 1.6 - Prob. 11QECh. 1.7 - Prob. 1QECh. 1.7 - Prob. 3QECh. 1.7 - Prob. 4QECh. 1.8 - What makes Python an interpreted programming...Ch. 1.8 - Write Python statements that print the following:...Ch. 1.8 - Write Python statements to make the following...Ch. 1.8 - Write a Python statement that given an existing...Ch. 1.9 - Prob. 1QECh. 1.9 - Prob. 2QECh. 1.9 - Prob. 3QECh. 1.9 - Prob. 4QECh. 1.9 - Prob. 5QECh. 1.9 - Prob. 6QECh. 1.9 - Prob. 7QECh. 1.10 - Prob. 1QECh. 1.10 - Could errors have occurred in a byte from Question...Ch. 1.10 - Prob. 3QECh. 1.10 - Prob. 4QECh. 1.10 - Prob. 5QECh. 1.10 - Prob. 6QECh. 1 - Determine the output of each of the following...Ch. 1 - a. What Boolean operation does the circuit...Ch. 1 - a. If we were to purchase a flip-flop circuit from...Ch. 1 - Assume that both of the inputs in the following...Ch. 1 - The following table represents the addresses and...Ch. 1 - How many cells can be in a computers main memory...Ch. 1 - Prob. 7CRPCh. 1 - Prob. 8CRPCh. 1 - Prob. 9CRPCh. 1 - Prob. 10CRPCh. 1 - Suppose a picture is represented on a display...Ch. 1 - Prob. 12CRPCh. 1 - Prob. 13CRPCh. 1 - If each sector on a magnetic disk contains 1024...Ch. 1 - How many bytes of storage space would be required...Ch. 1 - Prob. 16CRPCh. 1 - Prob. 17CRPCh. 1 - Suppose a typist could type 60 words per minute...Ch. 1 - Prob. 19CRPCh. 1 - Prob. 20CRPCh. 1 - Prob. 21CRPCh. 1 - Prob. 22CRPCh. 1 - Prob. 23CRPCh. 1 - Prob. 24CRPCh. 1 - Prob. 25CRPCh. 1 - Prob. 26CRPCh. 1 - Prob. 27CRPCh. 1 - Prob. 28CRPCh. 1 - Prob. 29CRPCh. 1 - Prob. 30CRPCh. 1 - Prob. 31CRPCh. 1 - Prob. 32CRPCh. 1 - Prob. 33CRPCh. 1 - Prob. 34CRPCh. 1 - Prob. 35CRPCh. 1 - Prob. 36CRPCh. 1 - Prob. 37CRPCh. 1 - Prob. 38CRPCh. 1 - Prob. 39CRPCh. 1 - Prob. 40CRPCh. 1 - Prob. 41CRPCh. 1 - Prob. 42CRPCh. 1 - Prob. 43CRPCh. 1 - Prob. 44CRPCh. 1 - Prob. 45CRPCh. 1 - What would be the hexadecimal representation of...Ch. 1 - Prob. 47CRPCh. 1 - Prob. 48CRPCh. 1 - Prob. 49CRPCh. 1 - Prob. 50CRPCh. 1 - Prob. 51CRPCh. 1 - Prob. 52CRPCh. 1 - Prob. 53CRPCh. 1 - Prob. 54CRPCh. 1 - Prob. 55CRPCh. 1 - Prob. 56CRPCh. 1 - Prob. 57CRPCh. 1 - Prob. 58CRPCh. 1 - Write and test a Python script that, given a...Ch. 1 - Prob. 61CRPCh. 1 - Prob. 2SICh. 1 - Prob. 3SICh. 1 - Prob. 4SICh. 1 - Prob. 5SICh. 1 - Prob. 6SICh. 1 - Prob. 7SI
Knowledge Booster
Similar questions
- Consider a 16-bit binary floating point number representation system: + | SE E E E E E m m т m m m m m m The first bit of the exponent is dedicated to its sign. Assume that the mantissa must start with a '1'. Use this system to answer the following question What is the smallest (magnitude) number that can be represented with this system?arrow_forward3 Counting k-inversions A k-inversion in a bitstring b is when a 1 in the bitstring appears k indices before a 0; that is, when b; = 1 and bi+k = 0, for some i. For example, the string 010010 has two 1-inversions (starting at the second and fifth bits), one 2-inversion (starting at the second bit), and one 4-inversion (starting at the second bit). Devise an algorithm which, given a bitstring b of length n, counts all the k-inversions, for each k from 1 to n - 1. Your algorithm should run faster than (n²) time. You can assume arithmetic on real numbers can be done in constant time. Give a 3-part solution.arrow_forwardimplement c# program creates a BitArray of five Byte values (1,2,3,4,5) anddisplays each byte in its proper binary form:arrow_forward
- Scenario: In a biased N-bit binary number system with bias B, positive and negative numbers are represented as their value plus the bias B. For example, for 5-bit numbers with a bias of 15, the number 0 is represented as 01111, 1 as 10000, and so forth. Biased number systems are sometimes used in floating point mathematics. Consider a biased 8-bit binary number system with a bias of 12710 Question: What is the representation and value of the most negative number?arrow_forwardRGB is a color model that defines color by the combination of Red, Green, and Blue. An RGB tuple is composed of three numbers that specify the intensity of each color. Because it uses 8 bits (0s or 1s) for each color, each intensity can be transformed into a hexadecimal number with two digits at most. There are 256 possible shades for each color, since "11111111" (or hex "ff") corresponds to decimal 255, plus the number 000. The combination of all 256 possible shades for the three primary colors gives 256 cubed, or over 16 million possible colors. Write a function that takes a color in RGB or hex and returns the opposite. If it takes in the three integers in an RGB, it should return a string with the equivalent hexadecimal notation, plus a hash sign (#) at the front. If it takes in a string in hex, it should return an array with the three integers corresponding to RGB. Examples rgbHex (150, 50, 76) "#96324c" // 150 is hex 96, 50 is hex 32 and 76 is hex 4c. - rgbHex("#303749") → (48,…arrow_forwardWrite down the mathematical notation for fixed point representationand floating representation and also explain each term. Consider the following machine number in 64 bit and Precisely represent the above machine number in decimal digits. 0 10000000011 1011100100010000000000000000000000000000000000000000arrow_forward
- In a 64-bit long floating point Machine number representing equivalent to decimal, consider the number is negative, c =1034 and 1 . the 22 23 24 26 Machine number representation is O 110000001010 011101000000000000000000000000000 1 10000001010 01110100000000000000000000000000( 1 10000001010 01110100000000000000000000000000 O nonearrow_forwardThe latest super-duper supercomputer has memory locations that are 64-bits wide. What is the largest unsigned integer that can be stored in one memory location? Suppose that we use sign-magnitude for storing negative numbers and dedicate one bit for a sign bit. What would be the largest POSITIVE integer that can be stored in a memory location.arrow_forwardEncode (800) 555-0012 in ASCII, including punctuation. 5.Translate the following hexadecimal into binary and then into ASCII: 68 65 78 61 64 65 63 69 6D 61 6C You have discovered the following string of binary ASCII code; figure out what they mean: 01010111 01100001 01111001 00100000 01110100 01101111 00100000 01100111 01101111 00100001arrow_forward
- Consider a new floating point representation, which we will call here the CMPT215Float16 representation. The CMPT215Float16 representation follows the IEEE 754 binary floating point standard, but with smaller-sized fields for the exponent and fraction. In particular, CMPT215Float16 numbers have a 1-bit sign field, followed by a 7-bit exponent field (in biased notation, with a bias of only 63 because of the smaller size of this field), followed by an 8-bit fraction field. Give, in decimal, the quantity represented by the following CMPT215Float16 floating point value: 0100001110100000.arrow_forwardA binary code is a string of 0's and 1's. In particular, an n-bit binary code is a string of "n" 0's and 1's. For example, the code "01001" is a 5-bit binary code. How many 5-bit binary codes can be formed?arrow_forwardAssume we are using a simple model for floating-point representation similar to the one used in Chapter 2 of the textbook which has a 14-bit format, 5 bits for the exponent with a bias of 15 (not 16 as in the textbook), a normalized mantissa of 8 bits, and a single sign bit. Show how the computer would represent the numbers 12.125 using this representation.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education