Final projects are available here. They are due Friday, 5/9/03.
Read section 10.1-10.3 for Monday,.
Lab9 is the programming project 5 on page 416. Due Monday, 4/28.
You will implement a priority queue using a linked list. You can use all the files provided in
P\Class\Math\Aydin\Spring03\Math218\Chapter8\Lab9
Quiz on chapter 7.
Lab8 is due Monday 4/21.
Read sections 8.1 and 8.2 for Monday
Lab 7 : Implement the polynomial class so that the data type of coefficients is a template parameter so that we can declare polynomials having either integer or double or complex coeffients in the same program.
Your main program should look like this.
This is basically the programming project 6 on page 336 of the textbook and a revision of Lab 5.
You will also need to use the complex number class you did earlier in the course. Notice that you may need to add a few things to that class (e.g. more constructors, more operators to be overloaded).
If you are having trouble with projects, we will discuss an alternative method in class.
Due Wed, 4/9.
3/31/03: Read sections 6.1 and 6.2.
A simple program demonstrating a template function.
The midterm will be on Wed, 3/26
Lab6 is due Monday, 3/24.
Here are all the files (project) for the bag class implementation using a linked list.
2/24/03: Quiz on Chapter 4 on Wed.
Lab 5 is due Friday by midnight.
Implement the polynomial project as described in the class ( also in section 4.6 of the textbook but there are slight differences).
You don't need to implement "other operations". But carefully and throughly test your program.
Here are the files for the dynamic bag class: header file, implementation file and application file.
Also a demonstration program for dynamic memory.
Lab 4 is due 2 pm, Wed, 2/19.
Do problems 3 and 4 on page 136. Implement all the functions suggested in problem 3. Write 3 files under a project: a header file for the sequence class, an implementation file for the sequence class and an application file containing the main function. The application file should be similar to Figure 3.10 (page 129-131) and it should provide the user with a menu and take appropriate actions based on the user choice. Carefully test each one of your functions.
2/5/03: Quiz on sorting algorithms. Finish up 13.2. Start working on Lab 3
1/29/03 Wed: Quiz and finish up recursion, then we'll go over 12.1. Lab 2 is due 2 pm on Wed 2/5 and consists of 2 (small) programming projects: #13 on page 452 and #2 on page 594. Next topic for Monday will be 13.1 and 13.2
1/22/03 Wed: Finish up Chapter 2 with operator overloading. Here is Lab1 on the material of chapter 2. It is due Monday, 1/27. Read Chapter 9 (Recursion) before the class on Wednesday. Handout on recursion.
1/20/03 Mon: A quick review of classes. Take a look at Chapter2.ppt and NOTES02.pdf We won't talk about these in clas but talk about header and implementation files (projects) and operator overloading.
1/15/02 Wed: Course Admin, Recall basics, Chapter 1.
Chapter Notes: Chapter1.ppt (power point version) Chapter1.pdf (pdf version, compact) NOTES01.pdf (pdf version expanded).
Hmw: Read all of Chapter 1. Work on the Practice Sheet with Big-O Notation. Do Lab0. due Wed 1/22.
Read Chapter 2 before class on Monday.