{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

final-f2008

# final-f2008 - 6.006 Fall 2008 Final Examination...

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 finding 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 finding the shortest path from s to t in a directed, weighted graph exhibits optimal substructure. Explain: (f) T F A single rotation is sufficient 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.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern