Loyola University Chicago

Computer Science 271
Structured Programming & Data Structures
Michael Goldwasser

Spring 2001

Math. and Computer Science Dept.


COURSE INFORMATION

Lectures:
Tuesday 1:00-2:15pm, DH735 (Damen Hall)
Thursday 1:00-2:15pm, DH735 (Damen Hall)
Lake Shore Campus

Labs:
Section 021: Tuesday 12:00-12:50pm, DH340 (Damen Hall)
Section 022: Thursday 2:30-3:20pm, DH340 (Damen Hall)
Information about the Department Labs

Instructor:
Michael Goldwasser
Email: mhg@cs.luc.edu
Office: DH 115, Lake Shore Campus (inside the DH105 Suite)
Phone: (773) 508-2883
Hours: Mondays 2:00-3:00pm, Thursdays 2:15-3:15pm, or by appointment.

Teaching Assistants:
Hai Wu
Email: whai@hotmail.com
Hours: tba

Tutoring Centers:

Tutoring is available for this course (and others) on a walk-in basis or by appointment through either
  • the department's Mathematics and Computer Science Learning Center (featuring our TAs, among others!)
  • the University's Learning Assistance Center.

  • Text:
    Data Structures and Algorithms in JAVA, 2nd edition
    Michael T. Goodrich and Roberto Tamassia
    John Wiley & Sons, 2000, ISBN 0-471-38367-8
    List price: $71.95
    Will be available at Barnes & Noble Campus Store, Beck's, or many online vendors (shop around!)

    Note: Please notice that we are using the second edition of the text which has just been printed. This book has a brown cover (the original had a white/yellow cover).



    Prerequisites:
    The official prerequisite for this course is Structured Programming (Comp 170). Also, we will specifically assume that you took the prerequisite using the Java programming language. If this is not the case, it will be up to you to learn Java outside of class (Chapter 1 of the textbook offers such a review of Java).


    Grades: The graded work of this course will be weighted as follows:
  • 30% - eight programming assignments (lowest score dropped)
  • 20% - eight written homeworks (lowest score dropped)
  • 10% - eleven lab assignments (lowest score dropped)
  • 10% - midterm 1 (Thur, 15 Feb 2001)
  • 10% - midterm 2 (Thur, 29 Mar 2001)
  • 20% - final exam (Tues, 8 May 2001 - 10:20am)

  • Letter grades will be based on each students overall percentage of awarded points according to the above formula.
  • A percentage of 85% will result in a grade of A or better.
  • A percentage of 78% will result in a grade of B+ or better.
  • A percentage of 70% will result in a grade of B or better.
  • A percentage of 65% will result in a grade of C+ or better.
  • A percentage of 60% will result in a grade of C or better.
  • A percentage of 50% will result in a grade of D or better.
  • Any modifications to this scale at the end of the year will be in favor of the students. That is we may later decide to award an A to a student who is slightly below the above cutoff, but we certainly will not take away an A from someone who is just above the cutoff.


    Academic Honesty: At the beginning of the semester, all students will be asked to read and sign a statement of Academic Honesty for this course.


    Late Assignments: The timing of lectures, labs, and assignments are designed in a coordinated way. For this reason, students are most strongly encouraged to stay on top of the work in this course, and to turn in all required assignments in a timely fashion.

  • All exams must be taken promptly at the required time. Requests for rescheduling an exam will only be considered if the request is made prior to the start of the exam, or else in an ``emergency'' situation with appropriate documentation.

  • Labs are scheduled at specific, required times. You must attend the lab and turn in your results at that time, in order to receive credit. No credit will be given for "late" labs without an advanced arangement between the student and the TA.

  • For both programming assignments and written homeworks, the following late penalty will be strictly applied. The intent is to allow students to continue to work comfortably beyond the official deadline when a little more time will result in more progress, while at the same time discouraging students from falling several days behind pace.

    Any assignment which is not turned in promptly by its due date and time will be assessed a penalty based on the formula S = R * exp(-t/6), where S is the grade given, R is the grade the work would have gotten if turned in on time and t is the amount of time (in days or fractions thereof) the work was late. Thus, the value of a late assignment decays exponentially, with a half-life of about four days. Examples: work turned in 1 hour late will receive over 99% of original credit, work turned in 6 hours late will receive 96% credit, one full day late receives less than 85%, work turned in four days late will receive 51%. This penalty will only be waived in an ``emergency'' situation with appropriate documentation.


  • comp271 Class Page
    mhg@cs.luc.edu
    Last modified: 22 January 2001