This program was written for ACS 279 - Data Structures and Algorithms.  Data flow analysis programs are used to analyze how a set of jobs can be executed in the fastest possible order and time.  For those who know about graph algorithms, this would be considered a topological sort.  This program 1)tests for cycles in a directed graph, 2) gives a possible sequential order of the execution, and 3)gives a shortest time and total number of processors to executed the program.  Part three is not complete.  There are comments in the code that tell what is not completed.  There are also sample files in the zip file.

A Skip List is a special linked list that has a pointer array.  The size of the pointer array varies and allow for faster searching than a typical linked list.  A great interactive demo is located here.  This demo should explain Skip Lists better.  If you need more help you may want to read this article in .pdf format.  It is the same article that I had to use to write my program.  Very interesting algorithm/data structure.

This file contains a very good implementation of classes.  It contains the basic stack and queue functions.  There is a header file for queues and stacks.  There are also .cpp files for each.  The main function is program1.cpp.  This is an easy to follow program that helped me get started with classes.  Just compile the program with all of the .cpp files and be sure that the header files are in the same directory as the .cpp files.

This file is also a good implementation of a class.  It uses a linked list data structure to store a bunch of numbers.  The program reads in an input file.  Then sorts the file.  And then outputs the new sorted file.  The program takes three command line arguments.  The first is the program executable name.  The second is the input file, and the third is the output file.  I have included a small sample input file.  I feel that the linked lists are easy to follow and well implemented.  It will help out most people having trouble with classes and/or linked lists.

Here are some short examples of creating processes in UNIX.  Tree.c uses a call to fork() to create more copies of the program.  It generates a binary tree of processes.  Message.c uses a message queue to store a 5 character string and then creates 5 children processes.  Each child changes one of the characters in the string.  Shared.c also creates 5 children to do the same thing as message.c, however, it uses shared memory instead of a message queue.  These program use a header file created by my teacher Dr. Janet Hartman.  She is a professor at ISU and one of the best in the Computer Science Sequence.  The class that I wrote these for is ACS 325.

For more information on this Interpreter program follow this link to the pages that my group made.  It should explain everything.  I had to write this program for my ACS 327 class - Concepts in programming languages.  It was very difficult and tedious.  It is kind of like a compiler.  Check it out!

This date program runs through the file supplied (8a.1) and tells what the previous and next date is.  It is a simple program with some specific rules that have to be followed in order to get each date correct.  The biggest reason that i have chosen to include this file is because it demonstrates how to use multiple files in a project.  To make this program work you must make a project and include all of the files in the project.  There is a header file that has all of the function prototypes in it.  This header file must be in the same directory as the other files.  After you include all of the files in the project just compile and fun.  Make sure that the path for the input file is correct!

 Sort Functions
 Sample input for sorting functions
 Array Implementation of Booth's Algorithm
 Random (Misc) Functions
 Stop Watch Functions (Timing)
 Miscellaneous C++ Functions
 
 

BACK TO LANGUAGES              HOME