### How space efficient is your hamming code

Assignment Help Data Structure & Algorithms
##### Reference no: EM13326812

Construct a Hamming code that will correct single bit errors in a 32 bit word. Construct a specific error in a Hamming code output (original 32 bit word plus whatever you must add for Hamming) and explicitly verify that the Hamming correction algorithm first detects and then corrects the error. How many bit errors will your code detect? Construct a specific error in more than this number of bits and explicitly show that the Hamming algorithm fails to detect the error. How space (number of bits required) efficient is your Hamming code?

#### Create a work plan

Design a dynamic programming algorithm to find the value of the optimal plan. Implement your algorithm using any programming language you prefer. Describe the recurrence rel

#### Design greedy algorithm to solve activity selection problem

Design a greedy algorithm to solve the activity selection problem. Suppose there are a set of activities: a1, a2, ... an that wish to use a lecture hall. Each activity ai ha

#### Design a dynamic programming algorithm to find the value

Design a dynamic programming algorithm to find the value of the optimal plan. Implement your algorithm using any programming language you prefer. Describe the recurrence rel

#### Create a simple hierarchy for items

Assume you have to write software to be used by a university library. There are three types of item that can be borrowed from the library - DVDs, books and journ

#### Using our stack data structure for storing disk objects

Using our Stack Data Structure for storing Disk objects (see attached zip file), implement the game The Towers of Hanoi for 3 disks and 3 columns (as simulated at: http://w

#### Using the stack data structure for storing disk objects

Which parts of the assignment were you not able to complete fully? For each, explain why you were unable to complete this part and what steps you took to attempt to complete

#### Definitions and discussion on best-average-worst case

Definitions and discussion (0-complexity of algorithms discussed: best-average-worst case, doubly linked list, trees, binary trees, binary search trees, AVL, and b-tree.

#### How to implement a class called hugeinteger

Using your own Linked List implementation (see attached), implement a class called HugeInteger that represents arbitrary sized integers and supports addition only. You may o