ESP Biography
GAURAV SINGH, ESP Teacher
Major: 18, 6 College/Employer: MIT Year of Graduation: 2015 

Brief Biographical Sketch:
Not Available. Past Classes(Clicking a class title will bring you to the course's section of the corresponding course catalog)H11977: Opera 101 in Splash 2017 (Nov. 18  19, 2017)
Have you heard about this thing called opera? Do you want to know more about it? We will talk about a few famous composers, how operas are made, and a bit of the history of them.
M11146: Cryptography in Splash 2016 (Nov. 19  20, 2016)
Have you seen this weird cryptography in the news? Are you wondering how keys are relevant to your data? Then this class is for you! We will discuss the idea of cryptography, and go over some of the most important building blocks. If there is extra time, we will discuss some of the more exciting directions it is going in.
Z11147: Opinions in Splash 2016 (Nov. 19  20, 2016)
Do you have opinions? Well, we don't care about those in this class. In this class we will look at opinions of a different set of people, the Supreme Court. We will discuss how the Supreme Court works, and go through their opinions for a case together.
M10456: Cryptography in Spark 2016 (Mar. 12  13, 2016)
Cryptography is an exciting tool to communicate with others while controlling what information other people can get. We will start with basic cryptography, and talk about some of the exciting directions it is moving in.
M10189: Lattices in Cryptography in Splash 2015 (Nov. 21  22, 2015)
Have you heard of Fully Homomorphic Encryption or Functional Encryption? These allow you to encrypt data, give it to someone else, and have them compute some functions of the data, without them ever learning anything about your data.
This seems really hard to do, but it turns out that lattices allow us to do this. We will not go into all the details, but we will cover some of the relevant information.
W9434: LN2 Ice Cream! in Spark 2015 (Mar. 14  15, 2015)
Do you like ice cream? Come see how ice cream can be made using liquid nitrogen, and learn why it tastes so much better than store bought ice cream.
C9036: Quantum Computation in Splash 2014 (Nov. 22  23, 2014)
Have you heard that Quantum Computers can "try all the possibilities at once"? Do you want to know why people are spending so much effort trying to make quantum computers? Do you want to know why people are excited that they built a computer that could factor 15? If you come here, you will learn about how it really works.
W8256: LN2 Ice Cream! in Spark 2014 (Mar. 15  16, 2014)
Do you like ice cream? Come see how ice cream can be made using liquid nitrogen, and learn why it tastes so much better than store bought ice cream.
W7815: LN2 Ice Cream! in Splash! 2013 (Nov. 23  24, 2013)
Do you like ice cream? Come see how ice cream can be made using liquid nitrogen, and learn why it tastes so much better than store bought ice cream.
C7983: Introduction to Algorithms in Splash! 2013 (Nov. 23  24, 2013)
Algorithms describe a "recipe" for doing something. Having good algorithms that are fast and easy to use is important for every area of life.
This class will be a survey of several computer science algorithm topics including sorting, hashing, and graph algorithms.
X8000: Steak: Theory and Practice in Splash! 2013 (Nov. 23  24, 2013)
Steer yourself on over! By the end of this class, you'll have herd how to cook a delicious prime steak. We'll moove from the science of cooking meat to useful tools and techniques for preparing beef. Classes this well done are rare, so it would be a missteak to miss this.
P8033: Splash Concert Choir in Splash! 2013 (Nov. 23  24, 2013)
Do you like to sing? Want to learn more about singing? We'll do some fun rounds and fugues, some folk song callandresponse, and then we'll try out a famous classical choral piece.
C7188: Introduction to Algorithms in Spark! 2013 (Mar. 16, 2013)
Algorithms describe a "recipe" for doing something. Having good algorithms that are fast and easy to use is important for every area of life.
In this class we'll talk about computer science algorithms in particular. We'll talk about how to use algorithms to sort a list of things, create tables that make looking up values really easy, and find shortest paths in graphs.
M7189: The Limits of Computation in Spark! 2013 (Mar. 16, 2013)
Can a computer tell if a program will stop? It turns out that there are some programs for which a computer cannot say if it will stop or run forever. We will show this, and then we will investigate other limits on the powers of a computer.
A7195: Spark Concert Choir in Spark! 2013 (Mar. 16, 2013)
Do you like to sing? Want to learn more about singing? We'll do some fun rounds and fugues, some folk song callandresponse, and then we'll try out a famous classical choral piece.
W7196: LN2 Ice Cream in Spark! 2013 (Mar. 16, 2013)
Eat LN2 ice cream!
M6115: The Limits of Computation in Splash! 2012 (Nov. 17  18, 2012)
Can a computer tell if a program will stop? It turns out that there are some programs for which a computer cannot say if it will stop or run forever. We will show this, and then we will investigate other limits on the powers of a computer.
M6606: Space Algebra in Splash! 2012 (Nov. 17  18, 2012)
Do you like algebra? Do you want to do it in space? Well now you can! We will be using algebra in a variety of spaces, to look at their structure, and to tell if two spaces are different.
W6796: Liquid Nitrogen Ice Cream! in Splash! 2012 (Nov. 17  18, 2012)
Come learn about some cool properties of liquid nitrogen, and get to try some ice cream made with liquid nitrogen.
M6018: Computability and Complexity in HSSP Summer 2012 (Jul. 08, 2012)
Can we make a program that can check if a program will stop? How long does it take a program to run? These are some questions that we will answer in this class. We will define a theoretical version of a computer, and see what it can or cannot do, and what it means for an algorithm to be fast.
M5681: Introduction to Discrete Mathematics in HSSP Spring 2012 (Feb. 18, 2012)
Do you know how to count up to 10? What about counting the number of possible 5 card hands in poker? We will cover a variety of topics in discrete mathematics. We will start off by discussing combinatorics, which is how to count the number of a type of objects. We will then move on to probability, where we will learn how to estimate the chances of a particular event happening. We will then talk about a little bit of number theory, which studies the properties of numbers, and we will finish the class with some puzzle problems, which will relate to the topics that we discussed earlier
M5766: Introduction to Theoretical Computer Science in Spark! 2012 (Mar. 10, 2012)
Suppose you write a program to compute all the prime numbers. Can you tell if it stops? Now what if we had a really complicated program. Could you tell if it stops? Could a computer tell if it stops?
In this class, we will think about abstract "computers", and we will talk about what a computer can or cannot do.
X5065: Solve a Puzzle Hunt in Splash! 2011 (Nov. 19  20, 2011)
Do you like mental challenges? Do you want to find the answer without anyone telling you how? Then you should come solve a puzzle hunt! We will start off by introducing puzzles, and then we will work together to solve a puzzle hunt, which is a themed collection of puzzles.
X5445: How to (not) be awkward in Splash! 2011 (Nov. 19  20, 2011)
See examples of how to avoid being awkward.
