NYU Tandon Bridge Course

Build the Foundations of Computer Science

100% Online, Self-Paced, and Flexible

The NYU Tandon Bridge Course is a comprehensive, non-credit, online program that builds the mathematical and computing foundations essential for success in graduate-level STEM study and technical careers.

Developed by NYU Tandon’s Department of Computer Science and Engineering, the Bridge program combines academic rigor with flexibility. It is 100% online, fully self-paced, and provides one year of access to all course materials, allowing learners to progress on their own schedule.

Course Prerequisites

The Bridge course requires:

• Introductory knowledge of Python programming
• Proficiency in precalculus concepts such as functions, exponents, and logarithms

Not sure if you’re ready? Take the Bridge Pre-Assessment to evaluate your readiness. Learners who need additional preparation are encouraged to enroll in Bridge OnRamp, a short online course designed to help you build the necessary foundation before starting the Bridge program.

Course Format

• Delivery: 100% Online, Asynchronous, Self-paced
• Access: One year of course access from enrollment date
• Length: It generally takes 6-7 months to complete the course. Learners maintain course access for one year.
• Assessment: Four graded exams learners must earn a 70% or better to pass the course and earn a certificate credential
• Credential: Earn a Certificate in Core Computer Science Principles
• Cost: $4,000

Course Structure and Content

The Bridge curriculum is divided into four major units, each building on the last to provide a complete foundation in computer science fundamentals.

Unit 1: Discrete Mathematics

This unit is designed to introduce you to the fundamental concepts and problem-solving techniques that form the backbone of computer science, data science, and advanced mathematics. By the end of the unit, you will have developed a solid foundation in discrete mathematics and the confidence to apply its principles to logical reasoning, algorithm design, data analysis, and beyond. The Discrete Math unit is organized into five modules, each covering a key area of discrete mathematics:

1. Propositional Logic & Logical Reasoning
2. Proof Techniques & Quantifiers
3. Induction & Number Theory
4. Set Theory, Relations, Functions, & Graph Theory
5. Probability & Counting

Unit 2: C++

This unit introduces learners to the fundamental concepts of computer programming using C++. Learners will learn how to write, compile, and execute simple programs while developing an understanding of problem-solving through algorithms. Topics include basic syntax, variables and data types, input/output operations, control structures (conditionals and loops), functions, and arrays. This Unit contains the following Modules:

• Number Systems
• Compilation/Execution process, Hello World
• Data Types and Expressions; Variables; Float and Double; Basic IO
• Char and String; Math Operations; Boolean Operators and Expressions
• Branching Statements
• Loops
• Functions, Abstraction, and Runtime Stack
• Arrays
• Strings
• Recursion
• Introduction to Algorithm Analysis
• Pointers and Dynamic Storage; Vectors Pointers Arithmetics; Pointers and Arrays; Pointers and Functions
• File Processing

Unit 3: Data Structures

This unit introduces learners to fundamental data structures and their role in organizing and managing data efficiently. Learners will explore arrays, linked lists, stacks, queues, and basic trees, learning how to implement these structures and understand their performance trade-offs. By the end of this unit, learners will be able to design, implement, and evaluate basic data structures in code. Modules in this Unit include:

• Object-Oriented Programming concepts
• Searching
• Sorting
• Linked Lists
• Stacks and Queues
• Trees and Binary Search Trees
• Hash Tables
• Basic Graphs

Unit 4: Networking and Operating Systems

This unit introduces the core concepts of computer networking and operating systems. Networking topics include network models, application layer protocols, TCP/UDP transport, IP addressing, and routing. Operating system topics cover processes, threads, concurrency, deadlocks, and memory management. Participants will learn how networks enable communication between systems and how operating systems manage resources and execution. Modules in this Unit include:

• Networking Basics
• Networking Application Layer
• Networking TCP/UDP
• Networking IP
• Networking Routing
• Intro to OS Concepts
• Processes & Threads
• Threads & Concurrency
• Deadlocks
• Memory Management

Required Textbooks

1. Problem Solving with C++, Tenth Edition, Walter Savitch, Kenrick Mock, Pearson, ISBN-13: 978-0134448282, ISBN-10: 0134448286
2. Modern Operating System, Fourth edition, Andrew S. Tanenbaum, Pearson Prentice Hall, ISBN-13: 978-0133591620, ISBN-10: 013359162X
3. Computer Networking: A Top-Down Approach, 7th Edition, James Kurose, Keith Ross, Pearson, ISBN-10: 0133594149, ISBN-13: 978-0133594140
4. Recommended: Data structures and Algorithms in C++, Fourth edition, Mark Allen Weiss, Pearson, ISBN-13: 978-0132847377, ISBN-10: 013284737
    

Technology Requirements

You will need a Windows or Mac operating system, a device for multi-factor authentication, reliable internet, and a built-in or external web camera and microphone. Please also review these requirements for the online proctoring platform.

Next Steps

Determine your readiness with the Bridge Pre-Assessment or get started with Bridge OnRamp.

Register Now ​​​​​​​