Online Master of Science in Computer Science

New students take the Mastery Skill Profiler to determine their current level of programming and discrete mathematics skills. Students may skip this 0-credit foundational course if their results demonstrate proficiency in foundational mathematical and processing skills.

This course will introduce students to basic mathematical and processing topics. These topics include numbering systems, summations, progressions, combinatorics, logarithms, matrices, probabilities, and how to use basic processing tools to compute those. The topics are intended to set a solid discrete mathematical foundation to develop basic programming skills in a simple script language and to allow the student to support discrete mathematics operations with basic script language commands. Credits: 0

This course is an introduction to programming concepts. Emphasis will be placed on algorithms, test-driven design, development, and structured programming in the Python language. Topics include program development, modularity, variables and data types as numbers, strings, arrays and lists, plus the basic programming concepts as conditionals and Boolean algebra, loops, I/O operations, classes, and objects, abstract data types, sorting algorithms, and recursion. Credits: 4

This foundational course is an introduction to algorithmic thinking and the mathematics of computer science. Topics include abstract data types such as lists, stacks, queues, hash maps, trees and graphs, but also basics of asymptotic analysis, recursion and various algorithmic strategies including brute force, decrease-and-conquer and divide-and-conquer. Programming exercises will help create proficiency in Python Programming language. Emphasis will be placed on understanding underlying mathematics, such as discrete probability, statistics, graph theory and set theory. Credits: 4

This course is an extension of the process of algorithmic thinking and the mathematics of computer science. Topics include asymptotic analysis, and various algorithmic strategies including transform-and-conquer, dynamic, greedy, amortized analysis, linear and integer programming, randomized, and approximation algorithms. Emphasis will be placed on understanding underlying mathematics, such as discrete probability, statistics, graphs, and set theory. Credits: 4

This course will introduce students to basic concepts of computational theory from a practical point of view. This course will introduce the students to C++ programming language, assuming a fluency in the Python programming language. The students are expected to understand the definition of a language using finite automata and regular expressions. The concepts of pushdown automata and Turing machines will be demonstrated as a basic model of computation, equivalent to all existent programming languages. The students will be introduced to the concept of decidability, which is the determination if a language can be Turing-decidable or not, thus allowing us to investigate the power of algorithms to solve problems. Credits: 4

Great products start out from great designs authored by effective teams. This course introduces the student to the software development lifecycle at the graduate level. Focus will be placed on design and documentation methodologies used by practitioners. Students will learn to author clear and effective software documentation for a host of different design methodologies. Software design methodologies discussed will include waterfall, spiral, scrum, and agile. Other topics include version control, issue tracking, software project management, debugging, and profiling. Credits: 4

An introduction to databases at the graduate level. In this course, students will learn to effectively design, implement, and deploy both relational and non-relational databases. Topics include relational databases, normal forms, consistency, basic SQL, stored procedures, query optimization, non-relational and no-SQL databases. Examples will be drawn from industry. Students will also obtain hands-on experience with several database engines. Credits: 4

This course introduces students to key programming language families and concepts, and key system programming concepts. Topics include procedural, object-oriented, and functional programming language principles, the role of type systems and type safety, multi-threaded programming and associated design techniques including parallelization, deadlock and deadlock avoidance, and basic scheduling algorithms. Examples will be drawn from contemporary systems and languages. Credits: 4

This course will introduce students to advanced concepts in programming. These topics will include the development and use of large-scale application programmer interfaces (APIs), effective documentation of APIs, authoring clean and useful APIs, sockets, generics, regular expressions, client-server model applications, and design patterns such as factories, decorators, and MVC. Credits: 4