Mi-young Kim, PhD

Associate Professor, Augustana - Sciences
Directory

Fall Term 2024 (1890)

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 (52519)

2024-09-16 - 2024-12-09
MWF 09:45 - 10:45 (AU C 167)

LAB 1D01 (52520)

2024-09-16 - 2024-12-09
M 14:00 - 17:00 (AU LIB 1 130)

LAB 1D02 (52521)

2024-09-16 - 2024-12-09
W 14:00 - 17:00 (AU LIB 1 130)

Winter Term 2025 (1900)

AUCSC 455 - Networks and Security

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

Introduction to computer communication networks and network security. Physical and architectural elements and information layers of a communication network, including communication protocols, network elements, switching and routing, local area networks, and wireless networks. Authentication, cryptography, firewalls, intrusion detection, and communication security, including wireless security. Prerequisite: AUCSC 250. Corequisite: AUCSC 480. Note: Credit may be obtained for only one of AUCSC 455 and AUCSC 355 (2022).

LECTURE 1B01 (77739)

2025-01-27 - 2025-04-15
TR 12:00 - 13:30 (AU C 115)

LAB 1H01 (77740)

2025-01-27 - 2025-04-15
M 12:15 - 13:45 (AU LIB 1 130)



AUSCI 330 - History and Theory of Computing

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

History and models of computers including finite automata and Turing machines, computability, basics of formal languages, and complexity classes (P, NP, NP-complete). Prerequisite: AUCSC 111, or AUCSC 113 (2023) and AUSCI 135; and AUMAT 250. Note: Credit may be obtained for only one of AUMAT 355, AUCSC 315 and AUCSC 415 (2021).

LECTURE 1B01 (77737)

2025-01-27 - 2025-04-15
TR 10:15 - 11:45 (AU C 115)