ESP Biography


Major: Computer Science

College/Employer: Stanford

Year of Graduation: 2011

Picture of Roy Frostig

Brief Biographical Sketch:

Not Available.

Past Classes

  (Clicking a class title will bring you to the course's section of the corresponding course catalog)

M2888: Information theory in Splash! Spring 2013 (Apr. 13 - 14, 2013)
How much information is there in revealing the outcome of a coin toss? A dice roll? A random English sentence? As it turns out, it is completely reasonable and possible to quantify the information contained in a random event. We'll start by doing that, then discuss compression and redundancy. Specifically, we'll answer questions like "into how small a file can I compress this audio track?", and understand how you can still play a CD just fine after you've scratched it.

M1774: Boolean gates and digital circuit logic in Splash! Fall 2011 (Oct. 29 - 30, 2011)
The hardware in modern computers offers a grab-bag of simple logical and arithmetic operations --- like the "add two numbers" operation or the "remember this value" operation --- as building blocks for creating the computer's more sophisticated tasks, including the task of executing software programs. Each of these simple operations is created by connecting together even simpler components called Boolean gates. These Boolean gates are functions that take two input bits and produce one output bit --- very simple animals. In fact, Boolean gates are finally simple enough that we can use electrical current and semiconducting materials to build them. This is how all of our computational tasks can eventually be carried out by actual physical machines. In this course, we'll learn how Boolean gates are built, and how to use them to make some of the simple operations: adders, multiplexers, and simple memory.