CS 3343, Summer 2007
Analysis of Algorithms

Instructor: Daniel A. Jiménez
Office: SB 4.01.58
E-mail: dj@cs.utsa.edu
Office Hours: Tuesdays 3:00pm-4:30pm

Teaching Assistant: Hui Shen (Catherine)
Office: SB 3.01.04
E-mail: hshen@cs.utsa.edu
Office Hours: Thursdays 1:30pm-2:30pm

Class Time and Location:
CS 3343 section 1, Tuesday and Thursday 10:00am to 11:50am HSS 3.02.18
CS 3341 section 1, Tuesday 12:00pm to 1:15pm HSS 3.04.06

Textbook: Introduction to Algorithms, Second Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, McGraw-Hill 2001 ISBN 0-07-013151-1

Prerequisites: CS 2413,2411 (Systems Programming), CS 3233,3231 (Discrete Math) and MAT 2213 (Calculus III). Concurrent enrollment in CS 3341 is required.

Course Description:

Analysis of the performance of algorithms; discussion of programming techniques and data structures used in the writing of effective algorithms. (Formerly CS 4323. Credit cannot be earned for both CS 3343 and CS 4323.)
Course Requirements:

Policy on Assignments and Tests

Late assignments are not accepted. If you have not completed an assignment by the time it is due, turn in what you have for partial credit. Make-up tests are generally not given except for university sanctioned reasons, such as documented illness or other grave situations. You must inform the instructor before missing the test.

Academic Dishonesty

Unless a programming project or problem set is specifically assigned as a group project, students are not allowed to work together on programs. You may discuss general ideas related to the assignment, but you may not e.g. share program code or read each others programs. Instances of such collaboration will be dealt with harshly, but the real cost comes when a student doesn't know how to answer questions on a test about issues involved in doing an assignment.