Selected topics that highlight the interdisciplinary nature of the Liberal Arts and Sciences. This seminar-style class is a key aspect of the Augustana First Year Experience. The focus and content of each course are determined by faculty interests, and vary from year to year.
The course allows students to learn about approaches, methodologies and/or analytic techniques specific to a discipline, while offering an opportunity to practice working collaboratively in groups on a large project. Prerequisite: AUIDS 101.
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 (2021) or AUCSC 211 and AUSCI 235, and AUMAT 250.
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 in Computing Science or Mathematics or at least third-year standing.
This course involves tutoring students learning first-year material in mathematics and computing science for 3 hours per week in the Math & Computing Support Centre (MCSC). Tutors will also receive coaching from the MCSC Director in how best to perform their duties. Prerequisites: *15 in MAT or CSC and third-year standing.
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 (2021) or AUCSC 211 and AUSCI 235, and AUMAT 250.