5. Hamming Codes a) Suppose we want an error correcting code that will allow all single-bit errors to be corrected for memory words of length 15. How many check bits are necessary? b) Suppose we are now working with memory words of length 8. We have already calculated that we need 4 check bits, and the length of all codewords will be 12. We now receive the following code word: 010011011111 Is this a legal codeword, assuming even parity? If not, where is the error?

5. Hamming Codes a) Suppose we want an error correcting code that will allow all single-bit errors to be corrected for memory words of length 15. How many check bits are necessary? b) Suppose we are now working with memory words of length 8. We have already calculated that we need 4 check bits, and the length of all codewords will be 12. We now receive the following code word: 010011011111 Is this a legal codeword, assuming even parity? If not, where is the error?

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.5: Variables And Declaration Statements

Problem 9E: (Practice) a. Using Figure 2.14 and assuming the variable name rate is assigned to the byte at...

See similar textbooks

Similar questions

c++ part2 and the rest plz 1- Given a set of numbers where all elements occur even number of timesexcept one number, find the odd occurring number” This problem can beefficiently solved by just doing XOR of all numbers.2- Use bitwise operators to compute division and multiplication by a numberthat is power of 2. For example: bitwise_divide/multiply(num,8/16/32/2/4/128) should use only bitwise operators to compute result.3- Write code that checks if a number is odd or even using bitwise operators.4- Write a program that checks if a number is positive/negative/zero.5- Write a function that returns toggle case of a string using the bitwiseoperators in place. this is the answer of the first exercice: #include <bits/stdc++.h> // include header file for standard header filesusing namespace std; int funintar[],intsizeintar[],intsizeintar[],intsize // start definition of function to check the odd occurences of the numbers{ int res = 0;…
Computer Science it has to be done in c programming // Task 3 // For this function, you must return the largest power of 2 that// is less than or equal to x (which will be positive). You may// not use multiplication or some sort of power function to do this,// and should instead rely on bitwise operations and the underlying// binary representation of x. If x is 0, then you should return 0.unsigned largest_po2_le(unsigned x) {return x;}
You are writing code that is equivalent to: X = A / (5 + B) Assume signed bytes and the following first 3 lines of code: mov al,A mov bl,B add bl,5 What is the one line of code that will perform the division correctly?
c++ i want part 2 and the rest 1- Given a set of numbers where all elements occur even number of timesexcept one number, find the odd occurring number” This problem can beefficiently solved by just doing XOR of all numbers.2- Use bitwise operators to compute division and multiplication by a numberthat is power of 2. For example: bitwise_divide/multiply(num,8/16/32/2/4/128) should use only bitwise operators to compute result.3- Write code that checks if a number is odd or even using bitwise operators.4- Write a program that checks if a number is positive/negative/zero.5- Write a function that returns toggle case of a string using the bitwiseoperators in place. part1 #include <bits/stdc++.h> // include header file for standard header filesusing namespace std; int fun(int ar[], int size) // start definition of function to check the odd occurences of the numbers{ int res = 0; // declare the required numbers for (int i = 0;…
1. Write a C++ program that takes two binary numbers of 8 bits eachrepresented with the letters Z and O (for zero or one) and displays thesum in binary with Zs and Os. Do this by converting the numbers to ints,adding the its using +, displaying the 3 ints, then converting the sum toZ and Os and displaying the result. 1 a.) Redo number 1, by doing a bit-by-bit addition, not forgetting the carry. 1b.) Write a program to take two numbers represented with romannumerals and display the sum. Assume the sum will be less than 20.Hints: Ask the user to terminate each number with a semicolon and usechars to hold the roman ‘digits’.The numbers are I, II, III IV, V, VI, VII, VIII, IX, X, XI, XII, XIII, XIV, XV…isfive, Change the program to allow the sum to go up to 49 See how large a number you can handle. L is 50, C is 100, M is 1000. Using basic C++ int, char, if- else statements, and switch statements, please! no functions, or strings, or Cmath etc.
Question Asked Jul 9, 2020 3 views Python Programming- Computer-Assisted Instruction Part 1: Computer-Assisted Instruction (CAI) refers to the use of computers in education. Write a script to help an elementary school student learn multiplication. Create a function that randomly generates and returns a tuple of two positive one-digit integers. Use that function's result in your script to prompt the user with a question, such as: How much is 6 times 7? For a correct answer, display the message "Very good!" and ask another multiplication question. For an incorrect answer, display the message "No. Please try again." and let the student try the same question repeatedly until the student finally gets it right. Then, modify the program so that various comments are displayed for each answer. Possible responses to a correct answer should include 'Very good!' , 'Nice work!' and 'Keep up the good work!' Possible responses to an incorrect answer shojld include 'No. Please try again.' ,…
Problem 7: Explain the outcome of each of the following code segment?(a)addi $t0, $zero, 0xFF2Bandi $t2, $t2, $t0 (b)ori $t2, $t2, 0x00E9 I NEED ANSWER ASAP. PLEASE DO FAST
Task 3 Largest PO2 LE: Implement the largest_po2_le function as directed in the comment above the function. If the directions are unclear, run the code, and look at the expected answer for a few inputs. As specified in the comment, you may not use multiplication or some sort of power function, and should instead rely on bitwise operations. Consider how binary numbers are structured, and how you might find the largest power of 2 of a binary number. Code: #include <stdio.h>#include <stdbool.h>#include <stdlib.h> // BEGIN STRINGBUILDER IMPLEMENTATION // This code is a very rudimentary stringbuilder-like implementation// To create a new stringbuilder, use the following line of code//// stringbuilder sb = new_sb();//// If you want to append a character to the stringbuilder, use the// following line of code. Replace whatever character you want to// append where the 'a' is.//// sb_append_char(sb, 'a');//// Though there are some other functions that might be…
need help adding OR, a binary logical calculator with operations AND, OR, NOT. def add(num1,num2):return num1 + num2 def sub(num1,num2):return num1 - num2 def mult(num1,num2):return num1 * num2 def divide(num1,num2):return num1 / num2 print("Select operation.")print("1.Add")print("2.Subtract")print("3.Multiply")print("4.Divide") option = int(input("Choose between 1,2,3,4: ")) a = int(input("First number: ")) b = int(input("Second number: ")) if option == 1:print(a, " + " ,b, " = ", add(a,b))elif option == 2:print(a, " - ",b," = ",sub(a,b)) elif option == 3:print(a, " * ",b," = ",mult(a,b)) elif option == 4:print(a, " / ",b," = ",divide(a,b))else:print("error")
Consider the following code which includes a parity check for the third digit: C=(000,011,101,110). You get the third digit by adding the first two and then using the remainder on division by 2. Can this code detect and count single errors? how can this be implemented?
10. Fill in the following addition table for base 3.+ 0 1 201211. Identify the following statements as TRUE OR FALSE. a) BCD stands for Binary Coded Decimal and encodes each digit of a decimal number to an 8-bit binary form. b) Unicode is a 16-bit code, occupying twice the disk space for text as ASCII or EBCDIC would require. c) A signed-magnitude integer representation includes more negative numbers than it does positive ones. d) A byte is 8 bits, but a word may vary in size (16-bits, 32-bits, etc.) from one architecture to another. e)The largest value that a 60-bit unsigned binary integer can represent is (260-1). f) A 2's complement integer representation includes more negative numbers than it does positive ones.
T/F Bit arrays and bit fields are same.