C960: discrete math 2 WITH CORRECT ANSWERS /WELL
VERIFIED/ACTUAL EXAM!
Computational Complexity - ANSWER⭐☑️The amount of resources used by an algorithm
Time complexity - ANSWER⭐☑️The time an algorithm requires to run
Space complexity - ANSWER⭐☑️The amount of memory an algorithm uses
Atomic operations - ANSWER⭐☑️Operations that can't be split any further; a computer would evaluate
them in one step (addition, multiplication)
Asymptotic Notation - ANSWER⭐☑️mathematical tool for runtime complexity
Big-O Notation - ANSWER⭐☑️Rough upper bound for functions; worst case scenario
Omega Notation - ANSWER⭐☑️Similar to big O, but provides lower bound on the growth of the function
Theta Notation - ANSWER⭐☑️Indicates how the algorithm performs for any case; average time or
random
case function
O(f(n)) - ANSWER⭐☑️complexity never surpasses f(n)
Omega(f(n)) - ANSWER⭐☑️complexity is never smaller than f(n)
Theta(f(n)) - ANSWER⭐☑️complexity is usually f(n)
Keys - ANSWER⭐☑️Hard to find prime numbers used to secure data when encrypting
Fundamental theorem of arithmetic - ANSWER⭐☑️Every positive integer can be written uniquely as
product of prime numbers where they are written in non-decreasing order (smallest to biggest)
Multiplicity - ANSWER⭐☑️The number of times a prime factor appears in the product of primes
(exponent number)
GCD (greatest common denominator) - ANSWER⭐☑️Largest positive integer that is a factor of both x
and
y; find with the MIN # of each exponent pair
VERIFIED/ACTUAL EXAM!
Computational Complexity - ANSWER⭐☑️The amount of resources used by an algorithm
Time complexity - ANSWER⭐☑️The time an algorithm requires to run
Space complexity - ANSWER⭐☑️The amount of memory an algorithm uses
Atomic operations - ANSWER⭐☑️Operations that can't be split any further; a computer would evaluate
them in one step (addition, multiplication)
Asymptotic Notation - ANSWER⭐☑️mathematical tool for runtime complexity
Big-O Notation - ANSWER⭐☑️Rough upper bound for functions; worst case scenario
Omega Notation - ANSWER⭐☑️Similar to big O, but provides lower bound on the growth of the function
Theta Notation - ANSWER⭐☑️Indicates how the algorithm performs for any case; average time or
random
case function
O(f(n)) - ANSWER⭐☑️complexity never surpasses f(n)
Omega(f(n)) - ANSWER⭐☑️complexity is never smaller than f(n)
Theta(f(n)) - ANSWER⭐☑️complexity is usually f(n)
Keys - ANSWER⭐☑️Hard to find prime numbers used to secure data when encrypting
Fundamental theorem of arithmetic - ANSWER⭐☑️Every positive integer can be written uniquely as
product of prime numbers where they are written in non-decreasing order (smallest to biggest)
Multiplicity - ANSWER⭐☑️The number of times a prime factor appears in the product of primes
(exponent number)
GCD (greatest common denominator) - ANSWER⭐☑️Largest positive integer that is a factor of both x
and
y; find with the MIN # of each exponent pair
