[PORTALNAME]

Course Criteria

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

  • CS 642: Discrete Event Systems

    3.00 Credits
    University of Kentucky

    The objective of the course is to prepare students for research in the field of supervisory control of discrete event systems (DES's). Logical models, supervising control. Stability and optimal control of DES, complexity analysis and other related research areas will be covered. Prereq: Graduate standing or consent of instructor. (Same as EE 642.)
    ShareCS 642 - Discrete Event Systems
    Favorite

  • CS 655: Programming Languages

    3.00 Credits
    University of Kentucky

    Overview of programming-language styles: imperative, functional, declarative, object-oriented, concurrent, simulation, glue. Non-local referencing environments, combinatorial control structures (backtracking, coroutines), higher-order types, lazy/eager evaluation. This course looks at features, not complete languages, touching on such languages as Ada, CLU, FP, Haskell, Icon, Lisp, ML, Modula-2, Modula-3, Pascal, Post, Prolog, Russell, CSim, Simula-67, and Smalltalk-80. Students will not become proficient in any of these languages, but rather will learn what contributions each has made to the state of the art in language design. Compiler-construction issues will be touched on only in passing. Prereq: CS 450G or consent of instructor.
    ShareCS 655 - Programming Languages
    Favorite

  • CS 663: Artificial Intelligence

    3.00 Credits
    University of Kentucky

    Overview of modern artificial intelligence. Covers topics such as searching and game trees, knowledge representation techniques, methods to represent uncertain information and to reason about it, reasoning about action and planning, expert systems, machine learning and neural networks. Prereq: CS 555 or consent of instructor.
    ShareCS 663 - Artificial Intelligence
    Favorite

  • CS 670: Distributed Operating System Theory

    3.00 Credits
    University of Kentucky

    This course covers advanced distributed operating system algorithms and theory. Topics such as distributed mutual exclusion, distributed event ordering, distributed deadlock detection/avoidance, agreement protocols, consistent global snapshot collection, stable predicate detection, failure recovery, faulty-tolerant consensus, leader election, process groups and group communication. Case studies of distributed operating systems such as LOCUS, Grapevine, V System, ISIS, Amoeba, Sprite, and Mach will be used as illustrations of the above algorithms. Prereq: CS 570 or consent of instructor.
    ShareCS 670 - Distributed Operating System Theory
    Favorite

  • CS 671: Advanced Computer Networks

    3.00 Credits
    University of Kentucky

    This course is intended to provide students with a solid understanding of the state of the art in computer network systems and protocols. Topics are covered in some depth, including both abstract and concrete aspects. The course begins with a study of implementations of the current Internet Protocols (TCP, UDP and IP); this provides a concrete backdrop for the rest of the course. The emphasis is on learning by doing, with programming and other hands-on assignments associated with most topics. Prereq: CS 571 or consent of instructor.
    ShareCS 671 - Advanced Computer Networks
    Favorite

  • CS 673: Error Correcting Codes

    3.00 Credits
    University of Kentucky

    The problem of correct transmission of data in a noisy environment. The design and analysis of codes that efficiently (in terms of data rate and encryption and decryption speed) correct errors. Linear and nonlinear block codes, general encoding and decoding techniques, fundamental bounds, dual codes, cyclic codes. Specific codes will be studied, including Hamming, BCH, Reed-Muller, Reed-Solomon, trellis, and convolutional codes. Prereq: CS 515 or consent of the instructor.
    ShareCS 673 - Error Correcting Codes
    Favorite

  • CS 674: Heuristic Algorithms

    3.00 Credits
    University of Kentucky

    Solving problems that are intractable. Exact techniques such as search integer programming and dynamic programming. Approximation techniques including local search, divide and conquer, and greedy algorithms. Methods based upon natural models such as force-directed iteration, simulated annealing, genetic algorithms, and neural networks. Examples will be selected from active research areas. Prereq: CS 515 or consent of instructor.
    ShareCS 674 - Heuristic Algorithms
    Favorite

  • CS 675: Computability And Complexity

    3.00 Credits
    University of Kentucky

    The formal study of computation, including computability and computation with limited resources. Church's thesis and models of computation. Topics will include Turing machines or other basic models of computation; reductions; computable and computably enumerable sets; Rice's Theorem; decidability and undecidability; basic complexity theory; NP-completeness and notions of intractability. Additional topics may include primitive recursive functions and Grzegorczyk hierarchy; nondeterminism; the arithmetic hierarchy; formal complexity measures; time and space hierarchy theorems; the polynomial hierarchy and PSPACE; probabilistic complexity classes; circuit complexity. Prereq: CS 575 or consent of instructor.
    ShareCS 675 - Computability And Complexity
    Favorite

  • CS 677: Computational Geometry

    3.00 Credits
    University of Kentucky

    Design and analysis of algorithms and data structures for geometric problems. The particular groups of problems addressed include convex hull construction, proximity, Voronoi Diagrams, geometric search, intersection. Prereq: CS 580.
    ShareCS 677 - Computational Geometry
    Favorite

  • CS 678: Cryptography

    3.00 Credits
    University of Kentucky

    The study of security in communications and electronic computing. The encryption of data using public key systems, block ciphers, and stream ciphers. The basic tools for the design and analysis of such systems. Topics may include information theory, authentication, digital signatures, secret sharing schemes, complexity theoretic issues, probabilistic encryption, electronic commerce and others. Prereq: CS 515 or consent of the instructor.
    ShareCS 678 - Cryptography
    Favorite
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)