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.

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.

AUCSC 250 - Computer Organization and Architecture I

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

Introduction to computer systems as multilevel machines. Topics include data representation; the organization and execution cycle of Von Neumann machines; assembly-level programming, addressing modes, control flow, procedure calls, input/output, interrupts, caching; finite state machines, Boolean algebra, logic gates, and digital circuits. Prerequisite: AUCSC 112, or AUCSC 211 and AUSCI 235.

AUCSC 370 - Programming Languages

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

Principles of language design, abstraction, syntax and parsing, operational semantics (declaration, allocation, evaluation, run-time environment, typing, activation), and programming language paradigms (procedural, object- oriented, functional, logic programming). Prerequisites: AUCSC 112 (2021), or AUCSC 211 and AUSCI 235. Corequisite: AUCSC 250 and AUMAT 250.

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.