Answer:
an information key that explains how information in a chart is represented by colors or patterns
Explanation:
This is the information that is used to explain the data in the graph.
Answer: B
Explanation:
if each color can be represented as 8 bits and you have 3 colors total that would mean you would need 24 bits to represent the entirety of the RGB spectrum. And each bit can either be on or off so you have two choices for each one. So the total amount of colors you can have for 8bit RGB would be 
which is 16,777,216.
Answer:
Explanation:
The following code is written in Java. Both functions traverse the linkedlist, until it reaches the desired index and either returns that value or deletes it. If no value is found the function terminates.
public int GetNth(int index)
{
Node current = head;
int count = 0;
while (current != null)
{
if (count == index)
return current.data;
count++;
current = current.next;
}
assert (false);
return 0;
}
public int removeNth(int index)
{
Node current = head;
int count = 0;
while (current != null)
{
if (count == index)
return current.remove;
count++;
current = current.next;
}
assert (false);
return 0;
}
A user hacking or looking up utter nonsense....sorry if it didn't help
