Want to know more about my background and/or collaborate? Let's connect through LinkedIn! Nam's LinkedIn
The bridge program is an intensive study of the required topics which are requisite information for general admission into the NYU-Tandon CSE graduate program. Conventionally, covering these topics take three to four semesters to complete and must be done sequentially. Under the bridge program, you will complete your studies in one, intensive, semester which includes all of the material from the conventional courses in a more compact form. The bridge will require as much as 100 hours of study, but scheduling of each module can be done at a time of your discretion, due to the online nature of the program. Working at an average of about 16 hours of study each week, the bridge program will be completed in one semester. You are expected, and required to attend a weekly online meeting as well.
By the end of the CS Bridge Program students should have:
- Basic understanding of how data is represented and how computers execute instructions to use and modify data in order to solve problems.
- Understanding of computational thinking: how to develop algorithms using decisions, repetition, and decomposition into manageable components to solve problems.
- Ability to implement and test moderate sized programs in C++, using constructs including variables, operators, decision statements, loops, functions, and built-in data types.
- Ability to understand basic object-oriented programming concepts.
- Ability to code, use, analyze the performance of, and modify fundamental data structures.
- Have a firm understanding of operating systems topics related to processes, threads, thread concurrency, deadlocks, and memory management.
- Understanding of fundamental concepts in discrete math
- Fundamentals of system hardware
- Number Systems
- Compilation and Execution process
- Data types and Expressions
- Branching statements
- Iterative Statements
- Propositional logic
- Sets basics
- Mathematical functions
- Basic counting and combinatorics
- Intro to probability
- The Pigeonhole Principle
- Intro to algorithm analysis and Order of growth
- Coding functions, Abstraction and Runtime stack
- Arrays
- Strings
- Pointers and Dynamic allocation
- Induction
- 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