Basic concepts of computer hardware and software. Microcomputer systems and workstations. Networking and the Internet. The interdisciplinary science of computing. Non-major course. Prerequisites: none. 2 hour lab required.

Problem solving and algorithm development. Organization and characteristics of modern digital computers. Emphasis on developing good programming habits. Building abstractions with procedures and data. Programming in a modern computing language. No student who has received credit for 140 or 160 with a grade of C or better may subsequently receive credit for 102. 3 hour lab required.

Advanced problem solving and algorithm development, structured programming, data structures and applications, I/O techniques, lists, queues, trees, algorithms, files. Prereq: 102. 3 hour lab required.

Number systems, Boolean algebra, combinational and sequential circuits, registers, processor functional units and control, pipelining, memory and caching, stored program computing, memory management, computer system organization, assembly language programming. Prereq: 102. 3 hour lab required.

Fall 2006 - Dr. Micah Beck
Spring 2006 - Dr. Bob Ward
Fall 2005 - Dr. Jens Gregor
Spring 2005 - Dr. Bob Ward
Fall 2004 - Dr. Jens Gregor

Topics vary. Programming languages, operating systems and application software packages. May be repeated. Maximum 9 hours.

Practical tools available under Unix to enable students to become more efficient in performing labs and research projects. Course will be pass/fail. Topics to be covered include: sh, cat/grep/find/sort/at/ed/sed, awk, perl, python, make, rcs, jgraph, gcc/cpp/purify/quantify. Prereq: CS140 or permission of instructor. Satisfactory/no credit grading.

Design, analysis, and implementation of fundamental algorithms, such as sorting and searching, and their data structures. Prereq: 140 and 160. 3 hour lab required.

Equivalence relations, partial ordering. Combinations, permutations, analysis of algorithms. Finite automata and regular languages. Prereq; 140, 160, and Math 300.

Principles of analysis and design of information systems. Principles of program design and verification, formal objects, formal specifications. Prereq: 140, 160, and 311. 3 hour lab required.

Introduction to user-level systems programming; file control, process control, memory management, system utilities, networking programming. Prereq: 302. 3 hour lab required.

Language paradigms (procedural, functional, object-oriented, logic), language design and implementation issues, and language issues related to parallelism. Prereq: 302.

Spring 2005 - Dr. Michael Berry

The design, analysis, and implementation of numerical algorithms for solving problems in science and engineering. Emphasis on program design, data structures, computational complexity, scientific computing environments, and high-performance software packages. Prereq: 140, M241, and M251. 3 hour lab required.

Fall 2005 - Dr. Bob Ward

Countability and diagonalization. Finite automata and regular sets. Push-down automata and context-free languages. Introduction to Turing machines and undecidability. Prereq: 140, 160, and 311.

Frontiers-of-computer-science technology and research. Students begin writing a senior thesis. Prereq: senior standing. Writing-emphasis course.

Continuation of 411. Writing-emphasis course.

Search, learning, expert systems, neural networks, pattern recognition and natural language processing. Faculty research. Prereq: Completion of core curriculum or consent of instructor. May be repeated. Maximum 9 hours.

CS 420/594 - Fall 2004
Title: "Complex Systems and Self-Organization"
Instructor: Bruce MacLennan
Schedule: 3:40-4:55 MW
Webpage: View webpage
CS 420 covers advanced topics in machine intelligence with an emphasis on faculty research; CS 594 is similarly focused on faculty research. In the Fall semester of 2003 the topic for my CS 420/594 will be complex systems and self-organization.

Architecture, parallel processors, microprogramming, networks and communications. Faculty research. Prereq: Completion of core curriculum or consent of instructor. May be repeated. Maximum 9 hours.

CS 430/594 - Fall 2004
Title: "UNIX Network Programming"
Instructor: David Straight
Schedule: 12:40-1:55 TR
Webpage: View webpage
CS 430/594 UNIX Network Programming (Fall, 2004) will be a programming-intensive course focusing on the implementation of a simplified TCP/IP stack. Networking basics, the TCP/IP stack, gateways, routing, etc. We provide a virtual LAN and virtual Internet (implemented through sockets).

Operating systems, compilers, parallel computation, software engineering, database systems and programming languages. Faculty research. Prereq: Completion of core curriculum or consent of instructor. May be repeated. Maximum 9 hours.

CS 460/594 - Fall 2004
Title: "Distributed Systems"
Schedule: 9:40-10:55, MW
Instructor: Micah Beck
This class will survey fundamental topics in distributed systems from theoretical foundations to file and operating systems, fault tolerance, scalable networking and wide area information systems.

CS 460 - Spring 2000
Title: "Finishing School for Programmers"
A capstone course for seniors finishing their coursework in computer science. The course will be a project-oriented course emphasizing students working in small groups on research-oriented projects in graphical interfaces. The course will employ the Gamma, et. al. Design Patterns book and the Meyers Effective C++ book to "finish" the student's knowledge of object-oriented programming. Skills developed in this course will include object-oriented design and programming skills, teamwork skills, and graphical interface design and implementation skills. A previous course in C++ is a prerequisite. Permission of instructor is required.

Numerical methods, supercomputers and computer modeling and simulation of physical systems. Faculty research. Prereq: Completion of core curriculum or consent of instructor. May be repeated. Maximum 9 hours.

Introduction to computation, instabilities, and rounding. Interpolation and approximation by polynomials and piecewise polynomials. Quadrature and numerical solution of initial and boundary value problems of ordinary differential equations, including stiff systems. Prereq: 371 or consent of instructor. (Math is major department.)

Direct and iterative methods for systems of linear equations. Solution of a single nonlinear equation and nonlinear systems. Orthogonal decomposition, least squares and the algebraic eigenvalue problem. Prereq: 371 or consent of instructor. Recommended: M453. (Math is major department.)

Theory of computation, complexity theory, formal languages and graph theory and its applications. Faculty research. Prereq: Completion of core curriculum or consent of instructor. May be repeated. Maximum 9 hours.

Special project in area of student's primary interest. To be directed by Computer Science faculty, perhaps jointly with student's faculty advisor. Intended for students with a specific project to pursue in conjunction with a faculty member. Project may be from a department other than Computer Science in which case a faculty member from the appropriate department will help oversee project. May be repeated. A maximum of 6 hours may be applied to the major. Prereq: consent of instructor.

May be repeated. Maximum 9 hours.

CS 494 - Fall 2004
Title: "MATLAB in Science and Engineering"
Schedule: 9:05-9:55 MW
Instructor: Michael Thomason
Webpage: View webpage
This course is an introduction to computing with MATLAB for Physical Sciences and Engineering. It covers basic ideas of algorithm design and data structures using MATLAB as the tool for implementations.

CS 494 - Fall 2004
Title: "Cluster Computing"
Schedule: 9:05-9:55 MW
Instructor: Graham Fagg

CS 494 - Fall 2004
Title: "Computer and Network Security"
Schedule: 5.05-7.45 W
Instructor: Tom Dunigan
Webpage: View webpage
The course will cover three areas: security risks and countermeasures, principles of computer cryptography, and applied cryptography.

Required for the student not otherwise registered during any semester when student uses university facilities and/or faculty time before degree is completed. May not be used toward degree requirements. May be repeated. Satisfactory/No Credit grading only.

Various functions in living systems and their actual or potential realization in computers. Prereq: Discrete Structures.

Survey of key ideas in software engineering: formal methods, tools, testing, reliability, structured design and development, metrics, management and history of the field.

Architectures and systems organization for serial and parallel machines. Prereq: CS 311 and CS 360.

Fall 2007 - Dr. Bob Ward

Boolean algebras. Combinational and sequential logic design. Microprocessors. Hardware lab. Prereq: one year college mathematics beyond algebra and trigonometry.

Algorithms for CAD of VLSI systems. Placement and routing algorithms; programmable logic arrays. Prereq: Discrete structures (311) and analysis of algorithms.

Design and operation of networks. Hardware and software systems; communications subsystems. Prereq: 360

Data model theory, optimization, and normalization; intelligent database systems; comparison of implementations; analysis of distributed and networked databases. Techniques for evaluation of performance, integrity, security and reliability. Prereq: 311.

Decision-theoretic and structural pattern analysis. Deterministic and statistical decision rules, feature extraction and representation; syntactic and semantic methods, relational models. Prereq: 311 and a course in probability or statistics.

Enhancement and restoration of digital images. 2D transforms. Segmentation and description. Computational procedures for image reconstruction. Prereq: Calculus and CS311.

Design and implementation of compilers, software systems; optimization, run-time storage administration. Software system design issues; description, structure and design of contemporary software systems. Prereq: 360.

Analysis of direct and iterative methods for linear algebraic systems; singular value decomposition and linear least squares problem. Theory of Newton and quasi-Newton methods for systems of nonlinear equations; nonlinear least squares. Quadrature theory. Theory and current practice in numerical methods for ordinary differential equations. Polynomial and piecewise polynomial approximation theory. Prereq: M445-46, M453, 471-72. (Math is major department.)

Finite element techniques for solution of boundary and initial-boundary value problems. Variational formulation. Finite dimensional subspaces and their approximating properties; rates of convergence. Computer implementation. Prereq: M435, 471, and either M453 or 472. Recommended prereq: M445-46, 573. (Math is major department.)

Advanced topics in study of iterative and direct methods for large systems of linear equations: sparse matrix analysis, relationship to modern computer architectures. Prereq: M453, 471-72, or consent of instructor. May be repeated. Maximum 9 hours (Math is major department.)

Solution of large sparse linear systems: graph models, reordering techniques, symbolic factorizations, data structures, numerical algorithms, complexity analyses, parallel algorithms. Prereq: course on numerical linear algebra.

Foundations of computer science, including computability, computational complexity, fundamental algorithms and algorithm analysis. Prereq: 380.

Analysis of algorithms and relevance of analysis to design of efficient computer algorithms. Sorting, searching, graph algorithms, pattern matching, dynamic programming, efficient approximation algorithms. Prereq: 302.

May be repeated.

Dr. Lynne Parker (parker@cs.utk.edu)

This CS594 course on Artificial Intelligence (AI) covers the breadth of the field of AI, including topics such as problem-solving, logic, planning, reasoning, learning, perception, and robotics. We define AI as the study of intelligent agents that receive percepts from the environment and perform actions. We will cover different ways to represent the mapping of percept sequences to actions, such as production systems, reactive agents, real-time conditional planners, neural networks, and decision-theoretic systems. Our primary aim is to convey the ideas that have emerged over the past fifty years of AI research.

Offered: Fall 2004

Dr. Graham Fagg (fagg@cs.utk.edu)

Offered: Fall 2004

Dr. Bruce MacLennan (mclennan@cs.utk.edu)

CS 420 covers advanced topics in machine intelligence with an emphasis on faculty research; CS 594 is similarly focused on faculty research. In the Fall semester of 2003 the topic for my CS 420/594 will be complex systems and self-organization.

Offered: Fall 2004

This course will cover the math and algorithms that allow medical doctors to look inside the human body. Topics include: Fourier transform (FFT), magnetic resonance imaging (MRI), Radon transform and projection reconstruction, X-ray computer tomography (CT), algebraic reconstruction methods, gamma-ray emission tomography (SPECT/PET), statistical reconstruction methods, and aspects of parallel and distributed computing. A fieldtrip will be arranged to Dept. Radiology/UTMCK.

Dr. Tom Dunigan (dunigan@cs.utk.edu)

The course will cover three areas: security risks and countermeasures, principles of computer cryptography, and applied cryptography.

Offered: Fall 2004

Dr. Victor Eijkhout (eijkhout@cs.utk.edu)

The TeX typesetting system, and the macro package LaTeX written on top of it, are a popular word processor in mathematics, computer science, physics, and (!) philology. TeX was written by the Stanford computer scientist Donald Knuth. This course will teach you the basics of LaTeX use, and TeX macro programming.

After that, we will go into various topics in computer science that relate to TeX. For instance, the line breaking and page breaking algorithms take us into optimization and graph theory, the TeX macro language lets us take a look at functional programming, and the font description language Metafont leads to an exploration of splines and approximation theory. Finally, there are several software engineering aspects to TeX that we will look into, such as font encodings, the "torture test" approach to program correctness, and the Web system for "literate programming".

Offered: Fall 2004

Dr. Micah Beck (beck@cs.utk.edu)

This class will survey fundamental topics in distributed systems from theoretical foundations to file and operating systems, fault tolerance, scalable networking and wide area information systems.

Offered: Fall 2004

Dr. David Straight (straight@cs.utk.edu)

CS 430/594 UNIX Network Programming (Fall, 2004) will be a programming-intensive course focusing on the implementation of a simplified TCP/IP stack. Networking basics, the TCP/IP stack, gateways, routing, etc. We provide a virtual LAN and virtual Internet (implemented through sockets).

Offered: Fall 2004

P/NP only.

Prereq: consent of instructor. May be repeated with consent of Department.

Prereq: consent of instructor. May be repeated with consent of Department.

Prereq: consent of instructor. May be repeated with consent of Department.

Prereq: consent of instructor. May be repeated with consent of Department.