Pre-313 quiz administered on the first day of classes Fall 2000

  Question  tally
1. Complexity of comparison sorting is inherently
  (i) linear
  (ii) logarithmic
  (iii) quadratic		 
 20
 35
 22
2. Complexity of matrix multiplication is
  (i) linear
  (ii) quadratic
  (iii) cubic		  
 13
 17
 8
3. Fibonacci sequence is
  (i) a new linear data structure
  (ii) a useful tool in program complexity analysis
  (iii) a cryptographic method		  
 9
 20
 8
4. Loop invariant
  (i) can be used in analysis of data structure complexity
  (ii) can be used to prove correctness of iterative programs
  (iii) can be used in defining class structure in an OOP		  
 21
 45
 13
5. Bucket sorting and hashing
  (i) use related concepts
  (ii) have nothing in common
  (iii) depend on the distribution of key values 		 
 10
 0
 13
6. Dynamic programming is
  (i) a novel OOP language
  (ii) an optimization method
  (iii) a data structure		  
 6
 26
 10

Mercifully, these questions were not asked on the final...