CSC517-F: Algorithms


Prof. B. Rosenberg
Fall Semester, 2004-5 (051)
MWF 1:25-2:15 PM
Memorial Building, Room 205
The Class Syllabus


Exams:

Announcements:

Notes:

Projects:
CSC 401: Practicum assignments

  1. Write selection sort, insertion sort.
  2. Run selection and insertion sort on random data of increasing data set size. Plot the run-time and see if you get an n2 result.
  3. Run insertion sort on initially sorted data of increasing data set size. What does the plot of run time give in this case? Interpret.
  4. Due date: Please finish Practicum problems 1-3 by October 1.
  5. Write various versions of hashing, including deletion, and run tests. Details
    Due: Nov 8.
  6. Write a program which Huffman encodes a text file, producing an encoded text and a encoding table. It should also operate on the encoded text and the encoded table to decode the file. You can simplify the problem by mapping the characters of the file to encode to a simpler set (such as mapping all characters to lower case, and all non-characters to a blank).
    Due: Dec 3.
Homework:
  1. Exercises 2.1-1, 2.1-3, 2.1-4 and 2.2-4.
    Due: Sept 3.
  2. Exercises 3.1-1, 3.1-2, 3.1-3, 3.1-7.
    Due: Sept 15. New Due Date
  3. Problems 3-1, 3-2, 3-3, Extra Credit: 3-4.
    Due: Sept 22.
  4. The following exercises:
    1. 6.1-1 through 6.1-6,
    2. 6.2-1 through 6.2-5,
    3. 6.3-1 through 6.3-3,
    4. 6.5-1 through 6.5-5.
    5. Extra Credit: 6.5-6 through 6.5-8.
    Due: Monday, Oct 4. New due date
  5. Exercises 11.1-1, 11.1-2, 11.2-1,11.2-2, 11.3-1, 11.3-2, 11.3-3, 11.4-1 and 11.4-2.
    Due: Monday, Nov 1.
  6. Problems 13-2 and 13-3.
    Due: Monday, Nov 8.
  7. Exercises 15.2-1 through 15.2-4, and 15.4-1 through 15.4-4.
    Due: Monday, Nov 22.
    New due date: Monday, Nov 29.
  8. Exercises 22.1-1 through 22.1-5; 22.2-1, 22.2-2; 22.3-1 through 22.3-5.
    Due: Friday, Dec 3.