
Zuwen (Dave) Gan
415-691-0832zgan@dons.usfca.edu
2845 Golden Gate Ave Apt 5, San Francisco, CA 94118
http://www.linkedin.com/zuwen-gan
OBJECTIVE
Seeking a job as a software engineerEDUCATION
University of San Francisco, San Francisco, CA May 2016 (Expected)Bachelor of Science Degree, Computer Science
GPA 3.62 Major GPA: 3.6
COMPUTER SKILLS
Programming Skills: Java (proficient), C, HTML/CSS, PHP(with MySQL), PythonFramework: Bootstrap, Angular.js
Revision Control: Subversion, GitHub
Others: Openshift(for dynamic web(php+MySQL) and web application), phpMyAdmin
EXPERIENCE
2015 Spring — Software Development Course Teaching Assistance, USFHold office hours to help students with questions, assist with grading, and developing solutions and test programs. Proactively, learn new technologies and programs such as JSON, can answer student questions.
2015 Spring — Introduction to Computer Science II Course Teaching Assistance, USF
Hold office hours to answer student questions and assist with grading.
2015 Fall — CS Tutor, USF
On average, assist up to 10 students a day from all CS courses.
2014 Fall — The ACM International Collegiate Programming Contest
2015 Fall — Library System Assistant, USF
Help to troubleshoot problems of the library database system software. Edit the Library web page. Write java programs to help to solve problems, such as efficiently copy library documents with huge size to another place.
PROJECTS
2014 Fall — Search Engine (Java, HTML, MySQL, Software Development)Built a thread-safe inverted index with multithreaded search function to store data. Built a website as interface for the search using MySQL database language to store user information, such as visited results and search history; worked with cookie and session to track user status and wrote servlet codes with Java.
2014 Spring — Finding Shortest Path (Java, Algorithm)
The project is about using Dijkstra algorithm to calculate the shortest path between two cities and priority queue to increase the efficiency. User can click any two cities on a given GUI map and then it will calculate the shortest path between two cities and show the path on the map.
2014 Fall — MPI-Finding Primes (C, MPI Library)
Used MPI to parallel the process of finding primes with the given range. Each process finds it's own primes and sends to the receiver, which is right shifted by the amount of the bitmask. Receivers used merge-split to get a merged list until process 0 receives all the primes from other processes.
2014 Spring — Dictionary (Java, Data Structure)
The project is about using binary tree structure to store a word or a part of a word with search, add delete and suggest functions.
Downlaod