final - CS 373 Combinatorial Algorithms Spring 1999 Final...

Info icon This preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Alias: This is a closed-book, closed-notes exam! If you brought anything with you besides writing instruments and your two 8 1 2 ′′ × 11 ′′ cheat sheets, please leave it at the front of the classroom. Print your name, netid, and alias in the boxes above, and print your name at the top of every page. Answer six of the seven questions on the exam. Each question is worth 10 points. If you answer every question, the one with the lowest score will be ignored. 1-unit graduate students must answer question #7. 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 clarification. 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. # Score Grader 1 2 3 4 5 6 7
Image of page 1

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

View Full Document Right Arrow Icon
Name: CS 373 Final Exam 1. Short Answer sorting induction Master theorem divide and conquer randomized algorithm amortization brute force hashing binary search depth-first search splay tree Fibonacci heap convex hull sweep line minimum spanning tree shortest paths shortest path adversary argument NP-hard reduction string matching evasive graph property dynamic programming H n Choose from the list above the best method for solving each of the following problems. We do
Image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    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.

    Student Picture

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

  • Left Quote Icon

    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.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    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.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern