|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Computational Optimization. (3-0). Credit 3. Combinatorial theory of polytopes as a tool for the solution of combinatorial optimization problems; applications to max flow, matching and matroids; geometric interpretation of the results indicating the profound role that polyhedral combinatorics play in the design and complexity of approximation algorithms. Prerequisite: CSCE 629.
-
3.00 Credits
Information Storage and Retrieval. (3-0). Credit 3. Representation, storage, and access to very large multimedia document collections; fundamental data structures and algorithms of information storage and retrieval systems; techniques to design and evaluate complete retrieval systems, including cover of algorithms for indexing, compressing, and querying very large collections. Prerequisites: CSCE 310 or 603 or approval of instructor; graduate classification.
-
3.00 Credits
Computer-Human Interaction. (3-0). Credit 3. Comprehensive coverage of Computer-human Interaction (CHI) including history, importance, design theories and future direction; modeling computer users and interfaces, empirical techniques for task analysis and interface design, and styles of interaction. Prerequisite: Graduate classification.
-
3.00 Credits
Computer Supported Collaborative Work. (3-0). Credit 3. Covers design, implementation and use of technical systems that support people working cooperatively; draws from the research area of Computer Supported Cooperative Work (CSCW) and includes current theoretical, practical, technical and social issues in CSCW and future directions of the field. Prerequisite: CSCE 671 or 610 or approval of instructor.
-
3.00 Credits
Information, Secrecy and Authentication I. (3-0). Credit 3. Preliminaries; probability, information, entropy, signals, channels; group-theoretic view of messages; contemporary secrecy and digital signature systems; one-time pads, DES, RSA, DSS, wheels, LFSR-based systems; analog scramblers; key exchange, key management, secret sharing, access structures; measures of security. Prerequisites: Graduate classification and approval of instructor. Cross-listed with MATH 673.
-
3.00 Credits
Information, Secrecy and Authentication II. (3-0). Credit 3. Classical and recent attacks; login, compression, error control and genetic codes; finite and infinite codes; matrices, graphs, duals, groups, morphisms, composites, products, rates and classification of codes; the confusion/diffusion/arithmetic/calculus extension of Shannon's two design primitives. Prerequisites: MATH 673; graduate classification or approval of instructor. Cross-listed with MATH 674.
-
3.00 Credits
Digital Libraries. (3-0). Credit 3. Surveys current research and practice in Digital Libraries, which seek to provide intellectual access to large-scale, distributed digital information repositories; current readings from the research literature which covers the breadth of this interdisciplinary area of study. Prerequisite: Graduate classification in computer science.
-
3.00 Credits
Switching Theory. (3-0). Credit 3. Digital systems design; introduction to switching algebras, overview of integrated circuit technologies, analysis and synthesis of combinational circuits, special properties of selected switching functions, sequential circuits, fundamental mode analysis, pulse mode analysis, and sequential circuit synthesis. Prerequisite: Graduate classification. Cross-listed with ECEN 652.
-
3.00 Credits
Testing and Diagnosis of Digital Systems. (3-0). Credit 3. The theory and techniques of testing VLSI-based circuits and systems, and design for testability. Prerequisites: CSCE 321 or ECEN 350 or equivalent; ECEN 220 or 248 or equivalent. Cross-listed with ECEN 680.
-
1.00 Credits
Seminar. (1-0). Credit 1. Reports and discussion of current research and of selected published technical articles. May not be taken for credit more than once in master's degree program nor twice in PhD program.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|