Skip to main content
This course is a study of applications of Boolean algebra to combinational circuit design problems, organization of simplified computer components, memory organization, architecture, and assembly language programming.
The course is designed to introduce the students to the software, hardware, legal, and ethical issues involved in computer forensics. Student will be developing the skills necessary to perform investigations into a variety of digital equipment through the use of practical projects.
This course is a study of programming language constructs emphasizing the run-time behavior of programs. Topics include formal grammars, parsing, information binding, data storage, global and local variables and parameters, string handling and list processing.
This course is a study of batch processing systems, implementation techniques for parallel processing of input/output and interrupt handling, memory management, system accounting, interprocess communication and interfaces, and deadlocks.
This course is designed to emphasize recognition of clarity and style of presentation in the reading and discussion of computer science related technical writing. (This course may also be taken for credit as MATH 373.)
This course provides an overview of computer and network security. Topics covered include risks and vulnerabilities; related policies; controls and protection methods; access controls; database security; authentication technologies; and host-based and network based security. The students will learn how to design and build secure systems. Throughout the course, students will be given real world examples and projects to deepen their understanding.
This course is an intensive study of the design and the implementation of a database. Topics include entity-relationship model, relational model, SQL, relational database design, obj ect-oriented databases and obj ect-relational databases.
This course is a study of numerical methods of evaluating integrals and differential equations, techniques in finding the roots of polynomials, solving systems of linear equations, and matrix manipulation. (This course may be taken for credit as MATH 390.)
This course focuses on the study of various cryptographic protocols, algorithms, and proofs of security. Topics include classical vs. modem cryptography; historical ciphers; principles of modem cryptography; perfectly secret encryption.
This course is a professionally supervised experience with off-campus mathematicians, computer scientists, or applied scientists using modem research and/or analytical techniques. Settings may vary from purely academic summer programs to private or public scientific institutions. The number of credits awarded depends on the number of imbedded hours in the internship experience. A minimum of 50 imbedded hours is expected per credit with the maximum number of credit earned is eight.
