the 1(1) 1 points
1(2) 1 points(two technique of reducing...)

2(1) 2 points
2(2) 2 points
if they miss calculate the result, -0.25
if they mistake one data(frenqyuce or Lines) -0.5
if they mistakes two data -0.75
if they miscalculate one of the format(I mean NTSC or PAL) -0.75

3(1) 1.5 points(sampling, quantifing and encoding, each 0.5 point)
3(2) basically two right answers might appear(be careful about the result,
some of them might mistake some in the middle of the output) 1.5 points
If they just mistake one of the 32 output -0.25
two or three -0.5
all wrong -1.5 others -.75
and some of them don't calculate the bits needed -0.25
3(3) 1.5 points
DPCM output (0.5 points)
Huffman tree and the bits needed 1 points
if their hufferman tree didn't contain the beginning output of DPCM -0.5
if they hufferman tree didn't contain the beginning output of DPCM and their
tree are wrong, -0.75
if they include the beginning points, but the tree is wrong -0.25

if their calculate the wrong bits needed according to their tree, -0.25

3(4) if they only calculate the bits huffman need /the bits orginally needed,
that is 102/160
-0.5

4(1) 2 points
4(2) 2 points

5(1) 1 points
5(2) 1 points
5(3) 2 points