Assignments for Computer Science 201

The following table indicates assignments and due dates for Computer Science 201. Unless otherwise indicated, textbook references are to course textbooks. Additional exercises are stated later on this page. Rules for submitting programs are given at the bottom of this page.

Collaboration is allowed on some assignments and not on others; specific rules of collaboration are shown for each assignment.

Due Date	Text	Chapter	Collaboration	Problems
Fri., Jan 28	Gries	1	No	1.3, 1.4
Tues, Feb 1	C Prog.	−	No	Lab 1: Elementary C Programming
Fri, Feb 4	Gries	2	No	2.5, 2.6cefghjkl
Tues, Feb 8	C Prog.	−	Yes	Lab 2: Representation of Integers
Fri, Feb 11	Gries	4	No	4.1.3, 4.2.6a-bjkm, 4.4.2, 4.5.2ac
	Gries	5	No	5.1.1ace, 5.1.2bfg, 5.2.2, 5.2.3
Tues, Feb 15	C Prog.	−	Yes	Lab 3: Floating Point Numbers
Fri, Feb 18	Gries	6	No	6.2.1deg
Tues, Feb 22	C Prog.	−	Yes	Lab 4: Functions and Parameter Passage
Mon, Feb 28	Gries	7	No	7.1acef, 7.2(1,3,5), 7.4, 7.5
	Gries	8	No	8.1, 8.3, 8.6
Fri, Mar 4	Gries	9	No	9.1.1ace, 9.2.2, 9.2.3bdf, 9.2.4ace, 9.3.1ace
Mon, Mar 7	C Prog.	−	No	Lab 5: Singly-Linked Lists
Wed, Mar 9	C Prog.	−	No	Lab 6: More Singly-Linked Lists
Fri, Mar 11	Gries	10	No	10.1, 10.3, 10.5, 10.6, 10.8
Wed, Mar 16	C Prog.	−	No	Lab 7: Still More Linked Lists
Fri, Mar 18	Gries	11	No	11.1, 11.8, 11.9, 11.10, 11.12
Tues, Apr 5	C Prog.	−	No	Lab 8: Queues as Circular Lists
Fri, Apr 8	Gries	14	No	14.1abd
Tues, Apr 12	C Prog.	−	No	Optional Extra Credit Problems 1, 2, 3
Tues, Apr 12	C Prog.	−	Yes	Lab 9: Strings in C, Parts A-C
Tues, Apr 19	C Prog.	−	Yes	Lab 9: Strings in C, Part D
Fri, Apr 22	Gries	15	No	15.1.3, 15.1.4, 15.2.2
Mon, Apr 25	C Prog.	−	Yes	Lab 10: Binary Search Trees
Wed, Apr 27	C Prog.	−	No	Lab 11: More Binary Search Trees
Fri, Apr 29	Gries	16	No	16.2.2, 16.2.3
	Gries	16	No	16.3.1, 16.3.5, 16.3.7
Wed, May 4	C Prog.	−	Yes	Lab 12: Files in C
Fri, May 6	Gries	16	No	16.5.2, 16.5.5, 16.5.9
Mon, May 9	C Prog.	−	Yes	Lab 13: make and makefile
Fri, May 13	C Prog.	−	Yes	Lab 15: Environmental Variables
Due Date	Text	Chapter	Collaboration	Problems

Additional Exercises

Assignment details for this course are forthcoming

Extra Credit Problems

The following exercises are optional. If turned in by the deadline given, they may earn extra credit points to be applied to the lab grade.

Extra Credit Problem 1: Due Tuesday, April 12

Modify ~walker/c/lists/namelist.c, by adding an option that will delete duplicate names on a singly-linked list. When duplicate names appear, the first entry on the list should be retained, and all subsequent duplicate entries deleted.

This problem should use an iterative solution, with no more than 3 temporary pointers (including function parameters).

Extra Credit Problem 2: Due Tuesday, April 12

Modify your doubly-linked-list program to include an option to sort the names on the list into ascending alphabetical order.

Your sorting procedure should use an insertion sort that moves nodes. The sorting procedure may not deallocate space or allocate space for nodes, and names may not be copied from one node to another (even through an intermediate character array).

Extra Credit Problem 3: Due Tuesday, April 12

Modify your doubly-linked-list program to delete duplicates from the list, assuming the list is ordered.

This problem should use an iterative solution, with no more than 3 temporary pointers (including function parameters).

This procedure should use a hush-and-kernel approach, in which the kernel is recursive. Other than parameters, the hush may have no local variables, and the kernel may have at most one local variable.

Submitting Programs For This Course: In turning in any programs for the course, please follow these directions:

1. The first six lines of any C program should be comments containing your name, your mailbox number, this course number (195), and an identification of assignment being solved. For example:

   
       /**************************************
        * Henry M. Walker                    *
        * Box Science II                     *
        * Program for CSC 201               *
        * Assignment for Friday, September 1 *
        **************************************/
   

   Also, a comment is needed for every definition of a C function, stating both pre- and post-conditions for that program unit.

2. Obtain a listing of your program and a record of relevant test runs using the script command:
   • Within a terminal window (before running C), begin recording session with the statement
     
     script filename
     
     where filename is the name of the file in which you want the session stored.
   • Within the script file,
     • Print a copy of your program with the command
       
       cat C-file.c
       
       where C-file.c is the name of the file containing your C program.
     • If your work involves several files, list the main program first with the cat command; then list any supplementary files.
     • Compile your program with the gcc command, and run it with appropriate test cases to check the correctness of your program.
   • When your runs are complete, stop the script session by typing <Ctrl/D>.
   • Print the record of your session by typing
     
     print filename

3. Either write on your printout or include a separate statement that argues why your program is correct, based upon the evidence from your test runs.

• Since every programming task should yield readable and carefully tested code, the grading of all programs for this course will begin with the following algorithm (expressed in C format):

  
     if ((no_comments)
          || (missing pre- or post-conditions)
          || (no_evidence_of_compilation)
          || (no_test_runs)
          || (no_commentary_on_correctness))
       return (no_grade);
  

• When a program is submitted according to the format specified above, it should be understood that the program listing reflects a complete session of program listing, compilation, and running. With this understanding, editing of any script file is strictly forbidden and will result in automatic failure on the assignment. Such editing also may raise questions of academic dishonesty; and, by College policy, any evidence of academic dishonesty must be turned over to the Academic Standing Committee for action.

This document is available on the World Wide Web as

http://www.cs.grinnell.edu/~walker/courses/201.sp05/assignments.shtml

created 26 August 2001 last revised 4 May, 2005
For more information, please contact Henry M. Walker at walker@cs.grinnell.edu.