CS3240: Data Structures and Algorithms

This class has a series of shorter projects called exercises linked here as well as of the outline.

ALL WORK IS INDIVIDUAL unless explicity written differently

EXERCISES (50 points each unless otherwise noted) must demo in person!!! PROJECTS (points as indicated on page)

 

YOU will recieve NO credit if you are asked to demonstrate in person AND you have not done this.

Ex- Memory Ex- Binary Search
Ex- Linked List Ex- BST Ex- Sort

Ex- Hash

(may not be assigned)

Proj Research

 

 

 

 

Commenting Code and Zipping Entire Project Folder

   From now on I will be taking off the MINIMUM of the following points for not commenting SUFFICIENTLY and not zipping up your entire MS Visual Studio Project folder

1) -3 points Do not zip up entire MS Visual Studio Project folder containing all necessary resources


2) -6 points Do not SUFFICIENTLY Comment your code (by this time this should be second nature to you as a junior level programmer).  Here are my requirements:

  • Comment heading at the top of EVERY file including:  Name, Purpose of File, Date
    • Example:  

      /*  Name=Lynne Grewe
      *  filename= SSortedList.h
      *  Purpose= Header File for SSortedList class that represents a Sorted List
      *  Date = Feb 5, 2013
      */



  • Comment before EVERY function (including main) including: Name of Function, List of parameters and meaning of each one, Return type explained, Description of what function does
    • /* function:  binarySearch(first, last, item)
      * return:  index of location of where item is located, returns -1 if not found
      * parameters:   first = start index,  last= ending index, item=item value to search for
      * description:  this member function (or just regular function) will perform binary search on the SSortedList
      * data starting at index first to last, looking for item.  Will also
      * print out the values of visited nodes in the SSortedList.
      */

  • Comment next to EVERY variable  (in classes AND functions)
    • Example:      int pivot_point;   //represents the pivot point used in our QuickSort algorithm

  • Comment inside of functions in front of each "major" block of code doing some operation.
    • Example:
      //this double for loop visits each pixel in the image array img[][] and brightens the image by
      // adding a value v to its value
      for(r=0;r<rows;r++)
      for(c=0;c<cols;c++)
      if(img[r][c] + v <= 255)    //saftey check as do not want to go above 255
      img[r][c] +=v;
      else
      img[r][c] = 255;  //if would be greater than 255 cut off at that value.

 

© Lynne Grewe