Rosanna Heise, BSc (honors), MSc

ATS Associate Lecturer, Augustana - Sciences
Directory

Fall Term 2023 (1850)

AUCSC 111 - Introduction to Computational Thinking and Problem Solving

★ 3 (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, AUCSC 113 (2023), and AUCSC 120 (2019).

LECTURE 1A01 (88527)

2023-09-18 - 2023-12-06
MWF 09:45 - 10:45 (AU LIB 2 102)



AUCSC 211 - Data Structures and Algorithms

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

An introduction to object-oriented design and programming; 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 (2021), AUCSC 113 or AUSCI 135. Corequisite: AUSCI 235. Note: Credit may be obtained for only one of AUCSC 112 (2021) and AUCSC 211.

LECTURE 1A01 (88531)

2023-09-18 - 2023-12-06
TH 10:15 - 11:45 (AU LIB 2 102)



AUSCI 235 - Practices in Data Structures and Algorithms

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

Object-oriented design and programming in Java with experience in data structures and container classes using arrays, lists, array lists, stacks, queues, user-defined structures and an introduction to trees, along with associated algorithms such as insertion, removal, sorting and retrieval; introduction to examples in algorithm analysis; introduction to recursion. Prerequisites: One of AUCSC 111 (2021), AUCSC 113, or AUSCI 135. Corequisite: AUCSC 211. Note: Credit may be obtained for only one of AUCSC 112 (2021) and AUSCI 235.

LAB 1A01 (88534)

2023-09-18 - 2023-12-06
M 14:00 - 17:00 (AU C 115)

LAB 1A03 (88536)

2023-09-18 - 2023-12-06
F 14:00 - 17:00 (AU C 115)



AUSCI 385A - Mentoring in Computing and Mathematics

★ 1.5 (fi 6)(VAR, 0-0-3)

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.

LAB 1C01 (85760)

Winter Term 2024 (1860)

AUCSC 112 - Data Structures and Algorithms

★ 3 (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.

LAB 1H01 (18518)

2024-01-29 - 2024-04-19
T 14:15 - 17:15 (AU C 008)

LAB 1H03 (18520)

2024-01-29 - 2024-04-19
H 14:15 - 17:15 (AU C 008)



AUCSC 320 - Software Engineering II

★ 3 (fi 6)(SECOND, 0-4.5L-0)

Detailed study of software development processes, life cycles, and tools, especially object-oriented methods. Team work is emphasized in the completion of a large software project, from problem definition through to maintenance. Prerequisite: AUCSC 220.

LAB/LECTURE 3A01 (18509)

2024-01-04 - 2024-01-23
MTWHF 09:00 - 11:00 (AU C 115)

2024-01-04 - 2024-01-23
MTWHF 13:00 - 14:30 (AU C 103)