CS5024: Models and Analysis - Fall 1998
Instructor: Donald Allison, allison@cs.vt.edu
Office: 626 McBryde, tel. no. 231-4212
Office Hours: MWF 3.00 - 4.00 pm and by appointment
Class Meets: MWF McBryde 219, 12.00 - 12.50 pm
GTA: Hunter Nuttall, hnuttall@vt.edu
Office Hours: TR McBryde 133, 2.00 - 4.00 pm
Description:
This course addresses the fundamental concept of information in a computer
system. In particular, models for the structuring of information and
tools for analysing these models are emphasized. Models are considered in
the areas of operating systems, systems performance, fault tolerance,
reliability, data compression, and codes. Analysis tools are drawn from
combinatorics, graph theory, probability, queueing theory and
coding/information theory. Students attain a familiarity with the
capabilities and the languages of modeling and analysis in computer
science.
Prerequisites:
MATH 2534 (Discrete Mathematics), CS 3204 (Operating Systems) and a sound
background in elementary statistics and calculus.
Textbooks:
Applied Combinatorics, Fred S. Roberts, Prentice Hall
Probability, Statistics, and Queueing Theory, with Computer Science
Applications, Arnold O. Allen, Academic Press
On Reserve:
Probability and Statistics with Reliability, Queueing, and Computer
Science Applications, Kishor S. Trivedi, Prentice Hall
Applied Combinatorics, Alan Tucker, Wiley
Grading Policy:
Graded work consists of about seven homework assignments, one midterm exam
and a final exam. Some of the homework assignments may involve
programming in Mathematica.
Homework Assignments 50% Midterm Exam 17% Final Exam 33%
Ethics:
The Honor Code applies to all aspects of this course. All work submitted
must be the student's own work.
Grades
Mathematica Tutorial
Home Page
Mathematica Information
Web pages for earlier offerings of CS 5024