• 申请人应取得美国认可的学士学位
学术背景： • Programming: • Data types (native and derived) • Operators, precedence, and expressions • Assignment and statements • Control flow (conditionals and iteration) • Functions, return types, and parameters • Recursion • Console and file I/O
Math: • Logic: propositional logic; quantifiers • Mathematical reasoning: methods of proof, direct proof, and indirect proof. Mathematical induction and strong induction • Counting: methods of counting; permutations, combinations, binomial theorem, pigeonhole principle, inclusion-exclusion • Discrete probability: discrete probability spaces; conditional probability and independence; Bernoulli trials, Bayes’s theorem, random variables, and expected value; variance, geometric and binomial distributions • Asymptotic notation • Recurrences and methods of solving recurrences • Graphs: simple graphs, isomorphism, paths, trees • Modular arithmetic, divisibility, prime numbers; GCD and Euclid’s algorithm, Fermat’s little theorem | 
