Preview The New Tandon Website!

Overview

"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

Bionformatics Bridge Photo

A technical approach to the field of life sciences is now central. If you are looking to progress and pursue a Bioinformatics Master's Degree at NYU Tandon School of Engineering with little or no knowledge of Data or Biological Sciences, our online Bioinformatics Bridge Program provides you with foundational training to understand this cutting-edge discipline.

 

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. Please note that admission to different MS programs in Tandon have their own requirements which a successful bridge student needs to meet for being considered for admission. Please review the Bioinformatics, MS program requirements.


Semester Duration Application Deadline Start Date End Date
Summer
2018
24-Week May 1,
2018
July 9,
2018
December 22,
2018
Fall
2018
17-Week July 1,
2018
August 27, 2018 December 22, 2018
Cost
$1,500
Credits
0

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 tandon.online@nyu.edu.

 

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 is one course covering several topics listed below.

 
  • 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 -