This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: NAME: CSE 331 Introduction to Algorithm Analysis and Design Sample Midterm Exam: Fall 2011 Atri Rudra DIRECTIONS: • Closed Book, Closed Notes except for one 8 1 2 ” × 11” review sheet. • Time Limit: 50 minutes. • Answer the problems on the exam paper. • Each problem starts on a new page. • Make sure you write your NAME on the paper. • If you need extra space use the back of a page. • Problem 3b is a bonus problem. 1a /10 1b /10 1c /10 1d /10 2 /45 3a /15 3b /10 Total /100 Bonus /10 FEW GENTLE REMINDERS: • You can quote any result that we covered in class or any problem that was there in a homework (but remember to explicitly state where you are quoting a result from). • If you get stuck on some problem for a long time, move on to the next one. • The ordering of the problems is somewhat related to their relative difficulty. However, the order might be different for you!...
View
Full Document
 Fall '11
 RUDRA
 Graph Theory, Big O notation, Analysis of algorithms, adjacency matrix, Adjacency list, Algorithm Analysis and Design

Click to edit the document details