Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. We have already calculated that we need 4 check bits, and the length of all code words will be 11. Code words are created according to the Hamming Algorithm presented in the our class. We now receive the following code word: 1 0 1 0 1 0 1 1 1 1 0 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error? Show work No it is illegal code word - bit 6 is in error Yes it is legal code word and there is no error No it is illegal code word - bit 5 is in error No it is illegal code word - bit 3 is in error

Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. We have already calculated that we need 4 check bits, and the length of all code words will be 11. Code words are created according to the Hamming Algorithm presented in the our class. We now receive the following code word: 1 0 1 0 1 0 1 1 1 1 0 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error? Show work No it is illegal code word - bit 6 is in error Yes it is legal code word and there is no error No it is illegal code word - bit 5 is in error No it is illegal code word - bit 3 is in error

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Suppose you have a finite state machine that accepts bit strings divisible by 11. The FSM has 11 states R0, R1, ... , R10, each corresponding to the remainder when dividing by 11. Input is fed to the FSM one bit at a time from left to right, the same way we did in our in-class examples. If the machine is currently in state R7, an input of 1 should transition it to which state? Type the subscript only of the new state. Your answer should be an integer between 0 and 10, inclusive.
Write a program that swaps 5th~11th bits in data_a with 25th~31th bits in data_bYour program must work for any data given, not just the example belowIn this question, we assume that the positions of bits count from right to left.That is, the first bit is the least significant bit.data_a DCD 0x77FFD1D1data_b DCD 0x12345678
Write a 2 tape Turing machine that converts its input from binaryto unary. In other words, if the input is the string x ∈ {$, 0, 1}∗, a $ followed by thebinary expansion of the nonnegative integer n (for example, $101 to represent n = 5), thenthe machine outputs the string 1^n(e.g., 1^5 = 11111). You may assume the input stringwill be in this format, i.e., a $ followed by either just a 0, or followed by a binary stringbeginning with 1.
implement byteSwap(x,n,m) Swap the m and n byte of x /* * byteSwap - swaps the nth byte and the mth byte* Examples: byteSwap(0x12345678, 1, 3) = 0x56341278* byteSwap(0xDEADBEEF, 0, 2) = 0xDEEFBEAD* You may assume that 0 <= n <= 3, 0 <= m <= 3* Legal ops: ! ~ & ^ | + << >>* Max ops: 25*/ int byteSwap(int x, int n, int m) {return 2;}
Suppose you’re consulting for a bank that’s concerned about fraud detection, and they come to youwith the following problem. They have a collection of n bank cards that they’ve confiscated, suspectingthem of being used in fraud. Each bank card is a small plastic object, containing a magnetic stripe withsome encrypted data, and it corresponds to a unique account in the bank. Each account can have manybank cards corresponding to it, and we’ll say that two bank cards are equivalent if they correspond to thesame account.It’s very difficult to read the account number off a bank card directly, but the bank has a high-tech “equivalence tester” that takes two bank cards and, after performing some computations, determines whether theyare equivalent.Their question is the following: among the collection of n cards, is there a set of more than n/2 of themthat are all equivalent to one another? Assume that the only feasible operations you can do with the cardsare to pick two of them and plug them…
Give an informal description of a Turing machine with three tapes,that gets as input the binary representation of an arbitrary integer m ≥ 1 , and returns as output the unary representation of m a) Beginning of the calculation: Convert the number m of the first strip in binary. contains. The other 2 strips are empty (containing only the _ symbol). Our Turing machine is in the start state. b) End of calculation: 3rd lane includes conversion of m number in unity basis, i.e. It contains an array of m 1's. Our Turing machine is in the finishing position (final state). c) Hint: You can arrange the 2nd strip to contain 1 as one of the powers of 2.c) Hint: Arrange the order to contain 1' as one of the 2 powers
Write a program that swaps 5th~11th bits in data_a with 25th~31th bits in data_bYour program must work for any data given, not just the example belowIn this question, we assmue that the positions of bits count from right to left.That is, the first bit is the least significant bit.
Suppose a Genetic Algorithm uses chromosomes of the form x=abcdef with a fixed length of six genes.Each gene can be any digit between 0 and 9 . Let the fitness of individual x be calculated as : f(x) =(a+b)-(c+d)-(e+f) And let the initial population consist of four individuals x1, ... ,x4 with the following chromosomes : x1 = 3 5 3 2 6 5, x2 = 9 8 0 1 2 2, x3 = 1 2 2 1 2 3, x4 = 7 9 2 3 1 1 1. 1.Evaluate the fitness of each individual, showing all your workings, and arrange them in order with the fittest first and the least fit last. 2. calculate the average fitness. 3. Perform the following crossover operations:a- Cross the fittest two individuals using one point crossover at the middle point.b- Cross the second and third fittest individuals using a two point crossover (points b and e). Suppose the new population consists of the four offspring individuals received by the crossover operations in the above question. Evaluate the fitness of the new population, showing all your…
Consider the code C={00010, 01100,01011,11010,01010}. What is the minimum distance of C? For what k is the code C k-error detecting? Write the set of error patterns that C can detect?
Implement a class RLE that uses fixed-length encoding, to compress ASCII bytestreams using relatively few different characters, includingthe code as part of the encoded bitstream. Add code to compress() to make a stringalpha with all the distinct characters in the message and use it to make an Alphabet foruse in compress(), prepend alpha (8-bit encoding plus its length) to the compressedbitstream, then add code to expand() to read the alphabet before expansion.
Write a program in MIPS Asssembly, that uses a random number generator to ask the user three basic sqaure root questions. i.e " What is the sqaure root of .....?". Then output if the users input is correct or not. If the input is incorrect display "sorry thats incorrect" along with the correct answer.
Suppose that two matrices A and B with dimension n x n are stored on a 2D mesh of n2 processors such that P_(i,j) holds A[I,j] and B[j,i] . Write C-style pseudocode for an asynchronous algorithm that computes the product of A and B in O(n) time. (10 points) (WRITE THE PSEUDOCODE! IF YOU DON'T WRITE PSEUDOCODE, YOU WILL BE WRONG!! C-STYLE ONLY!!!)

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS

GET THE APP

About FAQ Academic Integrity Sitemap Document Sitemap

Contact Bartleby Contact Research (Essays)High School Textbooks Literature Guides Concept Explainers by Subject Essay Help Mobile App

GET THE APP

Privacy

Your CA Privacy Rights

Your NV Privacy Rights

About Ads

Manage My Data

bartleby, a Learneo, Inc. business

	No it is illegal code word - bit 6 is in error
	Yes it is legal code word and there is no error
	No it is illegal code word - bit 5 is in error
	No it is illegal code word - bit 3 is in error