|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
An introduction to the theory of computation. Topics include formal language theory (grammars, languages, and automata including Turing machines), and an introduction to the concept of undecidable problems, including the halting problem. Prerequisite: COMP 132 and MATH 211.
-
3.00 Credits
A continuation of Introduction to Probability and Statistics I. Includes such topics as analysis of variance, multiple and nonlinear regression, goodness of fit tests for categorical data, nonparametric methods, and statistical quality control. Prerequisites: 225 and 261. Offered in odd numbered spring semesters.
-
3.00 Credits
An introduction to deterministic operations research, including linear programming, sensitivity analysis, and duality. Special topics may include transportation and assignment problems, network models, integer programming, and game theory. Prerequisite: 262. Offered in odd numbered fall semesters.
-
3.00 Credits
A study of algorithmic approaches to problem-solving and techniques for analyzing and comparing algorithms. Approaches such as divide-and-conquer, dynamic programming, and backtracking will be explored in conjunction with complex structures such as trees and graphs. Topics in computational complexity include asymptotic complexity measures, intractability, and NP-complete problems. Prerequisite: 232, MATH 211. Offered every fall. NOTE: Completion of both 251 and 332 fulfills the WR requirement.
-
3.00 Credits
An introduction to axiomatic formalism using algebraic structures as paradigms. Topics chosen from groups, rings, integral domains, fields and vector spaces. Prerequisite: 262. Offered every spring.
-
3.00 Credits
An examination of the hardware, software and protocols used in computer networks. Topics include layered architectures, client server computing, reliable and unreliable protocols, data encoding and compression, error detection and correction, routing, examination of the internet as an example and an introduction to network programming. Prerequisite: 232 and 251. Offered in odd numbered springs.
-
3.00 Credits
A study of the principles underlying the organization and implementation of computer operating systems. Topics include multiprogramming, time-sharing, mutual exclusion and synchronization, process scheduling, memory management, and file systems. Prerequisites: 232 and 251. Offered in even numbered springs.
-
3.00 Credits
An examination of the major programming language paradigms. The course also explores the basic properties and special facilities of languages representing each paradigm. Topics include data types, scope rules, block structures, procedure calls and parameter types, and storage allocation considerations. Prerequisite: 232. Offered every fall.
-
3.00 Credits
A theoretical development of the basic ideas and concepts of real analysis. Topics include a study of real numbers, sequences, limits and continuity, differentiation and integration. Optional topics include infinite series, sequences and series of functions, and an introduction to point-set topology. Prerequisite: 261 and 262. Offered every fall.
-
3.00 Credits
A survey of techniques for applying computers to tasks usually considered to require human intelligence. Topics include knowledge representation and reasoning, search and constraint satisfaction, evolutionary and genetic algorithms, machine learning, neural networks, and philosophical questions. Prerequisites: 232 and MATH 211. Offered in even numbered falls.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|