• Home
• Schools of Study
  • Arts and Humanities
  • Behavioral and Brain Sciences
  • Economic, Political and Policy Sciences
  • Engineering and Computer Science
  • Interdisciplinary Studies
  • Management
  • Natural Sciences and Mathematics
• Special Programs
  • Academic Bridge
  • Collegium V
  • McDermott Scholars
  • Terry Scholars
• Admissions
  • Entering Freshmen
  • Transfer Students
  • Math Placement
  • THEA
• Scholarships
  • Academic Excellence
  • Major Fellowship Awards
  • Specialized Competitive Fellowships
  • Overseas Awards
  • Terry Scholarship
• LRC
  • Math Lab
  • Writing Lab
  • Supplemental Instruction
  • Testing Center
  • Scantron Scoring
  • Contact
• Staff
• Advising
  • Advising Staff
  • Advising Handbook
  • Academic Appeals
  • AP Credit
  • CLEP Credit
  • IB Credit
  • Minors Handbook
• FAQ

Information Assurance

A minor in Information Assurance requires 30 credit hours earned through the following courses:

CS 1337 Computer Science I (3 semester hours) Introduction to object-oriented software analysis, design, and development. Classes and objects. Object composition and polymorphism. Sorting, searching, recursion. Strings using core classes. Inheritance and interfaces. Graphical User Interfaces. Includes a comprehensive programming project. Prerequisite: CS 1336 with a grade of C or better or equivalent. (3-0) S

CS 2305 (MATH 2305) Discrete Mathematics for Computing I (3 semester hours) Principles of counting. Boolean operations. Logic and methods of proof. Sets, relations, functions, strings, and languages. Prerequisite: MATH 1326 or MATH 2417 or consent of the instructor. (3-0) S

CS 2336 Computer Science II (3 semester hours) Exceptions and number formatting. File input/output using Stream classes. Implementation of primitive data structures, including linked lists (all types), stacks, queues, and binary trees. Advanced data manipulation using core classes. Introduction to multithreading, multimedia, and networking. Includes a comprehensive programming project. Prerequisite: CS 1337. (3-0) S

CS 3305 Discrete Mathematics for Computing II (3 semester hours) Topics in enumeration; principle of inclusion and exclusion. Partial orders and lattices. Algorithmic complexity; recurrence relations. Graph theory. Prerequisite: CS 2305. (3-0) S

CS 3345 Data Structures and Introduction to Algorithmic Analysis (3 semester hours) Analysis of algorithms including time complexity and Big-O notation. Analysis of stacks, queues, and trees, including B-trees. Heaps, hashing, and advanced sorting techniques. Disjoint sets and graphs. Course emphasizes design and implementation. Prerequisites: CS 2336 and one of CS 3305 or SE 3306. (Same as SE 3345) (3-0) S

CS 4347 Database Systems (3 semester hours) This course emphasizes the concepts and structures necessary for the design and implementation of database management systems. Topics include data models, data normalization, data description languages, query facilities, file organization, index organization, file security, data integrity, and reliability. Prerequisite: CS/SE 3345. (Same as SE 4347) (3-0) Y

CS 4348 Operating Systems Concepts (3 semester hours) An introduction to fundamental concepts in operating systems: their design, implementation, and usage. Topics include process management, main memory management, virtual memory, I/O and device drivers, file systems, secondary storage management, and an introduction to critical sections and deadlocks. Prerequisites: CS 4340, one of CS/SE 3345 or TE 3346, and a working knowledge of C and UNIX. (Same as SE 4348 and TE 4348) (3-0) S

CS 4389 Data and Applications Security (3 semester hours) Data as a critical resource. Threats to data and applications security including access control violations, integrity violations, unauthorized intrusions and sabotage; techniques to enforce security. Prerequisite: CS/SE 4347. (3-0) Y

CS 4393 Computer and Network Security (3 semester hours) The study of security and vulnerabilities in computer and network systems. Common attacking techniques such as buffer overflow, viruses, worms, etc. Security in existing systems such as UNIX, Windows, and JVM. Fundamental access control and information flow concepts. Symmetric Ciphers such as DES and AES. Public-key encryption techniques and related number theory. Message authentication, hash functions, and digital signatures. Authentication applications, IP security and Web security. Prerequisite: CS/SE 4348. (3-0) Y

CS 4398 Digital Forensics (3 semester hours) Creating and preserving digital evidence, data recovery and evidence collection algorithms, evidence construction and reconstruction, methods for certifying evidence, storing evidence, data acquisition, forensic analysis algorithms, image files, network forensics, logging methods to trace back attacks and digital trails, e-mail investigations. Prerequisites: CS/SE 4348 and CS/TE 4390. (3-0) Y

Certificates

A Certificate in Information Assurance can be obtained by completing the following (as well as any required prerequisites):

CS 4389 Data and Application Security

CS 4394 Computer and Network Security

CS 4398 Digital Forensics

The certificate is intended for those individuals who are working in the industry and who already have a background similar to a BS-CS degree. CS and SE majors that complete the required classes, as well as students that complete the Minor in Information Assurance, will be awarded certificates in Information Assurance.

For additional information, please contact the Office of Undergraduate Studies