|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 - 6.00 Credits
Prerequisites: acceptance into the computer science graduate program; completion of an introductory computer programming course and MATH 2107 or 2111; and consent of instructor. This course is intended for students who have been accepted into the computer science graduate program but who arrive with limited course work in computer science. An intensive course with six contact hours a week plus programming assignments. Numerous topics are covered with a general emphasis on data structures and their application toward the modular development of large software systems. CSCI 6001 will not be counted toward fulfillment of degree requirements.
-
1.00 - 3.00 Credits
Prerequisite: consent of department. A projects course of independent work under the direction of a faculty supervisor whose sponsorship must be obtained in advance. May be repeated for up to a total of three credits. Cannot be used for degree credit by students who elect to fulfill the thesis degree requirements. Section number will correspond with credit to be earned.
-
3.00 Credits
Prerequisites: CSCI 4101 or consent of department. Advanced study of algorithms and their complexity; the notions of time and space complexity; design methods, including divide and conquer, and the greedy method; polynomial and nondeterministic polynomial algorithms; the class of NP-complete algorithms.
-
3.00 Credits
Prerequisites: CSCI 4101 or consent of department. A study of combinatorial and graph theoretic techniques for complexity analysis. Includes generating functions, recurrence relations, Polya's theory of counting, planar directed and undirected graphs, and NP-complete problems of combinatorial or graph-theoretic nature. Application of techniques to analysis of algorithms in graph theory, as well as more general problems, such as sorting and searching.
-
3.00 Credits
Prerequisites: CSCI 4101 and MATH 2511 or consent of instructor. A study of the methods used in data encryption and related cryptologic problems. The history of early cryptography, including the Caesar shift, Vigenere table, Playfair square, and Enigma machines. Modern cryptographic problems, including the Data Encryption Standard, the key management problem, the public-key encryption, knapsack methods, number-theoretic methods, and the Rivest- Shamir-Adelman public-key cryptosystem, digital signature, the Digital Signature Standard, and cryptanalysis of knapsacks. Other cryptologic problems, including threshold schemes, zero-knowledge protocols, mental poker, and implementations on uniprocessor machines, networks, and parallel machines.
-
3.00 Credits
Prerequisite: CSCI 4103 or consent of department. Theory and application of formal language systems and automata. Emphasis will be placed on formal systems, the languages they generate, and techniques used to parse strings in those languages.
-
3.00 Credits
Prerequisites: CSCI 4125 and 4311 or consent of department. A consideration of the problems and opportunities inherent in distributed databases on a network computer system. Includes distributed database design, optimization of access strategies, distributed concurrency control, recovery in distributed databases, distributed database administration, commercial systems.
-
3.00 Credits
Prerequisite: CSCI 4302 and 4401. A review of microelectronics and an introduction to MOS technology, basic electrical properties of MOS circuits, MOS circuit design processes, subsystem design and layout, scaling of MOS circuits, aspects of system design and timing, structured design and testing, MOS design projects.
-
3.00 Credits
Prerequisite: CSCI 6330 or consent of department. Design of large digital VLSI (Very Large Scale Integration) systems using modern CAD tools and state-of-the-art testing and characterization systems.
-
3.00 Credits
Prerequisite: CSCI 4401 and 4302 or consent of department. An investigation of modern parallel processing computers and generally those designed on non-vonNeumann architectures.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|