prelim_CPE105

4. It is simply a description of an algorithm in a language precise enough for a computer to understand.
8. If the GCD of the integer is 1.
9. IT is a definite procedure for performing some sort of task.
10. It is the smallest positive integer that is divisible by both a and b.
13. It refers to the number of elements in a set.
16. Ciphers that replace each letter of the alphabet by another letter.
17. It can be thought of as groups which has members.
18. It is used for illustrating set theoretic relationship.
19. It is the process of making a message secret.

1. If a and b are integers and m is a positive integer, then a is congruent to b modulo m if m divides a – b.
2. It is an example of shift cipher.
3. A commonly used procedure for generating pseudorandom numbers.
5. It is a rectangular array of numbers.
6. A branch pf mathematics that discusses the properties of integers.
7. It is a statement that invokes the procedure, giving it as its input the value of the argument expression.
11. It can be used to find all primes not exceeding a specified positive integer.
12. It is an efficient method for computing the greatest common divisor for two integers.
14. It is the anti-thesis of Calculus.
15. It is The process of recovering plaintext from ciphertext without knowledge both of the encryption method and the key.