<strong> <br><a href="http://www.unlv.edu/">University of Nevada Las Vegas </a> <br><a href="http://www.egr.unlv.edu/"> Howard R. Hughes College of Engineering </a> <br><a href="http://www.cs.unlv.edu/"> School of Computer Science </a><br> <a href="/larmore/"> My Home Page</a><br> </strong> UNLV CS Fall 2011 First Examination

Topics on the first examination, CS 302

Thursday, September 22, 2011, 1:00 PM

  1. True-false and fill-in-the-blank questions.
  2. Short definitions. What is a ________________ ? These will be one-liners; if you write a page, you automatically get it wrong.
  3. Sorting functions by asymptotic class, as we did in Assignment 1.
  4. Analyzing code fragments, such as in Assignment 3.
  5. Questions about sorting.
  6. Implementations of queues and stacks, using arrays and linked lists.
  7. The algorithm for shortest path in a graph, using a queue.
  8. The algorithm for evaluating a postfix (reverse Polish) expression using a stack.