CollegeTransfer.Net

Course Criteria

Add courses to your favorites to save, share, and find your best transfer school.
  • 3.00 Credits

    Prerequisite: basic knowledge of C++. Covers the fundamentals of objectoriented programming. Includes object-oriented concepts such as data abstractions, encapsulation, inheritance, dynamic binding, and polymorphism, and uses C++ as the vehicle for illustrating and implementing these concepts. The object-oriented paradigm is systematically employed in the design of all concepts. Effects of this methodology on software maintenance, extensibility, and reuse. Significant programming/design projects. Effective Until: Summer 2006
  • 3.00 Credits

    Prerequisite: advanced Web-based programming with an emphasis on the Java language and platform. No prior knowledge of Java is required but students are expected to have a good understanding of object-oriented programming concepts such as encapsulation, inheritance, and polymorphism, experience with C++. Basic constructs and syntax and then the core advanced features. Topics include: networking and sockets, remote method invocation (RMI), database connectivity (JDBC), Java Beans, multi-threading and lighweight components (Swing). Common gateway interface (CGI) languages and browser scripting (JavaScript and VBScript) are discussed when used as a complement to the functionality of the Java language. Emphasis is on the Java Development Kit version 1.1 (JDK1.1), both deprecated methods and newly introduced features are discussed. Effective Until: Summer 2006
  • 3.00 Credits

    Prerequisite: CIS 601. Introduction to Graphical User Interface (GUI) Programming in the X Windows System environment. Design and implementation of the GUI at various levels of abstraction using industry standard software tools. Trade-offs between flexibility and ease of use inherent in GUI building tools. Best suited for the advanced programmer. Effective Until: Summer 2006
  • 3.00 Credits

    Prerequisites: CIS 333 and CIS 432 or instructor approval (see undergraduate catalog for descriptions). Fundamentals of client/server architecture as applied to the development of software systems. Concepts of distributed systems such as open systems, middleware, software reengineering, and distributed computing environments. Components of distributed client/server technologies such as X Windows Systems, DCE, CORBA, NFS, and ODBC. Case studies are used to illustrate how client/server techniques can be used in a variety of applications. The importance of standards and their role in client/server architecture, such as Posix, DCE, and COS. Requires creation of distributed applications. Effective Until: Summer 2006
  • 3.00 Credits

    Prerequisite: Math 630 or EE 601 or MnE 603 or equivalent. Covers discrete event dynamic system theory and its applications in modeling, control, analysis, validation, simulation, and performance evaluation of computer systems, flexible manufacturing systems, robotic systems, intelligent supervisory control systems, and communication networks. Emphasis on Petri net and automation based approaches. Effective Until: Summer 2006
  • 3.00 Credits

    This course involves computational methods providing secure Internet communication. Among the topics covered are: Security threats in communication systems; conventional cryptography: substitution and transposition codes; distribution of secret key over the Internet; principles of public-key cryptography; RSA and other public-key cryptographic methods; and digital signature protocol. Effective Until: Summer 2006
  • 3.00 Credits

    Prerequisite: CIS 505 or CIS 335 or equivalents (see undergraduate catalog for description). Intensive study of the fundamentals of data structures and algorithms. Presents the definitions, representations, processing algorithms for data structures, general design and analysis techniques for algorithms. Covers a broad variety of data structures, algorithms and their applications including linked lists, various tree organizations, hash tables, strings, storage allocation, algorithms for searching and sorting, and a selected collection of other algorithms. Programs are assigned to give students experience in algorithms, data structure design and implementation. Effective Until: Summer 2006
  • 3.00 Credits

    Prerequisites: mathematics bridge requirements. Introduces the theoretical fundamentals of computing, and provides an understanding of both the inherent capabilities and limitations of computation. The main models of computation are deterministic and non-deterministic Turing machines. Auxiliary models include partial and total recursive functions, first order logic, recursive and recursively enumerable sets, and symbol systems. Covers the essentials of computational theory: first order logic, Russel's Paradox, completeness and consistency, Goedel's Theorem, Church's Thesis, countable and uncountable sets, simulation and computation, diagonalization, dove-tailing, decidable and undecidable problems, reduction, recursion theory, Rice's Theorem, Recursion Theorem, execution time measures, P and NP, polynomial-time reduction, NP-completeness and NP-hardness and formal correctness semantics of programs. Effective Until: Summer 2006
  • 3.00 Credits

    Prerequisite: Math 511 (see undergraduate catalog for description) or an introductory course in numerical methods. An introduction to computational aspects of scientific and engineering problems. Time-dependent phenomena and corresponding quantitative models. Numerical stability and conditioning. Approximation of functions. Interpolation, integration. Solution of nonlinear equations. Ordinary differential equations of the first order. Finite and iterative algorithms for solution of systems of linear equations. Emphasis on computer implementation of algorithms and application to variety of engineering problems. Effective Until: Summer 2006
  • 3.00 Credits

    Prerequisite: Math 511 (see undergraduate catalog for description) or an introductory course in numerical methods. This course covers the theory and design of computer solutions to mathematical equations. Included are iterative methods for solving systems of linear and nonlinear equations, the numerical eigenvalue-eigenvector problem, and methods for solving ordinary and partial differential equations. Emphasis is on the control of errors generated by the computer. Effective Until: Summer 2006
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
(Type the name of a College, University, Exam, or Corporation)
(For example: Accounting, Psychology)
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
(For example: Introduction To Accounting)
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
of
(For example: Find all institutions within 5 miles of the selected Zip Code)