Preliminary Information Sheet for CS 3343 Analysis of Algorithms Fall 1996

Instructor: Dr. Steven Robbins
Office: 3.02.01A SB
Phone: 458-5544
Address: srobbins@runner.utsa.edu

Course Homepage: /cs3343

Course Newsgroup: utsa.cs.3343

Office Hours: TTH 11:00 a.m. - 12:15 p.m. and by appointment

Class Times: TTH 2:00 - 3:15 p.m. in room 3.02.36 HSS

Text:

  • Required: Data Structures and Algotithms by Aho, Hopcraft, and Ullman
  • Recommended: Introduction to Algorithms by Corman, Leiserson, and Rivest

    Prerequisites: CS 2413, CS 3233, MAT 2213

    Course Content:
    We will be covering parts of Chapters 1, 6, 7, 8, 9, and 10 from Aho and small sections from Corman.

    Grading

  • 30% Two exams
  • 35% Assignments (programs and problem sets)
  • 35% Final Exam (Thursday, December 12, 10:30am - 1:15pm)

    Course Policy:
    Friday, October 25, is the last day to drop this course. No make-up exams will be given except for university sanctioned excused absences. Homework assignments will not be accepted after the due date. Hand in whatever you have finished on an assignment on the due date for partial credit. If you must miss an exam (for a good reason), it is your responsibility to contact me before the exam. Leave a message at the above number or send me email.

    You are to do the assignments without collaboration. You can ask me questions about any aspect of an assignment. General discussion with others on the system or on an approach to a problem is constructive and is okay. However, since your grade is based on your assignments, they must be your own work. Students who hand in programs or written assignments which are identical or nearly identical are cheating. This type of scholastic dishonesty usually results in immediate failure in the course and can lead to additional disciplinary action.