CSCI 4450: Algorithm Analysis and Complexity Theory

This page contains material specific to the Spring 2004 CSCI 4450 Algorithm Analysis and Complexity Theory class taught by Steve Tate in the Department of Computer Sciences at the University of North Texas.

Who's in charge here, anyway?

All administrative questions about the class should be directed to the instructor. Questions about homework assignments should be directed first to the teaching assistant, if possible, and then to the instructor.

Instructor	Teaching Assistant
Steve Tate	Wenming Li
Office: NTRP F-227	Office: F-232
Office Hours: Mon-Thurs 9:30-11:00	Office Hours: Tues/Thurs 2:00-4:00
E-Mail: srt@cs.unt.edu	E-Mail: wenming@cs.unt.edu

On-Line Information

Most documents are available in both HTML (looks good in a Web browser) and PDF (looks good on paper). Since this course is very mathematical, and HTML offers very poor facilities for including mathematical expressions, some of the handouts are available only in PDF. You will need a PDF viewer (such as Adobe Acrobat) in order to use these files.

Basic information:

A list of topics covered on each class day. If you miss class, first check here to see what was covered, and what handouts were given.
A list of assignments, with due dates
Students may access their grades through the Webmail system.

Class Handouts and Information

Class information and syllabus [PDF]
Algorithms Introduction: Algorithms for Perrin numbers
Assignment 4: Due Thursday, Feb. 12 [PDF]

Files for assignment 4

Current students are welcome to send me anonymous comments. This is for anonymous suggestions to (hopefully) improve classes. It is not for questions about homework or class material -- since these comments are anonymous I have no way to answer questions submitted here!

Steve Tate / University of North Texas / 940-565-4864 / srt@cs.unt.edu

Last modified: Thu Feb 5 17:33:03 CST 2004