AUCSC 220 - Software Engineering I

3 units (fi 6)(EITHER, 3-0-1.5)

Software engineering paradigms, requirements specification, iterative software development, object-oriented design patterns, visual modelling with UML, software architecture; testing, verification and maintenance; software development environments and software engineering tools; societal implications such as the cost of failure and professional responsibilities. Prerequisite: AUCSC 112, or AUCSC 211 and AUSCI 235.

AUCSC 395 - Directed Study I

3 units (fi 6)(EITHER, 1-0-3)

Intensive study of a specific area of Computing Science as defined by the student and a supervising instructor, including completion of a software project in the selected area. Prerequisite: 9 units of senior-level Computing Science. Notes: Admission to AUCSC 395 normally requires a minimum GPA of 3.0 in Computing Science. An Application for Individual Study must be completed and approved before registration in the course.

AUMAT 328 - Cryptography

3 units (fi 6)(EITHER, 3-0-0)

Introduction to cryptography in theory and practice, including its applications and mathematical foundations. Topics include classical cryptosystems, private-key cryptosystems (including DES and AES), hashing and public-key cryptosystems (including RSA), digital signatures, selected topics in cryptography. Prerequisite: AUMAT 250 and one of AUMAT 240 or AUSCI 250 (2023).

AUCSC 220 - Software Engineering I

3 units (fi 6)(EITHER, 3-0-1.5)

Software engineering paradigms, requirements specification, iterative software development, object-oriented design patterns, visual modelling with UML, software architecture; testing, verification and maintenance; software development environments and software engineering tools; societal implications such as the cost of failure and professional responsibilities. Prerequisite: AUCSC 112, or AUCSC 211 and AUSCI 235.

AUCSC 112 - Data Structures and Algorithms

3 units (fi 6)(EITHER, 3-0-3)

An introduction to object-oriented design and programming in Java; algorithm analysis; data structures and container classes including arrays, lists, arraylists, stacks, queues, user-defined structures and an introduction to trees, along with associated algorithms such as insertion, removal, sorting and retrieval; introduction to recursion. Prerequisite: AUCSC 111, AUCSC 113 (2023) or AUSCI 135. Corequisites: AUMAT 116 and 120. Note: Credit may be obtained for only one of AUCSC 112 and AUCSC 211, and for only one of AUCSC 112 and AUSCI 235.