ESP Biography

VAROT PREMTOON, MIT Freshman from Thailand, majoring in Comp Sci

Major: 6-3

College/Employer: MIT

Year of Graduation: 2018

Picture of Varot Premtoon

Brief Biographical Sketch:


My name is Varot Premtoon, although I go by 'Pond.' I'm an MIT freshman from Thailand, and I'm going to major in Course 6-3 Computer Science!

I started programming in 7th grade, and have been learning algorithms, data structures, and coding in general since then. I finally made it to the International Olympiad in Informatics 2012 (It's basically a international high-school-level competition for algorithmic problem solving. Four people represent each of the ~80 participating countries) and got a bronze medal. I code in C/C++ and also Python.

Besides CS, I am a Thai at heart. I am a native speaker of the Thai language, and I also like writing poem occasionally in Thai. I am taking 24.900 Intro to Linguistics, and I found it enormously interesting as a language learner (I didn't grow up speaking English) to learn a science aspect of language. I wish to pursue a minor in Linguistics. I also play Thai traditional music

I want to teach for a living in the future. Hopefully I will become a college professor in Thailand, where I can both teach and do awesome research. Splash will be my first big step into the world of teaching, and I'm really excited about it!

Past Classes

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

H12052: Writing systems in Spark 2018 (Mar. 17 - 18, 2018)
A panoramic view of many major writing systems used around the world.

C8730: Find the Shortest Path! in Splash 2014 (Nov. 22 - 23, 2014)
How map apps find you the best path in a gigantic map within seconds? This class explores how to create efficient algorithms to find the shortest route on a map represented in graph. We will begin with a basic way to represent a map, and then create and improve our code until it can perform on a 10,000-road map within a second! The class will be taught in C. (keywords: graph, breadth first search, dijkstra, floyd-warshall) (Don't be scared by the keywords!)