Answer:
Garbage in, garbage out
Explanation:
In computer science, garbage in, garbage out is the concept that flawed, or nonsense input data produces nonsense output or garbage
Answer:

Explanation:
The statements are logically equivalent if they have the same truth tables. So let´s use truth tables in order to determine if they are logically equivalent or not:
The picture that I attached you shows the truth table for each case. As you can see in the highlight columns:

They are logically equivalent because they have exactly the same truth values between each other. Hence, we can conclude that they are logically equivalent.
Change the line in word, it basically returns
Answer:
char str[5][100]
Explanation:
See attachment for options:
From the options, we can see that the programming language is C language.
The syntax to store an array of m strings with a maximum of n elements in C is:
char array-name[m][n]
In this case:
--- Number of strings in the array
--- Maximum character in each string
Assume the array name is str, the syntax can be expressed as:
char str[5][100]