~~TOC~~
Corning Community College
Data Structures
Projects
To provide a list of programming projects to aid in the understanding of course concepts and gaining of valuable development experience.
A core part of your work in the course will revolve around performing projects. This will offer you many opportunities to both learn and apply important concepts, and achieve a better mastery of material.
The method of undertaking a project will generally take the following form:
The aim here is two-fold:
Before starting on a project, you must obtain approval from me regarding the following items:
If desired, a sample template is available here that you can copy and paste into an applicable portfolio page.
All projects undertaken need to be documented on the wiki in your portfolio namespace. Specifically, you should set up a front page at:
And link to projects within the namespace:
Project documentation needs to have (at least) the following sections:
The following are the programming attributes you must consider while undertaking a project for credit in this course:
Attribute | Qty needed | Description |
---|---|---|
pointers | 8 | indirection/dereferencing are demonstrated |
malloc/new | 4 | utilization of dynamic memory allocation |
linked lists | 2 | implementation/utilization of a linked list |
doubly linked lists | 4 | implementation/utilization of doubly linked lists |
stacks | 4 | implementation/utilization of stack data structure |
queues | 4 | implementation/utilization of queue data structure |
sorts | 4 | implementation/utilization of a sorting algorithm |
trees | 2 | implementation/utilization of a tree data structure |
graph | 1 | implementation/utilization of a graph data structure |
hash table | 1 | implementation/utilization of a hash table data structure |
file I/O | 2 | demonstration/utilization of file I/O in your code |
libraries | 4 | implementation/utilization of non-core libc library that aids you in projects |
There are a total of 40 items needed; with a maximum of 6 achievable per project, that makes for a minimum of 7 projects you must perform during the semester.
Note that where multiple quantities of attributes are concerned, only a single instance of an attribute can be achieved on any single project.
You need to keep an inventory of the total attributes you've achieved, displayed on your project portfolio page for this course.
The following are possible sources of projects you can undertake in this course. Note that while most of these can be solved by hand, and some have a single solution, your task is to implement a computer program to solve the problem, making use of the programming concepts and creating effective algorithms for accomplishing these tasks.
Projects here are listed in no particular order, please do not correlate difficulty with arrangement.
Project | Description | Potential Attributes |
---|---|---|
Euler | Various mathematical/scientific problems | varies |
Logic | Various logic/combinatorial problems | varies |
Cardgame Project | Implement a card game | varies |
Course Prerequisites | Process course prerequisites | pointers, file I/O |
BMP to RLE | Image format conversion | varies |
linked list library | Create your own Linked List Library for use in other projects | pointers, malloc/new, linked lists |
stack library | Expand the Linked List Library to incorporate stack functionality | pointers, malloc/new, stacks |
queue library | Expand the Linked List Library to incorporate queue functionality | pointers, malloc/new, queues |
Again, these are not the only nor required projects, they are suggestions and worthwhile explorations. It is highly recommended you at least start with some of these projects, then as you find a particular direction or interest, pursue it.
A couple things to keep in mind:
In addition to posting the appropriate project documentation under your portfolio namespace, you must also attend to the following: