Please pardon our classic look. We look forward to revealing this section's new look in July.

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

A Graduate Degree in Computer Engineering yields among the highest return on investment with six figure salary potential for early and mid-level careers. Our unique Bridge Program equips you with the necessary fundamental knowledge to enter the field of Computer Engineering regardless of your background. This program is your pathway to pursuing a Computer Engineering Master's Degree at NYU Tandon School of Engineering offered 100% online or on-campus.

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 Computer Engineering, MS program requirements.

 


Semester Duration Application Deadline Start Date End Date
Winter 2019 17-Week October 15, 2018 January 7,
2019
May 6,
2019
Winter 2019 24-Week October 15, 2018 January 7,
2019
June 24,
2019
Spring 2019 24-Week January 8, 2019 April 1,
2019
September 13,
2019
Summer 2019 17-Week April 2, 2019 July 8,
2019
November 4,
2019
Summer 2019 24-Week April 2, 2019 July 8,
2019
December 23,
2019
Cost
$1,500
Credits
0

How to Apply

 


 

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
  • 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
  • Pointers and Dynamic allocation
  • Recursion
  • Searching and Sorting
  • Object Oriented Programming concepts
  • File Processing
  • Linked Lists
  • Data Structures
  • 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 -