What is the bit-rate generated by a MPEG-1 video coder? 3–15  Mbit/s

-------------------------------------------------

Suppose we are using H.263 to encode video, and we monitor the bit-rate at the output of the encoder. Why do we usually see a peak (burst) in the bit-rate in correspondence of a change of scene? What happens if the first frame of the next scene is encoded in predictive mode instead than in intraframe mode? 
Coding error vector instead of the motion vector itself • The prediction starts from taking median values of the motion vectors of “previous”, “above”, and “above-right” macroblocks.
up = median(0, u2, u3)
------------------------------------------------------
Write at least two main differences between MPEG-4 video compression and other two previous MPEG video compressions. 
we dont have MPEG-4 in the slides 

------------------------------------------------------
Suppose we want to store the video signal on a hard disk, and, in order to save space, re-quantize each chrominance (Cr, Cb) signals with only 6 bits per sample. What is the minimum size of the hard disk required to store 10 minutes of video?  
450 * 520 * 25 * 14 (8 bits for luma subsample + 6 bits for chrominance subsample) * 60 * 10 = 49140000000(Bit) = 49140000(KB) = 49140(MB)

----------------------------------------------------
Explain why with bidirectional motion compensation of videos the camera and display order of frames is different from the transmission and decoding order. How many displacement vectors do we need to transmit for each 16x16 macroblock of a Bframe in MPEG-2?
The prediction of matching macroblocks at the enhancement layer by combined motion-compensation prediction and interlayer motion compensation prediction

......................................................
What is the difference in quantization SNR between the signal before and after the coarser quantization? (Recall how to compute SNR and its measurement unit.  
7  * 6 = 42 dB decrease.  from where the 6 ?

-----------------------------------------------------
Supposed that you have the following sampled values: 10.3, 10.6, 10.9, 11.2, 11.7, 11.3, 10.9.  Assume that you use the previous value for the prediction and quantize values using round function. Show the encoded values by a closed loop DPCM. Also, show the decoded values in the decoder side. 
dont we need table to get the values for e^ ?

......................................................
What is difference between the general DPCM and Closed-loop DPCM?  
Using Trunc for error and prediction

........................................................
Assume that you quantize 16-bit samples into k-bits (k <16) using DPCM.  Describe one inherent problem of DPCM and propose one method that can improve DPCM. 
 We can use Apcm 

i have these questions please if you know the answers it will be great 

some of them i answered but i'm not sure though !

thank you