Preview The New Tandon Website!


"I highly recommend this course to the dedicated individual seeking a deeper level of understanding for what they don't know (yet) in a short frame of time."

- Yin Mei

Read Testimonials

Since many of the best positions in growing fields like cyber security, data science, and artificial intelligence require an advanced degree, we designed this online program to prepare you for entrance into the Cybersecurity Master's Degree program at the NYU Tandon School of Engineering. Students with a humanities, arts or social science undergraduate degree will find this program particularly beneficial as you may have little to no computer science training.

Program Qualification

Students must have a Bachelor's degree in any discipline. To successfully complete this bridge course with a good grade, proficiency in college algebra, and some exposure to programming is desirable but not required. If you complete this intensive bridge course with a grade of B+ or better,  you are eligible to be admitted to the Cybersecurity master's program without any course deficiencies, if you meet all other School of Engineering admission requirements. Please review the Cybersecurity, MS program requirements.



Semester Duration Application Deadline Start Date End Date
24 wks May 1,
July 9,
December 22,
17 wks July 1,
August 27, 2018 December 22, 2018

How to Apply

NYU Tandon Alumni - Free

NYU Alumni - $500

Limited time, 100 free seats for all NYU Alumni for Summer 2018 cohort.

If you're an NYU Alumni student please make sure to enter your NYU N# on the NYU Tandon Bridge Application. If you do not remember your NYU N# please contact


Certificate of Completion

For an additional $2,500 fee, students can opt to obtain a certificate of completion for this bridge program.


Topics You'll Learn About

This program combines the multiple topics listed below into one course.

  • Fundamentals of system hardware
  • Number Systems
  • Compilation and Execution process
  • Data types and Expressions
  • Branching statements
  • Iterative Statements
  • Propositional logic
  • Predicate logic
  • Proving techniques: Rules of inference, Proof by contradiction, Induction
  • Sets basics
  • Intro to algorithm analysis and Order of growth
  • Functions, Abstraction and Runtime stack
  • Arrays
  • Strings
  • Pointers and Dynamic allocation
  • Recursion
  • Searching and Sorting
  • Object Oriented Programming concepts
  • File Processing
  • Linked Lists
  • Stacks and Queues
  • Trees and Binary Search trees
  • Computer Organization
  • Assembly language basics
  • Intro to OS Concepts
  • Processes & Threads
  • Thread concurrency and deadlocks
  • Memory Management




Back to Top -