<u>Answer:</u>
<em>Science fair always has experiments which prove science concepts.</em> Students will bring apparatus or an lab items and show experiments as a magic. There are only certain things which a Science can prove and show to other.
<em>From the given question, the following can be proved:
</em>
- <em>Does pressure have an effect on the volume of a gas?
</em>
- <em>Which brand of soap is the best for cleaning grease off dishes?
</em>
- <em>Which laboratory experiment is the most fun to perform?</em>
<em>
The below cannot be proved but can be explained
</em>
- <em>Is the information on the periodic table difficult to understand?
</em>
- <em>Which physicist was the smartest?</em>
Answer:
Hash.
Explanation:
An authentication can be defined as the process of verifying the identity of an individual or electronic device. Authentication work based on the principle (framework) of matching an incoming request from a user or electronic device to a set of uniquely defined credentials.
Basically, authentication ensures a user is truly who he or she claims to be, as well as confirm that an electronic device is valid through the process of verification. Smart cards, digital certificates, picture passwords, and biometrics are generally used to perform an authentication in the field of computer.
Hence, when authenticating a user's password, the password supplied by the user is authenticated by comparing the hash of the password with the one stored on the system.
In Computer science, a hash function can be defined as any function which is used to map data by accepting a block of data with variable length size or arbitrary size as input to produce a fixed size hash values or codes.
Generally, when a block of data (input) of arbitrary size is hashed, the resulting hash values or codes is usually smaller than the input data. Thus, hash functions are considered to be a compression of data and as a result, sometimes called compression functions. Basically, the block size of a hash function typically ranges from 128 bits to 512 bits.
Answer:
If all the character pairs match after processing both strings, one string in stack and the other in queue, then this means one string is the reverse of the other.
Explanation:
Lets take an example of two strings abc and cba which are reverse of each other.
string1 = abc
string2 = cba
Now push the characters of string1 in stack. Stack is a LIFO (last in first out) data structure which means the character pushed in the last in stack is popped first.
Push abc each character on a stack in the following order.
c
b
a
Now add each character of string2 in queue. Queue is a FIFO (first in first out) data structure which means the character inserted first is removed first.
Insert cba each character on a stack in the following order.
a b c
First c is added to queue then b and then a.
Now lets pop one character from the stack and remove one character from queue and compare each pair of characters of both the strings to each other.
First from stack c is popped as per LIFO and c is removed from queue as per FIFO. Then these two characters are compared. They both match
c=c. Next b is popped from stack and b is removed from queue and these characters match too. At the end a is popped from the stack and a is removed from queue and they both are compared. They too match which shows that string1 and string2 which are reverse of each other are matched.
The answer should be C, you need a text editor to write out the code, and then a web browser to view what the code creates.
