This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 373g: Algorithms, Fall 2003 Midterm — October 2, 2003 Name: Net ID: Alias: This is a closedbook, closednotes, openbrain exam. If you brought anything with you besides writing instruments and your handwritten 8 1 2 00 × 11 00 cheat sheet, please leave it at the front of the classroom. Print your name, netid, and alias in the boxes above. Print your name at the top of every page (in case the staple falls out!). You should answer all the questions on the exam. The last few pages of this booklet are blank. Use that for a scratch paper. Please let us know if you need more paper. If your cheat sheet if not hand written by yourself, or it is photocopied, please do not use it and leave it in front of the classroom. Submit your cheat sheet together with your exam. An exam without your cheat sheet attached to it will not be checked. If you are NOT using a cheat sheet you should indicate it in large friendly letters on this page. There are 20 multiple choice questions. There is only a single correct answer for each question. A correct answer would gain you one point, and incorrect answer gains you zero points (i.e., no penalty for incorrect answer). In case of several \correct" answers, you should chose the one which is better. Time limit: 75 minutes. Relax. Breathe. This is just an easy, silly and stupid midterm. # Score Grader Total CS 373g Midterm Questions (October, 2003) Fall 2003 1 CS 373g Midterm Questions (October, 2003) Fall 2003 1. The solution to the recurrence A ( n ) = A ( √ n ) + log n is A. Θ( n ) . B. Θ( √ n ) . C. Θ(log n ) . D. Θ(log * n ) . E. None of the above. Answer: 2. Given two graph G 1 and G 2 , deciding if one can delete k vertices from G 1 and get the graph G 2 is A. NPcomplete. B. can be solved in polynomial time. C. none of the above. Answer: 3. Given a set A of log n integer numbers, and a set B of n integer numbers, deciding if there is a subset of A that add up to a number t such that t ∈ B is A. NPHard....
View
Full
Document
This note was uploaded on 11/26/2009 for the course CIS 502 taught by Professor Naver during the Spring '09 term at National Tsing Hua University, China.
 Spring '09
 Naver
 Algorithms

Click to edit the document details