AUCSC 330 - Database Management Systems I

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

Introduction to current database management systems in theory and practice. Topics include relational database design (including entity-relationship modelling, relational schema, and normal forms); relational algebra, use of a query language (typically SQL) and other components of a current database management system; overview of database system architecture, file structures (including B-tree indices), query processing, and transaction management; new directions. Prerequisites: AUCSC 112, or AUCSC 211 or AUSCI 235. Corequisite: AUMAT 250.

AUCSC 495 - Directed Study II

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 in Computing Science at the 300 level. Notes: Admission to AUCSC 495 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 353 - Applied Probability

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

Introduction to elementary probability theory and stochastic processes with a special emphasis on their applications in science. Topics include basics of probability, random variables, functions of random variables, random vectors, random processes and their classification, well-known random processes including the Bernoulli process, random walk process, Gaussian process, Poisson process, and Markov process. Prerequisite: AUMAT 250.

AUSCI 430 - Ethical Issues in Computing and Mathematics

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

This course explores a variety of ethical issues related to computing and mathematics. Students will study ethical theory, professional codes of ethics, and apply them to make moral decisions. Topics involve information privacy and security, surveillance, cryptography, data mining, intellectual property and copyrights, computer crime and abuse, etc. The course includes extensive writing assignments and oral presentations. Prerequisite: At least 15 units in Computing Science or Mathematics or at least third-year standing. Note: Credit may be obtained for only one of AUCSC 490 (2021) and AUSCI 430.

AUCSC 111 - Introduction to Computational Thinking and Problem Solving

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

An introduction to computational thinking, problem solving, and the fundamental ideas of computing. Topics include algorithms, abstraction, and modelling; the syntax and semantics of a high-level language (e.g. Python); fundamental programming concepts and data structures, including simple containers (variables, arrays, lists, strings, dictionaries); sequencing, conditionals and repetition; documentation and style; object-oriented programming; exceptions and error handling; graphical user interfaces and event-driven programming; recursion; simple algorithm analysis and run- time efficiency. Prerequisite: Mathematics 30-1. Note: Credit may be obtained for only one of AUCSC 111 or AUCSC 113 (2023).

AUCSC 218 - Web Design, Development and Scripting

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

Introduction to modern web architectures and technologies. Web platforms and standards. Client-side/server-side programming and web languages (e.g. HTML, JavaScript, PHP, CSS, Node.js). Introduction to internet security. Design and implementation of a simple web application. Prerequisite: one of AUCSC 113 (2023) or AUSCI 135, or AUCSC 111.

AUCSC 310 - Algorithm Design and Analysis

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

Algorithm design techniques (divide-and-conquer, dynamic programming, the greedy method). Merge-sort and the analysis of divide-and-conquer algorithms with recurrence relations; bucket-sort, radix-sort, and the lower bound on sorting; comparison of sorting algorithms. Trees, binary trees, search trees, their implementation, traversal, and search and update operations. Introduction to graph theory; data structures for the representation of graphs, digraphs, and networks, and their associated algorithms (traversal, connected components, topological sorting, minimum- spanning trees, shortest paths, transitive closure). Dynamic equivalence relations and union-find sets; amortized analysis. String matching. Prerequisites: AUCSC 112, or AUCSC 211 and AUSCI 235; and AUMAT 250.

AUCSC 450 - Parallel and Distributed Computing

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

Parallel architectures, programming language constructs for parallel computing, parallel algorithms and complexity. Message-passing, remote procedure call, and shared-memory models. Synchronization and data coherence. Load balancing and scheduling. Appropriate applications. Prerequisites: AUCSC 250 and AUCSC 370.

AUCSC 480 - Operating Systems Concepts

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

Operating system functions, concurrent process coordination, scheduling and deadlocks, memory management and virtual memory, secondary storage management and file systems, protection. Prerequisites: AUCSC 250 and AUCSC 370. Note: Credit may be obtained for only one of AUCSC 480 and AUCSC 380 (2022).