Computer Science 381
Programming Unix in C

Winter Immersion 2014, The College of Saint Rose

Home     Syllabus     Schedule

In this lab, you will see how to develop a data structure in C using a somewhat "object-oriented" methodology, despite the lack of language features to support object orientation.

Previous Example Revisited

One of the last lab's examples demonstrates this: the ratio.h and ratio.c files.

The structure definition and the four functions provide similar capabilities to a class in a language like Java. The fields of the structure are like instance variables of a Java class (though they would be more like public rather than the preferred protected or private instance variables). The create_ratio function plays the role of a constructor. The other functions are like the methods of a class.

Notice, however, that we have no mechanism for real data hiding. Anyone with access to a pointer to a ratio can access and modify the data fields. In fact, with the ability to use casts, we could treat the memory that was allocated as a ratio in completely unexpected (and likely incorrect) ways.

Also, all calls to functions that operate on a ratio must take the ratio as a parameter. So what would be something like

rat.print_ratio();

in an object-oriented language would be

print_ratio(rat);

here. This is what actually happens behind the scenes with real objects.

A More Complex Example

Consider this example, which is an implementation of a singly-linked list structure that holds int values.

See Example:
/home/cs381/examples/sll

Study this code to make sure you know how it works.

Programming Assignment: A C Q

Develop a queue structure and corresponding functions to operate on queues in C that hold int values. Include an approrpriate header file, implementation file, and a separate file with a main function that tests your implementation. Also include a Makefile that compiles your queue implementation and your testing code.

Recall that a queue is a first-in, first-out structure that should be able to be constructed, enqueue elements, dequeue elements, and answer whether it currently contains any element. You should also be able to deallocate the queue.

This program and its Makefile are worth 25 points.

The executable for the reference solution to this program is available on mogul in /home/cs381/labs/ooc.

Submission

Please submit all required files as email attachments to terescoj AT strose.edu. You are recommended to do so by Monday, January 13, 2014. Be sure to check that you have used the correct file names and that your submission matches all of the submission guidelines listed on the course home page.

Grading