CSCI 4450: Algorithm Analysis and Complexity Theory

This page contains material specific to the Spring 2005 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	Maheedhar Reddy Muchala
Office: NTRP F-227	Office: NTRP F-205
Office Hours: Mon-Thurs 9:30-11:00	Office Hours: Tues/Thurs 1:30-3:30
E-Mail: srt@cs.unt.edu	E-Mail: mahy14@yahoo.com

Basic 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.

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
Class discussion forums

Class Handouts and Information

Class information and syllabus [PDF]
Algorithms Introduction: Algorithms for Perrin numbers
Assignment 2 (Due Wednesday, February 9) [PDF]
Problem Session 1 problems
Assignment 4 (Due Wednesday, March 9) [PDF]

a4skeleton.cc - C++ code for assignment 4

Problem Session 2 problems

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: Mon May 16 09:39:51 CDT 2005