|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Prerequisites: A minimum grade of 2.7 in CSCD 300 and in CSCD 350 and [CS majors need the first course in a senior sequence, CIS majors need CSCD 425, CS Theory majors need CSCD 420, 3D majors need CSCD 417 and MM majors need CSCD 414], Advanced Programming Exam Clearance, Advancement in Major. Students apply principles and techniques learned in other courses through team development of client-sponsored projects. Based on a requirements document provided by the team's client each team will use appropriate tools and management skills to specify, design, implement, test, install and document a solution that meets the client's needs. Project management, quality assurance and configuration management plans are required. Written documents and oral presentations are required of all teams and team members.
-
1.00 - 10.00 Credits
Prerequisites: CSCD 300 or 414, Advancement in the major.
-
1.00 - 5.00 Credits
Selected topics to be arranged in consultation with the requesting organization.
-
1.00 - 5.00 Credits
Prerequisite: Permission of the instructor.
-
1.00 - 5.00 Credits
Prerequisite: Permission of the instructor and the department chair.
-
1.00 Credits
Prerequisite: Graduate Standing This course presents a speaker-based seminar for graduate students intended as an introduction to research currently conducted by CS faculty and graduate students with some outside presenters from other institutions and corporations. Students will gain knowledge of current faculty research, which will aid them with their own research in CS sub-disciplines and with selecting a graduate advisor.
-
4.00 Credits
Prerequisites: CSCD 320 and MATH 301 or CSCD 310 or equivalent. The study of algorithms: asymptotic analysis of computing time and space requirements. Strategies for designing algorithms: divide-and-conquer, greedy method, backtracking and others. Analysis of graph algorithms. Introduction to parallel algorithms and their analysis. Further topics may be covered, as time permits, such as techniques for algebraic manipulations, lower bound theory and NP-complete problems.
-
4.00 Credits
Prerequisite: Permission of the instructor. Graph theory; trees; automata theory; computability; unsolvability; Turing machines; recursive functions theory; category theory as applied to machine morphisms; formal language theory with possible applications to compiler design, operating systems, etc. Switching theory, formal verification methods, data structuring and complexity theory may also be studied.
-
4.00 Credits
Prerequisite: MATH 225 or MATH 301 or equivalent. This course covers the general principles of modern cryptography, including symmetric cryptosystems, asymmetric cryptosystems, secure hash functions and cryptographic level randomness. Other topics may include historic cryptosystems and their cryptanalysis, information entropy, zero knowledge proofs, trusted computing architectures and information theory as it relates to cryptography. Programming assignments will be required. Writing and class presentations may be required.
-
4.00 Credits
Prerequisites: CSCD 350 or equivalent software development experience. A variable-content course. A study of methods and techniques available to develop reliable and maintainable software at minimal cost and selected software development topics. Possible topics include software metrics, object-oriented design, rapid prototyping, graphical user interface design and CASE tools. Individual research projects are required.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|