Bridge Master of Science (MS) Computer Science
What Is an MS in Computer Science Bridge Program?
Computer science is an ideal career path for those with a passion for technology and computers, and those who enjoy thinking critically, analytically and creatively to solve problems. To help individuals determine whether or not a career in computer science is right for them, they may ask questions such as, “Am I interested in math, science, learning computer languages and artificial intelligence?” or, “Do I find it fascinating to think about how computer systems and mobile devices can be more innovative and work better?” If so, completing the bridge program to pursue a technology career is the first step to take.
Grand Canyon University’s Bridge (Master of Science in Computer Science) program is designed to be an accelerated pathway into GCU’s Master of Science in Computer Science degree program for those interested in engineering, information technology, science and, more specifically, a career in computer science. A bachelor’s degree, which can be in an unrelated field, is required.
What You Will Learn
Offered by the College of Science, Engineering and Technology, this seven-course, 28-credit online bridge program introduces students to computer science and will support students in building the foundational skills necessary to be successful in the graduate program. Equipped with these skills, students in the MS in computer science bridge program can move on to deepen their understanding of the field which focuses on the theory, design, development, application and analysis of software, algorithms, applications and technological systems.
The online computer science bridge program begins with the study of calculus for science and engineering, which provides a rigorous treatment of elementary calculus concepts and methods and its application to real-world problems. The curriculum goes into more detail below.
Course Overview for the Computer Science Bridge Program
Students in the online computer science bridge program will develop competencies in the areas below:
- Calculus for Science and Engineering I: Learn about differentiation, optimization and integration; interact with software that facilitates problem analysis and graphing.
- Applied Linear Algebra I: Engage in concepts and techniques of modern linear algebra, while writing about linear algebra concepts and applying theory to examples.
- Computer Programming I: Become familiar with the Java programming language by learning about its fundamental concepts, syntax and object-oriented techniques.
- Algorithms and Data Structures: Learn about classical algorithms and data structures with an emphasis on implementation to solve real-world problems; the lab reinforces and expands upon principles addressed in the lecture and provides hands-on coding activities.
- Discrete Mathematics: This course examines how discrete mathematics can be applied to problem-solving, as well as mathematical reasoning and communication. Additionally, this course introduces how mathematics uses established methods to determine and validate new conclusions through the use of discrete mathematics.
- Operating Systems Concepts: Explore UNIX-derived, open-source operating systems, along with the history and development trends in open-source OS.
Next Steps After a Computer Science Bridge Program
Students will strongly benefit from moving directly into the master’s program following the bridge program. As the next step, the graduate-level program will prepare students for senior and leadership positions, such as:
- Algorithm designer
- Enterprise software tool developer
- Senior software architect
- Director of software development
See GCU’s Master of Science in Computer Science for an overview of the program, employment projections, potential workplaces and more.
Core Courses
Course Description
This course provides a rigorous treatment of the concepts and methods of elementary calculus and its application to real-world problems. Topics include a brief review of linear, exponential, logarithmic, trigonometric, and inverse functions; understanding and calculating limits, continuity, and derivatives as rates of change; differentiation rules including derivatives of polynomials, exponentials, trigonometric, and logarithmic functions; product and quotient rules, the chain rule, and implicit differentiation; related rates, curve sketching, maximum and minimum problems, mean value theorem, linear approximation, indeterminate forms, and L’Hospital’s rule; and applied optimization problems, antiderivatives, and approximating areas under the curve. Prerequisite: Grade of C or better in MAT-250 or MAT-261.
Course Description
This course provides a rigorous treatment of the concepts, methods, and applications of integral calculus and is the second course in a three-course sequence. Topics include definite integrals, fundamental theorem of calculus, and integration rules; arc length, solids of revolution, and physical applications; techniques of integration including improper integrals and an introduction to differential equations; polar coordinates, parametric equations, infinite sequences, and series; power series and conic sections; and vector arithmetic, dot product, and projections. Prerequisite: Grade of C or better in MAT-252.
Course Description
This course is intended primarily for mathematics, science, and engineering students. The goal of the course is to impart the concepts and techniques of modern linear algebra (over the real scalar field) with a significant level of rigor. Students write clearly about the concepts of linear algebra (definitions, counterexamples, simple proofs), and apply theory to examples. The course emphasizes the practical nature of solutions to linear algebra problems. Students implement some of these solutions, where appropriate, as computer programs. Prerequisite: MAT-264 or MAT-253
Course Description
This course introduces the fundamental concepts and syntax of the Java programming language. The course focuses on object-oriented techniques in Java with an emphasis on problem solving and fundamental algorithms.
Course Description
This course covers classical algorithms and data structures, with an emphasis on implementation and application in solving real-world computational problems. The course focuses on algorithms for sorting, searching, string processing, and graphs. Students learn basic strategies to evaluate divide-and-conquer, recursive backtracking, and algorithm efficiency. Hands-on activities focus on writing code that implements concepts and algorithm implementation techniques. Prerequisite: CST-210 or CST-239 or CST-135 or CST-250 or CST-227.
Course Description
This course examines how discrete mathematics can be applied to problem solving as well as mathematical reasoning and communication. Additionally, this course introduces how mathematics uses established methods to determine and validate new conclusions through the use of discrete mathematics. Prerequisites: MAT-252 and MAT-253.
Course Description
This course is an introduction to UNIX-derived open-source operating systems. Students explore the history and development trends in open-source OS. The course covers the file system, user commands and utilities, graphical user interfaces, editors, manual pages, and shells. Prerequisite: CST-135 or CST-239.
Pursue a next-generation education with an online degree from Grand Canyon University. Earn your degree with convenience and flexibility with online courses that let you study anytime, anywhere.
* Please note that this list may contain programs and courses not presently offered, as availability may vary depending on class size, enrollment and other contributing factors. If you are interested in a program or course listed herein please first contact your University Counselor for the most current information regarding availability.
* Please refer to the Academic Catalog for more information. Programs or courses subject to change.