Basics of system administration for Windows and Unix machines, including configuration of web, email, file systems, web services and database servers. Virtualization. Clustering. Performance measurement and enhancement. By the end of this course, the student will be able to:
<ul>
 <li>Administer modern computer systems and networks</li>
 <li>Develop software solutions to solve systems administration problems</li>
 <li>Use modern tools for system administration and configuration</li>
</ul>

System Administration

Comprehensive introduction to web development, working with extensible markup languages and databases, event-driven programming, implementing communication and web services. By the end of this course, the student will be able to:
<ul>
 <li>Demonstrate knowledge of fundamentals of web development</li>
 <li>Work with XML and databases</li>
 <li>Develop event-driven web applications</li>
 <li>Develop communication (e.g. news feeds and RSS) and web services applications (e.g. SOAP)</li>
</ul>

Web Application Development I

The design and implementation of database applications, with a focus on relational database management systems. By the end of this course, the student will be able to:
<ul>
 <li>Design and implement relational database schemas</li>
 <li>Design and implement database applications</li>
 <li>Understand and apply fundamental elements of relational database design</li>
</ul>

Database I

Introduces the fundamental concepts of object-oriented programming. By the end of this course, the student will be able to:
<ul>
 <li>Design and implement simple programs based on problem specifications</li>
 <li>Implement classes and methods when provided the informal specification</li>
 <li>Implement programs that use simple data structures and collections such as arrays and lists</li>
</ul>

Introduction to Computer Science I

Fundamentals of computer networks, TCP/IP layered model: application layer, transport layer, network layer, link layer, with examples of each layer, and explanation of design issues. IPv6. By the end of this course, the student will be able to:
<ul>
 <li>Understand fundamental concepts and principles of computer communication networks</li>
 <li>Understand computer networks from the perspective of the TCP/IP Internet framework</li>
 <li>Understand network protocol design decisions</li>
</ul>

Computer Networks 1

Introduction to algorithms as tools for computational problem solving, language of algorithms, understanding algorithms, approximately analyzing correctness and efficiency of algorithms, algorithms that solve fundamental computational problems, basic algorithm design techniques, and steps of computational problem solving. By the end of this course, the student will:
<ul>
 <li>Be able to read, write and understand algorithms</li>
 <li>Be able to estimate the correctness and efficiency of an algorithm</li>
 <li>Be able to implement and measure the efficiency of an algorithm</li>
 <li>Learn algorithm design/modify/reuse techniques</li>
</ul>

Algorithms I

Fundamentals of formal languages, including mathematical models of regular sets, context-free languages and Turing machines; deterministic and non-deterministic models. Basics of interpretation and compilation. By the end of this course, the student will:
<ul>
 <li>Have proficiency with mathematical tools and formal methods in Computer Science</li>
 <li>Understand different classes of abstract languages, their boundaries, their corresponding computation machine models and their significance in computation</li>
</ul>

Formal Languages

Application of ethical principles to computing-related topics, including privacy, property rights, autonomy, access and diversity. By the end of this course, the student will:
<ul>
 <li>Be capable of analyzing ethical problems in computing situations and making a decision</li>
 <li>Understand professional codes of ethics such as those of the Association for Computing Machinery and the Institute for Electrical and Electronic Engineers</li>
 <li>Be aware of existing U.S. legislation relating to ethical topics in computing</li>
 <li>Be able to advocate an ethical position in written format</li>
</ul>

Computer Ethics

Continues the development of programming from an object-oriented perspective. Emphasizes sound software engineering principles and best practices. By the end of this course, the student will be able to:
<ul>
 <li>Design, implement and test programs based on sound object-oriented design</li>
 <li>Design, implement and test class inheritance hierarchies based on informal specifications</li>
 <li>Implement and test class methods using polymorphism based on informal specifications</li>
 <li>Implement and test programs that require and use exception handling</li>
</ul>

Introduction to Computer Science II

Mobile IP, wireless routing, location management, ad-hoc wireless networks, wireless, wireless TCP personal communication systems and current mobile phone OTA protocols. By the end of this course, the student will:
<ul>
 <li>Develop advanced network protocol development skills</li>
 <li>Gain an understanding of performance issues in advanced wireless and mobile networks</li>
 <li>Gain an understanding of issues related to supporting mobile distributed applications</li>
</ul>

Wireless and Mobile Networks

Advanced course in web development and web server software development. By the end of this course, the student will be able to:
<ul>
 <li>Develop robust, advanced web software</li>
 <li>Work with a variety of modern web development languages</li>
 <li>Apply development principles in creating solutions in real-world web applications</li>
</ul>

Web Application Development II

Computer network design, including multiplexing, switching, routing, internetworking, transport protocols, congestion control and performance evaluation. By the end of this course, the student will:
<ul>
 <li>Gain deeper and more detailed understanding of computer networking topics covered in CPSC 3353</li>
 <li>Be able to apply network performance analysis techniques</li>
 <li>Gain understanding of switching, packet scheduling and queue management</li>
</ul>

Computer Networks II

Software development for wireless applications: specification, process, testing and performance evaluation. Design and development of wireless application layer software, including current protocols. By the end of this course the student will be able to:
<ul>
 <li>Understand how to incorporate modern smartphone hardware into applications, including cameras, GPSes and accelerometers</li>
 <li>Understand the software libraries available on modern smartphones for database, graphics rendering, sound and video</li>
 <li>Understand cross-platform development tools and processes</li>
 <li>To be able to design and develop a complex solution for a mobile device</li>
</ul>

Mobile Applications I

Current processes, methods and tools related to modeling and designing software systems. By the end of this course, the student will be able to:
<ul>
 <li>Understand life cycle activities used to develop software</li>
 <li>Employ testing techniques to clarify requirements, design and development</li>
 <li>Develop software in an iterative fashion using a test framework</li>
 <li>Refactor ill-structured code</li>
 <li>Understand iteration planning and tracking</li>
 <li>Understand tools common to industry: configuration management, bug reporting</li>
 <li>Select software metrics suitable for a specific development effort</li>
 <li>Develop a personal software development portfolio</li>
</ul>

Software Engineering 1

Development of a graphical event-driven desktop/laptop computer application using an object-oriented language and SDK, testing, systematic debugging documentation and maintenance programming. By the end of this course, the student will be able to:
<ul>
 <li>Understand a modern software development life cycle</li>
 <li>Be able to use modern integrated development environments to develop a graphical application for a current operating system</li>
 <li>Be able to design, implement and test a complete application of significant size</li>
</ul>

Software Construction Fundamentals

Basics of set theory, propositional and predicate logic as used to describe algorithms and recurrence relations. Proving correctness and estimating running time for algorithms will be covered, as will mathematical and structural induction. By the end of this course, the student will:
<ul>
 <li>Acquire basic knowledge of Discrete Mathematics</li>
 <li>Be able to produce rigorous proofs, including inductive proofs</li>
 <li>Be able to apply notions and results of Discrete Mathematics to computer science</li>
 <li>Be able to apply combinatorial reasoning to proofs of correctness for algorithms</li>
</ul>

Discrete Structures

Fundamental concepts of programming language design, interpretation and compilation. By the end of this course, the student will be able to:
<ul>
 <li>Understand the imperative, functional and object-oriented paradigms</li>
 <li>Understand fundamental issues in language design (scoping, typing, polymorphism, etc.)</li>
 <li>Build a simple compiler (lexer, parser, type checker and syntax-directed translator), using a functional programming language</li>
</ul>

Programming Languages and Translation

Current processes, methods and tools related to modeling and designing software systems. By the end of this course, the student will be able to:
<ul>
 <li>Elicit, analyze and specify functional and nonfunctional requirements</li>
 <li>Develop, analyze and document software architectures and designs</li>
 <li>Prioritize and select features based on project risk</li>
 <li>Understand project-level schedule estimation and monitoring</li>
 <li>Know common development processes used in the industry</li>
 <li>Re-pattern solutions where appropriate to meet nonfunctional requirements</li>
 <li>Understand how to incorporate nonfunctional requirements (specifically, security) into the development life cycle</li>
 <li>Understand the role of configuration management in the development process</li>
 <li>Develop a personal software full-life cycle development portfolio</li>
</ul>

Software Engineering II

Course builds mastery of mobile application development and the skills necessary to stay current in this fast-moving field throughout one’s career by introducing a new programming language and application programmer interface and requiring the student to master those. By the end of this course, the student will be able to:
<ul>
 <li>Independently learn a mobile software development platform</li>
 <li>Develop mobile software using a modern mobile operating system, including user interface design, persistent storage and network connections</li>
 <li>Conceive, design and implement a production-quality mobile device application</li>
</ul>

Mobile Applications II

Advanced complexity analysis techniques, notions of computational complexity, polynomial time hierarchy, computability, algorithms that solve advanced computational problems, advanced algorithm design techniques and computational problem solving. By the end of this course, the student will:
<ul>
 <li>Be able to determine correctness and efficiency of an algorithm using mathematical/logical tools</li>
 <li>Learn about algorithmic solutions to computational problems</li>
 <li>Learn the steps of computational problem solving</li>
 <li>Learn about levels of computational complexity</li>
</ul>

Algorithms II

Stored program computers, hardware and software components, data representations, instruction sets, addressing modes, assembly language programming, loaders, linkers and operating systems. By the end of this course, the student will be able to:
<ul>
 <li>Understand basic concepts in computer organization and fundamental computer architecture</li>
 <li>Understand data representation techniques, addressing modes, instruction sets, interfaces and interrupts</li>
 <li>Be able to apply basic knowledge of digital logic circuits to computer organization</li>
</ul>

Computer Organization and Assembly Language Programming

Design of Computer Systems, emphasizing the relationship between computer hardware and software. Includes processor control and data path organization, memory subsystem design, instruction set design, processor simulation and quantitative analysis of computer performance. By the end of this course, the student will:
<ul>
 <li>Be proficient in the design of modern computer systems at the architectural level</li>
 <li>Be able to quantitatively analyze the impact of design trade-offs on system performance</li>
 <li>Be able to develop software that utilizes the underlying architecture efficiently</li>
</ul>

Computer Architecture

Structure and functions of operating systems; processes and process scheduling; synchronization and mutual exclusion; memory management; auxiliary storage management; resource allocation and deadlock; security, privacy and ethical concerns; design tradeoffs. By the end of this course, the student will:
<ul>
 <li>Understand major components of operating systems</li>
 <li>Understand design tradeoffs associated with operating systems</li>
 <li>Understand system resource sharing among users</li>
 <li>Understand security and reliability mechanisms</li>
</ul>

Operating Systems

Overview of hardware and software issues in parallel systems: fundamental parallel architectures, programming languages, tools and algorithms, and parallel applications. By the end of this course, the student will:
<ul>
 <li>Be able to systematically partition a program for parallel computing</li>
 <li>Be able to match the problem at hand to a parallel computing environment</li>
 <li>Be able to program in a parallel programming language</li>
 <li>Be able to analyze issues in the design of a distributed system</li>
</ul>

Parallel Systems

Theory, design and implementation of database systems. By the end of this course, the student will be able to:
<ul>
 <li>Understand the theoretical underpinnings of the relational model</li>
 <li>Understand and apply relational design theory</li>
 <li>Understand implementation issues and strategies for relational database systems and query languages</li>
 <li>Design and implement non-relational databases and applications</li>
</ul>

Database II

Developing programs that use data structures and collections to efficiently store data. Emphasis will be placed on the interplay between effective data structures and efficient algorithms. By the end of this course, the student will be able to:
<ul>
 <li>Design and implement programs that use implementations of common data structures and collections</li>
 <li>Understand the design and implementation decisions on which common data structures and collections are based</li>
 <li>Understand the effect that the choice of data structure and collection has on the efficiency and scalability of algorithms</li>
</ul>

Auburn Computer Science Online Course Portal