CS 3343 Analysis of Algorithms
Fall 11
[ Home | Policies | Schedule | Slides, pictures | Homework | Resources ]

Home

News:

  • The grades are up on Blackboard. Thank you for a fun semester. And enjoy the holidays.

Class Description:

Analysis of the performance of algorithms; discussion of programming techniques and data structures used in the writing of effective algorithms.

Prerequisites:

CS 2121/3 Data Structures, CS 2231/3 Discrete Mathematical Structures, CS 3331/3 Mathematical Foundations

Class webpage:

http://www.cs.utsa.edu/~carola/teaching/cs3343/fall11/

Time & Place:

Lecture: Tuesdays, Thursdays 2pm - 3:15pm, BB 3.04.08
Recitations: Tuesdays 5pm - 5:50pm, SB 3.02.10A; Thursdays 3:30pm - 4:20pm, SB 3.02.10A

Textbooks:

Required textbook: Introduction to Algorithms, 3rd Edition; Cormen, Leiserson, Rivest, and Stein; MIT Press.
(The older editions are very similar, however one or two chapters are missing, and chapter numbers and exercise numbers are switched around. If you opt to use an older edition it is your responsibility to keep up with those differences. Links to free ebooks of older editions of the book are available on the Resources page.)

Instructor:

Carola Wenk
SB 4.01.17
E-mail: carola at cs dot utsa dot edu
Phone: 458-4501
Office hours: Tuesdays 4pm-5pm, Thursdays noon-1pm, and by appointment.

Teaching Assistant:

Mahmuda Ahmed
SB 3.01.04, cubicle 2
E-mail: mahmed at cs dot utsa dot edu
Office hours: Tuesdays 6pm-7pm, Thursdays 4:30pm-5:30pm, and by appointment


This Syllabus is provided for informational purposes regarding the anticipated course content and schedule of this course. It is based upon the most recent information available on the date of its issuance and is as accurate and complete as possible. I reserve the right to make any changes I deem necessary and/or appropriate. I will make my best efforts to communicate any changes in the syllabus in a timely manner. Students are responsible for being aware of these changes.