mt1 - CS 373: Combinatorial Algorithms, Spring 1999 Midterm...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Midterm 1 (February 23, 1999) Name: Net ID: Alias: This is a closed-book, closed-notes exam! If you brought anything with you besides writing instruments and your 8 1 2 ′′ × 11 ′′ cheat sheet, please leave it at the front of the classroom. Don’t panic! Print your name, netid, and alias in the boxes above, and print your name at the top of every page. Answer four of the ±ve questions on the exam. Each question is worth 10 points. If you answer more than four questions, the one with the lowest score will be ignored. 1-unit graduate students must answer question #5. Please write your answers on the front of the exam pages. Use the backs of the pages as scratch paper. Let us know if you need more paper. Read the entire exam before writing anything. Make sure you understand what the questions are asking. If you give a beautiful answer to the wrong question, you’ll get no credit. If any question is unclear, please ask one of us for clariFcation. Don’t spend too much time on any single problem. If you get stuck, move on to something else and come back later. Write something down for every problem. Don’t panic and erase large chunks of work. Even if you think it’s nonsense, it might be worth partial credit. Don’t panic!
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 6

mt1 - CS 373: Combinatorial Algorithms, Spring 1999 Midterm...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online