Bridge Course Information | NYU Tandon School of Engineering

Bridge Course Information

We have provided recommended preparatory courses, in addition to some videos which will introduce you to some of the concepts you will learn about in the Bridge.


preparatory resources

Course Structure

The Bridge Course is taught asynchronously. In the course, you will be participating in interactive online modules, live webinars, assignments, and peer-to-peer engagement. Each week, your professors will host a virtual meeting to discuss the week's lecture and topics, and answer students’ questions. Attendance at this meeting is mandatory however if you cannot attend you may re-watch the webinar within the course site, and reach out to the professors and TA’s with any questions! If you are not able to attend the webinars it will not have a negative impact on your grade, as most students work full time.

Your professors will assign weekly assignments. Each student is required to set aside time to study and complete the homework by the due dates. You will have 4 exams throughout the course that must be taken at the dates and times (6 PM EST) included in the Enrollment Agreement within your Admission email.

  • The 17-week course requires students to dedicate about 30-40 hours per week. 
  • The 24-week course requires students to dedicate about 20-30 hours per week.

Course Topics

  • Application Layer, Network Layer and Transport Layer
  • Arrays
  • Branching Statements
  • Coding Functions, Abstraction and Runtime stack
  • Compilation and Execution process
  • Data Types and Expressions
  • Discrete Probability
  • File Processing
  • Fundamentals of System Hardwares
  • Induction
  • Intro to Algorithm Analysis and Order of Growth
  • Intro to OS Concepts
  • Introduction to Counting
  • Introduction to Networking
  • Iterative Statements
  • Linked Lists
  • Logic
  • Mathematical Functions
  • Memory Management
  • Number Systems
  • Object Oriented Programming Concepts
  • Overview of OSI/RM
  • Physical Layout of Networks
  • Pointers and Dynamic Allocation
  • Processes & Threads
  • Proofs
  • Recursion
  • Searching and Sorting
  • Sets
  • Stacks and Queues
  • Strings
  • Thread Concurrency and Deadlocks
  • Trees and Binary Search Trees

Textbooks

The Bridge course requires four textbooks which we've listed below. Although other versions of these textbooks may be available, the professors will reference the page numbers of the following versions. If you purchase an alternate version, the page numbers may vary. Some of these books offer online resources, however the online version required is for ZyBooks.

  • Problem Solving with C++, Ninth Edition, Walter Savitch, University of California - ISBN-10: 0133591743, ISBN-13: 9780133591743 - Amazon Link
  • Modern Operating System, Fourth Edition, Andrew S. Tanenbaum, Pearson Prentice Hall - ISBN-10: 013359162X, ISBN-13: 978-0133591620 - Amazon Link
  • Data structures and Algorithms in C++, Fourth Edition, Mark Allen Weiss, Pearson - ISBN-10: 013284737X, ISBN-13: 978-0132847377 - Amazon Link
  • Discrete Mathematics - Available on ZyBooks (Instructions to access this book can be found in your course syllabus which will be available in the course site once it begins)

Recommended (but not required):

  • Introduction to Algorithms, 3rd Edition, Cormen, Leiserson, Rivest, and Stein, MIT Press, 2009 - ISBN-10: 9780262033848, ISBN-13: 9780262033848 - Amazon Link
  • Computer Networking: A Top-Down Approach, 7th Edition, James Kurose, Keith Ross, Pearson - ISBN-10: 9780133594140, ISBN-13: 978-0133594140 - Amazon Link
  • Discrete Mathematics and Its Applications, 7th Edition, Kenneth H. Rosen, The McGraw Hill Companies, 2012 - ISBN-10: 0073383090, ISBN-13: 978-0073383095 - Amazon Link

Prep Materials

Below are recommended preparatory courses, in addition to some videos which will introduce you to some of the concepts you will learn about in the Bridge.