<a href="http://www.unlv.edu/">University of Nevada Las Vegas </a> <a href="http://www.egr.unlv.edu/"> Howard R. Hughes College of Engineering </a> <a href="http://www.cs.unlv.edu/"> School of Computer Science </a> <a href="http://www.cs.unlv.edu/~larmore"> My Home Page</a> UNLV CS Spring 2007 Assignment 2

CS 302 Assignment 2

Due date: Tuesday, January 30, 2007, 8:30 AM in class.

All programming assignments must be submitted electronically. Submit them to the graduate assistant, James Oravec, on or before the due date.
All written assignments must be handwritten (not typed or printed from a computer file) in your own handwriting, on 8.5 by 11 inch paper, or on A4 paper. Write your name on each sheet, and do not fold the pages or crimp the corners. (You may use a paper clip or a staple.)

Chapter 1 and 2 - Reading Review questions.
1. What is the difference between pass by reference verses pass by value?
2. What is a Copy Constructor?
3. What is a class template?
4. What is operator overloading?
5. What is the definition of Big O?
6. What is the definition of Big Omega?
7. What is the definition of Big Theta?
8. What is the importance of asemptotic time complexity analysis?
9. Explain the maximum subsequence sum problem.
10. What is a binary search?
11. Explain Euclid's Algorithm.
Chapter 3 and 4 - Review Questions. You may also consult outside sources such as wikipedia.
1. What is an Abstract Data Type?
2. Why are Abstract Data Types important?
3. What is a list ADT?
4. List two ways a list ADT can be implemented.
5. Define a doubly linked list.
6. Define a circular linked list.
7. Define a stack ADT and what one can be used for.
8. What are infix expressions? Give an example that has at least 4 operators and at least two necessary pairs of parentheses.
9. What are postfix expressions? Give the postfix expression equivalent to the infix expression that you gave for the previous problem.
The programming assignment, Exercise 3.22 on page 110 of your textbook, will be due next Tuesday.