|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
(Prereq: departmental permission) This course teaches how computers can be exploited and how techniques can be selected and countered (e.g. scanning, mapping, password attacks, and more advanced attacks).
-
3.00 Credits
(Prereq: Grade of C or better in CSCI A220) Database organization; design and use of database management systems; database models, including network, hierarchical and relational; data description languages, data independence, and representation.
-
4.00 Credits
(Prereq: Grade of C or better in CSCI A520) A programming course in large-scale relational database environment using host languages. Database design and implementation of on-line applications using some of the programmatic extensions to Structured Query Language (SQL) supported by top of the line enterprise Relational Database Management Systems (RDBMS). Topics covered in this course include: database programming using open architectures, embedded and dynamic query languages, procedural extension of query languages,stored procedures and triggers, data transformation techniques to enhance interoperability of data, and introduction to extensible markup data definition and retrieval languages.
-
3.00 Credits
(Prereq: departmental permission) This course introduces the fundamentals for constructing secure software by applying security principles to software development processes. Software vulnerabilities and possible attacks that exploit them will be covered.
-
3.00 Credits
(Prereq: departmental permission) This course introduces the tools and techniques for monitoring and preventing illegal accesses to computer systems that contain confidential or sensitive information. In addition, this course introduces digital forensic tools and techniques to collect, analyze, document, and present evidence for malicious activities or computer-related crimes.
-
3.00 Credits
(Prereq: Grade of C or better in CSCI A220 and MATH A141) An introduction to the design and analysis of fundamental algorithms in computer science. The algorithmic design paradigms such as the greedy method, divide and conquer, dynamic programming, backtracking, and branch-and-bound. The analyses of algorithms from different areas such as searching, sorting, graph theory, combinatorial optimization, and computational geometry. An introduction to the theory of NP-completeness.
-
3.00 Credits
(Prereq: Grade of C or better in MATH A242 and MATH A544 or consent of instructor, and a working knowledge of programming) An introduction to numerical methods used in solving equations and systems of equations, numerical integration, differential equations, interpolation, and approximation of functions.
-
3.00 Credits
(Prereq: Senior standing in Applied Computer Science, CSCI A220 with a grade of C or better, and CSCI A360 with a grade of C or better) Each student is required to do an in-depth study of some topic or a team-based software design project in a student's final year of study. Lecture topics include project identification, project planning, software requirements analysis, design, specification, ethics, and social impact. Selection, specification, and feasibility study of an open-ended design project are to be completed.
-
3.00 Credits
(Prereq: CSCI A591 with a grade of C or better) Continuation of CSCI 591. The final project design, computer system implementation, testing, verification and validation of results will be completed by the end of the semester. Both written and oral reports are required.
-
3.00 Credits
(Prereq: Math placement above A108 or completion of MATH A108) Includes the measurement of national levels of production, inflation and unemployment, and the effects of monetary and fiscal policies on those variables.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|