Credits: 3
Duration: 15 Weeks
Dates: Tue,Thu
This course develops basic techniques used in communication networks. After protocol layering is introduced, algorithms and protocols are discussed for use in each of the five layers: physical, data link, network, transport and application. Specific protocols such as TCP/IP, ATM, SS7 are included. | Prerequisite for Brooklyn Engineering Students: Junior status in electrical engineering, computer engineering, or computer science. Co-requisites for Brooklyn Engineering Students: ECE-UY 2233 (EE majors) or MA-UY 2224 (CompE/CS majors) | Prerequisites for Abu Dhabi Students: ENGR-AD 194 (or co-req of MA-UY 3113) and ENGR-AD 195 (or co-req of ECE-UY 2233) . ABET competencies: a, c, e.
Elect. Engineering – ECE UGRD (Undergraduate)
3 credits – 15 Weeks
Credits: 3
Duration: 15 Weeks
Dates: Mon
Credits: 3
Duration: 15 Weeks
Dates: Mon,Fri
Credits: 3
Duration: 15 Weeks
Dates: Mon,Fri,Thu
This course includes hands-on experience with a combination of laboratory experiments, lectures and projects relating to basic and advanced topics in wireless communications. Specific topics include mixers, IQ modulation, phase locked loops, receiver design, PN code acquisition, smart antennas and RFID. | Prerequisite: EE-UY 4183
Elect. Engineering – ECE UGRD (Undergraduate)
3 credits – 15 Weeks
Credits: 3
Duration: 15 Weeks
Dates: Tue,Thu
Credits: 3
Duration: 15 Weeks
Dates: Tue,Thu
Focusing on software engineering, the course introduces techniques to specify, design, test and document medium and large software systems. Design techniques include information engineering, object orientation and complexity measures. Also covered are testing methods, such as path testing, exhaustive test models and construction of test data. An introduction to software tools and project management techniques is presented. Student projects involve team software development and tracking. | Prerequisites: Juniors or higher majoring in Computer Science, Computer Engineering or Electrical and Computer Engineering. Co-requisite: CS-UY 3224
Computer Science (Undergraduate)
3 credits – 15 Weeks
Credits: 3
Duration: 15 Weeks
Dates: Mon,Wed
This course covers fundamental principles of the design and analysis of algorithms. Topics include asymptotic notation, recurrences, randomized algorithms, sorting and selection, balanced binary search trees, augmented data structures, advanced data structures, algorithms on strings, graph algorithms, geometric algorithms, greedy algorithms, dynamic programming and NP completeness. | Prerequisites for Brooklyn Engineering Students: (CS-UY 2134 or CS-UY 1134) and (CS-UY 2124 or CS-UY 1124) (C- or better) and MA-UY 2314; Corequisite: EX-UY 1 | Prerequisites for Abu Dhabi Students: (ENGR-UH 3510 or CS-UH 1050) (C- or better) and CS-UH 1002 | Prerequisite for Shanghai Students: CSCI-SHU 210 (C- or better) and CSCI-SHU 2314
Computer Science (Undergraduate)
3 credits – 15 Weeks
Credits: 3
Duration: 15 Weeks
Dates:
A programming intensive introduction to the creation of computer games. Using mostly two-dimensional sprite-based programming, we examine and experiment with animation, physics, artificial intelligence and audio. In addition, the course explores the mathematics of transformations (both 2D and 3D) and the ways they may be represented. | Prerequisite: (CS-UY 2134 or CS-UY 1134) and (CS-UY 2124 or CS-UY 1124) (C- or better).
Computer Science (Undergraduate)
3 credits – 15 Weeks
Credits: 3
Duration: 15 Weeks
Dates: Tue,Thu
Credits: 3
Duration: 15 Weeks
Dates: Tue,Thu
This course provides a hands on approach to machine learning and statistical pattern recognition. The course describes fundamental algorithms for linear regression, classification, model selection, support vector machines, neural networks, dimensionality reduction and clustering. The course includes computer exercises on real and synthetic data using current software tools. A number of applications are demonstrated on audio and image processing, text classification, and more. Students should have competency in computer programming. | Prerequisite for Brooklyn Students: CS-UY 1134 AND (MA-UY 2034, MA-UY 2034G, MA-UY 1044 or MA-UY 3054) AND (MA-UY 2224, MA-UY 2222, MA-UY 2233, ECE-UY 2233, MA-UY 3012, MA-UY 3014, or MA-UY 3514) | Prerequisite for Abu Dhabi Students: (ENGR-UH 3510 or CS-UH 1050) (C- or better) AND (MATH-UH 1022 or MATH-UH 1023) AND (MATH-UH 2011Q or ENGR-UH 2010Q) | Prerequisite for Shanghai Students: CSCI-SHU 210 (C- or better) AND (MATH-SHU 140 or MATH-SHU 141) AND MATH-SHU 235
Computer Science (Undergraduate)
3 credits – 15 Weeks
Credits: 3
Duration: 15 Weeks
Dates: Tue
This course examines Modern Cryptography from a both theoretical and applied perspective, with emphasis on “provable security” and “application case studies”. The course looks particularly at cryptographic primitives that are building blocks of various cryptographic applications. The course studies notions of security for a given cryptographic primitive, its various constructions and respective security analysis based on the security notion. The cryptographic primitives covered include pseudorandom functions, symmetric encryption (block ciphers), hash functions and random oracles, message authentication codes, asymmetric encryption, digital signatures and authenticated key exchange. The course covers how to build provably secure cryptographic protocols (e.g., secure message transmission, identification schemes, secure function evaluation, etc.), and various number-theoretic assumptions upon which cryptography is based. Also covered: implementation issues (e.g., key lengths, key management, standards, etc.) and, as application case studies, a number of real-life scenarios currently using solutions from modern cryptography. | Prerequisite: (CS-UY 2134 or CS-UY 1134) and (CS-UY 2124 or CS-UY 1124) (C- or better) and MA-UY 2314.
Computer Science (Undergraduate)
3 credits – 15 Weeks