Answer:
Option C
Explanation:
The museum authority can easily automate the process of storage of data on cloud once the document is prepared.
This shall help is easy access to data to all and will also prevent issues arising because of non storage of data or some form of mis-happening leading to data loss.
Answer:
Hippocampus.
Explanation:
There are two parts of the limbic system. They are the frontal part which is the amygdala and the posterior part which is the hippocampus.
The hippocampus is an extension of the temporal part of the cerebral cortex which is a plastic-like structure that can be easily damaged by stimuli. It is packed with densed neurons and forms an S-shape at the extension of the temporal part.
It is responsible for learning and memory and damage to it can result to memory loss of recently learnt information.
Answer:
(a) 
= 
Explanation:
To convert from binary to hexadecimal, convert each 4 binary digits to its hexadecimal equivalent according to the following;
<em>Binary => Hex</em>
0000 => 0
0001 => 1
0010 => 2
0011 => 3
0100 => 4
0101 => 5
0110 => 6
0111 => 7
1000 => 8
1001 => 9
1010 => A
1011 => B
1100 => C
1101 => D
1110 => E
1111 => F
(a) 1100 1111 0101 0111
=> Taking the first four binary digits : 1100
According to the table, the hexadecimal equivalent is C
=> Taking the second four binary digits : 1111
According to the table, the hexadecimal equivalent is F
=> Taking the third four binary digits : 0101
According to the table, the hexadecimal equivalent is 5
=> Taking the last four binary digits : 0111
According to the table, the hexadecimal equivalent is 7
Therefore, the hexadecimal representation of
1100 1111 0101 0111 is CF57
Answer:
To make a computer more secure
Explanation:
we have following ways :
1)we should have anti virus to protect our computer.
2)we should not play or look computer for a long time because it destroy our files
Answer:
Sorting Algorithm
Explanation:
Here we are arraigning the elements in ascending order. Using for loop we are iterating through all the elements. in one iteration the first minimum element in the list is at 1st place and in the second iteration the second minimum element is in 2nd position and so on
