final-f2008

# final-f2008 - December 15, 2008 6.006 Fall 2008 Final...

This preview shows pages 1–5. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
6.006 Final Examination Name 2 Problem 1. Miscellaneous True/False [18 points] (6 parts) For each of the following questions, circle either T (True) or F (False). Explain your choice. (No credit if no explanation given.) (a) T F If the load factor of a hash table is less than 1, then there are no collisions. Explain: (b) T F If SAT P A , then A is NP-hard. Explain: (c) T F The longest common subsequence problem can be solved using an algorithm for ﬁnding the longest path in a weighted DAG. Explain:
6.006 Final Examination Name 3 (d) T F Applying a Givens rotation to a matrix changes at most one row of the matrix. Explain: (e) T F The problem of ﬁnding the shortest path from s to t in a directed, weighted graph exhibits optimal substructure. Explain: (f) T F A single rotation is sufﬁcient to restore the AVL invariant after an insertion into an AVL tree. Explain:

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
6.006 Final Examination Name 4 Problem 2. More True/False [18 points] (6 parts) For each of the following questions, circle either T (True) or F (False). Explain your choice. (No credit if no explanation given.) (a) T F Using hashing, we can create a sorting algorithm similar to COUNTING - SORT that sorts a set of n (unrestricted) integers in linear time. The algorithm works
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/20/2012 for the course CS 6.006 taught by Professor Erikdemaine during the Fall '08 term at MIT.

### Page1 / 17

final-f2008 - December 15, 2008 6.006 Fall 2008 Final...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online