CSC 326 COURSE PAGE

Spring 2000

Syllabus

Sample Exams

Exam I

Exam II  - HTML format,  Word format

Exam III

LABS

How to FTP your labs.

Lab1

Lab 2 - The Game of Life (Classes)

Lab 3 - Parking Garage

Lab4 - Queues

Lab5 - Expression Trees

Extra Credit Lab6 - Heapsort

WEB PRESENTATIONS

Exception Handling

Sorting and Searching

HANDOUTS

• linked list - array implementation

• stack2.h - array implementation of stack

• array implementation of a queue

• Linked Lists

  llist.h

  llist.cpp

• Queues

lqueue.cpp

lqueue.h

• Linked Stacks

  lstack.h

  lstack.cpp

HOMEWORK

Linked Lists - Nyhoff - pgs  448 - 449  1 - 7

Doubly Linked Lists - Nyhoff pgs 499 1 - 8

Queues -

  Due Monday

Using the array implementation of a queue, show how the queue, front, and rear change after each of the following instructions.

Q.Add(z);

Q.Add(f);

Q.Add(g);

Q.Add(m);

Q.delete(x);

Q.delete(x);

Q.Add(m);

  ***In addition Nyhof pgs pg 226    1-4 (assume the empty space is maintained before front in a full queue, ie the first queue element is placed in array positon 1.

Nyhoff pg 227       15