I'm currently attending the University of California, Irvine.
I expect to receive my B.S. in Computer Science in June 2010.
I have an overall GPA of 3.565 and a GPA of 3.804 in the School of Computer Science.
Intro to Computer Graphics - CS 112: Provided a introduction to the fundamentals of Computer Graphics. Projects focused around using OpenGL. Project samples available on request.
Project in Computer Graphics - CS 114 (In Progress): A quarter long project course focused on computer graphics.
Advanced Computer Graphics - EECS 204 (In Progress): A graduate level course in computer graphics.
Intro to AI - CS 171: An introduction to the field of Artificial Intelligence within Computer Science.
Project in AI - CS 175: A quarter long project in Artificial Intelligence. Project focused on solving Sudoku and Constraint Networks. Project samples available on request.
Intro to Data Management - CS 122A: An introduction to databases through Relational Algebra and SQL
Project in Database Management - CS 122B: A quarter long project course consisting of 5 separate projects including JDBC Connectors, Servlets, Ruby on Rails, Database Administration, and AJAX. Projects samples available on request.
CS 113: This was a quarter long project course focusing on developing a game. The final game was built using Java and is available upon request. It's a 2D side scrolling platformer with some built in puzzle elements.
CS 132: Focused on newtorking concepts and standards in an introductory manner.
CS 142A: The course focus on compiler creation given a grammar for a language. Compiler was created in 7 steps going through syntactic and semantic analysis and eventually generating MIPS Assembly code.
CS 161: Focused on exposure and analysis of various algorithms to create a foundation for learning Computer Science. Sorting, Integer Arithmetic, Dynamic Programming, String algorithms, Graphs (representation, traversal, ordering), Shortest paths, Minimum spanning trees, and Computational geometry.
CS 162: Centered around various classifications of language, regular, irregular, context-free, etc. and various machines that can recognize them. Also detailed Undecidability and NP-completeness and deriving whether or not a problem is undecidable or NP-complete through reductions onto known problems of the same classification.