STEPHEN E. MENDES

C PROGRAMS

List ADT 1

These first 3 programs are the same, except for the list ADT. The program reads an input file of single digit integers, one per line, and puts them into a list L (the ADT). The list is then printed, purged of duplicate elements and printed again. This one uses the ARRAY model.

List ADT 2

As above, but this one uses the LINKED LIST model with NO header cell.

List ADT 3

This one uses the LINKED LIST model and a HEADER CELL.

Polynomial Addition

Takes two input files. Each line in an input file contains a single term (the coefficient, followed by a space, then the exponent). the polynomials can be any length, but the terms must be entered highest exponent first.

Polynomial Multiplication

Takes two input files. Each line in an input file contains a single term (the coefficient, followed by a space, then the exponent). the polynomials can be any length, but the terms must be entered highest exponent first.

Priority Queue

Several insertions (events) are added to the queue as the program runs (these are hard coded into the program for simplicity) also serveral events are removed from the queue. The HEAP model is used and the integers added represent the priority of the events, with a lower number meaning HIGHER priority.

The SECRET NOTEBOOK.

This little application, I wrote as a project for my Systems Programming class. Have fun with it !! Modify it, any way you want, if you feel like telling me, I would LOVE to hear from you ! (You need to link it to 13 other files, 11 of them on Assembly Lang. page, be sure to download all of them before starting).

File Handler for the SECRET NOTEBOOK

Sound Driver for the SECRET NOTEBOOK

Back to Homepage.

Back to PROGRAM page.

© copyright 1995-97 Stephen E. Mendes, Barbados.