Description
1. True or False （1pts, 0.5pts per question）
A) The class NP consists of those problems that are verifiable in polynomial time.
B) NP is the class of languages that are not decidable in polynomial time on a deterministic single-tape Turing machine.
2. How many characteristics does an algorithm have? What are they？（3pts）
3. How many algorithm representations have we learned? What are they? (2pts)
4. Ordering the following functions by order of growth. Please give the calculation process. (4 pts)
(1.5)n log (log n) 2n
8n3+ 17n2
