Answer:Here Is An Example Data Structure We Can Struct Coordinate Int X; Intys Struct Square Coordinate Centers Coordinate Box[41; Here Is An Alternative Data Structure We Can Use To Describe Squares Struct Coordinate Int X; Int Y 2) Consider Our Drawing Example From Lecture. In The Below All We Can Draw Are Circles And Squares. Here Is An Example Data Structure
Explanation:
Answer:
1) 2 bits 2) shown in explanation 3) shown in explanation 4) 22 bits per pixel (2.75 bytes)
Explanation:
As a bit is one of two states, 1 or 0, 2 bits is sufficient to represent 4 colors:
00 = color 1
01 = color 2,
10 = color 3,
11 = color 4
This would be the custom type of encoding for that specific image as it only uses 4 colors.
Now to calculate the amount of memory saved, which is quite simple:
24-2=22
So you Would save 22 bits per pixel or 2.75 bytes per pixel.
DSL ranges from 128Kbps to 3Mbps, so this would be your bottleneck.
Answer:c)Clean redundant customer data
Explanation:Data cleansing/cleaning is the activity for the elimination of the data which is not required for further use, corrupt, unnecessary etc by detecting it. The data that is being cleared is categorized by levels like irrelevant data, incorrect data, inaccurate data, redundant data etc.
The data is eliminated by the method of correcting , modifying, reducing unnecessary parts,deleting, etc.Thus, the correct option is option(C).