CS 3343 Analysis of Algorithms
Spring 08

Class Description

From the catalog: This course is to provide an introduction to the design and analysis of computer algorithms. The students will learn how to analyze the performance of computer algorithms, and programming techniques and data structures used in the writing of effective algorithms.

We will discuss classic algorithm design strategies (e.g., divide-and-conquer, dynamic programming, greedy approaches), data structures (e.g., hash tables, binary search trees), classic problems (e.g., sorting, knapsack problem, scheduling, graph-related problems) and the classic algorithms to solve them. We will also analyze algorithm complexity throughout, and touch on issues of tractibility such as NP-Completeness.

Objectives: to learn and apply techniques for the design and analysis of algorithms.

Prerequisites: CS 2413, CS 3233, MAT 2213

Time & Place: Mondays, Wednesdays 4:00pm - 5:15pm, SB 3.02.10A

Textbooks:

• Required textbook: Introduction to Algorithms, 2nd Edition; Cormen, Leiserson, Rivest, and Stein; MIT Press, Boston, 2001.
  You can order it from Amazon for about $62.
  Errata: click to read the list of errors in the textbook.
• Optional textbook: Introduction to the Design and Analysis of Algorithms; Anany Levitin. Addison-Wesley.

Instructor:

• Dr. Jianhua Ruan
  SB 4.01.48
  E-mail: jruan at cs dot utsa dot edu
  Phone: 458-6819
  Office hours: Tuesdays 2pm-4pm, or by appointment

Teaching Assistant:

Yifeng Guo
E-mail: yguo at cs dot utsa dot edu
Office hours: Tuesdays & Thursdays 4-5pm @ SB3.01.04

Recitation sessions: Monday 5:30-6:20pm @ SB 3.02.10A

Schedule (tentative):

Grading:

     Exam 1 15% 
     Exam 2 15% 
     Final Exam 30% 
     Lab Work 10% 
     Homework plus programming projects 30 %

No grades will be dropped.  Exams cannot be made up, cannot be taken early, and must be taken in class at the scheduled time.  There will be no make up exams. The grade that you obtain for the course will also serve as the grade for the lab.

Since your grade is partially based on computer and homework assignments, they must be your own work. You can ask me questions about any aspect of an assignment and pursue general discussions with others on the system or on an approach to solving a problem. You may discuss high-level ideas and thoughts about a homework assignment with your other classmates, but you have to work out all details of any solutions discussed and write up the solution completely on your own. In particular, when working with a student on an assigned homework problem you should do so verbally -- Nothing should be written. This is aimed at keeping your discussion at a high level so everyone can work out the details on their own. Please follow the spirit of this rather than working to finds ways to share details verbally. Also you must clearly acknowledge anyone (except the instructor and TA) with whom you discussed any problem and say briefly what you discussed.

You are not allowed to read, copy, or rewrite the solutions written by others (in this or previous terms). Copying materials from websites, books or other sources is considered equivalent to copying from another student.

Every cheating (for example, copy homework solutions from the web, friends or other textbooks) will be reported to the office of academic integrity. If two people are caught sharing solutions then both the copier and copiee will be held equally responsible. Cheating on an exam will result in failing the course.

It is your responsibility to contact me in a timely manner if there are extenuating circumstances that impact your ability to perform in this class. Your grade is 'not given' by the instructor, but rather is earned by you through demonstrating your mastery of the subject.