https://github.com/shichenz1999/nyu-tandon-bridge-spring-2024

NYU Tandon Bridge Spring 2024
https://github.com/shichenz1999/nyu-tandon-bridge-spring-2024

c-plus-plus computer-science discrete-mathematics

Last synced: about 1 month ago
JSON representation

NYU Tandon Bridge Spring 2024

• Host: GitHub
• URL: https://github.com/shichenz1999/nyu-tandon-bridge-spring-2024
• Owner: shichenz1999
• Created: 2024-06-10T08:58:46.000Z (8 months ago)
• Default Branch: main
• Last Pushed: 2024-10-19T07:35:16.000Z (3 months ago)
• Last Synced: 2024-10-31T02:21:00.823Z (3 months ago)
• Topics: c-plus-plus, computer-science, discrete-mathematics
• Language: C++
• Homepage: https://engineering.nyu.edu/academics/programs/nyu-tandon-bridge
• Size: 5.39 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# NYU Tandon Bridge Spring 2024 (28 Weeks)

## 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. You may choose to attend the live sessions or watch the recording at your convenience. 

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 indicated by your course instructor.

The 21-week course requires students to dedicate about 30-40 hours per week. 

The 28-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