[ Assignments | CIS | UO | News ]

• Prerequisites: Math 231-232, CIS 210-212.

• Time and Place: Mondays, Wednesdays, and Fridays at 09:00 am in 204 Condon.

• Instructor: Andrzej Proskurowski, 256 Deschutes, phone 346-4428,
  email andrzej@cs.uoregon.edu.

• Teaching Assistant: Jianzhong Xue, 233 Deschutes, phone 346-1384,
  email xue@cs.uoregon.edu

• Office hours:
  • Andrzej: MWF 2-3 or by appt.
  • Xue: MWF 3-4.

• Directory: The (unix) directory for the class is /cs/classes/cis313.

• News: Keep an eye on the course news for miscellaneous announcements.

• Sample Solutions: These will be linked through the assignments page.

• Evaluation:
  • There will be four or five written assignments and three programming assignments. These are to be done individually rather than in groups.
  • The midterm will be held in the week of Feb.10. Check out the study guide (html) and the sample solution (postscript only).
  • The final will be held on Friday, March 21st. at 10:15 (it's a two hour exam). See the study guide for the final.
  • The approximate weighting of the work done is

    Homework Assignments	30%
    Programming Assignments	25%
    Midterm	15%
    Final Exam	30%

• Text: Weiss, Algorithms, Data Structures, and Problem Solving with C++, Addison-Wesley, 1995. A home page is available for the text. Following the "Supplement" link will lead you to C++ code for downloading. (There have been problems reported with that link - try the author's home page as well.)

• Supplemental Reading:
  • Decker, Hirschfield, The Object Concept, PSW Publ., 1995.
  • Cormen, Leiserson, and Rivest, Introduction to Algorithms, The MIT Press 1990.
  • Aho, Hopcroft and Ullman, Data Structures and Algorithms, Addison-Wesley 1987.
  • Knuth, The Art of Computer Programming, vol.I, Addison-Wesley 1975.
  • Ross and Wright, Discrete Mathematics, Prentice Hall 1992.
  • Epp, Discrete Mathematics with Applications, PSW Publ., 1995.

  Tentative Syllabus

  Week of	Chapter	Description
  Jan. 6	5	Algorithm analysis
  Jan. 13	6, 15, 16	Simple data structures
  Jan. 20	7	recursion and timing
  Jan. 27	11	Stacks and compilers
  Feb. 3	12	Trees: Huffman coding
  Feb. 10	17	Midterm Exam
  Feb. 17	18	Binary search trees
  Feb. 24	18	AVL and red-black trees
  Mar. 3	20	Priority queues
  Mar. 10	8	Sorting
  Mar. 21		Final Exam at 10:15 Friday

• Late policy: All assignments are due by 5:00pm of the stated due date, though it is much safer to turn them in at class time. Late papers are subject to a 5% per day penalty, up to a maximum of 25%. Late assignments will not be accepted once the graded papers are returned or once sample are handed out.

• Programming: should be done in C++. The programs have to be accompanied by a manual-like documentation page, analysis of program correctness and complexity, and evidence of experimentation that includes sample runs. Documentation should include both in-code and general comments. Legibility of the code is essential. The official center for computing activity is the Computing Room 100 in Deschutes Hall. Of course, if you have C++ available elsewhere, such as at home, you are welcome to use it. Due to the variety of platforms used, you should turn in hardcopy.

• Grading: will be performed by an able and experienced grader. Any contested score will be first referred to that person. Be aware of the possibility of correcting grading mistakes both in your favor and disadvantage, so that the challenged score can change in either direction. Note: to allow for a larger margin of subjectivity in grading, we will use the whole score range, from 0 to 100%; you may expect the average score (corresponding to B-) to be around 50%. The final letter grade will be assigned based on the total weighted score curve.