Problem 1
Match the Big-O notation with its definition or use. A. \(\mathrm{O}(1)\) B. \(\mathrm{O}\left(\log _{2} N\right)\) C. \(\mathrm{O}(N)\) D. \(\mathrm{O}\left(N \log _{2} N\right)\) E. \(\mathrm{O}\left(N^{2}\right)\) F. \(\mathrm{O}\left(2^{N}\right)\) G. O \((N !)\) Factorial time
Problem 2
Match the Big-O notation with its definition or use. A. \(\mathrm{O}(1)\) B. \(\mathrm{O}\left(\log _{2} N\right)\) C. \(\mathrm{O}(N)\) D. \(\mathrm{O}\left(N \log _{2} N\right)\) E. \(\mathrm{O}\left(N^{2}\right)\) F. \(\mathrm{O}\left(2^{N}\right)\) G. O \((N !)\) \(N \log N\) time
Problem 3
Match the Big-O notation with its definition or use. A. \(\mathrm{O}(1)\) B. \(\mathrm{O}\left(\log _{2} N\right)\) C. \(\mathrm{O}(N)\) D. \(\mathrm{O}\left(N \log _{2} N\right)\) E. \(\mathrm{O}\left(N^{2}\right)\) F. \(\mathrm{O}\left(2^{N}\right)\) G. O \((N !)\) Linear time
Problem 4
Match the Big-O notation with its definition or use. A. \(\mathrm{O}(1)\) B. \(\mathrm{O}\left(\log _{2} N\right)\) C. \(\mathrm{O}(N)\) D. \(\mathrm{O}\left(N \log _{2} N\right)\) E. \(\mathrm{O}\left(N^{2}\right)\) F. \(\mathrm{O}\left(2^{N}\right)\) G. O \((N !)\) Quadratic time
Problem 6
Match the Big-O notation with its definition or use. A. \(\mathrm{O}(1)\) B. \(\mathrm{O}\left(\log _{2} N\right)\) C. \(\mathrm{O}(N)\) D. \(\mathrm{O}\left(N \log _{2} N\right)\) E. \(\mathrm{O}\left(N^{2}\right)\) F. \(\mathrm{O}\left(2^{N}\right)\) G. O \((N !)\) Logarithmic time
Problem 8
Match the Big-O notation with its definition or use. A. \(\mathrm{O}(1)\) B. \(\mathrm{O}\left(\log _{2} N\right)\) C. \(\mathrm{O}(N)\) D. \(\mathrm{O}\left(N \log _{2} N\right)\) E. \(\mathrm{O}\left(N^{2}\right)\) F. \(\mathrm{O}\left(2^{N}\right)\) G. O \((N !)\) Time not dependent on the size of the problem
Problem 16
Match the name of the technique with the algorithm. A. Even parity B. Odd parity C. Check digits D. Error-correcting codes E. Parity bit An extra bit is associated with each byte in the hardware that ensures that the number of 1 bits is odd or even across all bytes.
Problem 18
Match the name of the technique with the algorithm. A. Even parity B. Odd parity C. Check digits D. Error-correcting codes E. Parity bit The number of 1 bits plus the parity bit is odd.
Problem 19
Match the name of the technique with the algorithm. A. Even parity B. Odd parity C. Check digits D. Error-correcting codes E. Parity bit The number of 1 bits plus the parity bit is even.
Problem 21
Mark the answers true or false as follows: A. True B. False \((1+x-1)\) is always equal to \(x\).
