prelim_cpe181

4. A commonly used procedure for generating pseudorandom numbers.
9. It can be used to find all primes not exceeding a specified positive integer.
15. It is the smallest positive integer that is divisible by both a and b.
16. It is the process of making a message secret.
17. An algorithm characteristics that takes little time and memory to run.
19. It is used for illustrating set theoretic relationship.
20. A branch pf mathematics that discusses the properties of integers.

1. It is specifying a sequence of steps used to solve a problem.
2. It is an efficient method for computing the greatest common divisor for two integers.
3. 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.
5. It is a statement that invokes the procedure, giving it as its input the value of the argument expression.
6. Ciphers that replace each letter of the alphabet by another letter.
7. It can be thought of as groups which has members.
8. If the GCD of the integer is 1.
10. It is an example of shift cipher.
11. It is The process of recovering plaintext from ciphertext without knowledge both of the encryption method and the key.
12. It is the anti-thesis of Calculus.
13. It is simply a description of an algorithm in a language precise enough for a computer to understand.
14. It is a rectangular array of numbers.
18. It refers to the number of elements in a set.