Introduction to Cryptography
Courant, Fall 2017
Homework 1
Instructor: Oded Regev
Student: YOUR NAME HERE
Homework is due by 11pm of Sep 17. Send by email to both regev (under the cs.nyu.edu domain) a
Introduction to Cryptography
Courant, Fall 2017
Homework 4
Instructor: Oded Regev
Student: YOUR NAME HERE
Homework is due by 11pm of Oct 15. Send by email to both regev (under the cs.nyu.edu domain) a
Introduction to Cryptography
Courant, Fall 2017
Instructor: Oded Regev
Student: YOUR NAME HERE
Homework 0
Homework is due by 11pm of Sep 10. Send by email to both regev (under the cs.nyu.edu domain) a
Introduction to Cryptography
Courant, Fall 2017
Homework 3
Instructor: Oded Regev
Student: YOUR NAME HERE
Homework is due by 11pm of Oct 1. Send by email to both regev (under the cs.nyu.edu domain) an
Introduction to Cryptography
Courant, Fall 2017
Homework 2
Instructor: Oded Regev
Student: YOUR NAME
Homework is due by 11pm of Sep 24. Send by email to both regev (under the cs.nyu.edu domain) and
ry
Introduction to Cryptography
Courant, Fall 2017
Instructor: Oded Regev
Student: YOUR NAME HERE
Homework 5
Homework is due by 11pm of Oct 22. Send by email to both regev (under the cs.nyu.edu domain) a
Export Tax Rebates and Real Exchange Rate Devaluation: Chinas
Experience in Recent Asia Financial Crisis
- A Computable General Equilibrium Analysis
Eden Yu, Department of Economics, City University o
CSCI-1200 Data Structures Spring 2014
Lecture 25 Concurrency & Asynchronous Computing
Final Exam General Information
The nal exam will be held:
Tuesday May 13th from 3-6pm in
DCC 308 (sections 1, 2,
CSCI-1200 Data Structures Spring 2014
Lecture 24 Garbage Collection & Smart Pointers
Review from Lecture 23
Finished Leftist Heaps
Operators as non-member functions, as member functions, and as frie
CSCI-1200 Data Structures Spring 2014
Lecture 22 C+ Exceptions
Review from Lecture 21
Inheritance is a relationship among classes. Examples: bank accounts, polygons, stack & list
Basic mechanisms of
CSCI-1200 Data Structures Spring 2014
Lecture 20 Priority Queues
Review from Lecture 19
A hash table is implemented with a array at the top level. Each key is mapped to a slot in the array by a hash
CSCI-1200 Data Structures Spring 2014
Lecture 19 Hash Tables
Announcements: Test 3 Information
Test 3 will be held Monday, April 14th from 6-7:50pm in DCC 308 (Sections 1-5 & 7-9) and DCC 337 (Sectio
CSCI-1200 Data Structures Spring 2014
Lecture 17 Trees, Part II
Review from Lecture 16
STL set container class (like STL map, but without the pairs!)
Overview of the ds set implementation and the be
CSCI-1200 Data Structures Spring 2014
Lecture 16 Trees, Part I
Review from Lectures 15
Maps containing more complicated values. Example: index mapping words to the text line numbers on which
they app
CSCI-1200 Data Structures Spring 2014
Lecture 18 Trees, Part III
Review from Lecture 17
Drawing pictures of binary search trees vs. drawing abstract representations of the data stored in an STL set
o